{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SCLINOCYGACF7YHW3YNHY2BFT4","short_pith_number":"pith:SCLINOCY","canonical_record":{"source":{"id":"1503.02372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-09T05:24:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a5d66e1ee97200a45a784d60ce2ffe001afd3e4f010478e56500b7ae82e0d564","abstract_canon_sha256":"3c2909ca321f338e85e98cfd8987bf17a6285b0a4f4fd0b4559346dc36f6bb55"},"schema_version":"1.0"},"canonical_sha256":"909686b85830045fe0f6de1a7c68259f32f674605a0161928acf267fa1372c25","source":{"kind":"arxiv","id":"1503.02372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02372","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02372v1","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02372","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"SCLINOCYGACF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SCLINOCYGACF7YHW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SCLINOCY","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SCLINOCYGACF7YHW3YNHY2BFT4","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-09T05:24:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a5d66e1ee97200a45a784d60ce2ffe001afd3e4f010478e56500b7ae82e0d564","abstract_canon_sha256":"3c2909ca321f338e85e98cfd8987bf17a6285b0a4f4fd0b4559346dc36f6bb55"},"schema_version":"1.0"},"canonical_sha256":"909686b85830045fe0f6de1a7c68259f32f674605a0161928acf267fa1372c25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:25.263253Z","signature_b64":"LrUUjARO0irFc0IWMQ7RJYczyYmWlgpjuygtOdZI9T44EiV0TzZUqmkvE0FgpnzpY3JazdtpGyaQ48XWZEDsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"909686b85830045fe0f6de1a7c68259f32f674605a0161928acf267fa1372c25","last_reissued_at":"2026-05-18T02:25:25.262826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:25.262826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02372","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhgRNjngXyZMK53DJKzU63WsVwd30o4kfeKCntdh+RqXVxFR7Udk7SK51zTWEdu4Yi78phFl7xNuGy3MJIf+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T09:07:13.059679Z"},"content_sha256":"abf063e1b3d6b9d8e16538a843af56c33f6c64b0003d8872a59e5ec1433f507b","schema_version":"1.0","event_id":"sha256:abf063e1b3d6b9d8e16538a843af56c33f6c64b0003d8872a59e5ec1433f507b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SCLINOCYGACF7YHW3YNHY2BFT4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Dimitrios Alanis, Lajos Hanzo, Panagiotis Botsinis, Soon Xin Ng, Zunaira Babar","submitted_at":"2015-03-09T05:24:49Z","abstract_excerpt":"Powerful Quantum Error Correction Codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classical codes, hashing bound approaching QECCs may be designed by exploiting a concatenated code structure, which invokes iterative decoding. Therefore, in this paper we provide an extensive step-by-step tutorial for designing EXtrinsic Information Transfer (EXIT) chart aided concatenated quantum codes based on the underlying quantum-to-classical isomorphism. These design lessons are then exemplified in the context of ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02372","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUWbsaKoU49r4EHMBzZ4Bz/uhGMyqL2FyAEIclNZDMmAb9TeA4bnEq0BYljKFYZ/NlA8XvofuvSg5HSwBMT8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T09:07:13.060165Z"},"content_sha256":"c63be093b85b3875904652c77cd0794acc78565af8a1a56c24708b982e7652da","schema_version":"1.0","event_id":"sha256:c63be093b85b3875904652c77cd0794acc78565af8a1a56c24708b982e7652da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCLINOCYGACF7YHW3YNHY2BFT4/bundle.json","state_url":"https://pith.science/pith/SCLINOCYGACF7YHW3YNHY2BFT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCLINOCYGACF7YHW3YNHY2BFT4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T09:07:13Z","links":{"resolver":"https://pith.science/pith/SCLINOCYGACF7YHW3YNHY2BFT4","bundle":"https://pith.science/pith/SCLINOCYGACF7YHW3YNHY2BFT4/bundle.json","state":"https://pith.science/pith/SCLINOCYGACF7YHW3YNHY2BFT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCLINOCYGACF7YHW3YNHY2BFT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SCLINOCYGACF7YHW3YNHY2BFT4","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":"3c2909ca321f338e85e98cfd8987bf17a6285b0a4f4fd0b4559346dc36f6bb55","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-09T05:24:49Z","title_canon_sha256":"a5d66e1ee97200a45a784d60ce2ffe001afd3e4f010478e56500b7ae82e0d564"},"schema_version":"1.0","source":{"id":"1503.02372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02372","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02372v1","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02372","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"SCLINOCYGACF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SCLINOCYGACF7YHW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SCLINOCY","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:c63be093b85b3875904652c77cd0794acc78565af8a1a56c24708b982e7652da","target":"graph","created_at":"2026-05-18T02:25:25Z","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"},"paper":{"abstract_excerpt":"Powerful Quantum Error Correction Codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classical codes, hashing bound approaching QECCs may be designed by exploiting a concatenated code structure, which invokes iterative decoding. Therefore, in this paper we provide an extensive step-by-step tutorial for designing EXtrinsic Information Transfer (EXIT) chart aided concatenated quantum codes based on the underlying quantum-to-classical isomorphism. These design lessons are then exemplified in the context of ou","authors_text":"Dimitrios Alanis, Lajos Hanzo, Panagiotis Botsinis, Soon Xin Ng, Zunaira Babar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-09T05:24:49Z","title":"The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02372","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:abf063e1b3d6b9d8e16538a843af56c33f6c64b0003d8872a59e5ec1433f507b","target":"record","created_at":"2026-05-18T02:25:25Z","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":"3c2909ca321f338e85e98cfd8987bf17a6285b0a4f4fd0b4559346dc36f6bb55","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-09T05:24:49Z","title_canon_sha256":"a5d66e1ee97200a45a784d60ce2ffe001afd3e4f010478e56500b7ae82e0d564"},"schema_version":"1.0","source":{"id":"1503.02372","kind":"arxiv","version":1}},"canonical_sha256":"909686b85830045fe0f6de1a7c68259f32f674605a0161928acf267fa1372c25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"909686b85830045fe0f6de1a7c68259f32f674605a0161928acf267fa1372c25","first_computed_at":"2026-05-18T02:25:25.262826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:25.262826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LrUUjARO0irFc0IWMQ7RJYczyYmWlgpjuygtOdZI9T44EiV0TzZUqmkvE0FgpnzpY3JazdtpGyaQ48XWZEDsBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:25.263253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abf063e1b3d6b9d8e16538a843af56c33f6c64b0003d8872a59e5ec1433f507b","sha256:c63be093b85b3875904652c77cd0794acc78565af8a1a56c24708b982e7652da"],"state_sha256":"458cfcebdde4de79e348d5a7df4dd31c9dbe14ac79742a118e171bc6d9a3d6ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpE+SArWSnk9eqrO/CW8x5vHPlVhgel8v/s1GsReS/TYLTIxWCtzvGi8cvn2F+EqoHffJeb82Fz/FeUHn3CFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T09:07:13.063274Z","bundle_sha256":"9280ba26dfaa2e7ce2183ee60a1beeeef928b74c8381e225ce07d5b04527933d"}}