{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:DXUSTQ5TYQKLXB6OSWEEU5J5VR","short_pith_number":"pith:DXUSTQ5T","schema_version":"1.0","canonical_sha256":"1de929c3b3c414bb87ce95884a753dac4b34ccfc8c19894a7f84f41182f4a7f2","source":{"kind":"arxiv","id":"quant-ph/9612015","version":1},"attestation_state":"computed","paper":{"title":"Quantum Weight Enumerators","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eric M. Rains","submitted_at":"1996-12-02T18:17:00Z","abstract_excerpt":"In a recent paper ([quant-ph/9610040]), Shor and Laflamme define two ``weight enumerators'' for quantum error correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, clarifying the duality between Shor and Laflamme's enumerators. We also use the new enumerators to give a simpler condition for a quantum code to have specified minimum distance, a"},"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/9612015","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-12-02T18:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"bcfe83b5d5df55d4f895aaaecfb727401d9f54f366d160fb5bc538c15c033a1f","abstract_canon_sha256":"706deebff795d2b202ca4a191a28c9280cc640afa8c6990626461f56c2ced925"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:05.938371Z","signature_b64":"0+tUWgq7ptu7JdkRbMzqzy609bunDA+2xbNJBdiCdFR7Dm4qJMuqYRIB1WhasYPnHXL9oYyo7DL1FAe2RjyTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de929c3b3c414bb87ce95884a753dac4b34ccfc8c19894a7f84f41182f4a7f2","last_reissued_at":"2026-07-04T14:47:05.937879Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:05.937879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Weight Enumerators","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eric M. Rains","submitted_at":"1996-12-02T18:17:00Z","abstract_excerpt":"In a recent paper ([quant-ph/9610040]), Shor and Laflamme define two ``weight enumerators'' for quantum error correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, clarifying the duality between Shor and Laflamme's enumerators. We also use the new enumerators to give a simpler condition for a quantum code to have specified minimum distance, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9612015","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9612015/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/9612015","created_at":"2026-07-04T14:47:05.937937+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9612015v1","created_at":"2026-07-04T14:47:05.937937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9612015","created_at":"2026-07-04T14:47:05.937937+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXUSTQ5TYQKL","created_at":"2026-07-04T14:47:05.937937+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXUSTQ5TYQKLXB6O","created_at":"2026-07-04T14:47:05.937937+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXUSTQ5T","created_at":"2026-07-04T14:47:05.937937+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/DXUSTQ5TYQKLXB6OSWEEU5J5VR","json":"https://pith.science/pith/DXUSTQ5TYQKLXB6OSWEEU5J5VR.json","graph_json":"https://pith.science/api/pith-number/DXUSTQ5TYQKLXB6OSWEEU5J5VR/graph.json","events_json":"https://pith.science/api/pith-number/DXUSTQ5TYQKLXB6OSWEEU5J5VR/events.json","paper":"https://pith.science/paper/DXUSTQ5T"},"agent_actions":{"view_html":"https://pith.science/pith/DXUSTQ5TYQKLXB6OSWEEU5J5VR","download_json":"https://pith.science/pith/DXUSTQ5TYQKLXB6OSWEEU5J5VR.json","view_paper":"https://pith.science/paper/DXUSTQ5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9612015&json=true","fetch_graph":"https://pith.science/api/pith-number/DXUSTQ5TYQKLXB6OSWEEU5J5VR/graph.json","fetch_events":"https://pith.science/api/pith-number/DXUSTQ5TYQKLXB6OSWEEU5J5VR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXUSTQ5TYQKLXB6OSWEEU5J5VR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXUSTQ5TYQKLXB6OSWEEU5J5VR/action/storage_attestation","attest_author":"https://pith.science/pith/DXUSTQ5TYQKLXB6OSWEEU5J5VR/action/author_attestation","sign_citation":"https://pith.science/pith/DXUSTQ5TYQKLXB6OSWEEU5J5VR/action/citation_signature","submit_replication":"https://pith.science/pith/DXUSTQ5TYQKLXB6OSWEEU5J5VR/action/replication_record"}},"created_at":"2026-07-04T14:47:05.937937+00:00","updated_at":"2026-07-04T14:47:05.937937+00:00"}