{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NJTOVY3J54RTUSYZNNCAO2MLOL","short_pith_number":"pith:NJTOVY3J","schema_version":"1.0","canonical_sha256":"6a66eae369ef233a4b196b4407698b72d394d4fca5387033d744437a183f3c9f","source":{"kind":"arxiv","id":"2603.22532","version":2},"attestation_state":"computed","paper":{"title":"Distance-Finding Algorithms for Quantum Codes and Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abraham Jacob, Mark Webster, Oscar Higgott","submitted_at":"2026-03-23T19:52:23Z","abstract_excerpt":"The distance of a classical or quantum code is a key figure of merit which reflects its capacity to detect errors. Quantum LDPC code families have considerable promise in reducing the overhead required for fault-tolerant quantum computation, but calculating their distance is challenging with existing methods. We generally assess the performance of a quantum code under circuit level error models, and for such scenarios the circuit distance is an important consideration. Calculating circuit distance is in general more difficult than finding the distance of the corresponding code as the detector "},"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":"2603.22532","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-23T19:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"21592a7ac3b88856c58396fa925bb203246764c6761b47b9e0805bb8beea23a7","abstract_canon_sha256":"c84316bf9c03b4eb13d5d79105425eaca0cd609d53e8b1b85e940e0b52103256"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-17T01:09:56.355090Z","signature_b64":"In9Q7t8JqNcHBL1uG799+OasLzuuSaiw/AnJkDzUUF+VzBf+0FBnVqjIvOvJJkq2RxvcJJeLTKnaPuh6cZi6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a66eae369ef233a4b196b4407698b72d394d4fca5387033d744437a183f3c9f","last_reissued_at":"2026-08-17T01:09:56.352788Z","signature_status":"signed_v1","first_computed_at":"2026-08-17T01:09:56.352788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance-Finding Algorithms for Quantum Codes and Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abraham Jacob, Mark Webster, Oscar Higgott","submitted_at":"2026-03-23T19:52:23Z","abstract_excerpt":"The distance of a classical or quantum code is a key figure of merit which reflects its capacity to detect errors. Quantum LDPC code families have considerable promise in reducing the overhead required for fault-tolerant quantum computation, but calculating their distance is challenging with existing methods. We generally assess the performance of a quantum code under circuit level error models, and for such scenarios the circuit distance is an important consideration. Calculating circuit distance is in general more difficult than finding the distance of the corresponding code as the detector "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.22532","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/2603.22532/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":"2603.22532","created_at":"2026-08-17T01:09:56.353305+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.22532v2","created_at":"2026-08-17T01:09:56.353305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.22532","created_at":"2026-08-17T01:09:56.353305+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJTOVY3J54RT","created_at":"2026-08-17T01:09:56.353305+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJTOVY3J54RTUSYZ","created_at":"2026-08-17T01:09:56.353305+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJTOVY3J","created_at":"2026-08-17T01:09:56.353305+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":8,"sample":[{"citing_arxiv_id":"2606.25870","citing_title":"Evolving Quantum Error-Correcting Encodings for Molecular Simulation","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20263","citing_title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","ref_index":106,"is_internal_anchor":true},{"citing_arxiv_id":"2606.03507","citing_title":"Full Extractors for Logical Processing in Hypergraph Product Codes","ref_index":85,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12445","citing_title":"SAT, MaxSAT, and SMT for QLDPC Distance Computation: A Large-Scale Empirical Study","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15348","citing_title":"Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14173","citing_title":"Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":164,"is_internal_anchor":true},{"citing_arxiv_id":"2604.09797","citing_title":"Optimising Quantum Error Correction Using Morphing Circuits","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL","json":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL.json","graph_json":"https://pith.science/api/pith-number/NJTOVY3J54RTUSYZNNCAO2MLOL/graph.json","events_json":"https://pith.science/api/pith-number/NJTOVY3J54RTUSYZNNCAO2MLOL/events.json","paper":"https://pith.science/paper/NJTOVY3J"},"agent_actions":{"view_html":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL","download_json":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL.json","view_paper":"https://pith.science/paper/NJTOVY3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.22532&json=true","fetch_graph":"https://pith.science/api/pith-number/NJTOVY3J54RTUSYZNNCAO2MLOL/graph.json","fetch_events":"https://pith.science/api/pith-number/NJTOVY3J54RTUSYZNNCAO2MLOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/action/storage_attestation","attest_author":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/action/author_attestation","sign_citation":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/action/citation_signature","submit_replication":"https://pith.science/pith/NJTOVY3J54RTUSYZNNCAO2MLOL/action/replication_record"}},"created_at":"2026-08-17T01:09:56.353305+00:00","updated_at":"2026-08-17T01:09:56.353305+00:00"}