[{"citation":{"short":"J. Lee, A. Vernet, N. Gruber, K.M. Kready, D.R. Burrill, J.C. Way, P.A. Silver, Protein Engineering, Design and Selection 34 (2021).","ieee":"J. Lee <i>et al.</i>, “Rational engineering of an erythropoietin fusion protein to treat hypoxia,” <i>Protein Engineering, Design and Selection</i>, vol. 34. Oxford University Press, 2021.","ista":"Lee J, Vernet A, Gruber N, Kready KM, Burrill DR, Way JC, Silver PA. 2021. Rational engineering of an erythropoietin fusion protein to treat hypoxia. Protein Engineering, Design and Selection. 34, gzab025.","ama":"Lee J, Vernet A, Gruber N, et al. Rational engineering of an erythropoietin fusion protein to treat hypoxia. <i>Protein Engineering, Design and Selection</i>. 2021;34. doi:<a href=\"https://doi.org/10.1093/protein/gzab025\">10.1093/protein/gzab025</a>","apa":"Lee, J., Vernet, A., Gruber, N., Kready, K. M., Burrill, D. R., Way, J. C., &#38; Silver, P. A. (2021). Rational engineering of an erythropoietin fusion protein to treat hypoxia. <i>Protein Engineering, Design and Selection</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/protein/gzab025\">https://doi.org/10.1093/protein/gzab025</a>","chicago":"Lee, Jungmin, Andyna Vernet, Nathalie Gruber, Kasia M. Kready, Devin R. Burrill, Jeffrey C. Way, and Pamela A. Silver. “Rational Engineering of an Erythropoietin Fusion Protein to Treat Hypoxia.” <i>Protein Engineering, Design and Selection</i>. Oxford University Press, 2021. <a href=\"https://doi.org/10.1093/protein/gzab025\">https://doi.org/10.1093/protein/gzab025</a>.","mla":"Lee, Jungmin, et al. “Rational Engineering of an Erythropoietin Fusion Protein to Treat Hypoxia.” <i>Protein Engineering, Design and Selection</i>, vol. 34, gzab025, Oxford University Press, 2021, doi:<a href=\"https://doi.org/10.1093/protein/gzab025\">10.1093/protein/gzab025</a>."},"OA_type":"free access","day":"01","status":"public","oa":1,"isi":1,"department":[{"_id":"CaGu"}],"publisher":"Oxford University Press","date_updated":"2026-07-28T12:27:59Z","language":[{"iso":"eng"}],"month":"11","date_published":"2021-11-01T00:00:00Z","type":"journal_article","acknowledgement":"This work was supported by funds from the Wyss Institute for Biologically Inspired Engineering and the Boston Biomedical Innovation Center (Pilot Award 112475; Drive Award U54HL119145). J.L., K.M.K., D.R.B., J.C.W. and P.A.S. were supported by the Harvard Medical School Department of Systems Biology. J.C.W. was further supported by the Harvard Medical School Laboratory of Systems Pharmacology. A.V., D.R.B. and P.A.S. were further supported by the Wyss Institute for Biologically Inspired Engineering. N.G.G. was sponsored by the Army Research Office under Grant Number W911NF-17-2-0092. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Office or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein. We sincerely thank Amanda Graveline and the Wyss Institute at Harvard for their scientific support.","article_type":"original","oa_version":"Published Version","intvolume":"        34","_id":"10363","scopus_import":"1","quality_controlled":"1","ddc":["570"],"main_file_link":[{"url":"https://doi.org/10.1093/protein/gzab025","open_access":"1"}],"article_number":"gzab025","year":"2021","date_created":"2021-11-28T23:01:28Z","publication":"Protein Engineering, Design and Selection","doi":"10.1093/protein/gzab025","publication_identifier":{"eissn":["1741-0134"],"issn":["1741-0126"]},"abstract":[{"lang":"eng","text":"Erythropoietin enhances oxygen delivery and reduces hypoxia-induced cell death, but its pro-thrombotic activity is problematic for use of erythropoietin in treating hypoxia. We constructed a fusion protein that stimulates red blood cell production and neuroprotection without triggering platelet production, a marker for thrombosis. The protein consists of an anti-glycophorin A nanobody and an erythropoietin mutant (L108A). The mutation reduces activation of erythropoietin receptor homodimers that induce erythropoiesis and thrombosis, but maintains the tissue-protective signaling. The binding of the nanobody element to glycophorin A rescues homodimeric erythropoietin receptor activation on red blood cell precursors. In a cell proliferation assay, the fusion protein is active at 10−14 M, allowing an estimate of the number of receptor–ligand complexes needed for signaling. This fusion protein stimulates erythroid cell proliferation in vitro and in mice, and shows neuroprotective activity in vitro. Our erythropoietin fusion protein presents a novel molecule for treating hypoxia."}],"external_id":{"pmid":["34725710"],"isi":["000746596900001"]},"publication_status":"published","article_processing_charge":"No","title":"Rational engineering of an erythropoietin fusion protein to treat hypoxia","OA_place":"publisher","volume":34,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Lee","first_name":"Jungmin","full_name":"Lee, Jungmin"},{"full_name":"Vernet, Andyna","last_name":"Vernet","first_name":"Andyna"},{"last_name":"Gruber","first_name":"Nathalie","id":"2C9C8316-AA17-11E9-B5C2-8BC2E5697425","full_name":"Gruber, Nathalie"},{"full_name":"Kready, Kasia M.","last_name":"Kready","first_name":"Kasia M."},{"last_name":"Burrill","first_name":"Devin R.","full_name":"Burrill, Devin R."},{"last_name":"Way","first_name":"Jeffrey C.","full_name":"Way, Jeffrey C."},{"full_name":"Silver, Pamela A.","first_name":"Pamela A.","last_name":"Silver"}],"pmid":1},{"quality_controlled":"1","corr_author":"1","date_created":"2022-03-03T09:51:48Z","year":"2021","publication":"Science","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"doi":"10.1126/science.abg0886","issue":"6530","publication_status":"published","external_id":{"isi":["000617551600027"],"pmid":["33574201"]},"abstract":[{"text":"Thermoelectric materials are engines that convert heat into an electrical current. Intuitively, the efficiency of this process depends on how many electrons (charge carriers) can move and how easily they do so, how much energy those moving electrons transport, and how easily the temperature gradient is maintained. In terms of material properties, an excellent thermoelectric material requires a high electrical conductivity σ, a high Seebeck coefficient S (a measure of the induced thermoelectric voltage as a function of temperature gradient), and a low thermal conductivity κ. The challenge is that these three properties are strongly interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury et al. (2) have found a way to partially break these ties in silver antimony telluride (AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering in this inherently disordered thermoelectric material.","lang":"eng"}],"article_processing_charge":"No","page":"678-679","title":"Tidying up the mess","volume":371,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Liu","first_name":"Yu","full_name":"Liu, Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez"}],"pmid":1,"citation":{"ama":"Liu Y, Ibáñez M. Tidying up the mess. <i>Science</i>. 2021;371(6530):678-679. doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.","short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.","ieee":"Y. Liu and M. Ibáñez, “Tidying up the mess,” <i>Science</i>, vol. 371, no. 6530. American Association for the Advancement of Science, pp. 678–679, 2021.","mla":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>, vol. 371, no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79, doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>.","apa":"Liu, Y., &#38; Ibáñez, M. (2021). Tidying up the mess. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>","chicago":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>."},"OA_type":"closed access","day":"12","status":"public","isi":1,"date_updated":"2026-07-28T12:16:17Z","department":[{"_id":"MaIb"}],"publisher":"American Association for the Advancement of Science","date_published":"2021-02-12T00:00:00Z","month":"02","language":[{"iso":"eng"}],"type":"journal_article","oa_version":"None","intvolume":"       371","article_type":"letter_note","scopus_import":"1","_id":"10809"},{"date_updated":"2026-07-28T13:08:48Z","arxiv":1,"publisher":"Elsevier","department":[{"_id":"HeEd"}],"date_published":"2021-02-01T00:00:00Z","month":"02","language":[{"iso":"eng"}],"oa":1,"isi":1,"scopus_import":"1","_id":"8317","type":"journal_article","acknowledgement":"This research was performed in part at the 33rd Bellairs Winter Workshop on Computational Geometry. We thank all other participants for a fruitful atmosphere. H. Akitaya was supported by NSF CCF-1422311 & 1423615. Z. Masárová was partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","oa_version":"Preprint","intvolume":"        93","article_type":"original","project":[{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","call_identifier":"FWF"}],"citation":{"apa":"Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M. L., Fekete, S. P., … Schmidt, C. (2021). Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>","chicago":"Aichholzer, Oswin, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>.","mla":"Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>, vol. 93, 101700, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>.","ieee":"O. Aichholzer <i>et al.</i>, “Folding polyominoes with holes into a cube,” <i>Computational Geometry: Theory and Applications</i>, vol. 93. Elsevier, 2021.","short":"O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, Computational Geometry: Theory and Applications 93 (2021).","ama":"Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. 2021;93. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>","ista":"Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2021. Folding polyominoes with holes into a cube. Computational Geometry: Theory and Applications. 93, 101700."},"status":"public","day":"01","title":"Folding polyominoes with holes into a cube","publication_status":"published","external_id":{"isi":["000579185100004"],"arxiv":["1910.09917"]},"abstract":[{"text":"When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several holes to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special “basic” holes guarantee foldability.","lang":"eng"}],"article_processing_charge":"No","related_material":{"record":[{"id":"6989","relation":"shorter_version","status":"public"}]},"volume":93,"author":[{"first_name":"Oswin","last_name":"Aichholzer","full_name":"Aichholzer, Oswin"},{"full_name":"Akitaya, Hugo A.","last_name":"Akitaya","first_name":"Hugo A."},{"full_name":"Cheung, Kenneth C.","last_name":"Cheung","first_name":"Kenneth C."},{"full_name":"Demaine, Erik D.","first_name":"Erik D.","last_name":"Demaine"},{"last_name":"Demaine","first_name":"Martin L.","full_name":"Demaine, Martin L."},{"first_name":"Sándor P.","last_name":"Fekete","full_name":"Fekete, Sándor P."},{"last_name":"Kleist","first_name":"Linda","full_name":"Kleist, Linda"},{"first_name":"Irina","last_name":"Kostitsyna","full_name":"Kostitsyna, Irina"},{"full_name":"Löffler, Maarten","first_name":"Maarten","last_name":"Löffler"},{"last_name":"Masárová","first_name":"Zuzana","orcid":"0000-0002-6660-1322","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana"},{"first_name":"Klara","last_name":"Mundilova","full_name":"Mundilova, Klara"},{"full_name":"Schmidt, Christiane","last_name":"Schmidt","first_name":"Christiane"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","main_file_link":[{"url":"https://arxiv.org/abs/1910.09917v3","open_access":"1"}],"quality_controlled":"1","corr_author":"1","publication":"Computational Geometry: Theory and Applications","doi":"10.1016/j.comgeo.2020.101700","publication_identifier":{"eissn":["1879-081X"],"issn":["0925-7721"]},"article_number":"101700","date_created":"2020-08-30T22:01:09Z","year":"2021"},{"oa":1,"language":[{"iso":"eng"}],"month":"08","date_published":"2021-08-17T00:00:00Z","department":[{"_id":"GaTk"}],"publisher":"arXiv","arxiv":1,"date_updated":"2026-07-29T06:53:41Z","oa_version":"Preprint","type":"preprint","acknowledgement":"FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone Grant\r\nNo. P34015.","_id":"10912","citation":{"ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying the coexistence of neuronal oscillations and avalanches.” arXiv.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.).","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. 2108.06686.","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.” arXiv, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>.","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (n.d.). Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>","mla":"Lombardi, Fabrizio, et al. <i>Quantifying the Coexistence of Neuronal Oscillations and Avalanches</i>. 2108.06686, arXiv, doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>."},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","grant_number":"P34015"}],"ec_funded":1,"OA_type":"green","day":"17","status":"public","article_processing_charge":"No","abstract":[{"text":"Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of \"closeness to criticality\", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"external_id":{"arxiv":["2108.06686"]},"publication_status":"submitted","title":"Quantifying the coexistence of neuronal oscillations and avalanches","author":[{"last_name":"Lombardi","first_name":"Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425","orcid":"0000-0003-2623-5249","full_name":"Lombardi, Fabrizio"},{"first_name":"Selver","last_name":"Pepic","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","full_name":"Pepic, Selver"},{"full_name":"Shriki, Oren","last_name":"Shriki","first_name":"Oren"},{"full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","last_name":"Tkačik","first_name":"Gašper"},{"full_name":"De Martino, Daniele","last_name":"De Martino","first_name":"Daniele"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","related_material":{"record":[{"id":"12762","relation":"later_version","status":"public"}]},"main_file_link":[{"url":"https://arxiv.org/abs/2108.06686","open_access":"1"}],"ddc":["570"],"year":"2021","date_created":"2022-03-21T11:41:28Z","article_number":"2108.06686","doi":"10.48550/ARXIV.2108.06686"},{"_id":"10080","biorxivid":1,"acknowledgement":"We thank Federico Stella for invaluable suggestions and discussions. We thank Yosman BapatDhar and Andrea Cumpelik for comments, help and suggestions on the exposure of the text. We thank Predrag Živadinović and Juliana Couras for comments on the text and the figures. This work was supported by the EU-FP7 MC-ITN IN-SENS (grant 607616).","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","author":[{"id":"30BD0376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8849-6570","full_name":"Nardin, Michele","first_name":"Michele","last_name":"Nardin"},{"id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","full_name":"Käfer, Karola","first_name":"Karola","last_name":"Käfer"},{"full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","first_name":"Jozsef L"}],"department":[{"_id":"GradSch"},{"_id":"JoCs"}],"date_updated":"2026-07-29T06:33:53Z","language":[{"iso":"eng"}],"title":"The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus","month":"10","date_published":"2021-10-02T00:00:00Z","abstract":[{"lang":"eng","text":"Hippocampal and neocortical neural activity is modulated by the position of the individual in space. While hippocampal neurons provide the basis for a spatial map, prefrontal cortical neurons generalize over environmental features. Whether these generalized representations result from a bidirectional interaction with, or are mainly derived from hippocampal spatial representations is not known. By examining simultaneously recorded hippocampal and medial prefrontal neurons, we observed that prefrontal spatial representations show a delayed coherence with hippocampal ones. We also identified subpopulations of cells in the hippocampus and medial prefrontal cortex that formed functional cross-area couplings; these resembled the optimal connections predicted by a probabilistic model of spatial information transfer and generalization. Moreover, cross-area couplings were strongest and had the shortest delay preceding spatial decision-making. Our results suggest that generalized spatial coding in the medial prefrontal cortex is inherited from spatial representations in the hippocampus, and that the routing of information can change dynamically with behavioral demands."}],"oa":1,"publication_status":"submitted","external_id":{"biorxivid":["10.1101/2021.09.30.462269"]},"article_processing_charge":"No","day":"02","publication":"bioRxiv","status":"public","das_tickbox":"1","doi":"10.1101/2021.09.30.462269","ec_funded":1,"year":"2021","date_created":"2021-10-04T06:28:32Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2021.09.30.462269"}],"project":[{"_id":"257BBB4C-B435-11E9-9278-68D0E5697425","grant_number":"607616","call_identifier":"FP7","name":"inter-and intracellular signalling in schizophrenia"}],"citation":{"short":"M. Nardin, K. Käfer, J.L. Csicsvari, BioRxiv (n.d.).","ieee":"M. Nardin, K. Käfer, and J. L. Csicsvari, “The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus,” <i>bioRxiv</i>. .","ama":"Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>","ista":"Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. bioRxiv, <a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>.","apa":"Nardin, M., Käfer, K., &#38; Csicsvari, J. L. (n.d.). The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2021.09.30.462269\">https://doi.org/10.1101/2021.09.30.462269</a>","chicago":"Nardin, Michele, Karola Käfer, and Jozsef L Csicsvari. “The Generalized Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2021.09.30.462269\">https://doi.org/10.1101/2021.09.30.462269</a>.","mla":"Nardin, Michele, et al. “The Generalized Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>."}},{"year":"2021","date_created":"2021-08-15T22:01:26Z","article_number":"15729","issue":"1","doi":"10.1038/s41598-021-95025-3","publication_identifier":{"eissn":["2045-2322"]},"publication":"Scientific Reports","quality_controlled":"1","file":[{"success":1,"creator":"asandaue","file_name":"2021_ScientificReports_Rella.pdf","content_type":"application/pdf","date_created":"2021-08-16T11:36:49Z","date_updated":"2021-08-16T11:36:49Z","file_size":3432001,"access_level":"open_access","relation":"main_file","checksum":"ac86892ed17e6724c7251844da5cef5c","file_id":"9927"}],"has_accepted_license":"1","ddc":["570","610"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"last_name":"Rella","first_name":"Simon","id":"B4765ACA-AA38-11E9-AC9A-0930E6697425","full_name":"Rella, Simon"},{"full_name":"Kulikova, Yuliya A.","last_name":"Kulikova","first_name":"Yuliya A."},{"first_name":"Emmanouil T.","last_name":"Dermitzakis","full_name":"Dermitzakis, Emmanouil T."},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor","first_name":"Fyodor","last_name":"Kondrashov"}],"volume":11,"related_material":{"record":[{"status":"public","id":"20811","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/counterintuitive-dynamics-threaten-the-end-of-the-pandemic/","relation":"press_release","description":"News on IST Website"}]},"pmid":1,"license":"https://creativecommons.org/licenses/by/4.0/","article_processing_charge":"Yes","abstract":[{"text":"Vaccines are thought to be the best available solution for controlling the ongoing SARS-CoV-2 pandemic. However, the emergence of vaccine-resistant strains may come too rapidly for current vaccine developments to alleviate the health, economic and social consequences of the pandemic. To quantify and characterize the risk of such a scenario, we created a SIR-derived model with initial stochastic dynamics of the vaccine-resistant strain to study the probability of its emergence and establishment. Using parameters realistically resembling SARS-CoV-2 transmission, we model a wave-like pattern of the pandemic and consider the impact of the rate of vaccination and the strength of non-pharmaceutical intervention measures on the probability of emergence of a resistant strain. As expected, we found that a fast rate of vaccination decreases the probability of emergence of a resistant strain. Counterintuitively, when a relaxation of non-pharmaceutical interventions happened at a time when most individuals of the population have already been vaccinated the probability of emergence of a resistant strain was greatly increased. Consequently, we show that a period of transmission reduction close to the end of the vaccination campaign can substantially reduce the probability of resistant strain establishment. Our results suggest that policymakers and individuals should consider maintaining non-pharmaceutical interventions and transmission-reducing behaviours throughout the entire vaccination period.","lang":"eng"}],"publication_status":"published","external_id":{"pmid":["34330988"],"isi":["000683329100001"]},"title":"Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"30","status":"public","citation":{"short":"S. Rella, Y.A. Kulikova, E.T. Dermitzakis, F. Kondrashov, Scientific Reports 11 (2021).","ieee":"S. Rella, Y. A. Kulikova, E. T. Dermitzakis, and F. Kondrashov, “Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains,” <i>Scientific Reports</i>, vol. 11, no. 1. Springer Nature, 2021.","ama":"Rella S, Kulikova YA, Dermitzakis ET, Kondrashov F. Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains. <i>Scientific Reports</i>. 2021;11(1). doi:<a href=\"https://doi.org/10.1038/s41598-021-95025-3\">10.1038/s41598-021-95025-3</a>","ista":"Rella S, Kulikova YA, Dermitzakis ET, Kondrashov F. 2021. Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains. Scientific Reports. 11(1), 15729.","apa":"Rella, S., Kulikova, Y. A., Dermitzakis, E. T., &#38; Kondrashov, F. (2021). Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-021-95025-3\">https://doi.org/10.1038/s41598-021-95025-3</a>","chicago":"Rella, Simon, Yuliya A. Kulikova, Emmanouil T. Dermitzakis, and Fyodor Kondrashov. “Rates of SARS-CoV-2 Transmission and Vaccination Impact the Fate of Vaccine-Resistant Strains.” <i>Scientific Reports</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41598-021-95025-3\">https://doi.org/10.1038/s41598-021-95025-3</a>.","mla":"Rella, Simon, et al. “Rates of SARS-CoV-2 Transmission and Vaccination Impact the Fate of Vaccine-Resistant Strains.” <i>Scientific Reports</i>, vol. 11, no. 1, 15729, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41598-021-95025-3\">10.1038/s41598-021-95025-3</a>."},"project":[{"grant_number":"771209","_id":"26580278-B435-11E9-9278-68D0E5697425","name":"Characterizing the fitness landscape on population and global scales","call_identifier":"H2020"}],"article_type":"original","intvolume":"        11","oa_version":"Published Version","type":"journal_article","acknowledgement":"We thank Alexey Kondrashov, Nick Machnik, Raimundo Julian Saona Urmeneta, Gasper Tkacik and Nick Barton for fruitful discussions. We also thank participants of EvoLunch seminar at IST Austria and the internal seminar at the Banco de España for useful comments. The opinions expressed in this document are exclusively of the authors and, therefore, do not necessarily coincide with those of the Banco de España or the Eurosystem. ETD is supported by the Swiss National Science and Louis Jeantet Foundation. The work of FAK was in part supported by the ERC Consolidator Grant (771209-CharFL).","_id":"9905","scopus_import":"1","isi":1,"oa":1,"file_date_updated":"2021-08-16T11:36:49Z","language":[{"iso":"eng"}],"month":"07","date_published":"2021-07-30T00:00:00Z","department":[{"_id":"FyKo"}],"publisher":"Springer Nature","date_updated":"2026-07-29T12:57:49Z"},{"type":"dissertation","oa_version":"Published Version","_id":"9418","oa":1,"file_date_updated":"2021-05-24T11:56:02Z","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"date_updated":"2026-07-30T05:33:52Z","language":[{"iso":"eng"}],"month":"05","date_published":"2021-05-30T00:00:00Z","status":"public","day":"30","alternative_title":["ISTA Thesis"],"citation":{"mla":"Phuong, Mary. <i>Underspecification in Deep Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>.","apa":"Phuong, M. (2021). <i>Underspecification in deep learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>.","ama":"Phuong M. Underspecification in deep learning. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>","ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021."},"OA_place":"publisher","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Bui Thi Mai","first_name":"Phuong","full_name":"Bui Thi Mai, Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"deleted","id":"7435","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7481","status":"public"},{"status":"public","id":"9416","relation":"part_of_dissertation"},{"status":"public","id":"7479","relation":"part_of_dissertation"}]},"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"abstract":[{"lang":"eng","text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models."}],"publication_status":"published","page":"125","article_processing_charge":"No","degree_awarded":"PhD","title":"Underspecification in deep learning","doi_confirm":"1","supervisor":[{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"}],"year":"2021","date_created":"2021-05-24T13:06:23Z","doi":"10.15479/AT:ISTA:9418","publication_identifier":{"issn":["2663-337X"]},"file":[{"date_created":"2021-05-24T11:22:29Z","file_name":"mph-thesis-v519-pdfimages.pdf","content_type":"application/pdf","creator":"bphuong","success":1,"file_id":"9419","relation":"main_file","checksum":"4f0abe64114cfed264f9d36e8d1197e3","access_level":"open_access","file_size":2673905,"date_updated":"2021-05-24T11:22:29Z"},{"date_created":"2021-05-24T11:56:02Z","content_type":"application/zip","file_name":"thesis.zip","creator":"bphuong","file_id":"9420","checksum":"f5699e876bc770a9b0df8345a77720a2","relation":"source_file","access_level":"closed","file_size":92995100,"date_updated":"2021-05-24T11:56:02Z"}],"corr_author":"1","ddc":["000"],"has_accepted_license":"1"},{"date_created":"2021-05-24T11:16:46Z","year":"2021","publication":"9th International Conference on Learning Representations","quality_controlled":"1","file":[{"date_created":"2021-05-24T11:15:57Z","file_name":"iclr2021_conference.pdf","content_type":"application/pdf","creator":"bphuong","file_id":"9417","access_level":"open_access","checksum":"f34ff17017527db5ba6927f817bdd125","relation":"main_file","date_updated":"2021-05-24T11:15:57Z","file_size":502356}],"corr_author":"1","conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2021-05-03","end_date":"2021-05-07","location":"Virtual"},"ddc":["000"],"main_file_link":[{"url":"https://openreview.net/pdf?id=krz7T0xU9Z_","open_access":"1"}],"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bui Thi Mai, Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","first_name":"Phuong","last_name":"Bui Thi Mai"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"related_material":{"record":[{"status":"public","id":"9418","relation":"dissertation_contains"}]},"publication_status":"published","abstract":[{"lang":"eng","text":"We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time  onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks."}],"article_processing_charge":"No","title":"The inductive bias of ReLU networks on orthogonally separable data","status":"public","day":"01","citation":{"chicago":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In <i>9th International Conference on Learning Representations</i>, 2021.","apa":"Phuong, M., &#38; Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In <i>9th International Conference on Learning Representations</i>. Virtual.","mla":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” <i>9th International Conference on Learning Representations</i>, 2021.","short":"M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021.","ieee":"M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in <i>9th International Conference on Learning Representations</i>, Virtual, 2021.","ista":"Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: <i>9th International Conference on Learning Representations</i>. ; 2021."},"type":"conference","oa_version":"Published Version","scopus_import":"1","_id":"9416","file_date_updated":"2021-05-24T11:15:57Z","oa":1,"date_updated":"2026-07-30T05:33:51Z","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"date_published":"2021-05-01T00:00:00Z","language":[{"iso":"eng"}],"month":"05"},{"article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"text":"We consider a totally asymmetric simple exclusion process (TASEP) consisting of particles on a lattice that require binding by a \"token\" to move. Using a combination of theory and simulations, we address the following questions: (i) How token binding kinetics affects the current-density relation; (ii) How the current-density relation depends on the scarcity of tokens; (iii) How tokens propagate the effects of the locally-imposed disorder (such a slow site) over the entire lattice; (iv) How a shared pool of tokens couples concurrent TASEPs running on multiple lattices; (v) How our results translate to TASEPs with open boundaries that exchange particles with the reservoir. Since real particle motion (including in systems that inspired the standard TASEP model, e.g., protein synthesis or movement of molecular motors) is often catalyzed, regulated, actuated, or otherwise mediated, the token-driven TASEP dynamics analyzed in this paper should allow for a better understanding of real systems and enable a closer match between TASEP theory and experimental observations.","lang":"eng"}],"external_id":{"arxiv":["2112.13558"]},"publication_status":"submitted","title":"Token-driven totally asymmetric simple exclusion process","author":[{"first_name":"Bor","last_name":"Kavcic","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6041-254X","full_name":"Kavcic, Bor"},{"last_name":"Tkačik","first_name":"Gašper","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"19785","relation":"later_version","status":"public"}]},"corr_author":"1","has_accepted_license":"1","main_file_link":[{"url":"https://arxiv.org/abs/2112.13558","open_access":"1"}],"ddc":["530"],"year":"2021","date_created":"2021-12-28T06:52:09Z","article_number":"2112.13558","doi":"10.48550/arXiv.2112.13558","publication":"arXiv","oa":1,"month":"12","language":[{"iso":"eng"}],"date_published":"2021-12-27T00:00:00Z","arxiv":1,"department":[{"_id":"GaTk"}],"date_updated":"2026-08-04T08:34:23Z","oa_version":"Preprint","acknowledgement":"B.K. thanks Stefano Elefante, Simon Rella, and Michal Hledík for their help with the usage of the cluster. B.K. additionally thanks Călin Guet and his group for help and advice. We thank M. Hennessey-Wesen for constructive comments on the manuscript. We thank Ankita Gupta (Indian Institute of Technology) for spotting a typographical error in Eq. (49) in the preprint version of this paper.","type":"preprint","_id":"10579","citation":{"apa":"Kavcic, B., &#38; Tkačik, G. (n.d.). Token-driven totally asymmetric simple exclusion process. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2112.13558\">https://doi.org/10.48550/arXiv.2112.13558</a>","chicago":"Kavcic, Bor, and Gašper Tkačik. “Token-Driven Totally Asymmetric Simple Exclusion Process.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2112.13558\">https://doi.org/10.48550/arXiv.2112.13558</a>.","mla":"Kavcic, Bor, and Gašper Tkačik. “Token-Driven Totally Asymmetric Simple Exclusion Process.” <i>ArXiv</i>, 2112.13558, doi:<a href=\"https://doi.org/10.48550/arXiv.2112.13558\">10.48550/arXiv.2112.13558</a>.","ieee":"B. Kavcic and G. Tkačik, “Token-driven totally asymmetric simple exclusion process,” <i>arXiv</i>. .","short":"B. Kavcic, G. Tkačik, ArXiv (n.d.).","ista":"Kavcic B, Tkačik G. Token-driven totally asymmetric simple exclusion process. arXiv, 2112.13558.","ama":"Kavcic B, Tkačik G. Token-driven totally asymmetric simple exclusion process. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2112.13558\">10.48550/arXiv.2112.13558</a>"},"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"day":"27","status":"public"},{"volume":15,"author":[{"last_name":"Bilu","first_name":"Margaret","full_name":"Bilu, Margaret","id":"98C47862-10D5-11EA-BEDD-0F6F3DDC885E"},{"last_name":"Howe","first_name":"Sean","full_name":"Howe, Sean"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","external_id":{"arxiv":["1910.05207"]},"abstract":[{"text":"We formulate and prove an analog of Poonen’s finite-field Bertini theorem with Taylor conditions that holds in the Grothendieck ring of varieties. This gives a broad generalization of the work of Vakil and Wood, who treated the case of smooth hypersurface sections, and is made possible by the use of motivic Euler products to write down candidate motivic probabilities. As applications, we give motivic analogs of many results in arithmetic statistics that have been proven using Poonen’s sieve, including work of Bucur and Kedlaya on complete intersections and Erman and Wood on semiample Bertini theorems.","lang":"eng"}],"article_processing_charge":"No","page":"2195-2259","keyword":["Algebra and Number Theory"],"title":"Motivic Euler products in motivic statistics","researchdata_availability":"no","date_created":"2024-04-03T08:12:59Z","year":"2021","das_tickbox":"0","publication":"Algebra & Number Theory","doi":"10.2140/ant.2021.15.2195","publication_identifier":{"issn":["1937-0652"],"eissn":["1944-7833"]},"issue":"9","quality_controlled":"1","supplementarymaterial":"no","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1910.05207"}],"type":"journal_article","intvolume":"        15","oa_version":"Preprint","article_type":"original","scopus_import":"1","_id":"15279","oa":1,"date_updated":"2026-08-06T11:10:09Z","publisher":"Mathematical Sciences Publishers","department":[{"_id":"TiBr"}],"arxiv":1,"date_published":"2021-12-23T00:00:00Z","month":"12","language":[{"iso":"eng"}],"day":"23","status":"public","citation":{"ama":"Bilu M, Howe S. Motivic Euler products in motivic statistics. <i>Algebra &#38; Number Theory</i>. 2021;15(9):2195-2259. doi:<a href=\"https://doi.org/10.2140/ant.2021.15.2195\">10.2140/ant.2021.15.2195</a>","ista":"Bilu M, Howe S. 2021. Motivic Euler products in motivic statistics. Algebra &#38; Number Theory. 15(9), 2195–2259.","short":"M. Bilu, S. Howe, Algebra &#38; Number Theory 15 (2021) 2195–2259.","ieee":"M. Bilu and S. Howe, “Motivic Euler products in motivic statistics,” <i>Algebra &#38; Number Theory</i>, vol. 15, no. 9. Mathematical Sciences Publishers, pp. 2195–2259, 2021.","mla":"Bilu, Margaret, and Sean Howe. “Motivic Euler Products in Motivic Statistics.” <i>Algebra &#38; Number Theory</i>, vol. 15, no. 9, Mathematical Sciences Publishers, 2021, pp. 2195–259, doi:<a href=\"https://doi.org/10.2140/ant.2021.15.2195\">10.2140/ant.2021.15.2195</a>.","apa":"Bilu, M., &#38; Howe, S. (2021). Motivic Euler products in motivic statistics. <i>Algebra &#38; Number Theory</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/ant.2021.15.2195\">https://doi.org/10.2140/ant.2021.15.2195</a>","chicago":"Bilu, Margaret, and Sean Howe. “Motivic Euler Products in Motivic Statistics.” <i>Algebra &#38; Number Theory</i>. Mathematical Sciences Publishers, 2021. <a href=\"https://doi.org/10.2140/ant.2021.15.2195\">https://doi.org/10.2140/ant.2021.15.2195</a>."}},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.06966"}],"supplementarymaterial":"no","corr_author":"1","doi":"10.48550/arXiv.2104.06966","das_tickbox":"0","publication":"arXiv","date_created":"2022-09-09T10:42:51Z","year":"2021","article_number":"2104.06966","researchdata_availability":"no","title":"Sums of four squareful numbers","article_processing_charge":"No","publication_status":"draft","external_id":{"arxiv":["2104.06966"]},"abstract":[{"text":"We find an asymptotic formula for the number of primitive vectors $(z_1,\\ldots,z_4)\\in (\\mathbb{Z}_{\\neq 0})^4$ such that $z_1,\\ldots, z_4$ are all squareful and bounded by $B$, and $z_1+\\cdots + z_4 = 0$. Our result agrees in the power of $B$ and $\\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"12072","relation":"dissertation_contains"}]},"author":[{"first_name":"Alec L","last_name":"Shute","full_name":"Shute, Alec L","id":"440EB050-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1812-2810"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"A.L. Shute, ArXiv (n.d.).","ieee":"A. L. Shute, “Sums of four squareful numbers,” <i>arXiv</i>. .","ista":"Shute AL. Sums of four squareful numbers. arXiv, 2104.06966.","ama":"Shute AL. Sums of four squareful numbers. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.06966\">10.48550/arXiv.2104.06966</a>","apa":"Shute, A. L. (n.d.). Sums of four squareful numbers. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.06966\">https://doi.org/10.48550/arXiv.2104.06966</a>","chicago":"Shute, Alec L. “Sums of Four Squareful Numbers.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.06966\">https://doi.org/10.48550/arXiv.2104.06966</a>.","mla":"Shute, Alec L. “Sums of Four Squareful Numbers.” <i>ArXiv</i>, 2104.06966, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.06966\">10.48550/arXiv.2104.06966</a>."},"day":"15","status":"public","date_published":"2021-04-15T00:00:00Z","language":[{"iso":"eng"}],"month":"04","date_updated":"2026-08-06T11:08:48Z","department":[{"_id":"TiBr"}],"arxiv":1,"oa":1,"_id":"12076","oa_version":"Preprint","type":"preprint"},{"has_accepted_license":"1","ddc":["510"],"supplementarymaterial":"no","file":[{"date_created":"2021-03-22T12:41:26Z","file_name":"2021_MathZeitschrift_Browning.pdf","content_type":"application/pdf","creator":"dernst","success":1,"file_id":"9279","checksum":"8ed9f49568806894744096dbbca0ad7b","relation":"main_file","access_level":"open_access","file_size":492685,"date_updated":"2021-03-22T12:41:26Z"}],"quality_controlled":"1","doi":"10.1007/s00209-021-02695-w","publication_identifier":{"eissn":["1432-1823"],"issn":["0025-5874"]},"publication":"Mathematische Zeitschrift","das_tickbox":"0","year":"2021","date_created":"2021-03-21T23:01:21Z","researchdata_availability":"no","title":"Arithmetic of higher-dimensional orbifolds and a mixed Waring problem","page":"1071–1101","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study the density of rational points on a higher-dimensional orbifold (Pn−1,Δ) when Δ is a Q-divisor involving hyperplanes. This allows us to address a question of Tanimoto about whether the set of rational points on such an orbifold constitutes a thin set. Our approach relies on the Hardy–Littlewood circle method to first study an asymptotic version of Waring’s problem for mixed powers. In doing so we make crucial use of the recent resolution of the main conjecture in Vinogradov’s mean value theorem, due to Bourgain–Demeter–Guth and Wooley."}],"publication_status":"published","external_id":{"isi":["000625573800002"]},"author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","first_name":"Timothy D","last_name":"Browning"},{"full_name":"Yamagishi, Shuntaro","first_name":"Shuntaro","last_name":"Yamagishi"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":299,"citation":{"chicago":"Browning, Timothy D, and Shuntaro Yamagishi. “Arithmetic of Higher-Dimensional Orbifolds and a Mixed Waring Problem.” <i>Mathematische Zeitschrift</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00209-021-02695-w\">https://doi.org/10.1007/s00209-021-02695-w</a>.","apa":"Browning, T. D., &#38; Yamagishi, S. (2021). Arithmetic of higher-dimensional orbifolds and a mixed Waring problem. <i>Mathematische Zeitschrift</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00209-021-02695-w\">https://doi.org/10.1007/s00209-021-02695-w</a>","mla":"Browning, Timothy D., and Shuntaro Yamagishi. “Arithmetic of Higher-Dimensional Orbifolds and a Mixed Waring Problem.” <i>Mathematische Zeitschrift</i>, vol. 299, Springer Nature, 2021, pp. 1071–1101, doi:<a href=\"https://doi.org/10.1007/s00209-021-02695-w\">10.1007/s00209-021-02695-w</a>.","ieee":"T. D. Browning and S. Yamagishi, “Arithmetic of higher-dimensional orbifolds and a mixed Waring problem,” <i>Mathematische Zeitschrift</i>, vol. 299. Springer Nature, pp. 1071–1101, 2021.","short":"T.D. Browning, S. Yamagishi, Mathematische Zeitschrift 299 (2021) 1071–1101.","ista":"Browning TD, Yamagishi S. 2021. Arithmetic of higher-dimensional orbifolds and a mixed Waring problem. Mathematische Zeitschrift. 299, 1071–1101.","ama":"Browning TD, Yamagishi S. Arithmetic of higher-dimensional orbifolds and a mixed Waring problem. <i>Mathematische Zeitschrift</i>. 2021;299:1071–1101. doi:<a href=\"https://doi.org/10.1007/s00209-021-02695-w\">10.1007/s00209-021-02695-w</a>"},"project":[{"name":"Between rational and integral points","grant_number":"EP-P026710-2","_id":"26A8D266-B435-11E9-9278-68D0E5697425"}],"status":"public","day":"05","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"month":"03","date_published":"2021-03-05T00:00:00Z","department":[{"_id":"TiBr"}],"publisher":"Springer Nature","date_updated":"2026-08-06T11:14:26Z","isi":1,"oa":1,"file_date_updated":"2021-03-22T12:41:26Z","_id":"9260","scopus_import":"1","article_type":"original","oa_version":"Published Version","intvolume":"       299","type":"journal_article","acknowledgement":"While working on this paper the authors were both supported by EPSRC grant EP/P026710/1, and the second author received additional support from the NWO Veni Grant 016.Veni.192.047. Thanks are due to Marta Pieropan, Arne Smeets and Sho Tanimoto for useful conversations related to this topic, and to the anonymous referee for numerous helpful suggestions."},{"volume":157,"author":[{"first_name":"Pascal","last_name":"Autissier","full_name":"Autissier, Pascal"},{"first_name":"Dante","last_name":"Bonolis","full_name":"Bonolis, Dante","id":"6A459894-5FDD-11E9-AF35-BB24E6697425"},{"full_name":"Lamzouri, Youness","first_name":"Youness","last_name":"Lamzouri"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","external_id":{"arxiv":["1909.03266"],"isi":["000667289300001"]},"abstract":[{"lang":"eng","text":"In this paper, we investigate the distribution of the maximum of partial sums of families of  m -periodic complex-valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near-optimal range. Our results apply to partial sums of Kloosterman sums and other families of  ℓ -adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are able to construct families of  m -periodic complex-valued functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality is sharp."}],"article_processing_charge":"No","page":"1610-1651","keyword":["Algebra and Number Theory"],"title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","researchdata_availability":"no","date_created":"2022-02-01T08:10:43Z","year":"2021","das_tickbox":"0","publication":"Compositio Mathematica","publication_identifier":{"eissn":["1570-5846"],"issn":["0010-437X"]},"doi":"10.1112/s0010437x21007351","issue":"7","quality_controlled":"1","supplementarymaterial":"no","corr_author":"1","main_file_link":[{"url":"https://arxiv.org/abs/1909.03266","open_access":"1"}],"acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions.","type":"journal_article","oa_version":"Preprint","intvolume":"       157","article_type":"original","scopus_import":"1","_id":"10711","oa":1,"isi":1,"date_updated":"2026-08-06T11:13:19Z","arxiv":1,"department":[{"_id":"TiBr"}],"publisher":"Cambridge University Press","date_published":"2021-06-28T00:00:00Z","month":"06","language":[{"iso":"eng"}],"day":"28","status":"public","citation":{"apa":"Autissier, P., Bonolis, D., &#38; Lamzouri, Y. (2021). The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>","chicago":"Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>.","mla":"Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>, vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>.","ieee":"P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum of partial sums of Kloosterman sums and other trace functions,” <i>Compositio Mathematica</i>, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.","short":"P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021) 1610–1651.","ista":"Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica. 157(7), 1610–1651.","ama":"Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. 2021;157(7):1610-1651. doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>"}},{"publication_identifier":{"eissn":["1611-3349"],"isbn":["9-783-6626-4330-3"],"eisbn":["978-3-662-64331-0"],"issn":["0302-9743"]},"doi":"10.1007/978-3-662-64331-0_1","publication":"25th International Conference on Financial Cryptography and Data Security","date_created":"2021-11-21T23:01:29Z","year":"2021","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1128"}],"conference":{"start_date":"2021-03-01","name":"FC: Financial Cryptography","location":"Virtual","end_date":"2021-03-05"},"quality_controlled":"1","related_material":{"record":[{"status":"public","id":"8304","relation":"earlier_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Zamyatin, Alexei","first_name":"Alexei","last_name":"Zamyatin"},{"full_name":"Al-Bassam, Mustafa","last_name":"Al-Bassam","first_name":"Mustafa"},{"first_name":"Dionysis","last_name":"Zindros","full_name":"Zindros, Dionysis"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","orcid":"0000-0002-8827-3382","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios"},{"full_name":"Moreno-Sanchez, Pedro","first_name":"Pedro","last_name":"Moreno-Sanchez"},{"last_name":"Kiayias","first_name":"Aggelos","full_name":"Kiayias, Aggelos"},{"full_name":"Knottenbelt, William J.","last_name":"Knottenbelt","first_name":"William J."}],"volume":"12675 ","title":"SoK: Communication across distributed ledgers","cryptoeprintid":1,"article_processing_charge":"No","page":"3-36","publication_status":"published","external_id":{"isi":["000712016200001"],"cryptoeprintid":["2019/1128"]},"abstract":[{"lang":"eng","text":"Since the inception of Bitcoin, a plethora of distributed ledgers differing in design and purpose has been created. While by design, blockchains provide no means to securely communicate with external systems, numerous attempts towards trustless cross-chain communication have been proposed over the years. Today, cross-chain communication (CCC) plays a fundamental role in cryptocurrency exchanges, scalability efforts via sharding, extension of existing systems through sidechains, and bootstrapping of new blockchains. Unfortunately, existing proposals are designed ad-hoc for specific use-cases, making it hard to gain confidence in their correctness and composability. We provide the first systematic exposition of cross-chain communication protocols. We formalize the underlying research problem and show that CCC is impossible without a trusted third party, contrary to common beliefs in the blockchain community. With this result in mind, we develop a framework to design new and evaluate existing CCC protocols, focusing on the inherent trust assumptions thereof, and derive a classification covering the field of cross-chain communication to date. We conclude by discussing open challenges for CCC research and the implications of interoperability on the security and privacy of blockchains."}],"alternative_title":["LNCS"],"day":"23","status":"public","citation":{"short":"A. Zamyatin, M. Al-Bassam, D. Zindros, E. Kokoris Kogias, P. Moreno-Sanchez, A. Kiayias, W.J. Knottenbelt, in:, 25th International Conference on Financial Cryptography and Data Security, Springer Nature, 2021, pp. 3–36.","ieee":"A. Zamyatin <i>et al.</i>, “SoK: Communication across distributed ledgers,” in <i>25th International Conference on Financial Cryptography and Data Security</i>, Virtual, 2021, vol. 12675, pp. 3–36.","ista":"Zamyatin A, Al-Bassam M, Zindros D, Kokoris Kogias E, Moreno-Sanchez P, Kiayias A, Knottenbelt WJ. 2021. SoK: Communication across distributed ledgers. 25th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography, LNCS, vol. 12675, 3–36.","ama":"Zamyatin A, Al-Bassam M, Zindros D, et al. SoK: Communication across distributed ledgers. In: <i>25th International Conference on Financial Cryptography and Data Security</i>. Vol 12675. Springer Nature; 2021:3-36. doi:<a href=\"https://doi.org/10.1007/978-3-662-64331-0_1\">10.1007/978-3-662-64331-0_1</a>","apa":"Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez, P., Kiayias, A., &#38; Knottenbelt, W. J. (2021). SoK: Communication across distributed ledgers. In <i>25th International Conference on Financial Cryptography and Data Security</i> (Vol. 12675, pp. 3–36). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-64331-0_1\">https://doi.org/10.1007/978-3-662-64331-0_1</a>","chicago":"Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK: Communication across Distributed Ledgers.” In <i>25th International Conference on Financial Cryptography and Data Security</i>, 12675:3–36. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-662-64331-0_1\">https://doi.org/10.1007/978-3-662-64331-0_1</a>.","mla":"Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.” <i>25th International Conference on Financial Cryptography and Data Security</i>, vol. 12675, Springer Nature, 2021, pp. 3–36, doi:<a href=\"https://doi.org/10.1007/978-3-662-64331-0_1\">10.1007/978-3-662-64331-0_1</a>."},"scopus_import":"1","_id":"10325","oa_version":"Preprint","acknowledgement":"We would like express our gratitude to Georgia Avarikioti, Daniel Perez and Dominik Harz for helpful comments and feedback on earlier versions of this manuscript. We also thank Nicholas Stifter, Aljosha Judmayer, Philipp Schindler, Edgar Weippl, and Alistair Stewart for insightful discussions during the early stages of this research. We also wish to thank the anonymous reviewers for their valuable comments that helped improve the presentation of our results. This research was funded by Bridge 1 858561 SESC; Bridge 1 864738 PR4DLT (all FFG); the Christian Doppler Laboratory for Security and Quality Improvement in the Production System Lifecycle (CDL-SQI); the competence center SBA-K1 funded by COMET; Chaincode Labs through the project SLN: Scalability for the Lightning Network; and by the Austrian Science Fund (FWF) through the Meitner program (project M-2608). Mustafa Al-Bassam is funded by a scholarship from the Alan Turing Institute. Alexei Zamyatin conducted the early stages of this work during his time at SBA Research, and was supported by a Binance Research Fellowship.","type":"conference","date_published":"2021-10-23T00:00:00Z","month":"10","language":[{"iso":"eng"}],"date_updated":"2026-08-11T08:05:29Z","department":[{"_id":"ElKo"}],"publisher":"Springer Nature","isi":1,"oa":1},{"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"citation":{"short":"S.A. Hashemi, M. Mondelli, J. Cioffi, A. Goldsmith, in:, Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers, IEEE, 2021, pp. 943–947.","ieee":"S. A. Hashemi, M. Mondelli, J. Cioffi, and A. Goldsmith, “Successive syndrome-check decoding of polar codes,” in <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>, Virtual, Pacific Grove, CA, United States, 2021, vol. 2021–October, pp. 943–947.","ama":"Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. Successive syndrome-check decoding of polar codes. In: <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>. Vol 2021-October. IEEE; 2021:943-947. doi:<a href=\"https://doi.org/10.1109/IEEECONF53345.2021.9723394\">10.1109/IEEECONF53345.2021.9723394</a>","ista":"Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. 2021. Successive syndrome-check decoding of polar codes. Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers. ACSSC: Asilomar Conference on Signals, Systems, and Computers vol. 2021–October, 943–947.","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, John Cioffi, and Andrea Goldsmith. “Successive Syndrome-Check Decoding of Polar Codes.” In <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>, 2021–October:943–47. IEEE, 2021. <a href=\"https://doi.org/10.1109/IEEECONF53345.2021.9723394\">https://doi.org/10.1109/IEEECONF53345.2021.9723394</a>.","apa":"Hashemi, S. A., Mondelli, M., Cioffi, J., &#38; Goldsmith, A. (2021). Successive syndrome-check decoding of polar codes. In <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i> (Vol. 2021–October, pp. 943–947). Virtual, Pacific Grove, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/IEEECONF53345.2021.9723394\">https://doi.org/10.1109/IEEECONF53345.2021.9723394</a>","mla":"Hashemi, Seyyed Ali, et al. “Successive Syndrome-Check Decoding of Polar Codes.” <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>, vol. 2021–October, IEEE, 2021, pp. 943–47, doi:<a href=\"https://doi.org/10.1109/IEEECONF53345.2021.9723394\">10.1109/IEEECONF53345.2021.9723394</a>."},"status":"public","day":"01","date_updated":"2026-08-12T06:36:04Z","arxiv":1,"department":[{"_id":"MaMo"}],"publisher":"IEEE","date_published":"2021-11-01T00:00:00Z","month":"11","language":[{"iso":"eng"}],"oa":1,"scopus_import":"1","_id":"10599","type":"conference","acknowledgement":"This work is supported in part by ONR grant N00014-18-1-2191. S. A. Hashemi was supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize.","oa_version":"Preprint","conference":{"start_date":"2021-10-31","name":"ACSSC: Asilomar Conference on Signals, Systems, and Computers","end_date":"2021-11-03","location":"Virtual, Pacific Grove, CA, United States"},"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2112.00057"}],"quality_controlled":"1","publication":"Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers","doi":"10.1109/IEEECONF53345.2021.9723394","publication_identifier":{"issn":["1058-6393"],"isbn":["9781665458283"]},"date_created":"2022-01-03T11:39:51Z","year":"2021","title":"Successive syndrome-check decoding of polar codes","external_id":{"arxiv":["2112.00057"]},"publication_status":"published","abstract":[{"lang":"eng","text":"A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome. A new formulation of the successive-cancellation (SC) decoding algorithm is presented that allows for successively refining the received codeword by comparing the log-likelihood ratio value of a frozen bit with its predefined value. The syndrome of the refined received codeword is then checked for possible errors. In case there are no errors, the decoding process is terminated. Otherwise, the decoder continues to refine the received codeword. The proposed method is extended to the case of SC list (SCL) decoding by terminating the decoding process when the syndrome of the best candidate in the list indicates no errors. Simulation results show that the proposed method reduces the time-complexity of SC and SCL decoders and their fast variants, especially at high signal-to-noise ratios."}],"article_processing_charge":"No","page":"943-947","volume":"2021-October","author":[{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli"},{"first_name":"John","last_name":"Cioffi","full_name":"Cioffi, John"},{"full_name":"Goldsmith, Andrea","first_name":"Andrea","last_name":"Goldsmith"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"01","status":"public","OA_type":"green","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"citation":{"mla":"Fathollahi, Dorsa, et al. “Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.” <i>2021 IEEE International Symposium on Information Theory</i>, IEEE, 2021, pp. 1082–87, doi:<a href=\"https://doi.org/10.1109/isit45174.2021.9517887\">10.1109/isit45174.2021.9517887</a>.","apa":"Fathollahi, D., Farsad, N., Hashemi, S. A., &#38; Mondelli, M. (2021). Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. In <i>2021 IEEE International Symposium on Information Theory</i> (pp. 1082–1087). Virtual, Melbourne, Australia: IEEE. <a href=\"https://doi.org/10.1109/isit45174.2021.9517887\">https://doi.org/10.1109/isit45174.2021.9517887</a>","chicago":"Fathollahi, Dorsa, Nariman Farsad, Seyyed Ali Hashemi, and Marco Mondelli. “Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.” In <i>2021 IEEE International Symposium on Information Theory</i>, 1082–87. IEEE, 2021. <a href=\"https://doi.org/10.1109/isit45174.2021.9517887\">https://doi.org/10.1109/isit45174.2021.9517887</a>.","ista":"Fathollahi D, Farsad N, Hashemi SA, Mondelli M. 2021. Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. 2021 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 1082–1087.","ama":"Fathollahi D, Farsad N, Hashemi SA, Mondelli M. Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. In: <i>2021 IEEE International Symposium on Information Theory</i>. IEEE; 2021:1082-1087. doi:<a href=\"https://doi.org/10.1109/isit45174.2021.9517887\">10.1109/isit45174.2021.9517887</a>","short":"D. Fathollahi, N. Farsad, S.A. Hashemi, M. Mondelli, in:, 2021 IEEE International Symposium on Information Theory, IEEE, 2021, pp. 1082–1087.","ieee":"D. Fathollahi, N. Farsad, S. A. Hashemi, and M. Mondelli, “Sparse multi-decoder recursive projection aggregation for Reed-Muller codes,” in <i>2021 IEEE International Symposium on Information Theory</i>, Virtual, Melbourne, Australia, 2021, pp. 1082–1087."},"scopus_import":"1","_id":"10597","type":"conference","oa_version":"Preprint","date_updated":"2026-08-12T06:36:19Z","publisher":"IEEE","arxiv":1,"department":[{"_id":"MaMo"}],"date_published":"2021-09-01T00:00:00Z","month":"09","language":[{"iso":"eng"}],"oa":1,"isi":1,"publication":"2021 IEEE International Symposium on Information Theory","doi":"10.1109/isit45174.2021.9517887","publication_identifier":{"eisbn":["978-1-5386-8209-8"],"isbn":["978-1-5386-8210-4"]},"date_created":"2022-01-03T11:31:26Z","year":"2021","conference":{"start_date":"2021-07-12","name":"ISIT: International Symposium on Information Theory","location":"Virtual, Melbourne, Australia","end_date":"2021-07-20"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2011.12882"}],"quality_controlled":"1","OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Fathollahi, Dorsa","id":"712472af-8a7e-11f1-848f-9768b0c2fdf8","first_name":"Dorsa","last_name":"Fathollahi"},{"first_name":"Nariman","last_name":"Farsad","full_name":"Farsad, Nariman"},{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco"}],"title":"Sparse multi-decoder recursive projection aggregation for Reed-Muller codes","publication_status":"published","external_id":{"isi":["000701502201029"],"arxiv":["2011.12882"]},"abstract":[{"lang":"eng","text":"We thank Emmanuel Abbe and Min Ye for providing us the implementation of RPA decoding. D. Fathollahi and M. Mondelli are partially supported by the 2019 Lopez-Loreta Prize. N. Farsad is supported by Discovery Grant from the Natural Sciences and Engineering Research Council of Canada (NSERC) and Canada Foundation for Innovation (CFI), John R. Evans Leader Fund. S. A. Hashemi is supported by a Postdoctoral Fellowship from NSERC."}],"article_processing_charge":"No","page":"1082-1087"},{"oa":1,"isi":1,"date_updated":"2026-08-12T06:39:42Z","arxiv":1,"department":[{"_id":"KrCh"}],"publisher":"IEEE","date_published":"2021-07-07T00:00:00Z","language":[{"iso":"eng"}],"month":"07","type":"conference","acknowledgement":"The authors are grateful to the anonymous referees for their valuable comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For M. H. the research leading to these results has received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007–2013) / ERC Grant Agreement no. 340506.","oa_version":"Preprint","scopus_import":"1","_id":"10002","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, IEEE, 2021, pp. 1–13, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">10.1109/LICS52264.2021.9470739</a>.","apa":"Chatterjee, K., Dvorak, W., Henzinger, M., &#38; Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13). Rome, Italy: IEEE. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">https://doi.org/10.1109/LICS52264.2021.9470739</a>","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 1–13. IEEE, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">https://doi.org/10.1109/LICS52264.2021.9470739</a>.","ama":"Chatterjee K, Dvorak W, Henzinger M, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2021:1-13. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">10.1109/LICS52264.2021.9470739</a>","ista":"Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.","short":"K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2021, pp. 1–13.","ieee":"K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Rome, Italy, 2021, pp. 1–13."},"ec_funded":1,"status":"public","day":"07","external_id":{"arxiv":["2104.07466"],"isi":["000947350400089"]},"publication_status":"published","abstract":[{"lang":"eng","text":"We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with  n  vertices and  m  edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires  O(n2)  symbolic operations and  O(1)  symbolic space. The only other symbolic algorithm for the MEC decomposition requires  O(nm−−√)  symbolic operations and  O(m−−√)  symbolic space. A main open question is whether the worst-case  O(n2)  bound for symbolic operations can be beaten. We present a symbolic algorithm that requires  O˜(n1.5)  symbolic operations and  O˜(n−−√)  symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all  0<ϵ≤1/2  the symbolic algorithm requires  O˜(n2−ϵ)  symbolic operations and  O˜(nϵ)  symbolic space ( O˜  hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of  ω -regular objectives for MDPs. We consider the canonical parity objectives for  ω -regular objectives, and for parity objectives with  d -priorities we present an algorithm that computes the almost-sure winning region with  O˜(n2−ϵ)  symbolic operations and  O˜(nϵ)  symbolic space, for all  0<ϵ≤1/2 ."}],"article_processing_charge":"No","page":"1-13","keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"title":"Symbolic time and space tradeoffs for probabilistic verification","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Dvorak, Wolfgang","first_name":"Wolfgang","last_name":"Dvorak"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","conference":{"location":"Rome, Italy","end_date":"2021-07-02","name":"LICS: Logic in Computer Science","start_date":"2021-06-29"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07466"}],"date_created":"2021-09-12T22:01:24Z","year":"2021","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","doi":"10.1109/LICS52264.2021.9470739","publication_identifier":{"issn":["1043-6871"],"eisbn":["978-1-6654-4895-6"],"isbn":["978-1-6654-4896-3"]}},{"project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"citation":{"ista":"Henzinger TA, Sarac NE. 2021. Quantitative and approximate monitoring. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 9470547.","ama":"Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>","ieee":"T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Online, 2021.","short":"T.A. Henzinger, N.E. Sarac, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2021.","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 9470547, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>.","apa":"Henzinger, T. A., &#38; Sarac, N. E. (2021). Quantitative and approximate monitoring. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Online: IEEE. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>."},"day":"29","status":"public","publisher":"IEEE","arxiv":1,"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2026-08-12T06:39:11Z","language":[{"iso":"eng"}],"month":"06","date_published":"2021-06-29T00:00:00Z","oa":1,"file_date_updated":"2021-06-16T08:23:54Z","isi":1,"_id":"9356","scopus_import":"1","type":"conference","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","oa_version":"Published Version","ddc":["000"],"conference":{"name":"LICS: Logic in Computer Science","start_date":"2021-06-29","location":"Online","end_date":"2021-07-02"},"has_accepted_license":"1","file":[{"file_size":641990,"date_updated":"2021-06-16T08:23:54Z","access_level":"open_access","relation":"main_file","checksum":"6e4cba3f72775f479c5b1b75d1a4a0c4","file_id":"9557","success":1,"creator":"esarac","file_name":"qam.pdf","content_type":"application/pdf","date_created":"2021-06-16T08:23:54Z"}],"quality_controlled":"1","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","doi":"10.1109/LICS52264.2021.9470547","article_number":"9470547","year":"2021","date_created":"2021-04-30T17:30:47Z","title":"Quantitative and approximate monitoring","abstract":[{"text":"In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.","lang":"eng"}],"external_id":{"arxiv":["2105.08353"],"isi":["000947350400021"]},"publication_status":"published","article_processing_charge":"No","related_material":{"record":[{"status":"public","id":"20147","relation":"dissertation_contains"}]},"author":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","first_name":"Naci E","last_name":"Sarac"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"title":"Stochastic processes with expected stopping time","article_processing_charge":"No","page":"1-13","publication_status":"published","external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"abstract":[{"lang":"eng","text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs."}],"related_material":{"record":[{"id":"18630","relation":"later_version","status":"public"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/2104.07278","open_access":"1"}],"conference":{"start_date":"2021-06-29","name":"LICS: Logic in Computer Science","location":"Rome, Italy","end_date":"2021-07-02"},"quality_controlled":"1","publication_identifier":{"isbn":["978-1-6654-4896-3"],"issn":["1043-6871"],"eisbn":["978-1-6654-4895-6"]},"doi":"10.1109/LICS52264.2021.9470595","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","date_created":"2021-09-12T22:01:25Z","year":"2021","date_published":"2021-07-07T00:00:00Z","month":"07","language":[{"iso":"eng"}],"date_updated":"2026-08-12T06:39:27Z","department":[{"_id":"KrCh"}],"publisher":"IEEE","arxiv":1,"isi":1,"oa":1,"scopus_import":"1","_id":"10004","oa_version":"Preprint","type":"conference","acknowledgement":"We are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. This research was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, IEEE, 2021, pp. 1–13, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">10.1109/LICS52264.2021.9470595</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2021). Stochastic processes with expected stopping time. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13). Rome, Italy: IEEE. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">https://doi.org/10.1109/LICS52264.2021.9470595</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 1–13. IEEE, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">https://doi.org/10.1109/LICS52264.2021.9470595</a>.","ista":"Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.","ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2021:1-13. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">10.1109/LICS52264.2021.9470595</a>","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Rome, Italy, 2021, pp. 1–13.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2021, pp. 1–13."},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"status":"public","day":"07","ec_funded":1},{"day":"09","status":"public","citation":{"chicago":"Gabrielaitis, Mantas. “Fast and Accurate Amplitude Demodulation of Wideband Signals.” <i>IEEE Transactions on Signal Processing</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/TSP.2021.3087899\">https://doi.org/10.1109/TSP.2021.3087899</a>.","apa":"Gabrielaitis, M. (2021). Fast and accurate amplitude demodulation of wideband signals. <i>IEEE Transactions on Signal Processing</i>. IEEE. <a href=\"https://doi.org/10.1109/TSP.2021.3087899\">https://doi.org/10.1109/TSP.2021.3087899</a>","mla":"Gabrielaitis, Mantas. “Fast and Accurate Amplitude Demodulation of Wideband Signals.” <i>IEEE Transactions on Signal Processing</i>, vol. 69, IEEE, 2021, pp. 4039–54, doi:<a href=\"https://doi.org/10.1109/TSP.2021.3087899\">10.1109/TSP.2021.3087899</a>.","short":"M. Gabrielaitis, IEEE Transactions on Signal Processing 69 (2021) 4039–4054.","ieee":"M. Gabrielaitis, “Fast and accurate amplitude demodulation of wideband signals,” <i>IEEE Transactions on Signal Processing</i>, vol. 69. IEEE, pp. 4039–4054, 2021.","ista":"Gabrielaitis M. 2021. Fast and accurate amplitude demodulation of wideband signals. IEEE Transactions on Signal Processing. 69, 4039–4054.","ama":"Gabrielaitis M. Fast and accurate amplitude demodulation of wideband signals. <i>IEEE Transactions on Signal Processing</i>. 2021;69:4039-4054. doi:<a href=\"https://doi.org/10.1109/TSP.2021.3087899\">10.1109/TSP.2021.3087899</a>"},"scopus_import":"1","_id":"9828","oa_version":"Preprint","intvolume":"        69","article_type":"original","acknowledgement":"The author thanks his colleagues K. Huszár and G. Tkačik for valuable discussions and comments on the manuscript.","type":"journal_article","date_published":"2021-06-09T00:00:00Z","language":[{"iso":"eng"}],"month":"06","date_updated":"2026-08-12T06:42:41Z","publisher":"IEEE","department":[{"_id":"GaTk"}],"arxiv":1,"isi":1,"oa":1,"publication_identifier":{"issn":["1053-587X"],"eissn":["1941-0476"]},"doi":"10.1109/TSP.2021.3087899","publication":"IEEE Transactions on Signal Processing","date_created":"2021-08-08T22:01:31Z","year":"2021","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.04832"}],"corr_author":"1","quality_controlled":"1","author":[{"first_name":"Mantas","last_name":"Gabrielaitis","full_name":"Gabrielaitis, Mantas","id":"4D5B0CBC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7758-2016"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":69,"title":"Fast and accurate amplitude demodulation of wideband signals","article_processing_charge":"No","page":"4039 - 4054","external_id":{"isi":["000682123900002"],"arxiv":["2102.04832"]},"publication_status":"published","abstract":[{"text":"Amplitude demodulation is a classical operation used in signal processing. For a long time, its effective applications in practice have been limited to narrowband signals. In this work, we generalize amplitude demodulation to wideband signals. We pose demodulation as a recovery problem of an oversampled corrupted signal and introduce special iterative schemes belonging to the family of alternating projection algorithms to solve it. Sensibly chosen structural assumptions on the demodulation outputs allow us to reveal the high inferential accuracy of the method over a rich set of relevant signals. This new approach surpasses current state-of-the-art demodulation techniques apt to wideband signals in computational efficiency by up to many orders of magnitude with no sacrifice in quality. Such performance opens the door for applications of the amplitude demodulation procedure in new contexts. In particular, the new method makes online and large-scale offline data processing feasible, including the calculation of modulator-carrier pairs in higher dimensions and poor sampling conditions, independent of the signal bandwidth. We illustrate the utility and specifics of applications of the new method in practice by using natural speech and synthetic signals.","lang":"eng"}]}]