{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SJ7MJCVJOATNOLYX3PIVPN2X4Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2ef7759f7d70106809dd340a50b3f3267924b3d44ef9363841f1dc93ed4df6c6","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-02T13:37:29Z","title_canon_sha256":"5dcb863129e29241d69052f979c940c96aa87efcf73bed5ee4631962041dd878"},"schema_version":"1.0","source":{"id":"2504.01728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.01728","created_at":"2026-07-05T10:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.01728v1","created_at":"2026-07-05T10:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01728","created_at":"2026-07-05T10:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"SJ7MJCVJOATN","created_at":"2026-07-05T10:43:29Z"},{"alias_kind":"pith_short_16","alias_value":"SJ7MJCVJOATNOLYX","created_at":"2026-07-05T10:43:29Z"},{"alias_kind":"pith_short_8","alias_value":"SJ7MJCVJ","created_at":"2026-07-05T10:43:29Z"}],"graph_snapshots":[{"event_id":"sha256:e725ba521ef12966da8dd59d313e59ecd0def3c8b5b2d4bf7c90ac4cb2bb1840","target":"graph","created_at":"2026-07-05T10:43:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.01728/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Asit Kumar Pradhan, Bane Vasi\\'c, Narayanan Rengaswamy, Nithin Raveendran","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-02T13:37:29Z","title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01728","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d3a5147312cf8044bd046620db2daff7bd8ede9cf11c127ede9636abda1374ea","target":"record","created_at":"2026-07-05T10:43:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2ef7759f7d70106809dd340a50b3f3267924b3d44ef9363841f1dc93ed4df6c6","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-02T13:37:29Z","title_canon_sha256":"5dcb863129e29241d69052f979c940c96aa87efcf73bed5ee4631962041dd878"},"schema_version":"1.0","source":{"id":"2504.01728","kind":"arxiv","version":1}},"canonical_sha256":"927ec48aa97026d72f17dbd157b757e64cac154ba59c9bcc9ed70a8407af9968","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"927ec48aa97026d72f17dbd157b757e64cac154ba59c9bcc9ed70a8407af9968","first_computed_at":"2026-07-05T10:43:29.092808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:29.092808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k4f4vvfcxKcojQ+z02yK/esI3g9KlzKsNofkWMl77r6NMziRRUtV+BdxlpEj0+Gh/5sdf/g8THME7yYpDWWiAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:29.093269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.01728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3a5147312cf8044bd046620db2daff7bd8ede9cf11c127ede9636abda1374ea","sha256:e725ba521ef12966da8dd59d313e59ecd0def3c8b5b2d4bf7c90ac4cb2bb1840"],"state_sha256":"916479d50f8e0dcada0329d18eb8867f42cbb140823b51f8280bf4b9a0ee2ee4"}