{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RTRF4MKR6GLWSPZGNUWF575ONN","short_pith_number":"pith:RTRF4MKR","schema_version":"1.0","canonical_sha256":"8ce25e3151f197693f266d2c5effae6b464f7be3a5eccffd515fb764ea6ba40a","source":{"kind":"arxiv","id":"0910.4129","version":2},"attestation_state":"computed","paper":{"title":"Graph Concatenation for Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Isaac Chuang, Markus Grassl, Peter Shor, Salman Beigi","submitted_at":"2009-10-21T16:16:34Z","abstract_excerpt":"Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on \"graph concatenation\", where graphs representing the inner and outer codes are concatenated via a simple graph operation called \"generalized local complem"},"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":"0910.4129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-10-21T16:16:34Z","cross_cats_sorted":[],"title_canon_sha256":"85ee180cf38dfba111da85b434e4e99fb305554a00c5bf8bb4a13094cb21a828","abstract_canon_sha256":"b690ad7f0f6e6bb4381daa883a983e61176740d4a83e4feb2b55cc5c709fa6b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:28.613177Z","signature_b64":"UGiiBeCxj4M9nuQ8Hzc448zFUaJAm0OnMR3gj72L7HQN7SA1Y+DXIp3ROf4aUlG+W1VnlJoTZ/LwsNyQ7b6xBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ce25e3151f197693f266d2c5effae6b464f7be3a5eccffd515fb764ea6ba40a","last_reissued_at":"2026-05-18T04:25:28.612330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:28.612330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Concatenation for Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Isaac Chuang, Markus Grassl, Peter Shor, Salman Beigi","submitted_at":"2009-10-21T16:16:34Z","abstract_excerpt":"Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on \"graph concatenation\", where graphs representing the inner and outer codes are concatenated via a simple graph operation called \"generalized local complem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.4129","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0910.4129","created_at":"2026-05-18T04:25:28.612471+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.4129v2","created_at":"2026-05-18T04:25:28.612471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.4129","created_at":"2026-05-18T04:25:28.612471+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTRF4MKR6GLW","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTRF4MKR6GLWSPZG","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTRF4MKR","created_at":"2026-05-18T12:26:01.383474+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/RTRF4MKR6GLWSPZGNUWF575ONN","json":"https://pith.science/pith/RTRF4MKR6GLWSPZGNUWF575ONN.json","graph_json":"https://pith.science/api/pith-number/RTRF4MKR6GLWSPZGNUWF575ONN/graph.json","events_json":"https://pith.science/api/pith-number/RTRF4MKR6GLWSPZGNUWF575ONN/events.json","paper":"https://pith.science/paper/RTRF4MKR"},"agent_actions":{"view_html":"https://pith.science/pith/RTRF4MKR6GLWSPZGNUWF575ONN","download_json":"https://pith.science/pith/RTRF4MKR6GLWSPZGNUWF575ONN.json","view_paper":"https://pith.science/paper/RTRF4MKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.4129&json=true","fetch_graph":"https://pith.science/api/pith-number/RTRF4MKR6GLWSPZGNUWF575ONN/graph.json","fetch_events":"https://pith.science/api/pith-number/RTRF4MKR6GLWSPZGNUWF575ONN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTRF4MKR6GLWSPZGNUWF575ONN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTRF4MKR6GLWSPZGNUWF575ONN/action/storage_attestation","attest_author":"https://pith.science/pith/RTRF4MKR6GLWSPZGNUWF575ONN/action/author_attestation","sign_citation":"https://pith.science/pith/RTRF4MKR6GLWSPZGNUWF575ONN/action/citation_signature","submit_replication":"https://pith.science/pith/RTRF4MKR6GLWSPZGNUWF575ONN/action/replication_record"}},"created_at":"2026-05-18T04:25:28.612471+00:00","updated_at":"2026-05-18T04:25:28.612471+00:00"}