{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PI46LC7KMIT3PMG747ZFWOLKGA","short_pith_number":"pith:PI46LC7K","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"},"canonical_sha256":"7a39e58bea6227b7b0dfe7f25b396a303d0e40857317ac24dafc52cf9d39b3c7","source":{"kind":"arxiv","id":"2608.08996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08996","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08996v1","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08996","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"PI46LC7KMIT3","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"PI46LC7KMIT3PMG7","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"PI46LC7K","created_at":"2026-08-11T01:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PI46LC7KMIT3PMG747ZFWOLKGA","target":"record","payload":{"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"},"canonical_sha256":"7a39e58bea6227b7b0dfe7f25b396a303d0e40857317ac24dafc52cf9d39b3c7","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"},"source_kind":"arxiv","source_id":"2608.08996","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-08-11T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qorK8Mt/M+IgctOjBDaprl57Hf185yudrW3OBoP1WEvG8zMNoeVv1B3xHmQP8q3SdA+YWU1IMbzLybcRGUyOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:30:53.454692Z"},"content_sha256":"654368c964b131d88b97d088cb8ddfaf88ad1eb35a20f34c3d805af7b0ce3261","schema_version":"1.0","event_id":"sha256:654368c964b131d88b97d088cb8ddfaf88ad1eb35a20f34c3d805af7b0ce3261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PI46LC7KMIT3PMG747ZFWOLKGA","target":"graph","payload":{"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"},"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-08-11T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0173r8lsNrcsGBz9JkmdvXjwKmBeqUJiG0ivFXQZw05zvEpuWq1NMAul24vY0STEFTiOFD8A0SCRQcYuGA9nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:30:53.482769Z"},"content_sha256":"9937ca3b246a102537b8373d8bc4708463bd713c9a28a08c5a66ec60e075fd20","schema_version":"1.0","event_id":"sha256:9937ca3b246a102537b8373d8bc4708463bd713c9a28a08c5a66ec60e075fd20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/bundle.json","state_url":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PI46LC7KMIT3PMG747ZFWOLKGA/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-14T19:30:53Z","links":{"resolver":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA","bundle":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/bundle.json","state":"https://pith.science/pith/PI46LC7KMIT3PMG747ZFWOLKGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PI46LC7KMIT3PMG747ZFWOLKGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PI46LC7KMIT3PMG747ZFWOLKGA","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":"47f222672cca63c2cfcb1e2c032cd855d8e6f440739c133374d8fe9aaa201910","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-10T01:32:34Z","title_canon_sha256":"17b7b2cb527fae6d4974385129cef46c0ba7078271cc6a8da8b858228151e3e9"},"schema_version":"1.0","source":{"id":"2608.08996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08996","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08996v1","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08996","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"PI46LC7KMIT3","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"PI46LC7KMIT3PMG7","created_at":"2026-08-11T01:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"PI46LC7K","created_at":"2026-08-11T01:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:9937ca3b246a102537b8373d8bc4708463bd713c9a28a08c5a66ec60e075fd20","target":"graph","created_at":"2026-08-11T01:25:55Z","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/2608.08996/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dongheng Qian, Tianyi Li","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-10T01:32:34Z","title":"Multi-agent discovery of practical quantum LDPC codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08996","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:654368c964b131d88b97d088cb8ddfaf88ad1eb35a20f34c3d805af7b0ce3261","target":"record","created_at":"2026-08-11T01:25:55Z","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":"47f222672cca63c2cfcb1e2c032cd855d8e6f440739c133374d8fe9aaa201910","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-10T01:32:34Z","title_canon_sha256":"17b7b2cb527fae6d4974385129cef46c0ba7078271cc6a8da8b858228151e3e9"},"schema_version":"1.0","source":{"id":"2608.08996","kind":"arxiv","version":1}},"canonical_sha256":"7a39e58bea6227b7b0dfe7f25b396a303d0e40857317ac24dafc52cf9d39b3c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a39e58bea6227b7b0dfe7f25b396a303d0e40857317ac24dafc52cf9d39b3c7","first_computed_at":"2026-08-11T01:25:55.826069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:25:55.826069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zgBBV7JtFMjYdZ+nskUsR30J5brkNAX9TyxWOETqxvgVzJYs6YPQ23h3JxvkpkLCD72kgIv7/+yF1DdMyDX8Ag==","signature_status":"signed_v1","signed_at":"2026-08-11T01:25:55.828541Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.08996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:654368c964b131d88b97d088cb8ddfaf88ad1eb35a20f34c3d805af7b0ce3261","sha256:9937ca3b246a102537b8373d8bc4708463bd713c9a28a08c5a66ec60e075fd20"],"state_sha256":"35fc207f0bae089724927f30f2e2e819b7d10b3396758ce7bd3c58e86b40360e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RuGLWjIQlCJxCRHr3hqspfE8AoIv9XBQTmZT/p9IBn/NmMDDBjUrScA+jFbSY1brP4vqAWGwnfoE71l37VGAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T19:30:53.492874Z","bundle_sha256":"d560ba1a44315424268a75aa4b63d9924313b5a6c2cafd1fcc89a35924feec2c"}}