{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SEUTQUJ23TEBQOHQBXOCXM6O43","short_pith_number":"pith:SEUTQUJ2","schema_version":"1.0","canonical_sha256":"912938513adcc81838f00ddc2bb3cee6edd67a7684d154a3e35b9accc0a18d66","source":{"kind":"arxiv","id":"2608.07783","version":1},"attestation_state":"computed","paper":{"title":"Multistage Rewinding Decoder for QLDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Bane Vasi\\'{c}, Dimitris Chytas, Milad Taghipour","submitted_at":"2026-08-07T22:06:41Z","abstract_excerpt":"In this paper, we propose a multistage decoding framework that leverages internal information produced by an underlying message-passing decoder. The proposed method targets the failure dynamics caused by both classical trapping sets and degenerate errors supported on symmetric stabilizers, which are among the primary limitations of iterative decoding for QLDPC codes. To identify unreliable variable nodes, we introduce a heuristic metric that combines several dynamical features of the decoder, including variable-node log likelihood reliabilities, hard-decision oscillations, the number of adjace"},"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":"2608.07783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-07T22:06:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c6d570ee919c75f7612654bfb224f50f10fadd4246e5964b68cf2abebd915281","abstract_canon_sha256":"27bce6936a6c22a20779ddb184b73764de989bfa6eb407e811a73d7e5f43b2dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:18:13.480367Z","signature_b64":"ZTnnMxE78AKX0f3YBKOA8KkKnh5k87R53doWdTHXlHNnfHsUHk/ocGb2lNx458Z2xujMqR4lC5t/jonHwhn5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"912938513adcc81838f00ddc2bb3cee6edd67a7684d154a3e35b9accc0a18d66","last_reissued_at":"2026-08-11T01:18:13.477887Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:18:13.477887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multistage Rewinding Decoder for QLDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Bane Vasi\\'{c}, Dimitris Chytas, Milad Taghipour","submitted_at":"2026-08-07T22:06:41Z","abstract_excerpt":"In this paper, we propose a multistage decoding framework that leverages internal information produced by an underlying message-passing decoder. The proposed method targets the failure dynamics caused by both classical trapping sets and degenerate errors supported on symmetric stabilizers, which are among the primary limitations of iterative decoding for QLDPC codes. To identify unreliable variable nodes, we introduce a heuristic metric that combines several dynamical features of the decoder, including variable-node log likelihood reliabilities, hard-decision oscillations, the number of adjace"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07783","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/2608.07783/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":"2608.07783","created_at":"2026-08-11T01:18:13.478584+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07783v1","created_at":"2026-08-11T01:18:13.478584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07783","created_at":"2026-08-11T01:18:13.478584+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEUTQUJ23TEB","created_at":"2026-08-11T01:18:13.478584+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEUTQUJ23TEBQOHQ","created_at":"2026-08-11T01:18:13.478584+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEUTQUJ2","created_at":"2026-08-11T01:18:13.478584+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43","json":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43.json","graph_json":"https://pith.science/api/pith-number/SEUTQUJ23TEBQOHQBXOCXM6O43/graph.json","events_json":"https://pith.science/api/pith-number/SEUTQUJ23TEBQOHQBXOCXM6O43/events.json","paper":"https://pith.science/paper/SEUTQUJ2"},"agent_actions":{"view_html":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43","download_json":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43.json","view_paper":"https://pith.science/paper/SEUTQUJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07783&json=true","fetch_graph":"https://pith.science/api/pith-number/SEUTQUJ23TEBQOHQBXOCXM6O43/graph.json","fetch_events":"https://pith.science/api/pith-number/SEUTQUJ23TEBQOHQBXOCXM6O43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43/action/storage_attestation","attest_author":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43/action/author_attestation","sign_citation":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43/action/citation_signature","submit_replication":"https://pith.science/pith/SEUTQUJ23TEBQOHQBXOCXM6O43/action/replication_record"}},"created_at":"2026-08-11T01:18:13.478584+00:00","updated_at":"2026-08-11T01:18:13.478584+00:00"}