{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PBOWL34IPCSKVRY54XC2PKXI34","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":"6bbe6fada208592bc7b33ef1393279795587b754687a6d943ebd6b77a42302e3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-03-26T14:38:14Z","title_canon_sha256":"03b62c1f1fdbb93aa21e820d7216d613e504142f2270b776d4284d3ad9bc4a85"},"schema_version":"1.0","source":{"id":"1903.10927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10927","created_at":"2026-07-05T01:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10927v1","created_at":"2026-07-05T01:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10927","created_at":"2026-07-05T01:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"PBOWL34IPCSK","created_at":"2026-07-05T01:43:54Z"},{"alias_kind":"pith_short_16","alias_value":"PBOWL34IPCSKVRY5","created_at":"2026-07-05T01:43:54Z"},{"alias_kind":"pith_short_8","alias_value":"PBOWL34I","created_at":"2026-07-05T01:43:54Z"}],"graph_snapshots":[{"event_id":"sha256:b4382268f9047f33e0008a227d4bfaf12ffe9dc32a1075f1ceafadc756bfe69a","target":"graph","created_at":"2026-07-05T01:43:54Z","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/1903.10927/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum stabilizer codes (QSCs) suffer from a low quantum coding rate, since they have to recover the quantum bits (qubits) in the face of both bit-flip and phase-flip errors. In this treatise, we conceive a low-complexity concatenated quantum turbo code (QTC) design exhibiting a high quantum coding rate. The high quantum coding rate is achieved by combining the quantum-domain version of short-block codes (SBCs) also known as single parity check (SPC) codes as the outer codes and quantum unity-rate codes (QURCs) as the inner codes. Despite its design simplicity, the proposed QTC yields a near-","authors_text":"Daryus Chandra, Lajos Hanzo, Soon Xin Ng, Zunaira Babar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-03-26T14:38:14Z","title":"Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10927","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:76ab4254bccbc33d17ac0657d10e954b0a1c8f5cb2b6fabc0782a8a467f0ddaf","target":"record","created_at":"2026-07-05T01:43:54Z","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":"6bbe6fada208592bc7b33ef1393279795587b754687a6d943ebd6b77a42302e3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-03-26T14:38:14Z","title_canon_sha256":"03b62c1f1fdbb93aa21e820d7216d613e504142f2270b776d4284d3ad9bc4a85"},"schema_version":"1.0","source":{"id":"1903.10927","kind":"arxiv","version":1}},"canonical_sha256":"785d65ef8878a4aac71de5c5a7aae8df0e5c5db599598e44b1377090d3964749","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"785d65ef8878a4aac71de5c5a7aae8df0e5c5db599598e44b1377090d3964749","first_computed_at":"2026-07-05T01:43:54.361031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:43:54.361031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sHNdheiWVChpVr1wwouRwNxB/+qRNLBKvWfRBE3ZeppOi72jjqZsaO2J5+vsVH4gc31pBVF2llEzoiP2PpUUAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:43:54.361426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76ab4254bccbc33d17ac0657d10e954b0a1c8f5cb2b6fabc0782a8a467f0ddaf","sha256:b4382268f9047f33e0008a227d4bfaf12ffe9dc32a1075f1ceafadc756bfe69a"],"state_sha256":"38a0053b310cf7dc175d49e799ccaee8c5dd86715256ff184277acc9b11cb083"}