{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PI46LC7KMIT3PMG747ZFWOLKGA","short_pith_number":"pith:PI46LC7K","schema_version":"1.0","canonical_sha256":"7a39e58bea6227b7b0dfe7f25b396a303d0e40857317ac24dafc52cf9d39b3c7","source":{"kind":"arxiv","id":"2608.08996","version":1},"attestation_state":"computed","paper":{"title":"Multi-agent discovery of practical quantum LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Dongheng Qian, Tianyi Li","submitted_at":"2026-08-10T01:32:34Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks, yet searching for useful finite-length instances remains a challenging design problem because code performance must be optimized while satisfying practical constraints. Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes. The framework combines specialist proposal and review, persistent scientific memory, long-horizon evolution of executable programs, and deterministic construc"},"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":"2608.08996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-10T01:32:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"17b7b2cb527fae6d4974385129cef46c0ba7078271cc6a8da8b858228151e3e9","abstract_canon_sha256":"47f222672cca63c2cfcb1e2c032cd855d8e6f440739c133374d8fe9aaa201910"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:25:55.828541Z","signature_b64":"zgBBV7JtFMjYdZ+nskUsR30J5brkNAX9TyxWOETqxvgVzJYs6YPQ23h3JxvkpkLCD72kgIv7/+yF1DdMyDX8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a39e58bea6227b7b0dfe7f25b396a303d0e40857317ac24dafc52cf9d39b3c7","last_reissued_at":"2026-08-11T01:25:55.826069Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:25:55.826069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-agent discovery of practical quantum LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Dongheng Qian, Tianyi Li","submitted_at":"2026-08-10T01:32:34Z","abstract_excerpt":"Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks, yet searching for useful finite-length instances remains a challenging design problem because code performance must be optimized while satisfying practical constraints. Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes. The framework combines specialist proposal and review, persistent scientific memory, long-horizon evolution of executable programs, and deterministic construc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08996","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/2608.08996/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":"2608.08996","created_at":"2026-08-11T01:25:55.826914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08996v1","created_at":"2026-08-11T01:25:55.826914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08996","created_at":"2026-08-11T01:25:55.826914+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI46LC7KMIT3","created_at":"2026-08-11T01:25:55.826914+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI46LC7KMIT3PMG7","created_at":"2026-08-11T01:25:55.826914+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI46LC7K","created_at":"2026-08-11T01:25:55.826914+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/PI46LC7KMIT3PMG747ZFWOLKGA","json":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA.json","graph_json":"https://pith.science/api/pith-number/PI46LC7KMIT3PMG747ZFWOLKGA/graph.json","events_json":"https://pith.science/api/pith-number/PI46LC7KMIT3PMG747ZFWOLKGA/events.json","paper":"https://pith.science/paper/PI46LC7K"},"agent_actions":{"view_html":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA","download_json":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA.json","view_paper":"https://pith.science/paper/PI46LC7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08996&json=true","fetch_graph":"https://pith.science/api/pith-number/PI46LC7KMIT3PMG747ZFWOLKGA/graph.json","fetch_events":"https://pith.science/api/pith-number/PI46LC7KMIT3PMG747ZFWOLKGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/action/storage_attestation","attest_author":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/action/author_attestation","sign_citation":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/action/citation_signature","submit_replication":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/action/replication_record"}},"created_at":"2026-08-11T01:25:55.826914+00:00","updated_at":"2026-08-11T01:25:55.826914+00:00"}