[{"author":[{"last_name":"Liu","first_name":"Y.","full_name":"Liu, Y."},{"id":"edaf889c-c7cd-11ef-ab1b-bb28c431bd29","full_name":"Mascia, Sara","last_name":"Mascia","first_name":"Sara"},{"full_name":"Pentericci, L.","last_name":"Pentericci","first_name":"L."},{"full_name":"Watson, P.","first_name":"P.","last_name":"Watson"},{"full_name":"Alavi, A.","first_name":"A.","last_name":"Alavi"},{"first_name":"P.","last_name":"Bergamini","full_name":"Bergamini, P."},{"full_name":"Bradač, M.","last_name":"Bradač","first_name":"M."},{"full_name":"Calabrò, A.","first_name":"A.","last_name":"Calabrò"},{"full_name":"Glazebrook, K.","last_name":"Glazebrook","first_name":"K."},{"full_name":"Henry, A.","last_name":"Henry","first_name":"A."},{"first_name":"M.","last_name":"Llerena","full_name":"Llerena, M."},{"first_name":"E.","last_name":"Merlin","full_name":"Merlin, E."},{"first_name":"B.","last_name":"Metha","full_name":"Metha, B."},{"first_name":"T.","last_name":"Nanayakkara","full_name":"Nanayakkara, T."},{"full_name":"Napolitano, L.","last_name":"Napolitano","first_name":"L."},{"full_name":"Roy, N.","first_name":"N.","last_name":"Roy"},{"full_name":"Siana, B.","first_name":"B.","last_name":"Siana"},{"first_name":"E.","last_name":"Vanzella","full_name":"Vanzella, E."},{"full_name":"Vulcani, B.","last_name":"Vulcani","first_name":"B."},{"full_name":"Wang, X.","last_name":"Wang","first_name":"X."}],"external_id":{"arxiv":["2507.11045"]},"article_number":"A328","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","PlanS_conform":"1","DOAJ_listed":"1","volume":704,"abstract":[{"lang":"eng","text":"Identifying Lyman continuum (LyC) leakers at intermediate redshifts is crucial for understanding the properties of cosmic reionizers because the opacity of the intergalactic medium (IGM) prevents the direct detection of LyC emission from sources during the Epoch of Reionization (EoR). In this study, we confirm two new LyC candidate leakers at z ∼ 3 in the Abell 2744 cluster field, with absolute escape fractions (fesc) of 0.83−0.80+0.15 and 0.74−0.70+0.23, respectively. The LyC emission was detected using HST/WFC3/F275W and F336W imaging. These two candidate leakers appear to be faint (MUV = −17.61 ± 0.06 and −18.22 ± 0.10), exhibit blue UV continuum slopes (β = −2.43 ± 0.05 and −1.92 ± 0.09), have low masses (M★ ∼ 107.51 ± 0.03 and 107.17 ± 0.15 M⊙) and Lyα equivalent widths of 90 ± 3 Å and 28 ± 12 Å, respectively. These two LyC candidate leakers were detected in a catalog of 91 spectroscopically confirmed sources using public spectra from the JWST and/or MUSE. We also analyzed properties that were proposed as indirect indicators of LyC emission, such as Lyα, the O32 ratio, and M★. We created a galaxy subsample that was selected according to these properties, stacked the LyC observations of this subsample, and assessed the limits of the escape fractions in the stacks. We aim to enhance our understanding of LyC escape mechanisms and improve our predictions of the LyC fesc during the EoR by analyzing the individual candidates and the stacks in the context of the currently limited sample of known LyC leakers at z ∼ 3."}],"month":"12","language":[{"iso":"eng"}],"oa":1,"acknowledgement":"We acknowledge support from the National Science Foundation of China – 12225301, INAF Large grant “Spectroscopic survey with JWST” jand from PRIN 2022 MUR project 2022CB3PJ3 – First Light And Galaxy aSsembly (FLAGS) funded by the European Union – Next Generation EU, and Postgraduate Scholarship Program under the grant of China Scholarship Council. P.W. and B.V. acknowledge support from the INAF Mini Grant ‘1.05.24.07.01 RSN1: Spatially Resolved Near-IR Emission of Intermediate-Redshift Jellyfish Galaxies’ (PI Watson). We acknowledge A. Acebron, C. Grillo, and P. Rosati for their fundamental contribution to the strong lensing analysis and results. We also extend our gratitude to the JWST and HST teams for their efforts in designing, building, and operating these transformative missions.","intvolume":"       704","article_type":"original","year":"2025","file_date_updated":"2026-01-05T09:26:17Z","date_published":"2025-12-01T00:00:00Z","date_created":"2026-01-04T23:01:35Z","ddc":["520"],"type":"journal_article","arxiv":1,"article_processing_charge":"No","quality_controlled":"1","doi":"10.1051/0004-6361/202556410","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Published Version","date_updated":"2026-02-16T12:14:52Z","OA_type":"diamond","day":"01","citation":{"apa":"Liu, Y., Mascia, S., Pentericci, L., Watson, P., Alavi, A., Bergamini, P., … Wang, X. (2025). A Lyman continuum analysis of ∼100 galaxies at z spec∼ 3 in the Abell 2744 cluster field. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202556410\">https://doi.org/10.1051/0004-6361/202556410</a>","mla":"Liu, Y., et al. “A Lyman Continuum Analysis of ∼100 Galaxies at z Spec∼ 3 in the Abell 2744 Cluster Field.” <i>Astronomy &#38; Astrophysics</i>, vol. 704, A328, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202556410\">10.1051/0004-6361/202556410</a>.","ieee":"Y. Liu <i>et al.</i>, “A Lyman continuum analysis of ∼100 galaxies at z spec∼ 3 in the Abell 2744 cluster field,” <i>Astronomy &#38; Astrophysics</i>, vol. 704. EDP Sciences, 2025.","ama":"Liu Y, Mascia S, Pentericci L, et al. A Lyman continuum analysis of ∼100 galaxies at z spec∼ 3 in the Abell 2744 cluster field. <i>Astronomy &#38; Astrophysics</i>. 2025;704. doi:<a href=\"https://doi.org/10.1051/0004-6361/202556410\">10.1051/0004-6361/202556410</a>","ista":"Liu Y, Mascia S, Pentericci L, Watson P, Alavi A, Bergamini P, Bradač M, Calabrò A, Glazebrook K, Henry A, Llerena M, Merlin E, Metha B, Nanayakkara T, Napolitano L, Roy N, Siana B, Vanzella E, Vulcani B, Wang X. 2025. A Lyman continuum analysis of ∼100 galaxies at z spec∼ 3 in the Abell 2744 cluster field. Astronomy &#38; Astrophysics. 704, A328.","chicago":"Liu, Y., Sara Mascia, L. Pentericci, P. Watson, A. Alavi, P. Bergamini, M. Bradač, et al. “A Lyman Continuum Analysis of ∼100 Galaxies at z Spec∼ 3 in the Abell 2744 Cluster Field.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202556410\">https://doi.org/10.1051/0004-6361/202556410</a>.","short":"Y. Liu, S. Mascia, L. Pentericci, P. Watson, A. Alavi, P. Bergamini, M. Bradač, A. Calabrò, K. Glazebrook, A. Henry, M. Llerena, E. Merlin, B. Metha, T. Nanayakkara, L. Napolitano, N. Roy, B. Siana, E. Vanzella, B. Vulcani, X. Wang, Astronomy &#38; Astrophysics 704 (2025)."},"publication":"Astronomy & Astrophysics","has_accepted_license":"1","department":[{"_id":"JoMa"}],"publisher":"EDP Sciences","file":[{"access_level":"open_access","date_created":"2026-01-05T09:26:17Z","relation":"main_file","file_size":4642530,"content_type":"application/pdf","creator":"dernst","file_id":"20938","checksum":"3e6061f3c4bfb521b3333ea4913c241a","success":1,"date_updated":"2026-01-05T09:26:17Z","file_name":"2025_AstronomyAstrophysics_Liu.pdf"}],"OA_place":"publisher","title":"A Lyman continuum analysis of ∼100 galaxies at z spec∼ 3 in the Abell 2744 cluster field","_id":"20932"},{"abstract":[{"text":"Photo-responsive systems based on azobenzenes usually require UV light for E→Z isomerization, limiting their applicability, especially in biomedical contexts. Disequilibration by sensitization of azobenzene under confinement (DESC) has recently emerged as a supramolecular strategy to bypass this limitation without the need to derivatize the azobenzene scaffold. Here, we expand DESC to water-soluble azopolymers obtained by RAFT polymerization and systematically investigate the interplay between the polymer structure and DESC efficiency. Using this approach, we achieved as much as 85% of the direct photoexcitation (UV) switching efficiency, while utilizing low-energy (yellow) light. These results establish general design principles for combining DESC with polymeric systems, opening new opportunities for the development of functional materials driven with low-energy light.","lang":"eng"}],"month":"12","date_published":"2025-12-23T00:00:00Z","article_type":"original","year":"2025","date_created":"2026-01-04T23:01:35Z","oa":1,"language":[{"iso":"eng"}],"acknowledgement":"This work is supported by the European Research Council (Consolidator Grand project MULTIMODAL, no. 101045223), the Research Council of Finland Center of Excellence “Life-Inspired Hybrid Materials Research” (LIBER, no. 346107) and the Research Council of Finland Flagship Programme on Photonics Research and Innovation (PREIN, no. 320165). H.M. gratefully acknowledges Oommen Podivan for providing access to their Zetasizer for DLS measurements and the Faculty of Medicine and Health Technologies at Tampere University for access to their laboratory facilities. R.K. acknowledges funding through the Award for Research Cooperation and High Excellence in Science (ARCHES) from the Federal German Ministry for Education and Research. S.H. acknowledges financial support through the profi7 profiling action SUSBIO from the Research Council of Finland (no. 352754).\r\nOpen access publishing facilitated by Tampereen yliopisto ja Tampereen ammattikorkeakoulu, as part of the Wiley - FinELib agreement.","external_id":{"pmid":["41437660"]},"publication_status":"epub_ahead","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"pmid":1,"article_number":"e23447","author":[{"last_name":"Meteling","first_name":"Henning Jörn","full_name":"Meteling, Henning Jörn"},{"last_name":"Gemen","first_name":"Julius","full_name":"Gemen, Julius"},{"full_name":"Häkkinen, Satu","last_name":"Häkkinen","first_name":"Satu"},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","last_name":"Klajn"},{"full_name":"Priimagi, Arri","last_name":"Priimagi","first_name":"Arri"}],"PlanS_conform":"1","project":[{"name":"Integrating Molecular Photoswitches with PH-Feedback Mechanisms: Towards Life-like Materials","grant_number":"713490","_id":"7bf494dc-9f16-11ee-852c-9fe37e3f50f0"}],"day":"23","date_updated":"2026-01-05T09:42:56Z","OA_type":"hybrid","OA_place":"publisher","_id":"20933","title":"Sensitized disequilibration of water-soluble azopolymers","publication":"Angewandte Chemie International Edition","has_accepted_license":"1","citation":{"ama":"Meteling HJ, Gemen J, Häkkinen S, Klajn R, Priimagi A. Sensitized disequilibration of water-soluble azopolymers. <i>Angewandte Chemie International Edition</i>. 2025. doi:<a href=\"https://doi.org/10.1002/anie.202523447\">10.1002/anie.202523447</a>","apa":"Meteling, H. J., Gemen, J., Häkkinen, S., Klajn, R., &#38; Priimagi, A. (2025). Sensitized disequilibration of water-soluble azopolymers. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.202523447\">https://doi.org/10.1002/anie.202523447</a>","mla":"Meteling, Henning Jörn, et al. “Sensitized Disequilibration of Water-Soluble Azopolymers.” <i>Angewandte Chemie International Edition</i>, e23447, Wiley, 2025, doi:<a href=\"https://doi.org/10.1002/anie.202523447\">10.1002/anie.202523447</a>.","ieee":"H. J. Meteling, J. Gemen, S. Häkkinen, R. Klajn, and A. Priimagi, “Sensitized disequilibration of water-soluble azopolymers,” <i>Angewandte Chemie International Edition</i>. Wiley, 2025.","short":"H.J. Meteling, J. Gemen, S. Häkkinen, R. Klajn, A. Priimagi, Angewandte Chemie International Edition (2025).","ista":"Meteling HJ, Gemen J, Häkkinen S, Klajn R, Priimagi A. 2025. Sensitized disequilibration of water-soluble azopolymers. Angewandte Chemie International Edition., e23447.","chicago":"Meteling, Henning Jörn, Julius Gemen, Satu Häkkinen, Rafal Klajn, and Arri Priimagi. “Sensitized Disequilibration of Water-Soluble Azopolymers.” <i>Angewandte Chemie International Edition</i>. Wiley, 2025. <a href=\"https://doi.org/10.1002/anie.202523447\">https://doi.org/10.1002/anie.202523447</a>."},"main_file_link":[{"url":"https://doi.org/10.1002/anie.202523447","open_access":"1"}],"publisher":"Wiley","department":[{"_id":"RaKl"}],"type":"journal_article","article_processing_charge":"Yes (via OA deal)","ddc":["540"],"oa_version":"Published Version","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1433-7851"],"eissn":["1521-3773"]},"doi":"10.1002/anie.202523447","quality_controlled":"1","status":"public"},{"date_updated":"2026-01-05T09:54:59Z","OA_type":"gold","alternative_title":["TMLR"],"day":"18","citation":{"mla":"Montagna, Francesco, et al. “Demystifying Amortized Causal Discovery with Transformers.” <i>Transactions on Machine Learning Research</i>, ML Research Press, 2025.","apa":"Montagna, F., Cairney-Leeming, M. T., Sridhar, D., &#38; Locatello, F. (2025). Demystifying amortized causal discovery with transformers. <i>Transactions on Machine Learning Research</i>. ML Research Press.","ieee":"F. Montagna, M. T. Cairney-Leeming, D. Sridhar, and F. Locatello, “Demystifying amortized causal discovery with transformers,” <i>Transactions on Machine Learning Research</i>. ML Research Press, 2025.","ama":"Montagna F, Cairney-Leeming MT, Sridhar D, Locatello F. Demystifying amortized causal discovery with transformers. <i>Transactions on Machine Learning Research</i>. 2025.","ista":"Montagna F, Cairney-Leeming MT, Sridhar D, Locatello F. 2025. Demystifying amortized causal discovery with transformers. Transactions on Machine Learning Research.","chicago":"Montagna, Francesco, Maximilian T Cairney-Leeming, Dhanya Sridhar, and Francesco Locatello. “Demystifying Amortized Causal Discovery with Transformers.” <i>Transactions on Machine Learning Research</i>. ML Research Press, 2025.","short":"F. Montagna, M.T. Cairney-Leeming, D. Sridhar, F. Locatello, Transactions on Machine Learning Research (2025)."},"has_accepted_license":"1","publication":"Transactions on Machine Learning Research","publisher":"ML Research Press","department":[{"_id":"FrLo"}],"file":[{"relation":"main_file","date_created":"2026-01-05T09:51:28Z","access_level":"open_access","creator":"dernst","file_size":1030280,"content_type":"application/pdf","success":1,"file_id":"20939","checksum":"968c471bb1f682cf823b2d4cadea8a3f","file_name":"2025_PMLR_Montagna.pdf","date_updated":"2026-01-05T09:51:28Z"}],"OA_place":"publisher","_id":"20934","title":"Demystifying amortized causal discovery with transformers","ddc":["000"],"type":"journal_article","article_processing_charge":"No","arxiv":1,"quality_controlled":"1","publication_identifier":{"eissn":["2835-8856"]},"status":"public","related_material":{"link":[{"url":"https://github.com/francescomontagna/learning-to-induce.git","relation":"software"}]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","abstract":[{"lang":"eng","text":" Supervised learning for causal discovery from observational data often achieves competitive performance despite seemingly avoiding the explicit assumptions that traditional methods require for identifiability. In this work, we analyze CSIvA (Ke et al., 2023) on bivariate causal models, a transformer architecture for amortized inference promising to train on synthetic data and transfer to real ones. First, we bridge the gap with identifiability theory, showing that the training distribution implicitly defines a prior on the causal model of the test observations: consistent with classical approaches, good performance is achieved when we have a good prior on the test data, and the underlying model is identifiable. Second, we find that CSIvA can not generalize to classes of causal models unseen during training: to overcome this limitation, we theoretically and empirically analyze \\textit{when} training CSIvA on datasets generated by multiple identifiable causal models with different structural assumptions improves its generalization at test time. Overall, we find that amortized causal discovery still adheres to identifiability theory, violating the previous hypothesis from Lopez-Paz et al. (2015) that supervised learning methods could overcome its restrictions."}],"month":"12","language":[{"iso":"eng"}],"oa":1,"article_type":"original","year":"2025","date_published":"2025-12-18T00:00:00Z","file_date_updated":"2026-01-05T09:51:28Z","date_created":"2026-01-04T23:01:35Z","author":[{"first_name":"Francesco","last_name":"Montagna","full_name":"Montagna, Francesco","id":"353afc8e-19f4-11f0-9db9-811f1723c83f"},{"full_name":"Cairney-Leeming, Maximilian T","id":"2214a80c-31f8-11ee-a48d-cf52cc58759b","first_name":"Maximilian T","last_name":"Cairney-Leeming"},{"full_name":"Sridhar, Dhanya","first_name":"Dhanya","last_name":"Sridhar"},{"first_name":"Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"}],"corr_author":"1","external_id":{"arxiv":["2405.16924"]},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","PlanS_conform":"1"},{"article_processing_charge":"Yes (in subscription journal)","type":"journal_article","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Published Version","status":"public","quality_controlled":"1","doi":"10.1016/j.molcel.2025.11.029","publication_identifier":{"issn":["1097-2765"],"eissn":["1097-4164"]},"day":"19","OA_type":"hybrid","date_updated":"2026-01-05T08:32:47Z","_id":"20935","title":"Toward community-driven visual proteomics with large-scale cryo-electron tomography of Chlamydomonas reinhardtii","OA_place":"publisher","publisher":"Elsevier","department":[{"_id":"AlMi"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.molcel.2025.11.029"}],"citation":{"short":"R. Kelley, S. Khavnekar, R.D. Righetto, J. Heebner, M. Obr, X. Zhang, S. Chakraborty, G. Tagiltsev, A.K. Michael, S. Van Dorst, F. Waltz, C.L. Mccafferty, L. Lamm, S. Zufferey, P. Van Der Stappen, H. Van Den Hoek, W. Wietrzynski, P. Harar, W. Wan, J.A.G. Briggs, J.M. Plitzko, B.D. Engel, A. Kotecha, Molecular Cell (n.d.).","chicago":"Kelley, Ron, Sagar Khavnekar, Ricardo D. Righetto, Jessica Heebner, Martin Obr, Xianjun Zhang, Saikat Chakraborty, et al. “Toward Community-Driven Visual Proteomics with Large-Scale Cryo-Electron Tomography of Chlamydomonas Reinhardtii.” <i>Molecular Cell</i>. Elsevier, n.d. <a href=\"https://doi.org/10.1016/j.molcel.2025.11.029\">https://doi.org/10.1016/j.molcel.2025.11.029</a>.","ista":"Kelley R, Khavnekar S, Righetto RD, Heebner J, Obr M, Zhang X, Chakraborty S, Tagiltsev G, Michael AK, Van Dorst S, Waltz F, Mccafferty CL, Lamm L, Zufferey S, Van Der Stappen P, Van Den Hoek H, Wietrzynski W, Harar P, Wan W, Briggs JAG, Plitzko JM, Engel BD, Kotecha A. Toward community-driven visual proteomics with large-scale cryo-electron tomography of Chlamydomonas reinhardtii. Molecular Cell.","ama":"Kelley R, Khavnekar S, Righetto RD, et al. Toward community-driven visual proteomics with large-scale cryo-electron tomography of Chlamydomonas reinhardtii. <i>Molecular Cell</i>. doi:<a href=\"https://doi.org/10.1016/j.molcel.2025.11.029\">10.1016/j.molcel.2025.11.029</a>","ieee":"R. Kelley <i>et al.</i>, “Toward community-driven visual proteomics with large-scale cryo-electron tomography of Chlamydomonas reinhardtii,” <i>Molecular Cell</i>. Elsevier.","apa":"Kelley, R., Khavnekar, S., Righetto, R. D., Heebner, J., Obr, M., Zhang, X., … Kotecha, A. (n.d.). Toward community-driven visual proteomics with large-scale cryo-electron tomography of Chlamydomonas reinhardtii. <i>Molecular Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molcel.2025.11.029\">https://doi.org/10.1016/j.molcel.2025.11.029</a>","mla":"Kelley, Ron, et al. “Toward Community-Driven Visual Proteomics with Large-Scale Cryo-Electron Tomography of Chlamydomonas Reinhardtii.” <i>Molecular Cell</i>, Elsevier, doi:<a href=\"https://doi.org/10.1016/j.molcel.2025.11.029\">10.1016/j.molcel.2025.11.029</a>."},"publication":"Molecular Cell","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"inpress","author":[{"first_name":"Ron","last_name":"Kelley","full_name":"Kelley, Ron"},{"first_name":"Sagar","last_name":"Khavnekar","full_name":"Khavnekar, Sagar"},{"full_name":"Righetto, Ricardo D.","first_name":"Ricardo D.","last_name":"Righetto"},{"full_name":"Heebner, Jessica","first_name":"Jessica","last_name":"Heebner"},{"id":"4741CA5A-F248-11E8-B48F-1D18A9856A87","full_name":"Obr, Martin","orcid":"0000-0003-1756-6564","last_name":"Obr","first_name":"Martin"},{"full_name":"Zhang, Xianjun","last_name":"Zhang","first_name":"Xianjun"},{"full_name":"Chakraborty, Saikat","last_name":"Chakraborty","first_name":"Saikat"},{"full_name":"Tagiltsev, Grigory","first_name":"Grigory","last_name":"Tagiltsev"},{"first_name":"Alicia","last_name":"Michael","full_name":"Michael, Alicia","orcid":"0000-0002-6080-839X","id":"6437c950-2a03-11ee-914d-d6476dd7b75c"},{"full_name":"Van Dorst, Sofie","last_name":"Van Dorst","first_name":"Sofie"},{"last_name":"Waltz","first_name":"Florent","full_name":"Waltz, Florent"},{"full_name":"Mccafferty, Caitlyn L.","last_name":"Mccafferty","first_name":"Caitlyn L."},{"first_name":"Lorenz","last_name":"Lamm","full_name":"Lamm, Lorenz"},{"first_name":"Simon","last_name":"Zufferey","full_name":"Zufferey, Simon"},{"full_name":"Van Der Stappen, Philippe","last_name":"Van Der Stappen","first_name":"Philippe"},{"first_name":"Hugo","last_name":"Van Den Hoek","full_name":"Van Den Hoek, Hugo"},{"last_name":"Wietrzynski","first_name":"Wojciech","full_name":"Wietrzynski, Wojciech"},{"id":"e03d953a-6e8c-11ef-99e4-f0717d385cd5","full_name":"Harar, Pavol","orcid":"0000-0001-5206-1794","last_name":"Harar","first_name":"Pavol"},{"full_name":"Wan, William","first_name":"William","last_name":"Wan"},{"full_name":"Briggs, John A.G.","first_name":"John A.G.","last_name":"Briggs"},{"full_name":"Plitzko, Jürgen M.","first_name":"Jürgen M.","last_name":"Plitzko"},{"full_name":"Engel, Benjamin D.","last_name":"Engel","first_name":"Benjamin D."},{"first_name":"Abhay","last_name":"Kotecha","full_name":"Kotecha, Abhay"}],"PlanS_conform":"1","month":"12","abstract":[{"text":"In situ cryo-electron tomography (cryo-ET) has emerged as the method of choice to investigate the structures of biomolecules in their native context. However, challenges remain for the efficient production and sharing of large-scale cryo-ET datasets. Here, we combined cryogenic plasma-based focused ion beam (cryo-PFIB) milling with recent advances in cryo-ET acquisition and processing to generate a dataset of 1,829 annotated tomograms of the green alga Chlamydomonas reinhardtii, which we provide as a community resource to drive method development and inspire biological discovery. To assay data quality, we performed subtomogram averaging of both soluble and membrane-bound complexes ranging in size from >3 MDa to ∼200 kDa, including 80S ribosomes, Rubisco, nucleosomes, microtubules, clathrin, photosystem II, and mitochondrial ATP synthase. The majority of these density maps reached sub-nanometer resolution, demonstrating the potential of this C. reinhardtii dataset as well as the promise of modern cryo-ET workflows and open data sharing to empower visual proteomics.","lang":"eng"}],"date_created":"2026-01-04T23:01:36Z","article_type":"original","year":"2025","date_published":"2025-12-19T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"acknowledgement":"Calculations were performed at the Max Planck Institute of Biochemistry and the Raven Supercomputer of the Max Planck Computing and Data Facility (MPCDF) in Garching, Germany; at the sciCORE (http://scicore.unibas.ch/) scientific computing center at the University of Basel, Switzerland; and at Thermo Fisher Scientific, in Eindhoven, the Netherlands. This work was supported by Thermo Fisher Scientific. All lamella preparations and tilt-series collections used in this work were conducted at Thermo Fisher R&D facilities in Brno and Eindhoven, utilizing Arctis and Krios microscopes. This work was also supported by the ERC consolidator grant “cryOcean” (fulfilled by the Swiss State Secretariat for Education, Research and Innovation, M822.00045) as well as a Swiss Nanoscience Institute PhD school grant to B.D.E. and P.V.d.S., an EMBO long-term postdoctoral fellowship (ALTF-383-2022) to G.T., an SNSF Postdoctoral Fellowship (project 210561) to F.W., a Boehringer Ingelheim Fonds fellowship to L.L., and by the Max Planck Society to J.A.G.B. and J.M.P."},{"citation":{"ieee":"J. Mombarg <i>et al.</i>, “Is a 1D perturbative method sufficient for asteroseismic modelling of β Cephei pulsators?” Zenodo, 2025.","mla":"Mombarg, Joey, et al. <i>Is a 1D Perturbative Method Sufficient for Asteroseismic Modelling of β Cephei Pulsators?</i> Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.17580178\">10.5281/ZENODO.17580178</a>.","apa":"Mombarg, J., Vanlaer, V., Das, S. B., Rieutord, M., Aerts, C., Bugnet, L. A., … Ballot, J. (2025). Is a 1D perturbative method sufficient for asteroseismic modelling of β Cephei pulsators? Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.17580178\">https://doi.org/10.5281/ZENODO.17580178</a>","ama":"Mombarg J, Vanlaer V, Das SB, et al. Is a 1D perturbative method sufficient for asteroseismic modelling of β Cephei pulsators? 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.17580178\">10.5281/ZENODO.17580178</a>","chicago":"Mombarg, Joey, Vincent Vanlaer, Srijan B Das, Michel Rieutord, Conny Aerts, Lisa Annabelle Bugnet, Stephane Mathis, Daniel Reese, and Jerome Ballot. “Is a 1D Perturbative Method Sufficient for Asteroseismic Modelling of β Cephei Pulsators?” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.17580178\">https://doi.org/10.5281/ZENODO.17580178</a>.","ista":"Mombarg J, Vanlaer V, Das SB, Rieutord M, Aerts C, Bugnet LA, Mathis S, Reese D, Ballot J. 2025. Is a 1D perturbative method sufficient for asteroseismic modelling of β Cephei pulsators?, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.17580178\">10.5281/ZENODO.17580178</a>.","short":"J. Mombarg, V. Vanlaer, S.B. Das, M. Rieutord, C. Aerts, L.A. Bugnet, S. Mathis, D. Reese, J. Ballot, (2025)."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.17580178"}],"department":[{"_id":"LiBu"}],"publisher":"Zenodo","OA_place":"repository","date_published":"2025-11-11T00:00:00Z","year":"2025","date_created":"2026-01-05T08:39:33Z","title":"Is a 1D perturbative method sufficient for asteroseismic modelling of β Cephei pulsators?","_id":"20936","date_updated":"2026-02-16T12:14:36Z","OA_type":"gold","abstract":[{"lang":"eng","text":"Supplementary material for Mombarg et al. (2025, A&A). Title: \"Is a 1D perturbative method sufficient for asteroseismic modelling of \r\n~Cephei pulsators? Implications for measurements of rotation and internal magnetic fields\"\r\n\r\nContent:\r\n- Non-rotating ESTER models and associated .GSM models. (Xini = 0.71, Zini = 0.014, vertical/horizonal viscosity 10^7 cm^2/s, vertical chemical diffusion 10^4 cm^2/s for evolution model. More details on the ESTER models can be found in the ESTER manual.\r\n\r\n- Rotational asymmetries computed with StORM and TOP in 1/d, and the central m=0 frequency from TOP in 1/d. (all_A*_new.pkl)\r\n\r\n- Magnetic asymmetries in 1/d for different obliquity angles between 0 and 90 deg for ZAMS and MAMS model, for B_0 = 75 kG. *_nu key gives unperturbed mode frequencies, *_npg the radial order (asym_dict.pkl, asym_dict_evol.pkl)"}],"month":"11","day":"11","doi":"10.5281/ZENODO.17580178","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","related_material":{"record":[{"relation":"used_in_publication","id":"20931","status":"public"}]},"ddc":["520"],"author":[{"full_name":"Mombarg, Joey","last_name":"Mombarg","first_name":"Joey"},{"last_name":"Vanlaer","first_name":"Vincent","full_name":"Vanlaer, Vincent"},{"last_name":"Das","first_name":"Srijan B","id":"9ce7c423-dacf-11ed-8942-e09c6cb27149","full_name":"Das, Srijan B","orcid":"0000-0003-0896-7972"},{"full_name":"Rieutord, Michel","first_name":"Michel","last_name":"Rieutord"},{"full_name":"Aerts, Conny","first_name":"Conny","last_name":"Aerts"},{"last_name":"Bugnet","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000"},{"first_name":"Stephane","last_name":"Mathis","full_name":"Mathis, Stephane"},{"first_name":"Daniel","last_name":"Reese","full_name":"Reese, Daniel"},{"last_name":"Ballot","first_name":"Jerome","full_name":"Ballot, Jerome"}],"type":"research_data_reference","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No"},{"year":"2025","OA_place":"repository","date_published":"2025-05-02T00:00:00Z","title":"Mode dispersion with magnetic field in a cavity-magnonics system","_id":"20940","date_created":"2026-01-05T10:00:06Z","oa":1,"citation":{"ama":"Mandal S, Maji K, Kapoor L, et al. Mode dispersion with magnetic field in a cavity-magnonics system. 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.15321721\">10.5281/ZENODO.15321721</a>","apa":"Mandal, S., Maji, K., Kapoor, L., Sasmal, S., Manni, S., Jesudasan, J., … Deshmukh, M. M. (2025). Mode dispersion with magnetic field in a cavity-magnonics system. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.15321721\">https://doi.org/10.5281/ZENODO.15321721</a>","mla":"Mandal, Supriya, et al. <i>Mode Dispersion with Magnetic Field in a Cavity-Magnonics System</i>. Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.15321721\">10.5281/ZENODO.15321721</a>.","ieee":"S. Mandal <i>et al.</i>, “Mode dispersion with magnetic field in a cavity-magnonics system.” Zenodo, 2025.","short":"S. Mandal, K. Maji, L. Kapoor, S. Sasmal, S. Manni, J. Jesudasan, P. Raychaudhuri, A. Thamizhavel, M.M. Deshmukh, (2025).","ista":"Mandal S, Maji K, Kapoor L, Sasmal S, Manni S, Jesudasan J, Raychaudhuri P, Thamizhavel A, Deshmukh MM. 2025. Mode dispersion with magnetic field in a cavity-magnonics system, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.15321721\">10.5281/ZENODO.15321721</a>.","chicago":"Mandal, Supriya, Krishnendu Maji, Lucky Kapoor, Souvik Sasmal, Soham Manni, John Jesudasan, Pratap Raychaudhuri, Arumugam Thamizhavel, and Mandar M. Deshmukh. “Mode Dispersion with Magnetic Field in a Cavity-Magnonics System.” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.15321721\">https://doi.org/10.5281/ZENODO.15321721</a>."},"has_accepted_license":"1","department":[{"_id":"MaIb"},{"_id":"JoFi"}],"publisher":"Zenodo","main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.15321721","open_access":"1"}],"abstract":[{"text":"These are the raw data files that supplement our study of mode dispersion with magnetic field of a cavity-magnonics system containing chromium trichloride on coplanar waveguide resonator.","lang":"eng"}],"day":"02","month":"05","date_updated":"2026-01-05T10:07:04Z","OA_type":"green","related_material":{"record":[{"status":"public","id":"20927","relation":"used_in_publication"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","doi":"10.5281/ZENODO.15321721","status":"public","type":"research_data_reference","article_processing_charge":"No","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"first_name":"Supriya","last_name":"Mandal","full_name":"Mandal, Supriya"},{"first_name":"Krishnendu","last_name":"Maji","full_name":"Maji, Krishnendu","id":"76bc9e9f-ba0b-11ee-8184-90edabd17a58"},{"last_name":"Kapoor","first_name":"Lucky","id":"84b9700b-15b2-11ec-abd3-831089e67615","full_name":"Kapoor, Lucky","orcid":"0000-0001-8319-2148"},{"full_name":"Sasmal, Souvik","last_name":"Sasmal","first_name":"Souvik"},{"full_name":"Manni, Soham","first_name":"Soham","last_name":"Manni"},{"full_name":"Jesudasan, John","last_name":"Jesudasan","first_name":"John"},{"last_name":"Raychaudhuri","first_name":"Pratap","full_name":"Raychaudhuri, Pratap"},{"first_name":"Arumugam","last_name":"Thamizhavel","full_name":"Thamizhavel, Arumugam"},{"full_name":"Deshmukh, Mandar M.","last_name":"Deshmukh","first_name":"Mandar M."}]},{"OA_type":"hybrid","date_updated":"2026-01-19T11:07:53Z","day":"28","publisher":"Wiley","main_file_link":[{"url":"https://doi.org/10.1002/anie.202505273","open_access":"1"}],"citation":{"ama":"Loos M, Xu F, Mandal PK, et al. Interfacing B‐DNA and DNA mimic foldamers. <i>Angewandte Chemie International Edition</i>. 2025;64(31). doi:<a href=\"https://doi.org/10.1002/anie.202505273\">10.1002/anie.202505273</a>","ieee":"M. Loos <i>et al.</i>, “Interfacing B‐DNA and DNA mimic foldamers,” <i>Angewandte Chemie International Edition</i>, vol. 64, no. 31. Wiley, 2025.","mla":"Loos, Manuel, et al. “Interfacing B‐DNA and DNA Mimic Foldamers.” <i>Angewandte Chemie International Edition</i>, vol. 64, no. 31, e202505273, Wiley, 2025, doi:<a href=\"https://doi.org/10.1002/anie.202505273\">10.1002/anie.202505273</a>.","apa":"Loos, M., Xu, F., Mandal, P. K., Chakrabortty, T., Douat, C., Konrad, D. B., … Huc, I. (2025). Interfacing B‐DNA and DNA mimic foldamers. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.202505273\">https://doi.org/10.1002/anie.202505273</a>","short":"M. Loos, F. Xu, P.K. Mandal, T. Chakrabortty, C. Douat, D.B. Konrad, M. Cabbar, J. Singer, V. Corvaglia, T. Carell, I. Huc, Angewandte Chemie International Edition 64 (2025).","chicago":"Loos, Manuel, Felix Xu, Pradeep K Mandal, Tulika Chakrabortty, Céline Douat, David B. Konrad, Melis Cabbar, et al. “Interfacing B‐DNA and DNA Mimic Foldamers.” <i>Angewandte Chemie International Edition</i>. Wiley, 2025. <a href=\"https://doi.org/10.1002/anie.202505273\">https://doi.org/10.1002/anie.202505273</a>.","ista":"Loos M, Xu F, Mandal PK, Chakrabortty T, Douat C, Konrad DB, Cabbar M, Singer J, Corvaglia V, Carell T, Huc I. 2025. Interfacing B‐DNA and DNA mimic foldamers. Angewandte Chemie International Edition. 64(31), e202505273."},"has_accepted_license":"1","publication":"Angewandte Chemie International Edition","_id":"20960","title":"Interfacing B‐DNA and DNA mimic foldamers","OA_place":"publisher","ddc":["540"],"article_processing_charge":"Yes (in subscription journal)","type":"journal_article","extern":"1","status":"public","quality_controlled":"1","publication_identifier":{"issn":["1433-7851"],"eissn":["1521-3773"]},"doi":"10.1002/anie.202505273","oa_version":"Published Version","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":64,"month":"07","abstract":[{"lang":"eng","text":"A linker unit was designed and synthesized that can serve both as a hairpin turn in a DNA duplex and anchor point for an aromatic helical foldamer mimicking the shape and surface properties of B‐DNA. Methods were developed to synthesize natural/non‐natural chimeric molecules combining foldamer and DNA segments. The ability of the linker to position the foldamer helix and the duplex DNA so that their rims and grooves are in register, despite their completely different chemical nature, was demonstrated using single crystal X‐ray diffraction, circular dichroism and molecular models. Bio‐layer interferometry confirmed that artificial hairpin DNA duplexes keep their ability to bind to DNA binding proteins. The chimeric molecules may pave the way to competitive inhibitors of protein‐DNA interactions involving sequence‐selective DNA‐binding proteins."}],"intvolume":"        64","language":[{"iso":"eng"}],"oa":1,"issue":"31","date_created":"2026-01-08T07:04:48Z","article_type":"original","year":"2025","date_published":"2025-07-28T00:00:00Z","author":[{"first_name":"Manuel","last_name":"Loos","full_name":"Loos, Manuel"},{"first_name":"Felix","last_name":"Xu","full_name":"Xu, Felix"},{"orcid":"0000-0001-5996-956X","full_name":"Mandal, Pradeep K","id":"6a3def15-d4b4-11ef-9fa9-a24c1f545ec3","first_name":"Pradeep K","last_name":"Mandal"},{"full_name":"Chakrabortty, Tulika","first_name":"Tulika","last_name":"Chakrabortty"},{"full_name":"Douat, Céline","first_name":"Céline","last_name":"Douat"},{"first_name":"David B.","last_name":"Konrad","full_name":"Konrad, David B."},{"first_name":"Melis","last_name":"Cabbar","full_name":"Cabbar, Melis"},{"full_name":"Singer, Johannes","last_name":"Singer","first_name":"Johannes"},{"first_name":"Valentina","last_name":"Corvaglia","full_name":"Corvaglia, Valentina"},{"full_name":"Carell, Thomas","first_name":"Thomas","last_name":"Carell"},{"last_name":"Huc","first_name":"Ivan","full_name":"Huc, Ivan"}],"article_number":"e202505273","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"pmid":1,"publication_status":"published","external_id":{"pmid":["40346004"]},"PlanS_conform":"1"},{"day":"30","date_updated":"2026-01-12T09:37:19Z","OA_type":"closed access","title":"Efficient near room temperature thermoelectric cooling and power generation with CuAgSe","_id":"20973","publication":"Small","citation":{"ista":"Meng W, Li M, Wang Q, Song P, Yang X, Wang WJ, Hong M, Ibáñez M, Cabot A, Zhang Y, Liu Y, Lim KH. 2025. Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. Small., e13035.","chicago":"Meng, Weite, Mingquan Li, Qingyue Wang, Pingan Song, Xuan Yang, Wen Jun Wang, Min Hong, et al. “Efficient near Room Temperature Thermoelectric Cooling and Power Generation with CuAgSe.” <i>Small</i>. Wiley, 2025. <a href=\"https://doi.org/10.1002/smll.202513035\">https://doi.org/10.1002/smll.202513035</a>.","short":"W. Meng, M. Li, Q. Wang, P. Song, X. Yang, W.J. Wang, M. Hong, M. Ibáñez, A. Cabot, Y. Zhang, Y. Liu, K.H. Lim, Small (2025).","mla":"Meng, Weite, et al. “Efficient near Room Temperature Thermoelectric Cooling and Power Generation with CuAgSe.” <i>Small</i>, e13035, Wiley, 2025, doi:<a href=\"https://doi.org/10.1002/smll.202513035\">10.1002/smll.202513035</a>.","apa":"Meng, W., Li, M., Wang, Q., Song, P., Yang, X., Wang, W. J., … Lim, K. H. (2025). Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. <i>Small</i>. Wiley. <a href=\"https://doi.org/10.1002/smll.202513035\">https://doi.org/10.1002/smll.202513035</a>","ieee":"W. Meng <i>et al.</i>, “Efficient near room temperature thermoelectric cooling and power generation with CuAgSe,” <i>Small</i>. Wiley, 2025.","ama":"Meng W, Li M, Wang Q, et al. Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. <i>Small</i>. 2025. doi:<a href=\"https://doi.org/10.1002/smll.202513035\">10.1002/smll.202513035</a>"},"publisher":"Wiley","department":[{"_id":"MaIb"}],"type":"journal_article","article_processing_charge":"No","oa_version":"None","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1002/smll.202513035","publication_identifier":{"issn":["1613-6810"],"eissn":["1613-6829"]},"quality_controlled":"1","status":"public","abstract":[{"lang":"eng","text":"CuAgSe-based materials are attractive for low-temperature thermoelectric (TE) applications but are limited by bipolar conduction and relatively high thermal conductivity. Herein, we report a ligand-free aqueous synthesis of Te-doped CuAgSe (CuAgSe1-xTex), where structural and electronic modulation improve carrier transport and suppress phonon propagation. Ex-situ time-resolved X-ray diffraction reveals a spontaneous growth mechanism, while density functional theory calculations show that Te-5s and 5p orbitals hybridization generates localized states and an asymmetric density of states, thereby enhancing the Seebeck coefficient. Electron microscopy and strain analyses confirm that Te-doping introduces a high density of lattice dislocations and grain boundaries, leading to a reduced lattice thermal conductivity of 0.11 W m−1K−1 at 443 K. These synergistic effects translate into device-level performance—the first integrated CuAgSe thermoelectric modules, exhibit a maximum cooling temperature difference of 27.3 K, and power density of 0.34 W cm−2 with a conversion efficiency of 3.6% at a modest temperature gradient of 136 K. These results demonstrate that CuAgSe1-xTex enables efficient energy harvesting and localized cooling under small temperature gradient, underscoring the importance of structural and electronic design beyond conventional zT benchmarks."}],"month":"12","date_published":"2025-12-30T00:00:00Z","article_type":"original","year":"2025","date_created":"2026-01-11T23:01:34Z","language":[{"iso":"eng"}],"acknowledgement":"K.H.L. acknowledges financial support from the National Natural Science Foundation of China (NSFC) (Grant Number 22208293) and the National Foreign Expert Project (Y20240175). Y.L. acknowledges funding from the NSFC (Grant Number 22209034), the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (Grant Number 2022LCX002), and the Fundamental Research Funds for the Central Universities (JZ2024HGTB0239). Y.Z. acknowledges funding from the NSFC (Grant Number 52502313) and Wenzhou Basic Scientific Research Project (Grant Number G20240034). Q. W. acknowledges financial support from the NSFC (Grant Number 22208292), the High-Level Overseas-Educated Talents Return Program, and the “Pioneer” and “Leading Goose” R&D Program of Zhejiang [2025C04021]. K.H.L., Q. W., and X. Y. also acknowledge the Research Funds of the Institute of Zhejiang University-Quzhou (Grants No. IZQ2022RCZX101, IZQ2021RCZX003, IZQ2021RCZX002, and IZQ2024KJ0004). M.H. acknowledges the funding from the Australian Research Council and the iLAuNCH Trailblazer, Department of Education, Australia. M.H. acknowledges the computational support from the National Computational Infrastructure (NCI), Australia, and Pawsey Supercomputing Centre, Australia.","external_id":{"pmid":["41470065"]},"publication_status":"epub_ahead","article_number":"e13035","pmid":1,"author":[{"full_name":"Meng, Weite","first_name":"Weite","last_name":"Meng"},{"full_name":"Li, Mingquan","last_name":"Li","first_name":"Mingquan"},{"full_name":"Wang, Qingyue","first_name":"Qingyue","last_name":"Wang"},{"first_name":"Pingan","last_name":"Song","full_name":"Song, Pingan"},{"last_name":"Yang","first_name":"Xuan","full_name":"Yang, Xuan"},{"first_name":"Wen Jun","last_name":"Wang","full_name":"Wang, Wen Jun"},{"last_name":"Hong","first_name":"Min","full_name":"Hong, Min"},{"last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"},{"full_name":"Zhang, Yu","first_name":"Yu","last_name":"Zhang"},{"full_name":"Liu, Yu","last_name":"Liu","first_name":"Yu"},{"full_name":"Lim, Khak Ho","first_name":"Khak Ho","last_name":"Lim"}]},{"author":[{"full_name":"Patel, Lipi","first_name":"Lipi","last_name":"Patel"},{"first_name":"Samarth","last_name":"Hawaldar","orcid":"0000-0002-1965-4309","full_name":"Hawaldar, Samarth","id":"221708e1-1ff6-11ee-9fa6-85146607433e"},{"full_name":"Panikkar, Aditya","first_name":"Aditya","last_name":"Panikkar"},{"last_name":"Shankar","first_name":"Athreya","full_name":"Shankar, Athreya"},{"last_name":"Suri","first_name":"Baladitya","full_name":"Suri, Baladitya"}],"external_id":{"arxiv":["2507.09298"]},"article_number":"254001","publication_status":"published","volume":127,"abstract":[{"lang":"eng","text":"We present an experimental demonstration of an impedance-engineered Josephson parametric amplifier (IEJPA) fabricated in a single-step lithography process. Impedance-engineering is implemented using a lumped-element series LC circuit. We use a simpler lithography process where the entire device—impedance transformer and Josephson parametric amplifier (JPA)—is patterned in a single electron beam lithography step, followed by a double-angle Dolan-bridge technique for Al–AlOx–Al deposition. We observe amplification with 18 dB gain over a wide 400 MHz bandwidth centered around 5.3 GHz with added noise approaching the quantum limit, and a saturation power of −114 dBm. To accurately explain our experimental results, we extend existing theories for IEJPAs to incorporate the full sine nonlinearity of both the JPA and the transformer. Our work provides a route to simpler realization of broadband JPAs and a theoretical foundation for a regime of JPA operation that has been less explored in literature."}],"month":"12","oa":1,"language":[{"iso":"eng"}],"acknowledgement":"The authors acknowledge receiving support from the Space Technology Cell at IISc and ISRO through the project STC-0444(2022) and the Ministry of Electronics and Information Technology of the Government of India, under the centre of Excellence of Quantum Technology at the Indian Institute of Science, as well as the office of Principle Scientific Advisor, Government of India. S.H. and A.P. acknowledge the support of the Kishore Vaigyanik Protsahan Yojana (KVPY). A.S. acknowledges the support of a New Faculty Initiation Grant (NFIG) from IIT Madras.","issue":"25","intvolume":"       127","article_type":"original","year":"2025","date_published":"2025-12-22T00:00:00Z","date_created":"2026-01-11T23:01:34Z","type":"journal_article","arxiv":1,"article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"issn":["0003-6951"],"eissn":["1077-3118"]},"doi":"10.1063/5.0290636","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Preprint","date_updated":"2026-01-12T09:57:53Z","OA_type":"green","day":"22","citation":{"ama":"Patel L, Hawaldar S, Panikkar A, Shankar A, Suri B. Impedance-engineered Josephson parametric amplifier with single-step lithography. <i>Applied Physics Letters</i>. 2025;127(25). doi:<a href=\"https://doi.org/10.1063/5.0290636\">10.1063/5.0290636</a>","ieee":"L. Patel, S. Hawaldar, A. Panikkar, A. Shankar, and B. Suri, “Impedance-engineered Josephson parametric amplifier with single-step lithography,” <i>Applied Physics Letters</i>, vol. 127, no. 25. AIP Publishing, 2025.","mla":"Patel, Lipi, et al. “Impedance-Engineered Josephson Parametric Amplifier with Single-Step Lithography.” <i>Applied Physics Letters</i>, vol. 127, no. 25, 254001, AIP Publishing, 2025, doi:<a href=\"https://doi.org/10.1063/5.0290636\">10.1063/5.0290636</a>.","apa":"Patel, L., Hawaldar, S., Panikkar, A., Shankar, A., &#38; Suri, B. (2025). Impedance-engineered Josephson parametric amplifier with single-step lithography. <i>Applied Physics Letters</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0290636\">https://doi.org/10.1063/5.0290636</a>","short":"L. Patel, S. Hawaldar, A. Panikkar, A. Shankar, B. Suri, Applied Physics Letters 127 (2025).","chicago":"Patel, Lipi, Samarth Hawaldar, Aditya Panikkar, Athreya Shankar, and Baladitya Suri. “Impedance-Engineered Josephson Parametric Amplifier with Single-Step Lithography.” <i>Applied Physics Letters</i>. AIP Publishing, 2025. <a href=\"https://doi.org/10.1063/5.0290636\">https://doi.org/10.1063/5.0290636</a>.","ista":"Patel L, Hawaldar S, Panikkar A, Shankar A, Suri B. 2025. Impedance-engineered Josephson parametric amplifier with single-step lithography. Applied Physics Letters. 127(25), 254001."},"publication":"Applied Physics Letters","department":[{"_id":"JoFi"}],"publisher":"AIP Publishing","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2507.09298","open_access":"1"}],"OA_place":"repository","title":"Impedance-engineered Josephson parametric amplifier with single-step lithography","_id":"20976"},{"status":"public","quality_controlled":"1","doi":"10.1038/s41467-025-66562-6","publication_identifier":{"eissn":["2041-1723"]},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","ddc":["570"],"article_processing_charge":"Yes","type":"journal_article","department":[{"_id":"PeJo"}],"publisher":"Springer Nature","file":[{"creator":"dernst","content_type":"application/pdf","file_size":7629997,"date_created":"2026-01-12T09:30:15Z","relation":"main_file","access_level":"open_access","file_name":"2025_NatureComm_Maslarova.pdf","date_updated":"2026-01-12T09:30:15Z","success":1,"file_id":"20978","checksum":"a8a1670e197484382e087be60f643945"}],"citation":{"chicago":"Maslarova, Anna, Jiyun N. Shin, Andrea C Navas Olivé, Mihály Vöröslakos, Hajo Hamer, Arnd Doerfler, Simon Henin, György Buzsáki, and Anli Liu. “Spatiotemporal Patterns Differentiate Hippocampal Sharp-Wave Ripples from Interictal Epileptiform Discharges in Mice and Humans.” <i>Nature Communications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s41467-025-66562-6\">https://doi.org/10.1038/s41467-025-66562-6</a>.","ista":"Maslarova A, Shin JN, Navas Olivé AC, Vöröslakos M, Hamer H, Doerfler A, Henin S, Buzsáki G, Liu A. 2025. Spatiotemporal patterns differentiate hippocampal sharp-wave ripples from interictal epileptiform discharges in mice and humans. Nature Communications. 16, 11636.","short":"A. Maslarova, J.N. Shin, A.C. Navas Olivé, M. Vöröslakos, H. Hamer, A. Doerfler, S. Henin, G. Buzsáki, A. Liu, Nature Communications 16 (2025).","ieee":"A. Maslarova <i>et al.</i>, “Spatiotemporal patterns differentiate hippocampal sharp-wave ripples from interictal epileptiform discharges in mice and humans,” <i>Nature Communications</i>, vol. 16. Springer Nature, 2025.","mla":"Maslarova, Anna, et al. “Spatiotemporal Patterns Differentiate Hippocampal Sharp-Wave Ripples from Interictal Epileptiform Discharges in Mice and Humans.” <i>Nature Communications</i>, vol. 16, 11636, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s41467-025-66562-6\">10.1038/s41467-025-66562-6</a>.","apa":"Maslarova, A., Shin, J. N., Navas Olivé, A. C., Vöröslakos, M., Hamer, H., Doerfler, A., … Liu, A. (2025). Spatiotemporal patterns differentiate hippocampal sharp-wave ripples from interictal epileptiform discharges in mice and humans. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-025-66562-6\">https://doi.org/10.1038/s41467-025-66562-6</a>","ama":"Maslarova A, Shin JN, Navas Olivé AC, et al. Spatiotemporal patterns differentiate hippocampal sharp-wave ripples from interictal epileptiform discharges in mice and humans. <i>Nature Communications</i>. 2025;16. doi:<a href=\"https://doi.org/10.1038/s41467-025-66562-6\">10.1038/s41467-025-66562-6</a>"},"publication":"Nature Communications","has_accepted_license":"1","title":"Spatiotemporal patterns differentiate hippocampal sharp-wave ripples from interictal epileptiform discharges in mice and humans","_id":"20977","OA_place":"publisher","OA_type":"gold","date_updated":"2026-01-12T09:31:56Z","day":"30","project":[{"name":"NOMIS Fellowship Program","_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A"}],"DOAJ_listed":"1","author":[{"last_name":"Maslarova","first_name":"Anna","full_name":"Maslarova, Anna"},{"full_name":"Shin, Jiyun N.","last_name":"Shin","first_name":"Jiyun N."},{"last_name":"Navas Olivé","first_name":"Andrea C","id":"739d26c9-52e8-11ee-8d72-f14d3893b4ce","orcid":"0000-0002-9280-8597","full_name":"Navas Olivé, Andrea C"},{"last_name":"Vöröslakos","first_name":"Mihály","full_name":"Vöröslakos, Mihály"},{"last_name":"Hamer","first_name":"Hajo","full_name":"Hamer, Hajo"},{"first_name":"Arnd","last_name":"Doerfler","full_name":"Doerfler, Arnd"},{"last_name":"Henin","first_name":"Simon","full_name":"Henin, Simon"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"},{"full_name":"Liu, Anli","last_name":"Liu","first_name":"Anli"}],"pmid":1,"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"article_number":"11636","publication_status":"published","external_id":{"pmid":["39975118"]},"intvolume":"        16","language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","oa":1,"acknowledgement":"We thank Karl Rössler and Sebastian Brandner for the human SEEG implantations; Katja Kobow for providing the histopathological findings of the patients; Jay Jeschke for help with human electrode localization; Esha Brahmbhatt and Deren Aykan for help with animal habituation; Mursel Karadas for the rodent treadmill design; Nicholas Paleologos, Noam Nitzan, Michael D Hadler and Samuel McKenzie for rating events in a human ripple survey included in a previous version of the manuscript; Nicholas Paleologos for sharing NYU iEEG data for validating UMAP parameters; Julio Esparza for help on the topological analysis through discussions; Thomas Hainmüller, Yiyao Zhang and Mursel Karadas for feedback on the manuscript. We would like to acknowledge Corticale SRL (Genoa, Italy) for providing the SiNAPS probes, and NeuroNexus (Ann Arbor, MI) for their contribution of the data acquisition system and Radiens software. We further acknowledge both Corticale and NeuroNexus for training and support making this research possible. This work was supported by the German Research Foundation (DFG; Walter Benjamin Fellowship MA 10301/1-1, A.M.), NYU Langone Health Finding a Cure for Epilepsy and Seizures (FACES, A.M.), the NOMIS Fellowship (A.N.-O.), the National Institutes of Health (R01NS127954, K23NS104252, A.L.; MH122391, U19NS107616, R01MH139216 G.B.,), and the NYU Department of Neurology (A.L.).","date_created":"2026-01-11T23:01:35Z","article_type":"original","year":"2025","date_published":"2025-12-30T00:00:00Z","file_date_updated":"2026-01-12T09:30:15Z","volume":16,"month":"12","abstract":[{"lang":"eng","text":"Hippocampal sharp-wave ripples (SPW-Rs) are high-frequency oscillations critical for memory consolidation. Despite extensive characterization in rodents, their detection in humans is limited by coarse spatial sampling, interictal epileptiform discharges (IEDs), and a lack of consensus on human ripple localization and morphology. Here, we demonstrate that mouse and human hippocampal ripples share spatial, spectral and temporal features, which are clearly distinct from IEDs. In recordings from male APP/PS1 mice, SPW-Rs were distinguishable from IEDs by multiple criteria. Hippocampal ripples recorded during NREM sleep in female and male surgical epilepsy patients exhibited similar narrowband frequency peaks and multiple ripple cycles in the CA1 and subiculum regions. Conversely, IEDs showed a broad spatial extent and wide-band frequency power. We developed a semi-automated, ripple curation toolbox (ripmap) to separate event waveforms by low-dimensional embedding to reduce false-positive rate in selected ripple channels. Our approach improves ripple detection and provides a firm foundation for future human memory research."}]},{"date_updated":"2026-04-07T11:41:43Z","month":"05","day":"16","abstract":[{"text":"Plant cells respond to a wide range of stimuli through intracellular calcium (Ca2+) signaling. Cyclic nucleotide-gated channels (CNGCs) are a major class of plant Ca2+ channels, with 20 homologs in Arabidopsis. These tetrameric plasma membrane proteins act downstream of diverse signals, such as phytohormones, extracellular damage, cell wall integrity or temperature. Here, we identify a class of plant-specific proteins, Armadillo Repeat Only (ARO), as essential regulators of possibly all plant CNGCs. Abrogation of functional sporophytic AROs results in a phenotypic pattern strongly reminiscent of CNGC dysfunction, including defects in root gravitropism, root hair growth and morphology, stomatal movement, and responses to extracellular ATP and the phytohormone auxin. aro2/3/4 mutants are fully resistant to the toxic effects caused by overexpression of CNGCs. AROs colocalize and physically interact with multiple CNGCs and modulate CNGC-dependent currents in Xenopus oocytes. Structural modeling and site-directed mutagenesis reveal AROs tetramer formation surrounding the CNGC channel, interacting via its IQ domain. Taken together, plant CNGC channels don’t act alone, but in a larger complex - channelosome, first of a kind in plants.","lang":"eng"}],"department":[{"_id":"JiFr"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2025.01.06.631460"}],"acknowledgement":"This project was supported by the Czech Science Foundation grant Nr. 25-16449S and by European\r\nUnion, Horizon Europe, project MOLIPEC, ID 101087030. Computational resources used for structural\r\nmodeling were provided by the e-INFRA CZ project (ID:90254), supported by the Ministry of Education,\r\nYouth and Sports of the Czech Republic. Part of the work was carried out with the support of a Growth\r\nFacility (BC Core Facilities; IPMB BC CAS). X. laevis oocytes were kindly provided by C. Korbmacher on\r\na regular basis (FAU Erlangen-Nürnberg). MF received support from the European Research Council\r\n(Grant 480 No. 101125499). We acknowledge the core facility LMH, the BC CAS supported by the MEYS\r\nCR (LM 2023050 Czech-BioImaging). DO received support from the Czech Science Foundation grant Nr.\r\n24-12107S\r\n","language":[{"iso":"eng"}],"oa":1,"citation":{"ieee":"I. Kulich <i>et al.</i>, “Armadillo repeat only proteins are required for the function of plant CNGC channels,” <i>bioRxiv</i>. .","apa":"Kulich, I., Oulehlová, D., Vladimirtsev, D., Zou, M., Lileikyte, E., Bondar, A., … Friml, J. (n.d.). Armadillo repeat only proteins are required for the function of plant CNGC channels. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2025.01.06.631460\">https://doi.org/10.1101/2025.01.06.631460</a>","mla":"Kulich, Ivan, et al. “Armadillo Repeat Only Proteins Are Required for the Function of Plant CNGC Channels.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2025.01.06.631460\">10.1101/2025.01.06.631460</a>.","ama":"Kulich I, Oulehlová D, Vladimirtsev D, et al. Armadillo repeat only proteins are required for the function of plant CNGC channels. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2025.01.06.631460\">10.1101/2025.01.06.631460</a>","chicago":"Kulich, Ivan, Denisa Oulehlová, Dmitrii Vladimirtsev, Minxia Zou, Edita Lileikyte, Alexey Bondar, Katarína Kulichová, et al. “Armadillo Repeat Only Proteins Are Required for the Function of Plant CNGC Channels.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2025.01.06.631460\">https://doi.org/10.1101/2025.01.06.631460</a>.","ista":"Kulich I, Oulehlová D, Vladimirtsev D, Zou M, Lileikyte E, Bondar A, Kulichová K, Janda M, Iakovenko O, Neubergerová M, Studtrucker T, Pleskot R, Dietrich P, Fendrych M, Friml J. Armadillo repeat only proteins are required for the function of plant CNGC channels. bioRxiv, <a href=\"https://doi.org/10.1101/2025.01.06.631460\">10.1101/2025.01.06.631460</a>.","short":"I. Kulich, D. Oulehlová, D. Vladimirtsev, M. Zou, E. Lileikyte, A. Bondar, K. Kulichová, M. Janda, O. Iakovenko, M. Neubergerová, T. Studtrucker, R. Pleskot, P. Dietrich, M. Fendrych, J. Friml, BioRxiv (n.d.)."},"publication":"bioRxiv","_id":"20982","title":"Armadillo repeat only proteins are required for the function of plant CNGC channels","date_created":"2026-01-13T14:07:58Z","year":"2025","date_published":"2025-05-16T00:00:00Z","OA_place":"repository","author":[{"id":"57a1567c-8314-11eb-9063-c9ddc3451a54","full_name":"Kulich, Ivan","last_name":"Kulich","first_name":"Ivan"},{"last_name":"Oulehlová","first_name":"Denisa","full_name":"Oulehlová, Denisa"},{"first_name":"Dmitrii","last_name":"Vladimirtsev","full_name":"Vladimirtsev, Dmitrii","id":"60466724-5355-11ee-ae5a-fa55e8f99c3d"},{"full_name":"Zou, Minxia","id":"5c243f41-03f3-11ec-841c-96faf48a7ef9","first_name":"Minxia","last_name":"Zou"},{"first_name":"Edita","last_name":"Lileikyte","full_name":"Lileikyte, Edita"},{"last_name":"Bondar","first_name":"Alexey","full_name":"Bondar, Alexey"},{"full_name":"Kulichová, Katarína","first_name":"Katarína","last_name":"Kulichová"},{"last_name":"Janda","first_name":"Martin","full_name":"Janda, Martin"},{"first_name":"Oksana","last_name":"Iakovenko","full_name":"Iakovenko, Oksana"},{"full_name":"Neubergerová, Michaela","last_name":"Neubergerová","first_name":"Michaela"},{"last_name":"Studtrucker","first_name":"Tanja","full_name":"Studtrucker, Tanja"},{"full_name":"Pleskot, Roman","first_name":"Roman","last_name":"Pleskot"},{"full_name":"Dietrich, Petra","last_name":"Dietrich","first_name":"Petra"},{"last_name":"Fendrych","first_name":"Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87","full_name":"Fendrych, Matyas","orcid":"0000-0002-9767-8699"},{"first_name":"Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"article_processing_charge":"No","publication_status":"draft","corr_author":"1","type":"preprint","status":"public","doi":"10.1101/2025.01.06.631460","related_material":{"record":[{"relation":"dissertation_contains","id":"20964","status":"public"}]},"oa_version":"Preprint","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"volume":11,"month":"12","abstract":[{"text":"Modeling the response of material and chemical systems to electric fields remains a longstanding challenge. Machine learning interatomic potentials (MLIPs) offer an efficient and scalable alternative to quantum mechanical methods, but do not by themselves incorporate electrical response. Here, we show that polarization and Born effective charge (BEC) tensors can be directly extracted from long-range MLIPs within the Latent Ewald Summation (LES) framework, solely by learning from energy and force data. Using this approach, we predict the infrared spectra of bulk water under zero or finite external electric fields, ionic conductivities of high-pressure superionic ice, and the phase transition and hysteresis in ferroelectric PbTiO3 perovskite. This work thus extends the capability of MLIPs to predict electrical response –without training on charges or polarization or BECs– and enables accurate modeling of electric-field-driven processes in diverse systems at scale.","lang":"eng"}],"intvolume":"        11","oa":1,"acknowledgement":"The authors thank for valuable discussions with Pinchen Xie, David Limmer, Jeff Neaton, and Greg Voth. The authors thank Sebastien Hamel for providing the DFT MD trajectories for superionic water, and help clarifying questions related to the pseudopotentials. The authors thank Federico Grasselli and Stefano Baroni for providing data and notebooks for computing the conductivity of a molten salt. This research used the Savio computational cluster resource provided by the Berkeley Research Computing program at the University of California, Berkeley (supported by the UC Berkeley Chancellor, Vice Chancellor for Research, and Chief Information Officer). D.S.K. and P.Z. acknowledge funding from the BIDMaP Postdoctoral Fellowship.","language":[{"iso":"eng"}],"date_created":"2026-01-15T12:17:07Z","date_published":"2025-12-29T00:00:00Z","file_date_updated":"2026-01-20T07:22:04Z","article_type":"original","year":"2025","author":[{"full_name":"Zhong, Peichen","last_name":"Zhong","first_name":"Peichen"},{"full_name":"Kim, Dongjin","last_name":"Kim","first_name":"Dongjin"},{"full_name":"King, Daniel S.","first_name":"Daniel S.","last_name":"King"},{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","last_name":"Cheng","first_name":"Bingqing"}],"publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"384","corr_author":"1","PlanS_conform":"1","OA_type":"gold","date_updated":"2026-01-20T07:23:34Z","day":"29","file":[{"date_updated":"2026-01-20T07:22:04Z","file_name":"2025_npj_Zhong.pdf","checksum":"cc999804ba3bfed809ae46c73869e4e3","file_id":"21005","success":1,"content_type":"application/pdf","file_size":2686255,"creator":"dernst","access_level":"open_access","relation":"main_file","date_created":"2026-01-20T07:22:04Z"}],"publisher":"Springer Nature","department":[{"_id":"BiCh"}],"has_accepted_license":"1","publication":"npj Computational Materials","citation":{"ama":"Zhong P, Kim D, King DS, Cheng B. Machine learning interatomic potential can infer electrical response. <i>npj Computational Materials</i>. 2025;11. doi:<a href=\"https://doi.org/10.1038/s41524-025-01911-z\">10.1038/s41524-025-01911-z</a>","ieee":"P. Zhong, D. Kim, D. S. King, and B. Cheng, “Machine learning interatomic potential can infer electrical response,” <i>npj Computational Materials</i>, vol. 11. Springer Nature, 2025.","apa":"Zhong, P., Kim, D., King, D. S., &#38; Cheng, B. (2025). Machine learning interatomic potential can infer electrical response. <i>Npj Computational Materials</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41524-025-01911-z\">https://doi.org/10.1038/s41524-025-01911-z</a>","mla":"Zhong, Peichen, et al. “Machine Learning Interatomic Potential Can Infer Electrical Response.” <i>Npj Computational Materials</i>, vol. 11, 384, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s41524-025-01911-z\">10.1038/s41524-025-01911-z</a>.","short":"P. Zhong, D. Kim, D.S. King, B. Cheng, Npj Computational Materials 11 (2025).","chicago":"Zhong, Peichen, Dongjin Kim, Daniel S. King, and Bingqing Cheng. “Machine Learning Interatomic Potential Can Infer Electrical Response.” <i>Npj Computational Materials</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s41524-025-01911-z\">https://doi.org/10.1038/s41524-025-01911-z</a>.","ista":"Zhong P, Kim D, King DS, Cheng B. 2025. Machine learning interatomic potential can infer electrical response. npj Computational Materials. 11, 384."},"_id":"20990","title":"Machine learning interatomic potential can infer electrical response","OA_place":"publisher","ddc":["540"],"article_processing_charge":"Yes","type":"journal_article","status":"public","doi":"10.1038/s41524-025-01911-z","publication_identifier":{"eissn":["2057-3960"]},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Published Version"},{"abstract":[{"text":"We extend work of Heath-Brown and Salberger, based on the determinant method, to provide a uniform upper bound for the number of integral points of bounded height on an affine surface, which are subject to a polynomial congruence condition. This is applied to get a new uniform bound for points on diagonal quadric surfaces, and to a problem about the representation of integers as a sum of four unlike powers.","lang":"eng"}],"month":"09","volume":2025,"date_published":"2025-09-01T00:00:00Z","file_date_updated":"2026-02-12T07:50:47Z","article_type":"original","year":"2025","date_created":"2026-01-18T23:02:44Z","oa":1,"acknowledgement":"Supported by FWF grant (DOI 10.55776/P36278), Supported by European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant\r\nAgreement No. 101034413.","language":[{"iso":"eng"}],"intvolume":"      2025","external_id":{"arxiv":["2408.11453"]},"corr_author":"1","publication_status":"published","article_number":"12","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","last_name":"Browning"},{"last_name":"Verzobio","first_name":"Matteo","id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","orcid":"0000-0002-0854-0306","full_name":"Verzobio, Matteo"}],"project":[{"_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3","name":"Rational curves via function field analytic number theory","grant_number":"P36278"},{"grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"day":"01","date_updated":"2026-02-12T08:03:12Z","OA_type":"diamond","OA_place":"publisher","_id":"21003","title":"Counting integer points on affine surfaces with a side condition","has_accepted_license":"1","publication":"Discrete Analysis","citation":{"mla":"Browning, Timothy D., and Matteo Verzobio. “Counting Integer Points on Affine Surfaces with a Side Condition.” <i>Discrete Analysis</i>, vol. 2025, 12, Cambridge: Alliance of Diamond Open Access Journals, 2025, doi:<a href=\"https://doi.org/10.19086/da.143787\">10.19086/da.143787</a>.","apa":"Browning, T. D., &#38; Verzobio, M. (2025). Counting integer points on affine surfaces with a side condition. <i>Discrete Analysis</i>. Cambridge: Alliance of Diamond Open Access Journals. <a href=\"https://doi.org/10.19086/da.143787\">https://doi.org/10.19086/da.143787</a>","ieee":"T. D. Browning and M. Verzobio, “Counting integer points on affine surfaces with a side condition,” <i>Discrete Analysis</i>, vol. 2025. Cambridge: Alliance of Diamond Open Access Journals, 2025.","ama":"Browning TD, Verzobio M. Counting integer points on affine surfaces with a side condition. <i>Discrete Analysis</i>. 2025;2025. doi:<a href=\"https://doi.org/10.19086/da.143787\">10.19086/da.143787</a>","ista":"Browning TD, Verzobio M. 2025. Counting integer points on affine surfaces with a side condition. Discrete Analysis. 2025, 12.","chicago":"Browning, Timothy D, and Matteo Verzobio. “Counting Integer Points on Affine Surfaces with a Side Condition.” <i>Discrete Analysis</i>. Cambridge: Alliance of Diamond Open Access Journals, 2025. <a href=\"https://doi.org/10.19086/da.143787\">https://doi.org/10.19086/da.143787</a>.","short":"T.D. Browning, M. Verzobio, Discrete Analysis 2025 (2025)."},"file":[{"success":1,"checksum":"3d38e850b40f3e1abbfd30073bd4388a","file_id":"21214","file_name":"2025_DiscreteAnalysis_Browning.pdf","date_updated":"2026-02-12T07:50:47Z","relation":"main_file","date_created":"2026-02-12T07:50:47Z","access_level":"open_access","creator":"dernst","file_size":393625,"content_type":"application/pdf"}],"department":[{"_id":"TiBr"}],"publisher":"Cambridge: Alliance of Diamond Open Access Journals","type":"journal_article","arxiv":1,"article_processing_charge":"No","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Published Version","publication_identifier":{"eissn":["2397-3129"]},"doi":"10.19086/da.143787","ec_funded":1,"status":"public"},{"day":"01","date_updated":"2026-01-21T09:46:26Z","OA_type":"hybrid","OA_place":"publisher","_id":"21007","title":"A simpler and parallelizable O(√log n)-approximation algorithm for SPARSEST CUT","citation":{"ieee":"V. Kolmogorov, “A simpler and parallelizable O(√log n)-approximation algorithm for SPARSEST CUT,” <i>ACM Transactions on Algorithms</i>, vol. 21, no. 4. Association for Computing Machinery, pp. 1–22, 2025.","mla":"Kolmogorov, Vladimir. “A Simpler and Parallelizable O(√log n)-Approximation Algorithm for SPARSEST CUT.” <i>ACM Transactions on Algorithms</i>, vol. 21, no. 4, Association for Computing Machinery, 2025, pp. 1–22, doi:<a href=\"https://doi.org/10.1145/3748723\">10.1145/3748723</a>.","apa":"Kolmogorov, V. (2025). A simpler and parallelizable O(√log n)-approximation algorithm for SPARSEST CUT. <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3748723\">https://doi.org/10.1145/3748723</a>","ama":"Kolmogorov V. A simpler and parallelizable O(√log n)-approximation algorithm for SPARSEST CUT. <i>ACM Transactions on Algorithms</i>. 2025;21(4):1-22. doi:<a href=\"https://doi.org/10.1145/3748723\">10.1145/3748723</a>","chicago":"Kolmogorov, Vladimir. “A Simpler and Parallelizable O(√log n)-Approximation Algorithm for SPARSEST CUT.” <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3748723\">https://doi.org/10.1145/3748723</a>.","ista":"Kolmogorov V. 2025. A simpler and parallelizable O(√log n)-approximation algorithm for SPARSEST CUT. ACM Transactions on Algorithms. 21(4), 1–22.","short":"V. Kolmogorov, ACM Transactions on Algorithms 21 (2025) 1–22."},"has_accepted_license":"1","publication":"ACM Transactions on Algorithms","publisher":"Association for Computing Machinery","department":[{"_id":"VlKo"}],"file":[{"checksum":"4a80fdb1e3711b9a2768d2bb8f6d3b4e","file_id":"21031","success":1,"date_updated":"2026-01-21T09:38:09Z","file_name":"2025_ACMToA_Kolmogorov.pdf","access_level":"open_access","date_created":"2026-01-21T09:38:09Z","relation":"main_file","content_type":"application/pdf","file_size":2208302,"creator":"dernst"}],"type":"journal_article","arxiv":1,"article_processing_charge":"Yes (via OA deal)","ddc":["510"],"related_material":{"record":[{"status":"public","id":"17236","relation":"shorter_version"}]},"page":"1-22","scopus_import":"1","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publication_identifier":{"issn":["1549-6325"],"eissn":["1549-6333"]},"doi":"10.1145/3748723","status":"public","abstract":[{"lang":"eng","text":"Currently, the best known tradeoff between approximation ratio and complexity for the Sparsest Cut problem is achieved by the algorithm in [Sherman, FOCS 2009]: it computes O(√(log n)/ε)-approximation using O(nε logO(1) n) maxflows for any ε∈[Θ(1/log n),Θ(1)]. It works by solving the SDP relaxation of [Arora-Rao-Vazirani, STOC 2004] using the Multiplicative Weights Update algorithm (MW) of [Arora-Kale, JACM 2016]. To implement one MW step, Sherman approximately solves a multicommodity flow problem using another application of MW. Nested MW steps are solved via a certain \"chaining\" algorithm that combines results of multiple calls to the maxflow algorithm. We present an alternative approach that avoids solving the multicommodity flow problem and instead computes \"violating paths\". This simplifies Sherman's algorithm by removing a need for a nested application of MW, and also allows parallelization: we show how to compute O(√(log n)/ε)-approximation via O(logO(1) n) maxflows using O(nε) processors. We also revisit Sherman's chaining algorithm, and present a simpler version together with a new analysis."}],"month":"10","volume":21,"article_type":"original","year":"2025","date_published":"2025-10-01T00:00:00Z","file_date_updated":"2026-01-21T09:38:09Z","date_created":"2026-01-20T10:04:02Z","oa":1,"issue":"4","language":[{"iso":"eng"}],"intvolume":"        21","corr_author":"1","external_id":{"arxiv":["2307.00115"]},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"PlanS_conform":"1"},{"publication_status":"submitted","article_processing_charge":"No","arxiv":1,"article_number":"2505.17858","external_id":{"arxiv":["2505.17858"]},"type":"preprint","author":[{"id":"920a7385-7995-11ef-9bfd-8c434cd8f3c2","orcid":"0000-0002-4861-9174","full_name":"Bleile, Yossi","last_name":"Bleile","first_name":"Yossi"},{"first_name":"Lisbeth","last_name":"Fajstrup","full_name":"Fajstrup, Lisbeth"},{"first_name":"Teresa","last_name":"Heiss","full_name":"Heiss, Teresa","orcid":"0000-0002-1780-2689","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Svane","first_name":"Anne Marie","full_name":"Svane, Anne Marie"},{"full_name":"Sørensen, Søren Strandskov","first_name":"Søren Strandskov","last_name":"Sørensen"}],"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"}],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ec_funded":1,"doi":"10.48550/arXiv.2505.17858","month":"05","day":"23","abstract":[{"lang":"eng","text":"Motivated by applications in chemistry, we give a homlogical definition of tunnels, or more generally cobordisms, connecting disjoint parts of a cell complex. For a filtered complex, this defines a persistence module. We give a method for identifying birth and death times using kernel persistence and a matrix reduction algorithm for pairing birth and death times."}],"date_updated":"2026-06-11T11:51:13Z","date_created":"2026-01-20T10:12:21Z","_id":"21016","title":"Identifying cobordisms using kernel persistence","OA_place":"repository","date_published":"2025-05-23T00:00:00Z","year":"2025","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2505.17858","open_access":"1"}],"department":[{"_id":"HeEd"}],"publication":"arXiv","oa":1,"citation":{"short":"Y. Bokor Bleile, L. Fajstrup, T. Heiss, A.M. Svane, S.S. Sørensen, ArXiv (n.d.).","ista":"Bokor Bleile Y, Fajstrup L, Heiss T, Svane AM, Sørensen SS. Identifying cobordisms using kernel persistence. arXiv, 2505.17858.","chicago":"Bokor Bleile, Yossi, Lisbeth Fajstrup, Teresa Heiss, Anne Marie Svane, and Søren Strandskov Sørensen. “Identifying Cobordisms Using Kernel Persistence.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2505.17858\">https://doi.org/10.48550/arXiv.2505.17858</a>.","ama":"Bokor Bleile Y, Fajstrup L, Heiss T, Svane AM, Sørensen SS. Identifying cobordisms using kernel persistence. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2505.17858\">10.48550/arXiv.2505.17858</a>","mla":"Bokor Bleile, Yossi, et al. “Identifying Cobordisms Using Kernel Persistence.” <i>ArXiv</i>, 2505.17858, doi:<a href=\"https://doi.org/10.48550/arXiv.2505.17858\">10.48550/arXiv.2505.17858</a>.","apa":"Bokor Bleile, Y., Fajstrup, L., Heiss, T., Svane, A. M., &#38; Sørensen, S. S. (n.d.). Identifying cobordisms using kernel persistence. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2505.17858\">https://doi.org/10.48550/arXiv.2505.17858</a>","ieee":"Y. Bokor Bleile, L. Fajstrup, T. Heiss, A. M. Svane, and S. S. Sørensen, “Identifying cobordisms using kernel persistence,” <i>arXiv</i>. ."},"acknowledgement":"Y. B. B. and L. F. were funded by the Independent Research Fund Denmark, grant\r\nnumber 1026-00037. T. H. was partially supported by the European Research Council\r\n(ERC) Horizon 2020, grant number 788183.","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"oa":1,"acknowledgement":"We thank the ACM TOCS Editors and the reviewers for their help in improving the manuscript. This work was partially supported by CAPES - Brazil (Coordenação de Aperfeiçoamento de Pessoal de Nível Superior) and byFundação para a Ciência e Tecnologia (FCT) under project UIDB/50021/2020 and grant 2020.05270.BD, and via project COSMOS (via the OE with ref. PTDC/EEI-COM/29271/2017, via the łPrograma Operacional Regional de Lisboa na sua componente FEDER” with ref. Lisboa-01-0145-FEDER-029271) and project Angainor with reference LISBOA-01-0145-FEDER-031456, grant agreement number 952226, and project GLOG, with reference LISBOA2030-FEDER-00771200, and project BIG (Enhancing the research and innovation potential of Tecnico through blockchain technologies and design Innovation for social Good), and project ScalableCosmosConsensus, and the Austrian Science Fund (FWF) SFB project SpyCoDe F8502 and the Vienna Science and Technology Fund (WWTF) project SCALE2 CT22-045","date_created":"2026-01-20T10:14:23Z","year":"2025","article_type":"original","date_published":"2025-09-05T00:00:00Z","month":"09","abstract":[{"lang":"eng","text":"With the growing interest in blockchains, permissioned approaches to consensus have received increasing attention. Unfortunately, the BFT consensus algorithms that are the backbone of most of these blockchains scale poorly and offer limited throughput. In fact, many state-of-the-art BFT consensus algorithms require a single leader process to receive and validate votes from a quorum of processes and then broadcast the result, which is inherently non-scalable. Recent approaches avoid this bottleneck by using dissemination/aggregation trees to propagate values and collect and validate votes. However, the use of trees increases the round latency, which limits the throughput for deeper trees. In this paper we propose Kauri, a BFT communication abstraction that sustains high throughput as the system size grows by leveraging a novel pipelining technique to perform scalable dissemination and aggregation on trees. Furthermore, when the number of faults is moderate (arguably the most common case in practice), our construction is able to recover from faults in an optimal number of reconfiguration steps. We implemented and experimentally evaluated Kauri with up to 800 processes. Our results show that Kauri outperforms the throughput of state-of-the-art permissioned blockchain protocols, by up to 58x without compromising latency. Interestingly, in some cases, the parallelization provided by Kauri can also decrease the latency."}],"project":[{"grant_number":"F8502","name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"},{"grant_number":"ICT22-045","name":"SeCure, privAte, and interoperabLe layEr 2","_id":"7bdd2f70-9f16-11ee-852c-b7950bc6d277"}],"PlanS_conform":"1","author":[{"first_name":"Ray","last_name":"Neiheiser","full_name":"Neiheiser, Ray","orcid":"0000-0001-7227-8309","id":"f09651b9-fec0-11ec-b5d8-934aff0e52a4"},{"full_name":"Matos, Miguel","last_name":"Matos","first_name":"Miguel"},{"full_name":"Rodrigues, Luis","first_name":"Luis","last_name":"Rodrigues"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"3769423","publication_status":"epub_ahead","corr_author":"1","publisher":"Association for Computing Machinery","department":[{"_id":"KrPi"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3769423"}],"citation":{"ista":"Neiheiser R, Matos M, Rodrigues L. 2025. Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. ACM Transactions on Computer Systems., 3769423.","chicago":"Neiheiser, Ray, Miguel Matos, and Luis Rodrigues. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation.” <i>ACM Transactions on Computer Systems</i>. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3769423\">https://doi.org/10.1145/3769423</a>.","short":"R. Neiheiser, M. Matos, L. Rodrigues, ACM Transactions on Computer Systems (2025).","apa":"Neiheiser, R., Matos, M., &#38; Rodrigues, L. (2025). Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. <i>ACM Transactions on Computer Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3769423\">https://doi.org/10.1145/3769423</a>","mla":"Neiheiser, Ray, et al. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation.” <i>ACM Transactions on Computer Systems</i>, 3769423, Association for Computing Machinery, 2025, doi:<a href=\"https://doi.org/10.1145/3769423\">10.1145/3769423</a>.","ieee":"R. Neiheiser, M. Matos, and L. Rodrigues, “Kauri: BFT consensus with pipelined tree-based dissemination and aggregation,” <i>ACM Transactions on Computer Systems</i>. Association for Computing Machinery, 2025.","ama":"Neiheiser R, Matos M, Rodrigues L. Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. <i>ACM Transactions on Computer Systems</i>. 2025. doi:<a href=\"https://doi.org/10.1145/3769423\">10.1145/3769423</a>"},"publication":"ACM Transactions on Computer Systems","has_accepted_license":"1","_id":"21017","title":"Kauri: BFT consensus with pipelined tree-based dissemination and aggregation","OA_place":"publisher","OA_type":"hybrid","date_updated":"2026-06-18T18:28:26Z","day":"05","status":"public","quality_controlled":"1","publication_identifier":{"issn":["0734-2071"],"eissn":["1557-7333"]},"doi":"10.1145/3769423","scopus_import":"1","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"article_processing_charge":"Yes (via OA deal)","type":"journal_article"},{"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"},{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"}],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","full_name":"Karimi, Mahyar","orcid":"0009-0005-0820-1696","last_name":"Karimi","first_name":"Mahyar"},{"last_name":"Thejaswini","first_name":"K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","full_name":"Thejaswini, K. S."}],"corr_author":"1","external_id":{"arxiv":["2505.09276"]},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","acknowledgement":"This work is a part of projects VAMOS that has received fund-ing from the European Research Council (ERC), grant agreementNo 101020093 and the Austrian Science Fund (FWF) SFB projectSpyCoDe F8502.We thank anonymous reviewers for pointing us to related work [ 3] and for their valuable suggestions that improved this paper.","language":[{"iso":"eng"}],"oa":1,"year":"2025","file_date_updated":"2026-01-21T07:34:58Z","date_published":"2025-11-22T00:00:00Z","date_created":"2026-01-20T10:17:10Z","abstract":[{"lang":"eng","text":"Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\nIn this work, we propose two novel protocols for the privacy-preserving runtime verification of systems against formal sequential specifications. In our first protocol, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. Our second protocol ensures that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocols adapt and improve existing techniques used in cryptography, and more specifically, multi-party computation.\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocols exchange a single message per observation step, after an initialisation phase. This design minimises communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally."}],"month":"11","quality_controlled":"1","doi":"10.1145/3719027.3765137","publication_identifier":{"isbn":["9798400715259"]},"ec_funded":1,"status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"21401","status":"public"}]},"page":"2774-2787","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","conference":{"start_date":"2025-10-13","name":"CCS: Conference on Computer and Communications Security","location":"Taipei, Taiwan","end_date":"2025-10-17"},"ddc":["000"],"type":"conference","arxiv":1,"article_processing_charge":"Yes (via OA deal)","citation":{"short":"T.A. Henzinger, M. Karimi, K.S. Thejaswini, in:, Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2025, pp. 2774–2787.","chicago":"Henzinger, Thomas A, Mahyar Karimi, and K. S. Thejaswini. “Privacy-Preserving Runtime Verification.” In <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i>, 2774–87. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3719027.3765137\">https://doi.org/10.1145/3719027.3765137</a>.","ista":"Henzinger TA, Karimi M, Thejaswini KS. 2025. Privacy-preserving runtime verification. Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 2774–2787.","ama":"Henzinger TA, Karimi M, Thejaswini KS. Privacy-preserving runtime verification. In: <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i>. Association for Computing Machinery; 2025:2774-2787. doi:<a href=\"https://doi.org/10.1145/3719027.3765137\">10.1145/3719027.3765137</a>","ieee":"T. A. Henzinger, M. Karimi, and K. S. Thejaswini, “Privacy-preserving runtime verification,” in <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i>, Taipei, Taiwan, 2025, pp. 2774–2787.","mla":"Henzinger, Thomas A., et al. “Privacy-Preserving Runtime Verification.” <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i>, Association for Computing Machinery, 2025, pp. 2774–87, doi:<a href=\"https://doi.org/10.1145/3719027.3765137\">10.1145/3719027.3765137</a>.","apa":"Henzinger, T. A., Karimi, M., &#38; Thejaswini, K. S. (2025). Privacy-preserving runtime verification. In <i>Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security</i> (pp. 2774–2787). Taipei, Taiwan: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3719027.3765137\">https://doi.org/10.1145/3719027.3765137</a>"},"publication":"Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security","has_accepted_license":"1","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"publisher":"Association for Computing Machinery","file":[{"file_id":"21024","checksum":"615ffddab6c7285158c2953acec6fa6f","success":1,"date_updated":"2026-01-21T07:34:58Z","file_name":"2025_CCS_HenzingerT.pdf","access_level":"open_access","date_created":"2026-01-21T07:34:58Z","relation":"main_file","file_size":1241912,"content_type":"application/pdf","creator":"dernst"}],"OA_place":"publisher","_id":"21020","title":"Privacy-preserving runtime verification","date_updated":"2026-03-13T13:37:19Z","OA_type":"hybrid","day":"22"},{"ddc":["000"],"type":"conference","arxiv":1,"article_processing_charge":"No","quality_controlled":"1","status":"public","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"url":"https://github.com/sidgairo18/how-to-probe","relation":"software"}]},"conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2025-04-24","location":"Singapore","end_date":"2025-04-28"},"date_updated":"2026-02-09T06:11:17Z","OA_type":"gold","day":"22","has_accepted_license":"1","publication":"13th International Conference on Learning Representations","citation":{"ama":"Gairola S, Böhle M, Locatello F, Schiele B. How to probe: Simple yet effective techniques for improving post-hoc explanations. In: <i>13th International Conference on Learning Representations</i>. ICLR; 2025.","mla":"Gairola, Siddhartha, et al. “How to Probe: Simple yet Effective Techniques for Improving Post-Hoc Explanations.” <i>13th International Conference on Learning Representations</i>, ICLR, 2025.","apa":"Gairola, S., Böhle, M., Locatello, F., &#38; Schiele, B. (2025). How to probe: Simple yet effective techniques for improving post-hoc explanations. In <i>13th International Conference on Learning Representations</i>. Singapore: ICLR.","ieee":"S. Gairola, M. Böhle, F. Locatello, and B. Schiele, “How to probe: Simple yet effective techniques for improving post-hoc explanations,” in <i>13th International Conference on Learning Representations</i>, Singapore, 2025.","short":"S. Gairola, M. Böhle, F. Locatello, B. Schiele, in:, 13th International Conference on Learning Representations, ICLR, 2025.","ista":"Gairola S, Böhle M, Locatello F, Schiele B. 2025. How to probe: Simple yet effective techniques for improving post-hoc explanations. 13th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","chicago":"Gairola, Siddhartha, Moritz Böhle, Francesco Locatello, and Bernt Schiele. “How to Probe: Simple yet Effective Techniques for Improving Post-Hoc Explanations.” In <i>13th International Conference on Learning Representations</i>. ICLR, 2025."},"file":[{"creator":"dernst","content_type":"application/pdf","file_size":24386863,"relation":"main_file","date_created":"2026-02-09T06:06:14Z","access_level":"open_access","file_name":"2025_ICLR_Gairola.pdf","date_updated":"2026-02-09T06:06:14Z","success":1,"checksum":"6c8dfe4291c41d5a2c2fd838105e10b9","file_id":"21162"}],"publisher":"ICLR","department":[{"_id":"FrLo"}],"OA_place":"publisher","title":"How to probe: Simple yet effective techniques for improving post-hoc explanations","_id":"21049","author":[{"first_name":"Siddhartha","last_name":"Gairola","full_name":"Gairola, Siddhartha","id":"fb21489d-057c-11f1-b1b6-d68cd6ae64f5"},{"full_name":"Böhle, Moritz","last_name":"Böhle","first_name":"Moritz"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco"},{"full_name":"Schiele, Bernt","first_name":"Bernt","last_name":"Schiele"}],"external_id":{"arxiv":["2503.00641"]},"corr_author":"1","publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"abstract":[{"text":"Post-hoc importance attribution methods are a popular tool for “explaining” Deep Neural Networks (DNNs) and are inherently based on the assumption that the explanations can be applied independently of how the models were trained. Contrarily, in this work we bring forward empirical evidence that challenges this very notion. Surprisingly, we discover a strong dependency on and demonstrate that the training details of a pre-trained model’s classification layer (<10% of model parameters) play a crucial role, much more than the pre-training scheme itself. This is of high practical relevance: (1) as techniques for pre-training models are becoming increasingly diverse, understanding the interplay between these techniques and attribution methods is critical; (2) it sheds light on an important yet overlooked assumption of post-hoc attribution methods which can drastically impact model explanations and how they are interpreted eventually. With this finding we also present simple yet effective adjustments to the classification layers, that can significantly enhance the quality of model explanations. We validate our findings across several visual pre-training frameworks (fully-supervised, self-supervised, contrastive vision-language training) and analyse how they impact explanations for a wide range of attribution methods on a diverse set of evaluation metrics.","lang":"eng"}],"month":"01","oa":1,"language":[{"iso":"eng"}],"acknowledgement":"We sincerely thank Sukrut Rao and Yue Fan for their valuable feedback on the paper and insightful discussions throughout the project. Additionally, we appreciate Sukrut’s help\r\nwith some LATEX sorcery. This work was partially supported by ELSA Mobility Program1\r\nas part of the ELLIS2 exchange program to the Institute of Science and Technology Austria (ISTA), where a portion of this research was conducted.","date_published":"2025-01-22T00:00:00Z","file_date_updated":"2026-02-09T06:06:14Z","year":"2025","date_created":"2026-01-27T12:48:35Z"},{"date_updated":"2026-06-02T09:24:17Z","abstract":[{"text":"In 1873, James C. Maxwell conjectured that the electric field generated by $n$ point charges in generic position has at most $(n-1)^2$ isolated zeroes. The first (non-optimal) upper bound was only obtained in 2007 by Gabrielov, Novikov and Shapiro, who also posed two additional interesting conjectures.\r\n In this article, we give the best upper bound known to date on the number of zeroes of the electric field, and construct a counterexample to a conjecture of Gabrielov, Novikov and Shapiro that the number of equilibria cannot exceed those of the distance function defined by the unit point charges.\r\n Finally, we note that it is quite possible that Maxwell's quadratic upper bound is not tight, so it is prudent to find smaller bounds. Hence, we also explore examples and construct configurations of charges achieving the highest ratios of the number of electric field zeroes by point charges found to this day.","lang":"eng"}],"day":"20","month":"03","publication":"arXiv","language":[{"iso":"eng"}],"citation":{"short":"H. Edelsbrunner, C.D. Fillmore, G. Olivera, ArXiv (n.d.).","ista":"Edelsbrunner H, Fillmore CD, Olivera G. Counting equilibria of the electrostatic potential. arXiv, <a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">10.48550/ARXIV.2501.05315</a>.","chicago":"Edelsbrunner, Herbert, Christopher D Fillmore, and Gonçalo Olivera. “Counting Equilibria of the Electrostatic Potential.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">https://doi.org/10.48550/ARXIV.2501.05315</a>.","ama":"Edelsbrunner H, Fillmore CD, Olivera G. Counting equilibria of the electrostatic potential. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">10.48550/ARXIV.2501.05315</a>","mla":"Edelsbrunner, Herbert, et al. “Counting Equilibria of the Electrostatic Potential.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">10.48550/ARXIV.2501.05315</a>.","apa":"Edelsbrunner, H., Fillmore, C. D., &#38; Olivera, G. (n.d.). Counting equilibria of the electrostatic potential. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2501.05315\">https://doi.org/10.48550/ARXIV.2501.05315</a>","ieee":"H. Edelsbrunner, C. D. Fillmore, and G. Olivera, “Counting equilibria of the electrostatic potential,” <i>arXiv</i>. ."},"oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2501.05315","open_access":"1"}],"department":[{"_id":"HeEd"}],"OA_place":"repository","date_published":"2025-03-20T00:00:00Z","year":"2025","date_created":"2026-01-27T14:29:27Z","title":"Counting equilibria of the electrostatic potential","_id":"21050","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert"},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","full_name":"Fillmore, Christopher D","last_name":"Fillmore","first_name":"Christopher D"},{"full_name":"Olivera, Gonçalo","first_name":"Gonçalo","last_name":"Olivera"}],"type":"preprint","external_id":{"arxiv":["2501.05315"]},"corr_author":"1","publication_status":"draft","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"arxiv":1,"article_processing_charge":"No","doi":"10.48550/ARXIV.2501.05315","status":"public","oa_version":"Preprint","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"status":"public","id":"21021","relation":"dissertation_contains"},{"id":"21931","relation":"later_version","status":"public"}]}},{"volume":9,"month":"01","abstract":[{"text":"Program logics have proven a successful strategy for verification of complex programs. By providing local reasoning and means of abstraction and composition, they allow reasoning principles for individual components of a program to be combined to prove guarantees about a whole program. Crucially, these components and their proofs can be reused. However, this reuse is only available once the program logic has been defined. It is a frustrating fact of the status quo that whoever defines a new program logic must establish every part, both semantics and proof rules, from scratch. In spite of programming languages and program logics typically sharing many core features, reuse is generally not available across languages. Even inside one language, if the same underlying operation appears in multiple language primitives, reuse is typically not possible when establishing proof rules for the program logic.\r\nTo enable reuse across and inside languages when defining complex program logics (and proving them sound), we serve program logics à la carte by combining program logic fragments for the various effects of the language. Among other language features, the menu includes shared state, concurrency, and non-determinism as reusable, composable blocks that can be combined to define a program logic modularly. Our theory builds on ITrees as a framework to express language semantics and Iris as the underlying separation logic; the work has been mechanized in the Coq proof assistant.","lang":"eng"}],"intvolume":"         9","oa":1,"issue":"POPL","language":[{"iso":"eng"}],"date_created":"2026-01-28T06:35:47Z","date_published":"2025-01-09T00:00:00Z","article_type":"original","year":"2025","author":[{"full_name":"Vistrup, Max","last_name":"Vistrup","first_name":"Max"},{"full_name":"Sammler, Michael Joachim","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7","first_name":"Michael Joachim","last_name":"Sammler"},{"last_name":"Jung","first_name":"Ralf","full_name":"Jung, Ralf"}],"publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"PlanS_conform":"1","OA_type":"hybrid","date_updated":"2026-02-09T06:19:36Z","day":"09","main_file_link":[{"open_access":"1"}],"publisher":"Association for Computing Machinery","has_accepted_license":"1","publication":"Proceedings of the ACM on Programming Languages","citation":{"short":"M. Vistrup, M.J. Sammler, R. Jung, Proceedings of the ACM on Programming Languages 9 (2025) 300–331.","ista":"Vistrup M, Sammler MJ, Jung R. 2025. Program logics à la Carte. Proceedings of the ACM on Programming Languages. 9(POPL), 300–331.","chicago":"Vistrup, Max, Michael Joachim Sammler, and Ralf Jung. “Program Logics à La Carte.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3704847\">https://doi.org/10.1145/3704847</a>.","ama":"Vistrup M, Sammler MJ, Jung R. Program logics à la Carte. <i>Proceedings of the ACM on Programming Languages</i>. 2025;9(POPL):300-331. doi:<a href=\"https://doi.org/10.1145/3704847\">10.1145/3704847</a>","mla":"Vistrup, Max, et al. “Program Logics à La Carte.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 9, no. POPL, Association for Computing Machinery, 2025, pp. 300–31, doi:<a href=\"https://doi.org/10.1145/3704847\">10.1145/3704847</a>.","apa":"Vistrup, M., Sammler, M. J., &#38; Jung, R. (2025). Program logics à la Carte. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3704847\">https://doi.org/10.1145/3704847</a>","ieee":"M. Vistrup, M. J. Sammler, and R. Jung, “Program logics à la Carte,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 9, no. POPL. Association for Computing Machinery, pp. 300–331, 2025."},"_id":"21052","title":"Program logics à la Carte","OA_place":"publisher","article_processing_charge":"No","extern":"1","type":"journal_article","status":"public","publication_identifier":{"issn":["2475-1421"]},"doi":"10.1145/3704847","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"300-331"}]