{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UGY5KDY4W7SRTNAQXNKX5UHYBM","short_pith_number":"pith:UGY5KDY4","schema_version":"1.0","canonical_sha256":"a1b1d50f1cb7e519b410bb557ed0f80b3ff442528a6f5120960a078e1a7fd211","source":{"kind":"arxiv","id":"2606.12445","version":1},"attestation_state":"computed","paper":{"title":"SAT, MaxSAT, and SMT for QLDPC Distance Computation: A Large-Scale Empirical Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PL","math.IT"],"primary_cat":"quant-ph","authors_text":"Ching-Yi Lai, Seyed Mohammad Reza Jafari, Yu-Fang Chen","submitted_at":"2026-05-29T15:34:33Z","abstract_excerpt":"Exact distance computation for quantum LDPC (QLDPC) codes plays a central role in validating candidate fault-tolerant quantum-code constructions, yet the computational structure of this problem remains poorly understood. Despite substantial recent progress in QLDPC design, it remains unclear which algorithmic principles govern the practical scalability of exact distance computation and which classes of exact solvers are best suited to this task. To address these questions, we conduct a systematic study of SAT- and MaxSAT-based formulations for exact QLDPC distance computation across representa"},"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":"2606.12445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-29T15:34:33Z","cross_cats_sorted":["cs.IT","cs.PL","math.IT"],"title_canon_sha256":"6f1a3fbb91608d742beec2d8722518c43ca60f78af32f41c8d2df852fe7891e4","abstract_canon_sha256":"c7b2788787d9b0cba9bb4a2001e0f8b29ba870f7e567a117bb6f50b7af213bdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T00:07:50.957530Z","signature_b64":"I+l6bppiTzKN4D8tfXhfelpVdnGB7ygfkV5xu1yy4uzXpGCjJucK7QR3UsKySS5bc7i0sPgRx8Zxdghz2JdLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1b1d50f1cb7e519b410bb557ed0f80b3ff442528a6f5120960a078e1a7fd211","last_reissued_at":"2026-06-12T00:07:50.957081Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T00:07:50.957081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAT, MaxSAT, and SMT for QLDPC Distance Computation: A Large-Scale Empirical Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PL","math.IT"],"primary_cat":"quant-ph","authors_text":"Ching-Yi Lai, Seyed Mohammad Reza Jafari, Yu-Fang Chen","submitted_at":"2026-05-29T15:34:33Z","abstract_excerpt":"Exact distance computation for quantum LDPC (QLDPC) codes plays a central role in validating candidate fault-tolerant quantum-code constructions, yet the computational structure of this problem remains poorly understood. Despite substantial recent progress in QLDPC design, it remains unclear which algorithmic principles govern the practical scalability of exact distance computation and which classes of exact solvers are best suited to this task. To address these questions, we conduct a systematic study of SAT- and MaxSAT-based formulations for exact QLDPC distance computation across representa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12445","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/2606.12445/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":"2606.12445","created_at":"2026-06-12T00:07:50.957144+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12445v1","created_at":"2026-06-12T00:07:50.957144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12445","created_at":"2026-06-12T00:07:50.957144+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGY5KDY4W7SR","created_at":"2026-06-12T00:07:50.957144+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGY5KDY4W7SRTNAQ","created_at":"2026-06-12T00:07:50.957144+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGY5KDY4","created_at":"2026-06-12T00:07:50.957144+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/UGY5KDY4W7SRTNAQXNKX5UHYBM","json":"https://pith.science/pith/UGY5KDY4W7SRTNAQXNKX5UHYBM.json","graph_json":"https://pith.science/api/pith-number/UGY5KDY4W7SRTNAQXNKX5UHYBM/graph.json","events_json":"https://pith.science/api/pith-number/UGY5KDY4W7SRTNAQXNKX5UHYBM/events.json","paper":"https://pith.science/paper/UGY5KDY4"},"agent_actions":{"view_html":"https://pith.science/pith/UGY5KDY4W7SRTNAQXNKX5UHYBM","download_json":"https://pith.science/pith/UGY5KDY4W7SRTNAQXNKX5UHYBM.json","view_paper":"https://pith.science/paper/UGY5KDY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12445&json=true","fetch_graph":"https://pith.science/api/pith-number/UGY5KDY4W7SRTNAQXNKX5UHYBM/graph.json","fetch_events":"https://pith.science/api/pith-number/UGY5KDY4W7SRTNAQXNKX5UHYBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGY5KDY4W7SRTNAQXNKX5UHYBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGY5KDY4W7SRTNAQXNKX5UHYBM/action/storage_attestation","attest_author":"https://pith.science/pith/UGY5KDY4W7SRTNAQXNKX5UHYBM/action/author_attestation","sign_citation":"https://pith.science/pith/UGY5KDY4W7SRTNAQXNKX5UHYBM/action/citation_signature","submit_replication":"https://pith.science/pith/UGY5KDY4W7SRTNAQXNKX5UHYBM/action/replication_record"}},"created_at":"2026-06-12T00:07:50.957144+00:00","updated_at":"2026-06-12T00:07:50.957144+00:00"}