{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4IQSZCPHMIXRUUFPY42XE3WIR3","short_pith_number":"pith:4IQSZCPH","schema_version":"1.0","canonical_sha256":"e2212c89e7622f1a50afc735726ec88ef5fa37feee0ca76b817ee8ea5da71943","source":{"kind":"arxiv","id":"2107.09684","version":2},"attestation_state":"computed","paper":{"title":"Classification of Small Triorthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jeongwan Haah, Sepehr Nezami","submitted_at":"2021-07-20T18:00:08Z","abstract_excerpt":"Triorthogonal codes are a class of quantum error correcting codes used in magic state distillation protocols. We classify all triorthogonal codes with $n+k \\le 38$, where $n$ is the number of physical qubits and $k$ is the number of logical qubits of the code. We find $38$ distinguished triorthogonal subspaces and show that every triorthogonal code with $n+k\\le 38$ descends from one of these subspaces through elementary operations such as puncturing and deleting qubits. Specifically, we associate each triorthogonal code with a Reed-Muller polynomial of weight $n+k$, and classify the Reed-Mulle"},"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":"2107.09684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-20T18:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"b6ea1dbe8f3b43a28722766d18cfc1918a48d0e4a01119748f699d4ee58422e1","abstract_canon_sha256":"678eb5376bb80813e47b08a7c7294135ec988d409f1a24d265795e4076cbdc22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:18.325267Z","signature_b64":"gEymGVHXemE6zuFA1e5dQ2+LgJ+7LBGEuoDMTSydTvII3b8cS8QNiRoc5MvADRQ6lFEQg7rgdQryvtM8nU30Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2212c89e7622f1a50afc735726ec88ef5fa37feee0ca76b817ee8ea5da71943","last_reissued_at":"2026-07-05T04:44:18.324767Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:18.324767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of Small Triorthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jeongwan Haah, Sepehr Nezami","submitted_at":"2021-07-20T18:00:08Z","abstract_excerpt":"Triorthogonal codes are a class of quantum error correcting codes used in magic state distillation protocols. We classify all triorthogonal codes with $n+k \\le 38$, where $n$ is the number of physical qubits and $k$ is the number of logical qubits of the code. We find $38$ distinguished triorthogonal subspaces and show that every triorthogonal code with $n+k\\le 38$ descends from one of these subspaces through elementary operations such as puncturing and deleting qubits. Specifically, we associate each triorthogonal code with a Reed-Muller polynomial of weight $n+k$, and classify the Reed-Mulle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.09684","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/2107.09684/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":"2107.09684","created_at":"2026-07-05T04:44:18.324826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.09684v2","created_at":"2026-07-05T04:44:18.324826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.09684","created_at":"2026-07-05T04:44:18.324826+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IQSZCPHMIXR","created_at":"2026-07-05T04:44:18.324826+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IQSZCPHMIXRUUFP","created_at":"2026-07-05T04:44:18.324826+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IQSZCPH","created_at":"2026-07-05T04:44:18.324826+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28518","citing_title":"Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3","json":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3.json","graph_json":"https://pith.science/api/pith-number/4IQSZCPHMIXRUUFPY42XE3WIR3/graph.json","events_json":"https://pith.science/api/pith-number/4IQSZCPHMIXRUUFPY42XE3WIR3/events.json","paper":"https://pith.science/paper/4IQSZCPH"},"agent_actions":{"view_html":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3","download_json":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3.json","view_paper":"https://pith.science/paper/4IQSZCPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.09684&json=true","fetch_graph":"https://pith.science/api/pith-number/4IQSZCPHMIXRUUFPY42XE3WIR3/graph.json","fetch_events":"https://pith.science/api/pith-number/4IQSZCPHMIXRUUFPY42XE3WIR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3/action/storage_attestation","attest_author":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3/action/author_attestation","sign_citation":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3/action/citation_signature","submit_replication":"https://pith.science/pith/4IQSZCPHMIXRUUFPY42XE3WIR3/action/replication_record"}},"created_at":"2026-07-05T04:44:18.324826+00:00","updated_at":"2026-07-05T04:44:18.324826+00:00"}