{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:7UVNPDPMS2GPT4OO6SMS3S3DGL","short_pith_number":"pith:7UVNPDPM","schema_version":"1.0","canonical_sha256":"fd2ad78dec968cf9f1cef4992dcb6332e2348d0dc2c187fc4e9b7f4daa744300","source":{"kind":"arxiv","id":"quant-ph/0012111","version":1},"attestation_state":"computed","paper":{"title":"Quantum error-correcting codes associated with graphs","license":"","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"D. Schlingemann, R.F. Werner","submitted_at":"2000-12-20T16:20:53Z","abstract_excerpt":"We present a construction scheme for quantum error correcting codes. The basic ingredients are a graph and a finite abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors. This allows a simple verification of the 1-error correcting property of fivefold codes in any dimension. As new examples we construct a large class of codes saturating the singleton bound, as well as a tenfold code detecting 3 errors."},"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":"quant-ph/0012111","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-12-20T16:20:53Z","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"1ff163f0b0b596ab2513053f0e869b6e66bb2f540b756ebc5c7cf5d5fc534d49","abstract_canon_sha256":"c80ce4fde9d0dd1371c76efcd262baf9c566c0f4c9f0bc3d614b335a7e9bb1cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:20.611889Z","signature_b64":"LodSRGwNLSTQ4jid3n5FEcpttxu1tmmXZVMgvPprvHAGrREhxNtpsVDoCkNDFHTLK3okjFH89kqJp6hEIswdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd2ad78dec968cf9f1cef4992dcb6332e2348d0dc2c187fc4e9b7f4daa744300","last_reissued_at":"2026-05-18T03:24:20.611346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:20.611346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum error-correcting codes associated with graphs","license":"","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"D. Schlingemann, R.F. Werner","submitted_at":"2000-12-20T16:20:53Z","abstract_excerpt":"We present a construction scheme for quantum error correcting codes. The basic ingredients are a graph and a finite abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors. This allows a simple verification of the 1-error correcting property of fivefold codes in any dimension. As new examples we construct a large class of codes saturating the singleton bound, as well as a tenfold code detecting 3 errors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0012111","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0012111","created_at":"2026-05-18T03:24:20.611443+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0012111v1","created_at":"2026-05-18T03:24:20.611443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0012111","created_at":"2026-05-18T03:24:20.611443+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UVNPDPMS2GP","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UVNPDPMS2GPT4OO","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UVNPDPM","created_at":"2026-05-18T12:25:49.631198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.08847","citing_title":"The Structure of Circle Graph States","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL","json":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL.json","graph_json":"https://pith.science/api/pith-number/7UVNPDPMS2GPT4OO6SMS3S3DGL/graph.json","events_json":"https://pith.science/api/pith-number/7UVNPDPMS2GPT4OO6SMS3S3DGL/events.json","paper":"https://pith.science/paper/7UVNPDPM"},"agent_actions":{"view_html":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL","download_json":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL.json","view_paper":"https://pith.science/paper/7UVNPDPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0012111&json=true","fetch_graph":"https://pith.science/api/pith-number/7UVNPDPMS2GPT4OO6SMS3S3DGL/graph.json","fetch_events":"https://pith.science/api/pith-number/7UVNPDPMS2GPT4OO6SMS3S3DGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL/action/storage_attestation","attest_author":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL/action/author_attestation","sign_citation":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL/action/citation_signature","submit_replication":"https://pith.science/pith/7UVNPDPMS2GPT4OO6SMS3S3DGL/action/replication_record"}},"created_at":"2026-05-18T03:24:20.611443+00:00","updated_at":"2026-05-18T03:24:20.611443+00:00"}