{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4AAJTY6WAYGIHYJ6WLNTJPZOJQ","short_pith_number":"pith:4AAJTY6W","schema_version":"1.0","canonical_sha256":"e00099e3d6060c83e13eb2db34bf2e4c3fcd72b29ca43a3e466826698be3f5e6","source":{"kind":"arxiv","id":"2406.17995","version":4},"attestation_state":"computed","paper":{"title":"Managing Classical Processing Requirements for Quantum Error Correction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Abtin Molavi, Aws Albarghouthi, Satvik Maurya, Swamit Tannu","submitted_at":"2024-06-26T00:50:10Z","abstract_excerpt":"Large-scale quantum computers promise transformative speedups, but their viability hinges on fast and reliable quantum error correction (QEC). At the center of QEC are decoders-classical algorithms running on hardware such as FPGAs, GPUs, or CPUs that process error syndromes to detect errors every microsecond to preserve fault-tolerance. Quantum processors, therefore, operate not in isolation, but as accelerators tightly coupled with powerful classical digital hardware. A key challenge is that decoder demand fluctuates unpredictably: bursts of activity can require orders of magnitude more deco"},"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":"2406.17995","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-26T00:50:10Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"213a186e952698e23932a6ed06f3b434787897615cfb12088647753871defc0c","abstract_canon_sha256":"c4ace2b012a2fe063dd393a442590a36466c2b6cac6a45610db5b98537acbf12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:46.350362Z","signature_b64":"lcy3GovTvTllrDsQbfcq4rYpqYzAisio0vAxWS0ZE0jKhYFpCuEr4jYfGq6s8szvkKsUYuvYW0Z7boRSIyLGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e00099e3d6060c83e13eb2db34bf2e4c3fcd72b29ca43a3e466826698be3f5e6","last_reissued_at":"2026-05-20T00:02:46.349648Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:46.349648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Managing Classical Processing Requirements for Quantum Error Correction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Abtin Molavi, Aws Albarghouthi, Satvik Maurya, Swamit Tannu","submitted_at":"2024-06-26T00:50:10Z","abstract_excerpt":"Large-scale quantum computers promise transformative speedups, but their viability hinges on fast and reliable quantum error correction (QEC). At the center of QEC are decoders-classical algorithms running on hardware such as FPGAs, GPUs, or CPUs that process error syndromes to detect errors every microsecond to preserve fault-tolerance. Quantum processors, therefore, operate not in isolation, but as accelerators tightly coupled with powerful classical digital hardware. A key challenge is that decoder demand fluctuates unpredictably: bursts of activity can require orders of magnitude more deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.17995","kind":"arxiv","version":4},"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/2406.17995/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":"2406.17995","created_at":"2026-05-20T00:02:46.349763+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.17995v4","created_at":"2026-05-20T00:02:46.349763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.17995","created_at":"2026-05-20T00:02:46.349763+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AAJTY6WAYGI","created_at":"2026-05-20T00:02:46.349763+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AAJTY6WAYGIHYJ6","created_at":"2026-05-20T00:02:46.349763+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AAJTY6W","created_at":"2026-05-20T00:02:46.349763+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2512.02539","citing_title":"Constraint-Optimal Driven Allocation for Scalable QEC Decoder Scheduling","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15099","citing_title":"O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03180","citing_title":"Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding","ref_index":49,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04459","citing_title":"Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ","json":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ.json","graph_json":"https://pith.science/api/pith-number/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/graph.json","events_json":"https://pith.science/api/pith-number/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/events.json","paper":"https://pith.science/paper/4AAJTY6W"},"agent_actions":{"view_html":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ","download_json":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ.json","view_paper":"https://pith.science/paper/4AAJTY6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.17995&json=true","fetch_graph":"https://pith.science/api/pith-number/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/action/storage_attestation","attest_author":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/action/author_attestation","sign_citation":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/action/citation_signature","submit_replication":"https://pith.science/pith/4AAJTY6WAYGIHYJ6WLNTJPZOJQ/action/replication_record"}},"created_at":"2026-05-20T00:02:46.349763+00:00","updated_at":"2026-05-20T00:02:46.349763+00:00"}