{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SJ7MJCVJOATNOLYX3PIVPN2X4Z","short_pith_number":"pith:SJ7MJCVJ","schema_version":"1.0","canonical_sha256":"927ec48aa97026d72f17dbd157b757e64cac154ba59c9bcc9ed70a8407af9968","source":{"kind":"arxiv","id":"2504.01728","version":1},"attestation_state":"computed","paper":{"title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Asit Kumar Pradhan, Bane Vasi\\'c, Narayanan Rengaswamy, Nithin Raveendran","submitted_at":"2025-04-02T13:37:29Z","abstract_excerpt":"Quantum low-density parity-check (QLDPC) codes with asymptotically non-zero rates are prominent candidates for achieving fault-tolerant quantum computation, primarily due to their syndrome-measurement circuit's low operational depth. Numerous studies advocate for the necessity of fast decoders to fully harness the capabilities of QLDPC codes, thus driving the focus towards designing low-complexity iterative decoders. However, empirical investigations indicate that such iterative decoders are susceptible to having a high error floor while decoding QLDPC codes. The main objective of this paper i"},"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":"2504.01728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-02T13:37:29Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"5dcb863129e29241d69052f979c940c96aa87efcf73bed5ee4631962041dd878","abstract_canon_sha256":"2ef7759f7d70106809dd340a50b3f3267924b3d44ef9363841f1dc93ed4df6c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:29.093269Z","signature_b64":"k4f4vvfcxKcojQ+z02yK/esI3g9KlzKsNofkWMl77r6NMziRRUtV+BdxlpEj0+Gh/5sdf/g8THME7yYpDWWiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"927ec48aa97026d72f17dbd157b757e64cac154ba59c9bcc9ed70a8407af9968","last_reissued_at":"2026-07-05T10:43:29.092808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:29.092808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Asit Kumar Pradhan, Bane Vasi\\'c, Narayanan Rengaswamy, Nithin Raveendran","submitted_at":"2025-04-02T13:37:29Z","abstract_excerpt":"Quantum low-density parity-check (QLDPC) codes with asymptotically non-zero rates are prominent candidates for achieving fault-tolerant quantum computation, primarily due to their syndrome-measurement circuit's low operational depth. Numerous studies advocate for the necessity of fast decoders to fully harness the capabilities of QLDPC codes, thus driving the focus towards designing low-complexity iterative decoders. However, empirical investigations indicate that such iterative decoders are susceptible to having a high error floor while decoding QLDPC codes. The main objective of this paper i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01728","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/2504.01728/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":"2504.01728","created_at":"2026-07-05T10:43:29.092866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.01728v1","created_at":"2026-07-05T10:43:29.092866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01728","created_at":"2026-07-05T10:43:29.092866+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJ7MJCVJOATN","created_at":"2026-07-05T10:43:29.092866+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJ7MJCVJOATNOLYX","created_at":"2026-07-05T10:43:29.092866+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJ7MJCVJ","created_at":"2026-07-05T10:43:29.092866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03218","citing_title":"Edge-Based Anisotropic Decoding for Generalized Bicycle Codes","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z","json":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z.json","graph_json":"https://pith.science/api/pith-number/SJ7MJCVJOATNOLYX3PIVPN2X4Z/graph.json","events_json":"https://pith.science/api/pith-number/SJ7MJCVJOATNOLYX3PIVPN2X4Z/events.json","paper":"https://pith.science/paper/SJ7MJCVJ"},"agent_actions":{"view_html":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z","download_json":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z.json","view_paper":"https://pith.science/paper/SJ7MJCVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.01728&json=true","fetch_graph":"https://pith.science/api/pith-number/SJ7MJCVJOATNOLYX3PIVPN2X4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/SJ7MJCVJOATNOLYX3PIVPN2X4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z/action/storage_attestation","attest_author":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z/action/author_attestation","sign_citation":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z/action/citation_signature","submit_replication":"https://pith.science/pith/SJ7MJCVJOATNOLYX3PIVPN2X4Z/action/replication_record"}},"created_at":"2026-07-05T10:43:29.092866+00:00","updated_at":"2026-07-05T10:43:29.092866+00:00"}