{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ENJQRKT2NTJZ2RZUQJLRXJWMVQ","short_pith_number":"pith:ENJQRKT2","schema_version":"1.0","canonical_sha256":"235308aa7a6cd39d473482571ba6ccac0b3abe38ced4eb4470abb8667e21bbd6","source":{"kind":"arxiv","id":"2601.18879","version":2},"attestation_state":"computed","paper":{"title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Feroz Ahmed Mian, Owen Gwilliam, Stefan Krastanov","submitted_at":"2026-01-26T19:00:03Z","abstract_excerpt":"We introduce multivariate multicycle (MM) codes, a new family of quantum error-correcting codes (QECCs) that unifies bivariate bicycle, multivariate bicycle, abelian two-block group algebra, generalized bicycle, trivariate tricycle, and toric codes. MM codes are Calderbank-Shor-Steane (CSS) codes defined from length-$\\textit{t+1}$ chain complexes with $\\textit{$t \\ge 4$}$. The chief advantage of these codes is that they possess metachecks and high confinement that permit complete single-shot decoding. We offer a framework that facilitates the construction of long-length chain complexes through"},"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":"2601.18879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-01-26T19:00:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a2dd4ce5a75cd0d262bfd75293d080a2ae96df824249d0eb092423350c9766a4","abstract_canon_sha256":"d69fa307d478e807036f4f72fb9a1be850aba81f71cdf9317002cf1d5424cf3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:23.166500Z","signature_b64":"negR6VAsOtHO70QI7Yw3uETyaJJQwltEq/OuNdf6FCY2aeAfMKtuwX7ngNvC4b4Fpq30WLVjb73gPagAGuKUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"235308aa7a6cd39d473482571ba6ccac0b3abe38ced4eb4470abb8667e21bbd6","last_reissued_at":"2026-05-26T01:03:23.165583Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:23.165583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Feroz Ahmed Mian, Owen Gwilliam, Stefan Krastanov","submitted_at":"2026-01-26T19:00:03Z","abstract_excerpt":"We introduce multivariate multicycle (MM) codes, a new family of quantum error-correcting codes (QECCs) that unifies bivariate bicycle, multivariate bicycle, abelian two-block group algebra, generalized bicycle, trivariate tricycle, and toric codes. MM codes are Calderbank-Shor-Steane (CSS) codes defined from length-$\\textit{t+1}$ chain complexes with $\\textit{$t \\ge 4$}$. The chief advantage of these codes is that they possess metachecks and high confinement that permit complete single-shot decoding. We offer a framework that facilitates the construction of long-length chain complexes through"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.18879","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/2601.18879/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":"2601.18879","created_at":"2026-05-26T01:03:23.165707+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.18879v2","created_at":"2026-05-26T01:03:23.165707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.18879","created_at":"2026-05-26T01:03:23.165707+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENJQRKT2NTJZ","created_at":"2026-05-26T01:03:23.165707+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENJQRKT2NTJZ2RZU","created_at":"2026-05-26T01:03:23.165707+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENJQRKT2","created_at":"2026-05-26T01:03:23.165707+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.31441","citing_title":"Intrinsic locality dimension of quantum codes","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":161,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ","json":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ.json","graph_json":"https://pith.science/api/pith-number/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/graph.json","events_json":"https://pith.science/api/pith-number/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/events.json","paper":"https://pith.science/paper/ENJQRKT2"},"agent_actions":{"view_html":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ","download_json":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ.json","view_paper":"https://pith.science/paper/ENJQRKT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.18879&json=true","fetch_graph":"https://pith.science/api/pith-number/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/action/storage_attestation","attest_author":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/action/author_attestation","sign_citation":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/action/citation_signature","submit_replication":"https://pith.science/pith/ENJQRKT2NTJZ2RZUQJLRXJWMVQ/action/replication_record"}},"created_at":"2026-05-26T01:03:23.165707+00:00","updated_at":"2026-05-26T01:03:23.165707+00:00"}