{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GYHUFYVEHG4OF3M3SU35HTW7FZ","short_pith_number":"pith:GYHUFYVE","canonical_record":{"source":{"id":"1309.5598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-22T13:29:29Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e2158d533c4cf0c6ab9de3d9d791eb5ac0d212ba72018e0dd13c2153cd528b72","abstract_canon_sha256":"248f8e2694c981d7b279fa9f70cba2669195ceea1cd425e73f620914bdffbc6f"},"schema_version":"1.0"},"canonical_sha256":"360f42e2a439b8e2ed9b9537d3cedf2e70d639ffa64f402cb89341ff95092278","source":{"kind":"arxiv","id":"1309.5598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5598","created_at":"2026-05-18T03:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5598v1","created_at":"2026-05-18T03:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5598","created_at":"2026-05-18T03:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"GYHUFYVEHG4O","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GYHUFYVEHG4OF3M3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GYHUFYVE","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GYHUFYVEHG4OF3M3SU35HTW7FZ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-22T13:29:29Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e2158d533c4cf0c6ab9de3d9d791eb5ac0d212ba72018e0dd13c2153cd528b72","abstract_canon_sha256":"248f8e2694c981d7b279fa9f70cba2669195ceea1cd425e73f620914bdffbc6f"},"schema_version":"1.0"},"canonical_sha256":"360f42e2a439b8e2ed9b9537d3cedf2e70d639ffa64f402cb89341ff95092278","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:45.511913Z","signature_b64":"0DtT7xqRjIoqKuWsMSclByHrLiLlMm0VzmshmWQT2UJkJxFY3Pco4vHVnR/szZrlSdDBFqLBjFyPHN2E/vX1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"360f42e2a439b8e2ed9b9537d3cedf2e70d639ffa64f402cb89341ff95092278","last_reissued_at":"2026-05-18T03:10:45.511495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:45.511495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5598","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-18T03:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bm2LmKld8De0SunqymzfbaRez6vtu0Nu7GbVFE4omBUV+wlY6dA+5KaFmZ8TsMKy6+qgvTi9VNrv5yw75KjVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:15:16.576945Z"},"content_sha256":"7914273425e1005ab0826c860c18010a360be7c8c10a6c51a27fbdf001516ee8","schema_version":"1.0","event_id":"sha256:7914273425e1005ab0826c860c18010a360be7c8c10a6c51a27fbdf001516ee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GYHUFYVEHG4OF3M3SU35HTW7FZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stabilizer formalism for generalized concatenated quantum codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Bei Zeng, Markus Grassl, Yun-Jiang Wang","submitted_at":"2013-09-22T13:29:29Z","abstract_excerpt":"The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum coset codes. This formalism offers a new perspective for GCQCs and enables us to derive a lower bound on the code distance of stabilizer GCQCs from component codes parameters,for both non-degenerate and degenerate component codes. Our formalism also shows how to exploit the error-correcting capacity of component codes to design good GCQCs efficiently."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5598","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-18T03:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buDbFthDa6ExSpS8RHG/aQ8J73wke/nMYHhKwe2AqtPUDxncUvPISsLIoMS2Iw3WfBaO1J/abqYOWdlIGb3dBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:15:16.577624Z"},"content_sha256":"752f47c483a27186c9ce9c0f6d97439bb1c2c498b71af3079f5fc03bdce36165","schema_version":"1.0","event_id":"sha256:752f47c483a27186c9ce9c0f6d97439bb1c2c498b71af3079f5fc03bdce36165"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYHUFYVEHG4OF3M3SU35HTW7FZ/bundle.json","state_url":"https://pith.science/pith/GYHUFYVEHG4OF3M3SU35HTW7FZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYHUFYVEHG4OF3M3SU35HTW7FZ/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-30T14:15:16Z","links":{"resolver":"https://pith.science/pith/GYHUFYVEHG4OF3M3SU35HTW7FZ","bundle":"https://pith.science/pith/GYHUFYVEHG4OF3M3SU35HTW7FZ/bundle.json","state":"https://pith.science/pith/GYHUFYVEHG4OF3M3SU35HTW7FZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYHUFYVEHG4OF3M3SU35HTW7FZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GYHUFYVEHG4OF3M3SU35HTW7FZ","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":"248f8e2694c981d7b279fa9f70cba2669195ceea1cd425e73f620914bdffbc6f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-22T13:29:29Z","title_canon_sha256":"e2158d533c4cf0c6ab9de3d9d791eb5ac0d212ba72018e0dd13c2153cd528b72"},"schema_version":"1.0","source":{"id":"1309.5598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5598","created_at":"2026-05-18T03:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5598v1","created_at":"2026-05-18T03:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5598","created_at":"2026-05-18T03:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"GYHUFYVEHG4O","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GYHUFYVEHG4OF3M3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GYHUFYVE","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:752f47c483a27186c9ce9c0f6d97439bb1c2c498b71af3079f5fc03bdce36165","target":"graph","created_at":"2026-05-18T03:10:45Z","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":"The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum coset codes. This formalism offers a new perspective for GCQCs and enables us to derive a lower bound on the code distance of stabilizer GCQCs from component codes parameters,for both non-degenerate and degenerate component codes. Our formalism also shows how to exploit the error-correcting capacity of component codes to design good GCQCs efficiently.","authors_text":"Barry C. Sanders, Bei Zeng, Markus Grassl, Yun-Jiang Wang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-22T13:29:29Z","title":"Stabilizer formalism for generalized concatenated quantum codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5598","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:7914273425e1005ab0826c860c18010a360be7c8c10a6c51a27fbdf001516ee8","target":"record","created_at":"2026-05-18T03:10:45Z","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":"248f8e2694c981d7b279fa9f70cba2669195ceea1cd425e73f620914bdffbc6f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-22T13:29:29Z","title_canon_sha256":"e2158d533c4cf0c6ab9de3d9d791eb5ac0d212ba72018e0dd13c2153cd528b72"},"schema_version":"1.0","source":{"id":"1309.5598","kind":"arxiv","version":1}},"canonical_sha256":"360f42e2a439b8e2ed9b9537d3cedf2e70d639ffa64f402cb89341ff95092278","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"360f42e2a439b8e2ed9b9537d3cedf2e70d639ffa64f402cb89341ff95092278","first_computed_at":"2026-05-18T03:10:45.511495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:45.511495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0DtT7xqRjIoqKuWsMSclByHrLiLlMm0VzmshmWQT2UJkJxFY3Pco4vHVnR/szZrlSdDBFqLBjFyPHN2E/vX1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:45.511913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7914273425e1005ab0826c860c18010a360be7c8c10a6c51a27fbdf001516ee8","sha256:752f47c483a27186c9ce9c0f6d97439bb1c2c498b71af3079f5fc03bdce36165"],"state_sha256":"be15737177d1152fb49e74cca8fbeb7d3f1bd1166d0d642c0da102451a1090f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5jmE1xunRrgsLOijTpnGaDP6JGoBR4aDBjR5R7we8fh+b0gAw0+NXM41U5vpUNmmKiGHOCe8DgNENw4jdhhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:15:16.581066Z","bundle_sha256":"e955833f946516480bc0d5a1d3304f0b5cb0f31b15e631cceabb5fa4d97fdc15"}}