{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I2UWNSTTQDJGLKRDMNPRHIPGC2","short_pith_number":"pith:I2UWNSTT","schema_version":"1.0","canonical_sha256":"46a966ca7380d265aa23635f13a1e61690a51316fc6f9135f53d8ce1313f8ac9","source":{"kind":"arxiv","id":"2502.14372","version":1},"attestation_state":"computed","paper":{"title":"Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Austin Yubo He, Zi-Wen Liu","submitted_at":"2025-02-20T09:05:34Z","abstract_excerpt":"The realization of scalable fault-tolerant quantum computing is expected to hinge on quantum error-correcting codes. In the quest for more efficient quantum fault tolerance, a critical code parameter is the weight of measurements that extract information about errors to enable error correction: as higher measurement weights require higher implementation costs and introduce more errors, it is important in code design to optimize measurement weight. This underlies the surging interest in quantum low-density parity-check (qLDPC) codes, the study of which has primarily focused on the asymptotic (l"},"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":"2502.14372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-20T09:05:34Z","cross_cats_sorted":["cs.AI","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"5161a9f9eb6882faf6a943409f8fe26a9532847f19764f77da33752bf8ebbc31","abstract_canon_sha256":"57ecaa651090d0d30a0c70552ecd2dcf813a6ce01657b15726417c79e09469d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:25.293222Z","signature_b64":"qS1d3sCwRHszv3hBXWYey7vz618iyTWNdhyHm1BCTpAxYPAiyuUVjqzTlKnclrZ13uclPxiplOz/ymqkXy94AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46a966ca7380d265aa23635f13a1e61690a51316fc6f9135f53d8ce1313f8ac9","last_reissued_at":"2026-07-05T10:17:25.292736Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:25.292736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Austin Yubo He, Zi-Wen Liu","submitted_at":"2025-02-20T09:05:34Z","abstract_excerpt":"The realization of scalable fault-tolerant quantum computing is expected to hinge on quantum error-correcting codes. In the quest for more efficient quantum fault tolerance, a critical code parameter is the weight of measurements that extract information about errors to enable error correction: as higher measurement weights require higher implementation costs and introduce more errors, it is important in code design to optimize measurement weight. This underlies the surging interest in quantum low-density parity-check (qLDPC) codes, the study of which has primarily focused on the asymptotic (l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.14372","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/2502.14372/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":"2502.14372","created_at":"2026-07-05T10:17:25.292794+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.14372v1","created_at":"2026-07-05T10:17:25.292794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.14372","created_at":"2026-07-05T10:17:25.292794+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2UWNSTTQDJG","created_at":"2026-07-05T10:17:25.292794+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2UWNSTTQDJGLKRD","created_at":"2026-07-05T10:17:25.292794+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2UWNSTT","created_at":"2026-07-05T10:17:25.292794+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24808","citing_title":"Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2506.11552","citing_title":"Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28846","citing_title":"Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations","ref_index":120,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2","json":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2.json","graph_json":"https://pith.science/api/pith-number/I2UWNSTTQDJGLKRDMNPRHIPGC2/graph.json","events_json":"https://pith.science/api/pith-number/I2UWNSTTQDJGLKRDMNPRHIPGC2/events.json","paper":"https://pith.science/paper/I2UWNSTT"},"agent_actions":{"view_html":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2","download_json":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2.json","view_paper":"https://pith.science/paper/I2UWNSTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.14372&json=true","fetch_graph":"https://pith.science/api/pith-number/I2UWNSTTQDJGLKRDMNPRHIPGC2/graph.json","fetch_events":"https://pith.science/api/pith-number/I2UWNSTTQDJGLKRDMNPRHIPGC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/action/storage_attestation","attest_author":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/action/author_attestation","sign_citation":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/action/citation_signature","submit_replication":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/action/replication_record"}},"created_at":"2026-07-05T10:17:25.292794+00:00","updated_at":"2026-07-05T10:17:25.292794+00:00"}