{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:CLIAJ567TOWDHPXS5MGZIRLC5Q","short_pith_number":"pith:CLIAJ567","schema_version":"1.0","canonical_sha256":"12d004f7df9bac33bef2eb0d944562ec0db119eb2cf5cb45abaa41e9145f68fc","source":{"kind":"arxiv","id":"quant-ph/9608006","version":5},"attestation_state":"computed","paper":{"title":"Quantum Error Correction via Codes over GF(4)","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"((1) AT&T Research, (2) Institute for Defense Analyses), A. R. Calderbank (1), E. M Rains (2), N. J. A. Sloane (1), P. W. Shor (1)","submitted_at":"1996-08-06T18:13:19Z","abstract_excerpt":"The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits."},"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/9608006","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-08-06T18:13:19Z","cross_cats_sorted":[],"title_canon_sha256":"8cf0c46262fd9c29591ad50240318f7165660695a1b2fb4119ceeae7b7e6d881","abstract_canon_sha256":"40ffe337a93ad76d03d09d3b0de25644fe98b260833e9794e117cd4e4664f222"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:07:57.870216Z","signature_b64":"plYfQCKs4+HfcL6QE1S5CPS7qnhwSyEhIFPi/xxKCpgxO9m3AaOfO+zzIRyHIAawxTrTNqvZ275YpMr6+UElDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12d004f7df9bac33bef2eb0d944562ec0db119eb2cf5cb45abaa41e9145f68fc","last_reissued_at":"2026-07-04T15:07:57.869834Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:07:57.869834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Error Correction via Codes over GF(4)","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"((1) AT&T Research, (2) Institute for Defense Analyses), A. R. Calderbank (1), E. M Rains (2), N. J. A. Sloane (1), P. W. Shor (1)","submitted_at":"1996-08-06T18:13:19Z","abstract_excerpt":"The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9608006","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9608006/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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/9608006","created_at":"2026-07-04T15:07:57.869896+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9608006v5","created_at":"2026-07-04T15:07:57.869896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9608006","created_at":"2026-07-04T15:07:57.869896+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLIAJ567TOWD","created_at":"2026-07-04T15:07:57.869896+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLIAJ567TOWDHPXS","created_at":"2026-07-04T15:07:57.869896+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLIAJ567","created_at":"2026-07-04T15:07:57.869896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.25317","citing_title":"Fault-Tolerant QLDPC Syndrome Measurement via LDGM Encoding","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2504.21298","citing_title":"Preparation Circuits for Matrix Product States by Classical Variational Disentanglement","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"quant-ph/9705052","citing_title":"Stabilizer Codes and Quantum Error Correction","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q","json":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q.json","graph_json":"https://pith.science/api/pith-number/CLIAJ567TOWDHPXS5MGZIRLC5Q/graph.json","events_json":"https://pith.science/api/pith-number/CLIAJ567TOWDHPXS5MGZIRLC5Q/events.json","paper":"https://pith.science/paper/CLIAJ567"},"agent_actions":{"view_html":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q","download_json":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q.json","view_paper":"https://pith.science/paper/CLIAJ567","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9608006&json=true","fetch_graph":"https://pith.science/api/pith-number/CLIAJ567TOWDHPXS5MGZIRLC5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/CLIAJ567TOWDHPXS5MGZIRLC5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q/action/storage_attestation","attest_author":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q/action/author_attestation","sign_citation":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q/action/citation_signature","submit_replication":"https://pith.science/pith/CLIAJ567TOWDHPXS5MGZIRLC5Q/action/replication_record"}},"created_at":"2026-07-04T15:07:57.869896+00:00","updated_at":"2026-07-04T15:07:57.869896+00:00"}