{"schema":"pith.reference-change-event.v1","doi":"10.1073/pnas.2303904120","canonical_url":"https://pith.science/event/10.1073/pnas.2303904120","json_url":"https://pith.science/event/10.1073/pnas.2303904120.json","not_a_judgment":"This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.","primary":{"event_id":202196,"doi":"10.1073/pnas.2303904120","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2023-11-20","title":"Correction for Boullé et al., Elliptic PDE learning is provably data-efficient","work_title":"B OULLÉ , D","work_doi":"10.1073/pnas.2303904120","work_arxiv_id":null,"notice_doi":"10.1073/pnas.2319078120","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1073/pnas.2303904120","json_href":"/event/10.1073/pnas.2303904120.json"},"events":[{"event_id":202196,"doi":"10.1073/pnas.2303904120","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2023-11-20","title":"Correction for Boullé et al., Elliptic PDE learning is provably data-efficient","work_title":"B OULLÉ , D","work_doi":"10.1073/pnas.2303904120","work_arxiv_id":null,"notice_doi":"10.1073/pnas.2319078120","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1073/pnas.2303904120","json_href":"/event/10.1073/pnas.2303904120.json"}],"flags":[{"id":8541,"status":"open","status_label":"Open","citing_arxiv_id":"2508.21189","citing_title":"Faster Linear Algebra Algorithms with Structured Random Matrices","ref_index":21,"evidence_raw":"T OWNSEND , Operator learning without the adjoint , Journal of Ma- chine Learning Research, 25 (2024), pp. 1-54,https://doi.org/https://dl.acm.org/doi/abs/10.5555/3722577. 3722941. (Cited on page 34.) [21] N. B OULLÉ , D. H ALIKIAS , AND A. T OWNSEND , Elliptic PDE learning is provably data-efficient, Proceedings of the National Academy of Sciences, 120 (2023), p. e2303904120, https://doi.org/10.1073/pnas.2303904120. (Cited on page 34.) [22] T. B RAILOVSKAYA AND R. VAN HANDEL , Universality and sharp matrix concentration inequalities , Geom. Funct. Anal., 34 (2024), pp. 1734-1838, https://doi.org/10.1007/s00039-024-00692-9 , https://doi.org/10.1007/ s00039-024-00692-9 . (Cited on page 46.) [23] S. B RAVYI , A. C HOWDHURY , D. G OSSET , AND P . WOCJAN , Quantum Hamiltonian complexity in thermal equilibrium, Na-","evidence_cleaned":"T OWNSEND, Operator learning without the adjoint, Journal of Ma- chine Learning Research, 25 (2024), pp. 1-54,https://doi.org/https://dl.acm.org/doi/abs/10.5555/3722577. 3722941. (Cited on page 34.) [21] N. B OULLÉ, D. H ALIKIAS, AND A. T OWNSEND, Elliptic PDE learning is provably data-efficient, Proceedings of the National Academy of Sciences, 120 (2023), p. e2303904120, https://doi.org/10.1073/pnas.2303904120. (Cited on page 34.) [22] T. B RAILOVSKAYA AND R. VAN HANDEL, Universality and sharp matrix concentration inequalities, Geom. Funct. Anal., 34 (2024), pp. 1734-1838, https://doi.org/10.1007/s00039-024-00692-9, https://doi.org/10.1007/ s00039-024-00692-9 . (Cited on page 46.) [23] S. B RAVYI, A. C HOWDHURY, D. G OSSET, AND P . WOCJAN, Quantum Hamiltonian complexity in thermal equilibrium, Na-","evidence_source_label":"citation context","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2023-11-20","work_title":"B OULLÉ , D","work_doi":"10.1073/pnas.2303904120","event_doi":"10.1073/pnas.2303904120","flag_href":"/flags/8541","event_href":"/event/10.1073/pnas.2303904120","paper_href":"/paper/2508.21189","created_at":"2026-08-05T18:20:25.801983Z","dispute_note":null,"disputed_at":null,"disputed_by":null}],"flag_count":1,"flags_open":1,"flags_disputed":0,"desk_url":"https://pith.science/flags"}