{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:I2UWNSTTQDJGLKRDMNPRHIPGC2","short_pith_number":"pith:I2UWNSTT","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"},"canonical_sha256":"46a966ca7380d265aa23635f13a1e61690a51316fc6f9135f53d8ce1313f8ac9","source":{"kind":"arxiv","id":"2502.14372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.14372","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2502.14372v1","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.14372","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"I2UWNSTTQDJG","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"I2UWNSTTQDJGLKRD","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"I2UWNSTT","created_at":"2026-07-05T10:17:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:I2UWNSTTQDJGLKRDMNPRHIPGC2","target":"record","payload":{"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"},"canonical_sha256":"46a966ca7380d265aa23635f13a1e61690a51316fc6f9135f53d8ce1313f8ac9","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"},"source_kind":"arxiv","source_id":"2502.14372","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MdDWYZ+7eatjTVDdJe3M9gGzBF38NfHqNXMg5kCqVx1ipDel9rx5dCgkNTpWutOX1erGhoDm3NVHzMWiAYg6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T13:28:35.206367Z"},"content_sha256":"b567be8bab8fa9750d445647a4999d8fb6ac1a34ac0c0a231f2fa98d0219bb8a","schema_version":"1.0","event_id":"sha256:b567be8bab8fa9750d445647a4999d8fb6ac1a34ac0c0a231f2fa98d0219bb8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:I2UWNSTTQDJGLKRDMNPRHIPGC2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXOhNiOCQSfx9VeZiHMk3ivATb4piWklhs+O9A9Xp6rVoGiPwbPe0R3BQSUMhz+Wl986Ijc3nQ+kg8ehigWxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T13:28:35.206902Z"},"content_sha256":"d8563ef4caf33888c310e3cabfbe2dd392c0d7fbe47ac9050351aaca04fed419","schema_version":"1.0","event_id":"sha256:d8563ef4caf33888c310e3cabfbe2dd392c0d7fbe47ac9050351aaca04fed419"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/bundle.json","state_url":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T13:28:35Z","links":{"resolver":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2","bundle":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/bundle.json","state":"https://pith.science/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2UWNSTTQDJGLKRDMNPRHIPGC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:I2UWNSTTQDJGLKRDMNPRHIPGC2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"57ecaa651090d0d30a0c70552ecd2dcf813a6ce01657b15726417c79e09469d9","cross_cats_sorted":["cs.AI","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-20T09:05:34Z","title_canon_sha256":"5161a9f9eb6882faf6a943409f8fe26a9532847f19764f77da33752bf8ebbc31"},"schema_version":"1.0","source":{"id":"2502.14372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.14372","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2502.14372v1","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.14372","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"I2UWNSTTQDJG","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"I2UWNSTTQDJGLKRD","created_at":"2026-07-05T10:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"I2UWNSTT","created_at":"2026-07-05T10:17:25Z"}],"graph_snapshots":[{"event_id":"sha256:d8563ef4caf33888c310e3cabfbe2dd392c0d7fbe47ac9050351aaca04fed419","target":"graph","created_at":"2026-07-05T10:17:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.14372/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Austin Yubo He, Zi-Wen Liu","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-20T09:05:34Z","title":"Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.14372","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b567be8bab8fa9750d445647a4999d8fb6ac1a34ac0c0a231f2fa98d0219bb8a","target":"record","created_at":"2026-07-05T10:17:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"57ecaa651090d0d30a0c70552ecd2dcf813a6ce01657b15726417c79e09469d9","cross_cats_sorted":["cs.AI","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-20T09:05:34Z","title_canon_sha256":"5161a9f9eb6882faf6a943409f8fe26a9532847f19764f77da33752bf8ebbc31"},"schema_version":"1.0","source":{"id":"2502.14372","kind":"arxiv","version":1}},"canonical_sha256":"46a966ca7380d265aa23635f13a1e61690a51316fc6f9135f53d8ce1313f8ac9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46a966ca7380d265aa23635f13a1e61690a51316fc6f9135f53d8ce1313f8ac9","first_computed_at":"2026-07-05T10:17:25.292736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:17:25.292736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qS1d3sCwRHszv3hBXWYey7vz618iyTWNdhyHm1BCTpAxYPAiyuUVjqzTlKnclrZ13uclPxiplOz/ymqkXy94AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:17:25.293222Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.14372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b567be8bab8fa9750d445647a4999d8fb6ac1a34ac0c0a231f2fa98d0219bb8a","sha256:d8563ef4caf33888c310e3cabfbe2dd392c0d7fbe47ac9050351aaca04fed419"],"state_sha256":"657552b88e4019657b49c55dde27e83b6702ae50c89d5c1e21d3fd47197930b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdyqBBf5mMoLeAZtzUFVC7fh6jEtGZv13C+1ukb1QGPz0sAUi8beTtfLZ0lKl8jnt8R0WdZEvREDUoy1cWFxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T13:28:35.211365Z","bundle_sha256":"c559927c057051aa968223514ae41b2130ad22f4bfcb9f0e31e8de45750791d9"}}