{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:X5MGZ2C5SGS73RLYFJL3V4ZBGB","short_pith_number":"pith:X5MGZ2C5","schema_version":"1.0","canonical_sha256":"bf586ce85d91a5fdc5782a57baf321305601d145a47bb14477c5d0df5a2a3b00","source":{"kind":"arxiv","id":"quant-ph/9608026","version":2},"attestation_state":"computed","paper":{"title":"Quantum Reed-Muller Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Steane (Department of Physics, University of Oxford)","submitted_at":"1996-08-16T11:56:39Z","abstract_excerpt":"A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]] = [[2^r, 2^r - C(r,t) - 2 sum_{i=0}^{t-1} C(r,i), 2^t + 2^{t-1} ]]."},"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/9608026","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-08-16T11:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"5163326bc0f94cc1006052552bcedc9997b70cad1aca6f5128e15b9c1985b39c","abstract_canon_sha256":"596dbd5151eeb20df7f366b065d37f68b2cf484f3c9d31795befd7a060c98d17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:08:20.286985Z","signature_b64":"CU12cmv0qcBXGqJABX2roPZGYswHtafAYiuoBTcjl6xopdaQT7cLpxNEV3CDN9Ke81d8A8keVGVV1SuoHKqYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf586ce85d91a5fdc5782a57baf321305601d145a47bb14477c5d0df5a2a3b00","last_reissued_at":"2026-07-04T15:08:20.286622Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:08:20.286622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Reed-Muller Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Steane (Department of Physics, University of Oxford)","submitted_at":"1996-08-16T11:56:39Z","abstract_excerpt":"A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]] = [[2^r, 2^r - C(r,t) - 2 sum_{i=0}^{t-1} C(r,i), 2^t + 2^{t-1} ]]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9608026","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9608026/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/9608026","created_at":"2026-07-04T15:08:20.286678+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9608026v2","created_at":"2026-07-04T15:08:20.286678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9608026","created_at":"2026-07-04T15:08:20.286678+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5MGZ2C5SGS7","created_at":"2026-07-04T15:08:20.286678+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5MGZ2C5SGS73RLY","created_at":"2026-07-04T15:08:20.286678+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5MGZ2C5","created_at":"2026-07-04T15:08:20.286678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08651","citing_title":"Reed-Muller Codes for Quantum Pauli and Multiple Access Channels","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB","json":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB.json","graph_json":"https://pith.science/api/pith-number/X5MGZ2C5SGS73RLYFJL3V4ZBGB/graph.json","events_json":"https://pith.science/api/pith-number/X5MGZ2C5SGS73RLYFJL3V4ZBGB/events.json","paper":"https://pith.science/paper/X5MGZ2C5"},"agent_actions":{"view_html":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB","download_json":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB.json","view_paper":"https://pith.science/paper/X5MGZ2C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9608026&json=true","fetch_graph":"https://pith.science/api/pith-number/X5MGZ2C5SGS73RLYFJL3V4ZBGB/graph.json","fetch_events":"https://pith.science/api/pith-number/X5MGZ2C5SGS73RLYFJL3V4ZBGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB/action/storage_attestation","attest_author":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB/action/author_attestation","sign_citation":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB/action/citation_signature","submit_replication":"https://pith.science/pith/X5MGZ2C5SGS73RLYFJL3V4ZBGB/action/replication_record"}},"created_at":"2026-07-04T15:08:20.286678+00:00","updated_at":"2026-07-04T15:08:20.286678+00:00"}