{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:F7NBSNID26MH5I6J2TB46GURC6","short_pith_number":"pith:F7NBSNID","schema_version":"1.0","canonical_sha256":"2fda193503d7987ea3c9d4c3cf1a9117a189a21e92d315c02836544b3cc7232b","source":{"kind":"arxiv","id":"2303.04846","version":1},"attestation_state":"computed","paper":{"title":"Modular decoding: parallelizable real-time decoding for quantum computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chris Dawson, Fernando Pastawski, H\\'ector Bomb\\'in, Naomi Nickerson, Sam Roberts, Ye-Hua Liu","submitted_at":"2023-03-08T19:26:10Z","abstract_excerpt":"Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks which is remarkably effective. This decomposition of the global decoding problem into sub-tasks mirrors the logic"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2303.04846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-03-08T19:26:10Z","cross_cats_sorted":[],"title_canon_sha256":"b61596ff8bcd2ba29f0247778710b0c1adf75b6f4f8e238753b73845b7e489e0","abstract_canon_sha256":"aa5e2f677bf705e877cb96c13d13114fe4f04395022c5bee56d0c07ebdee53c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:34.494569Z","signature_b64":"OxjTCeO/+BJlnphPBhov/nB3leJCQxmmkXyWfBeASeXVm3LzXQ0KevKipjvKSwDFW44QkXEtWcZGhzrFxbhKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fda193503d7987ea3c9d4c3cf1a9117a189a21e92d315c02836544b3cc7232b","last_reissued_at":"2026-07-05T05:49:34.494170Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:34.494170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular decoding: parallelizable real-time decoding for quantum computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chris Dawson, Fernando Pastawski, H\\'ector Bomb\\'in, Naomi Nickerson, Sam Roberts, Ye-Hua Liu","submitted_at":"2023-03-08T19:26:10Z","abstract_excerpt":"Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks which is remarkably effective. This decomposition of the global decoding problem into sub-tasks mirrors the logic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.04846","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.04846/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.04846","created_at":"2026-07-05T05:49:34.494229+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.04846v1","created_at":"2026-07-05T05:49:34.494229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.04846","created_at":"2026-07-05T05:49:34.494229+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7NBSNID26MH","created_at":"2026-07-05T05:49:34.494229+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7NBSNID26MH5I6J","created_at":"2026-07-05T05:49:34.494229+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7NBSNID","created_at":"2026-07-05T05:49:34.494229+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14637","citing_title":"Adaptive Window Decoding based on Spatiotemporal Complementary Gap","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2406.17995","citing_title":"Managing Classical Processing Requirements for Quantum Error Correction","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17230","citing_title":"Maximum Likelihood Decoding of Quantum Error Correction Codes","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":107,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04459","citing_title":"Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6","json":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6.json","graph_json":"https://pith.science/api/pith-number/F7NBSNID26MH5I6J2TB46GURC6/graph.json","events_json":"https://pith.science/api/pith-number/F7NBSNID26MH5I6J2TB46GURC6/events.json","paper":"https://pith.science/paper/F7NBSNID"},"agent_actions":{"view_html":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6","download_json":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6.json","view_paper":"https://pith.science/paper/F7NBSNID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.04846&json=true","fetch_graph":"https://pith.science/api/pith-number/F7NBSNID26MH5I6J2TB46GURC6/graph.json","fetch_events":"https://pith.science/api/pith-number/F7NBSNID26MH5I6J2TB46GURC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6/action/storage_attestation","attest_author":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6/action/author_attestation","sign_citation":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6/action/citation_signature","submit_replication":"https://pith.science/pith/F7NBSNID26MH5I6J2TB46GURC6/action/replication_record"}},"created_at":"2026-07-05T05:49:34.494229+00:00","updated_at":"2026-07-05T05:49:34.494229+00:00"}