{"as_of":"2026-08-19T16:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00d8c37a61b756fd6e67aa79827e32fb2d03f96d66d295ec0de913d56eab5793","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":34,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:57:49.439824Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":36,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2406.17995","last_updated":"2026-03-11T16:38:21Z","snapshot_observed_at":"2026-07-06T18:37:04.753504Z","submitted_at":"2024-06-26T00:50:10Z","title":"Managing Classical Processing Requirements for Quantum Error Correction","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-24T00:08:21.027779Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2406.17995"},"observation_digest":"sha256:21a82ccbd97dc9ee0bbd173dd518bc9161202b091b5d346d24d7a8010291a36f","observation_id":"3cbd4f54-eefd-49b9-b67d-9af3ec8529df","resolution":{"observed_at":"2026-05-24T00:08:39.460766Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2409.17595","last_updated":"2024-09-26T07:21:58Z","snapshot_observed_at":"2026-08-13T21:53:07.774758Z","submitted_at":"2024-09-26T07:21:58Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","version":1},"reference_index":230,"source":"arxiv_source","source_observed_at":"2026-05-13T00:09:25.996037Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2409.17595"},"observation_digest":"sha256:5bf3f11d52347ade69a35aa84193b6344f516c2be2c0870fd71f2f28b8dc30f4","observation_id":"67bcc094-a247-4518-b8ec-cb52e57ca5cd","resolution":{"observed_at":"2026-05-13T00:09:26.220180Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2411.04664","last_updated":"2026-04-27T00:04:29Z","snapshot_observed_at":"2026-07-06T19:46:41.798193Z","submitted_at":"2024-11-07T12:49:55Z","title":"Taming Rydberg Decay with Measurement-based Quantum Computation","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-23T18:08:58.647426Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2411.04664"},"observation_digest":"sha256:e013fc99779b64f9bff6fa55626273e09577708b2fb33f3b1de54feaeb4163d1","observation_id":"8dcfacb3-e860-4c50-818d-c2b513a8e149","resolution":{"observed_at":"2026-05-23T18:13:18.232972Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2411.16228","last_updated":"2025-06-17T16:28:54Z","snapshot_observed_at":"2026-08-15T00:12:23.796482Z","submitted_at":"2024-11-25T09:41:25Z","title":"Soft information decoding with superconducting qubits","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T16:51:49.757465Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2411.16228"},"observation_digest":"sha256:a18df3a15cb80cacd951b32fee284224108e7168a5c7c417a612e3e553a49fe0","observation_id":"25da5fa2-6626-4764-b1fe-569fecb73f4f","resolution":{"observed_at":"2026-05-23T16:53:12.860288Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-12T12:06:10.927569Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.17519","last_updated":"2024-11-26T15:27:59Z","snapshot_observed_at":"2026-08-14T14:43:22.421782Z","submitted_at":"2024-11-26T15:27:59Z","title":"High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:10.927569Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2411.17519"},"observation_digest":"sha256:0cbada9b1b8da8d753766d4855cf30e98d0dfcca7aed7aa19b034cb09ed7a7c4","observation_id":"b249b575-25a9-46f6-9272-179d21d2fe21","resolution":{"observed_at":"2026-08-12T12:06:10.927569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-12T05:35:54.297299Z","title":"Sparse Blossom: Correcting a Million Errors per Core Second with Minimum-Weight Matching,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.00289","last_updated":"2026-07-15T22:59:09Z","snapshot_observed_at":"2026-08-16T12:38:23.205108Z","submitted_at":"2024-11-29T23:55:29Z","title":"Controller-decoder system requirements derived by implementing Shor's algorithm with surface code","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T05:35:54.297299Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2412.00289"},"observation_digest":"sha256:b5fe5625f3390cdfe327d1acce3e005a73c8332625445c6ef9e513e7cc348fc0","observation_id":"0681818a-ed8e-4cda-935c-a86b319e4b84","resolution":{"observed_at":"2026-08-12T05:35:54.297299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-12T04:28:05.760466Z","title":"Higgott and C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.01391","last_updated":"2024-12-02T11:24:46Z","snapshot_observed_at":"2026-08-18T05:21:19.160225Z","submitted_at":"2024-12-02T11:24:46Z","title":"Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T04:28:05.760466Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2412.01391"},"observation_digest":"sha256:3871db79442bf1d3e216b9019a265456c31bea160f6df9fa2fccadcdb899a02e","observation_id":"fd39562b-322c-44dd-8271-50609bd978b8","resolution":{"observed_at":"2026-08-12T04:28:05.760466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-12T04:28:28.287676Z","title":"Sparse blossom: correcting a million errors per core second with minimum-weight matching,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.01434","last_updated":"2025-04-07T12:06:06Z","snapshot_observed_at":"2026-08-16T12:46:52.260070Z","submitted_at":"2024-12-02T12:16:28Z","title":"Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T04:28:28.287676Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2412.01434"},"observation_digest":"sha256:f0ca79088ebc41a0da6588bee1910896c10a2986d036334265526e7d488c3f32","observation_id":"a82ff3cd-c481-4c01-a638-6206eb95dd39","resolution":{"observed_at":"2026-08-12T04:28:28.287676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2412.01446","last_updated":"2024-12-18T00:27:54Z","snapshot_observed_at":"2026-08-17T06:51:12.045538Z","submitted_at":"2024-12-02T12:35:52Z","title":"Magic State Injection on IBM Quantum Processors Above the Distillation Threshold","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-23T07:58:58.948256Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2412.01446"},"observation_digest":"sha256:1b037bd9359895a856952842e0b0543f9fb00c12ee5cca65da2744e6f0b570e1","observation_id":"519c8631-1f2e-48b8-9802-610ae08d8698","resolution":{"observed_at":"2026-05-23T08:02:43.721626Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-11T23:03:54.531663Z","title":"Sparse blossom: correcting a million errors per core second with minimum-weight matching","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02885","last_updated":"2024-12-03T22:45:43Z","snapshot_observed_at":"2026-08-19T00:09:55.574502Z","submitted_at":"2024-12-03T22:45:43Z","title":"SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T23:03:54.531663Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2412.02885"},"observation_digest":"sha256:69252cf2322b7c3733cd9c3860f133b6f2a25d5ab8c30bee5665f8b4b4995265","observation_id":"b5a31935-9b40-4f6c-9ed4-6f958ff77200","resolution":{"observed_at":"2026-08-11T23:03:54.531663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-11T12:39:32.738216Z","title":"Sparse Blossom: cor- recting a million errors per core second with minimum- weight matching,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14004","last_updated":"2024-12-18T16:20:14Z","snapshot_observed_at":"2026-08-16T06:23:06.991196Z","submitted_at":"2024-12-18T16:20:14Z","title":"The random coupled-plaquette gauge model and the surface code under circuit-level noise","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T12:39:32.738216Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2412.14004"},"observation_digest":"sha256:4b69116983bfd591206607c2755c34800ce62b0abf0a1adcc92168c6115e3db7","observation_id":"cb8680f6-0869-4565-bd42-bf0471db9873","resolution":{"observed_at":"2026-08-11T12:39:32.738216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-11T11:12:04.596716Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.15751","last_updated":"2024-12-26T04:19:49Z","snapshot_observed_at":"2026-08-16T12:47:41.630513Z","submitted_at":"2024-12-20T10:12:25Z","title":"Implementation of Magic State Injection within Heavy-Hexagon Architecture","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T11:12:04.596716Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2412.15751"},"observation_digest":"sha256:777bc3d762ccccdc8f50feb7c495a89bc52e1f9e79b504627ddd27833d0658b2","observation_id":"e0b25201-ea58-4eb7-bc37-37fdc198c53e","resolution":{"observed_at":"2026-08-11T11:12:04.596716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-08T11:34:41.368311Z","title":"Sparse Blossom: correcting a mil- lion errors per core second with minimum-weight matching,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07892","last_updated":"2025-02-28T09:30:50Z","snapshot_observed_at":"2026-08-17T09:43:41.840663Z","submitted_at":"2025-02-11T19:01:05Z","title":"Enhancing dissipative cat qubit protection by squeezing","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T11:34:41.368311Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2502.07892"},"observation_digest":"sha256:73a0b076d8a21f8849e2e4e2227d7093cbe218f94ed86f4754fc6cee00f1bbc4","observation_id":"a239dd3b-cbc1-46f7-96bc-25294a958b99","resolution":{"observed_at":"2026-08-08T11:34:41.368311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-16T10:55:32.856213Z","title":"Higgott and C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16999","last_updated":"2025-04-23T18:00:04Z","snapshot_observed_at":"2026-08-16T12:49:01.722058Z","submitted_at":"2025-04-23T18:00:04Z","title":"Learning to decode logical circuits","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T10:55:32.856213Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2504.16999"},"observation_digest":"sha256:0aa80a19913d4f336fe587217f9aac91dc1e80c25018b4c1eebf5e0ae5480de2","observation_id":"2bdcc09a-90f7-489e-8a18-ac6f57993b9b","resolution":{"observed_at":"2026-08-16T10:55:32.856213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-16T10:57:49.439824Z","title":"H I G G O T Tand C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.17082","last_updated":"2025-04-23T20:09:10Z","snapshot_observed_at":"2026-08-18T11:13:11.896388Z","submitted_at":"2025-04-23T20:09:10Z","title":"Surface-code Superconducting Quantum Processors: From Calibration To Logical Performance","version":1},"reference_index":205,"source":"pdf_text","source_observed_at":"2026-08-16T10:57:49.439824Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2504.17082"},"observation_digest":"sha256:af22c0078ff1f821fa49497110be74d15a026108f3c2d3f41287be57252b3e4c","observation_id":"8676809c-fca4-4a2c-8c1e-975ab3c9d77d","resolution":{"observed_at":"2026-08-16T10:57:49.439824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-15T23:16:14.852464Z","title":"Higgott and C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.05175","last_updated":"2026-07-17T21:06:24Z","snapshot_observed_at":"2026-08-17T23:56:56.553946Z","submitted_at":"2025-05-08T12:23:22Z","title":"Planar fault-tolerant circuits for non-Clifford gates on the 2D color code","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T23:16:14.852464Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2505.05175"},"observation_digest":"sha256:68f94eea904197c9138949013bcf2a106e91b1e2d5939db886bc389dda4287fe","observation_id":"48990981-9431-4b5c-9949-3f69f9f636a4","resolution":{"observed_at":"2026-08-15T23:16:14.852464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-07T11:39:52.850913Z","title":"Higgott and C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.01779","last_updated":"2025-08-22T12:35:33Z","snapshot_observed_at":"2026-08-14T09:32:22.319151Z","submitted_at":"2025-06-02T15:23:00Z","title":"Improved belief propagation is sufficient for real-time decoding of quantum memory","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.850913Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2506.01779"},"observation_digest":"sha256:9042ae87eeffa1444bbab654e4c0e35741e0d8fa678fa053e5bb90ba8ae6383a","observation_id":"38a285e7-ce3b-4493-960f-3479417754a1","resolution":{"observed_at":"2026-08-07T11:39:52.850913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-07T10:56:55.545463Z","title":"Higgott and C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04084","last_updated":"2025-06-04T15:45:03Z","snapshot_observed_at":"2026-08-17T08:14:22.182243Z","submitted_at":"2025-06-04T15:45:03Z","title":"A Unitary Encoder for Surface Codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:56:55.545463Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2506.04084"},"observation_digest":"sha256:3e57e2f91e5adcf040ef7e7f8b0ec78ab93dc96d30cea289b9f5ae0ae5aea4bd","observation_id":"23933a43-4635-46f8-9f7b-1498c923d557","resolution":{"observed_at":"2026-08-07T10:56:55.545463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-07T05:19:46.609890Z","title":"Higgott and C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08331","last_updated":"2025-06-10T01:35:21Z","snapshot_observed_at":"2026-08-14T00:05:08.213507Z","submitted_at":"2025-06-10T01:35:21Z","title":"Correcting a noisy quantum computer using a quantum computer","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:19:46.609890Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2506.08331"},"observation_digest":"sha256:a06f20415f63f88347a5c65ff2d4335d46f4c201077d64624077e62bb44a28f2","observation_id":"27bad367-4983-4a53-96ad-34d9b61f12b9","resolution":{"observed_at":"2026-08-07T05:19:46.609890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-07T04:36:46.402755Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10258","last_updated":"2025-06-12T00:57:49Z","snapshot_observed_at":"2026-08-19T12:48:28.723094Z","submitted_at":"2025-06-12T00:57:49Z","title":"Synchronization for Fault-Tolerant Quantum Computers","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:36:46.402755Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2506.10258"},"observation_digest":"sha256:44a526f695869a41e8778667393d8cfff07416a6132e3f8d3f3aed1f97cbd377","observation_id":"a0772ba1-2372-4b0b-bc75-b86d9379ac3e","resolution":{"observed_at":"2026-08-07T04:36:46.402755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-06T18:36:01.341267Z","title":"Higgott and C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08088","last_updated":"2025-07-10T18:01:27Z","snapshot_observed_at":"2026-08-18T02:20:52.875611Z","submitted_at":"2025-07-10T18:01:27Z","title":"Real-Time Dynamics in a (2+1)-D Gauge Theory: The Stringy Nature on a Superconducting Quantum Simulator","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T18:36:01.341267Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2507.08088"},"observation_digest":"sha256:f5cff43e73b9ed878eb50e816e6a61ce1bc21d5c623c9a2817167e5bb5d47e70","observation_id":"a2b4318e-c0b4-43b7-9d95-b25e8519f0bb","resolution":{"observed_at":"2026-08-06T18:36:01.341267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T23:11:30.235144Z","title":"Sparse blossom: correcting a million errors per core second with minimum-weight matching,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.05768","last_updated":"2025-08-07T18:34:52Z","snapshot_observed_at":"2026-08-16T12:37:20.921076Z","submitted_at":"2025-08-07T18:34:52Z","title":"Dynamics and rupture of doped Motility Induced Phase Peparation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T23:11:30.235144Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2508.05768"},"observation_digest":"sha256:1721e66f816f34ff1ffe8360090426acbf0963e98d0162fa487df3580b41d13e","observation_id":"9071ed10-7057-4383-832c-ba72ead51556","resolution":{"observed_at":"2026-08-05T23:11:30.235144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-15T16:42:46.791546Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02721","last_updated":"2025-09-02T18:18:46Z","snapshot_observed_at":"2026-08-17T01:53:43.454924Z","submitted_at":"2025-09-02T18:18:46Z","title":"Tableau-Based Framework for Efficient Logical Quantum Compilation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:46.791546Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2509.02721"},"observation_digest":"sha256:1354577417ad513b8e64ac4f5f1de82900df540c5a5bd5e8256ae070cb8d8a30","observation_id":"13a8059e-d696-4fd4-ba8f-5dac21db6757","resolution":{"observed_at":"2026-08-15T16:42:46.791546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2602.20238","last_updated":"2026-05-06T08:48:40Z","snapshot_observed_at":"2026-08-11T12:47:46.459709Z","submitted_at":"2026-02-23T19:00:00Z","title":"Proof of a finite threshold for the union-find decoder","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-15T20:12:10.149451Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2602.20238"},"observation_digest":"sha256:d03660a6f856c286e9419b13cf12794d13b039477abfee51351502ec9c53b7e1","observation_id":"ff68aeb3-295b-41bc-baac-f2c7b28873f1","resolution":{"observed_at":"2026-05-15T20:16:34.766471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2603.05320","last_updated":"2026-04-23T13:20:30Z","snapshot_observed_at":"2026-08-12T18:14:33.452433Z","submitted_at":"2026-03-05T16:00:24Z","title":"Simplified circuit-level decoding using Knill error correction","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-15T16:23:20.243937Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2603.05320"},"observation_digest":"sha256:ddda825ba5842cde9a8eab02447e8368ce6dc924dfee517f28ac067b45de8102","observation_id":"d0a883d2-5ad4-48ab-8f56-43bb562da705","resolution":{"observed_at":"2026-05-15T16:26:17.224546Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2605.04892","last_updated":"2026-05-06T13:24:10Z","snapshot_observed_at":"2026-08-11T15:32:27.624949Z","submitted_at":"2026-05-06T13:24:10Z","title":"Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-08T16:40:47.171265Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2605.04892"},"observation_digest":"sha256:e5447ae8e5204d281df93252de71381acee435d553ba0581937cb9ed47d9fec3","observation_id":"c4630719-6098-4577-94b6-51dabb582335","resolution":{"observed_at":"2026-05-11T18:06:05.860717Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2606.09678","last_updated":"2026-06-08T15:59:47Z","snapshot_observed_at":"2026-08-15T18:52:39.049979Z","submitted_at":"2026-06-08T15:59:47Z","title":"The dynamic 4.8.8 Floquet code","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T16:48:32.905893Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2606.09678"},"observation_digest":"sha256:541c61900e1646f4bcdf2f5c1190c389691aafe635cef3e10000eefdf2dd2845","observation_id":"06b7f0dc-3c17-4d21-a200-52e2c6e49927","resolution":{"observed_at":"2026-07-03T01:07:30.427758Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2606.12781","last_updated":"2026-06-11T00:50:39Z","snapshot_observed_at":"2026-08-14T23:31:19.829538Z","submitted_at":"2026-06-11T00:50:39Z","title":"Quantum Network Routing based on Surface Code Error Correction","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T06:59:27.172211Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2606.12781"},"observation_digest":"sha256:9a108e2902391bd5427b80c7634cff140e7f4b7814c587890102c1f1c7573a0d","observation_id":"93987f08-5b2f-4fc0-a82e-4bed139b8778","resolution":{"observed_at":"2026-07-03T14:38:29.142583Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2606.20513","last_updated":"2026-06-18T17:34:11Z","snapshot_observed_at":"2026-08-13T04:35:21.524126Z","submitted_at":"2026-06-18T17:34:11Z","title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T16:42:17.891781Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2606.20513"},"observation_digest":"sha256:c706678cac628800a6692a514023c6c9ac809923e5f94c4a90c461b6f408682c","observation_id":"aa5ad199-e99c-4e16-9e45-c7a12f5eaa2b","resolution":{"observed_at":"2026-07-04T04:49:36.078794Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2607.01887","last_updated":"2026-07-02T08:38:27Z","snapshot_observed_at":"2026-08-04T01:19:10.602015Z","submitted_at":"2026-07-02T08:38:27Z","title":"LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-03T12:16:51.954644Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2607.01887"},"observation_digest":"sha256:5b0c02883b31f35c200a5bd279c0501ee6caedb2dc7ef9d0ef9b09c917c62857","observation_id":"10e22d9e-36b7-4ca4-9afc-1ee35690323b","resolution":{"observed_at":"2026-07-03T12:18:06.126302Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2607.05814","last_updated":"2026-07-08T14:10:43Z","snapshot_observed_at":"2026-08-10T05:07:45.732110Z","submitted_at":"2026-07-07T04:18:42Z","title":"Latency-Constrained Hardware-Aware Quantum Error Correction Co-Design with Adaptive Confidence-Gated Neural Decoding for the Rotated Surface Code","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-08T23:31:46.204369Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2607.05814"},"observation_digest":"sha256:5ae5c993e6f0712e9f46ab9a5b8e4310e7cc649d26cc0f7de06074beecf6bd4a","observation_id":"31ee92fc-2bef-4cec-bc0a-9814648f7cbe","resolution":{"observed_at":"2026-07-08T23:35:45.804421Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":"2303.15933","doi":"10.48550/arxiv.2303.15933","metadata_source":"pith","pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse blossom: cor- recting a million errors per core second with minimum- weight matching","venue":"quant-ph","work_id":"c4214dfb-1b8d-4423-b704-a7b530f75a35","year":2023},"citing_paper":{"arxiv_id":"2607.05814","last_updated":"2026-07-08T14:10:43Z","snapshot_observed_at":"2026-08-10T05:07:45.732110Z","submitted_at":"2026-07-07T04:18:42Z","title":"Latency-Constrained Hardware-Aware Quantum Error Correction Co-Design with Adaptive Confidence-Gated Neural Decoding for the Rotated Surface Code","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T02:08:27.634896Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2607.05814"},"observation_digest":"sha256:e801a16e5210f77e0b01ea77dc3dec95d85e6ec534aece4f86801893ff462720","observation_id":"b8f4cdcc-f91c-4b86-ad77-c26bd5f37411","resolution":{"observed_at":"2026-07-11T02:17:46.539184Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-02T08:17:16.357047Z","title":"Sparse blos- som: correcting a million errors per core sec- ond with minimum-weight matching.Quantum, 9:1600, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-17T03:40:38.944272Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.357047Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:1d7fe2ef4d4f70bcf01763cbae0df6b8872ce63ddd4b54fad468eec1738d3cf5","observation_id":"65b66dbf-65d3-4327-a464-23558941f99f","resolution":{"observed_at":"2026-08-02T08:17:16.357047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15933","snapshot_observed_at":"2026-08-01T11:03:13.786028Z","title":"Higgott and C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20060","last_updated":"2026-07-29T11:12:52Z","snapshot_observed_at":"2026-08-16T08:37:53.838741Z","submitted_at":"2026-07-22T12:03:14Z","title":"Physics-Informed Graph-Neural Decoding of the Surface Code: the Logical Signal as an Exact Topological Pairing","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T11:03:13.786028Z"},"links":{"cited_paper":"/paper/2303.15933","citing_paper":"/paper/2607.20060"},"observation_digest":"sha256:befe515b33056f4d927a88810d7bf3abc4503df13415b0c7c9d8690965d915bf","observation_id":"5348d5c2-046e-4c97-a047-250446a077be","resolution":{"observed_at":"2026-08-01T11:03:13.786028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2303.15933/citation-record","integrity":"/paper/2303.15933/integrity","json":"/paper/2303.15933/citation-record.json","paper":"/paper/2303.15933"},"outbound":[],"paper":{"arxiv_id":"2303.15933","last_updated":"2025-01-14T17:46:22Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T15:44:44.190609Z","submitted_at":"2023-03-28T12:42:54Z","title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 34 inbound Pith citation observations for arXiv:2303.15933."}