{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ADYCRSBSFK3ACVPNT6N6N7C35F","short_pith_number":"pith:ADYCRSBS","canonical_record":{"source":{"id":"2606.25870","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-24T14:19:43Z","cross_cats_sorted":[],"title_canon_sha256":"0dbf565de47a7405d2daaf31d72c03b6f86038c3da019e029713590a217a431f","abstract_canon_sha256":"bf1ecb055a3b14e25390692ea186058c8d727290b8eb3d2ef89e92db60efe849"},"schema_version":"1.0"},"canonical_sha256":"00f028c8322ab60155ed9f9be6fc5be94f30eec55a6230fe5f3b550dde80430e","source":{"kind":"arxiv","id":"2606.25870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25870","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25870v1","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25870","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"ADYCRSBSFK3A","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"pith_short_16","alias_value":"ADYCRSBSFK3ACVPN","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"pith_short_8","alias_value":"ADYCRSBS","created_at":"2026-06-25T01:18:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ADYCRSBSFK3ACVPNT6N6N7C35F","target":"record","payload":{"canonical_record":{"source":{"id":"2606.25870","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-24T14:19:43Z","cross_cats_sorted":[],"title_canon_sha256":"0dbf565de47a7405d2daaf31d72c03b6f86038c3da019e029713590a217a431f","abstract_canon_sha256":"bf1ecb055a3b14e25390692ea186058c8d727290b8eb3d2ef89e92db60efe849"},"schema_version":"1.0"},"canonical_sha256":"00f028c8322ab60155ed9f9be6fc5be94f30eec55a6230fe5f3b550dde80430e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:41.837717Z","signature_b64":"SLTbHJBkYslStZJKhjt8Xpth85DUOr3lIGG072o5zpLeAX3RLbFRwhs4xzLBC4Htt+xQ01k6YAB6FlQjNO/XCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00f028c8322ab60155ed9f9be6fc5be94f30eec55a6230fe5f3b550dde80430e","last_reissued_at":"2026-06-25T01:18:41.837211Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:41.837211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.25870","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-06-25T01:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9kSY0S0uqXa8lnLJ492nj7ZtniJMJF50OWA9wMtfcvXOD+VsfRyqza9NfakLaxnZiN3+34ZTWd83Ho+G2wjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:43:15.039801Z"},"content_sha256":"507489560c9394d8fc496a122ff42160b93b64cf62ce4d97a367765868bff6ad","schema_version":"1.0","event_id":"sha256:507489560c9394d8fc496a122ff42160b93b64cf62ce4d97a367765868bff6ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ADYCRSBSFK3ACVPNT6N6N7C35F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evolving Quantum Error-Correcting Encodings for Molecular Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"James Brown, Kenny Heitritter, Tarini Hardikar","submitted_at":"2026-06-24T14:19:43Z","abstract_excerpt":"Useful quantum algorithms require many coupled discrete design choices. We study LLM-driven evolutionary program synthesis -- a language model edits a program, an external verifier scores the result, and high-scoring programs are retained and re-mutated -- as a tool for quantum-computing research. As a case study, we apply this loop to the Generalized Superfast Encoding (GSE), a fermion-to-qubit encoding whose prior molecular constructions reach code distance $3$. The search discovered interpretable constructor programs whose codes have \\emph{exact} distance $5$ on the molecular instances test"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25870","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.25870/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-06-25T01:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CF49ZZGKKJEeH9VeJpyO7Wdj/ErjLRBuMdJWdM6R8PVQohV2cK4ShKlu3giLqd4y0BOCWpM14pObr+v6VYyzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:43:15.040164Z"},"content_sha256":"28d30377d5eb2e91933b99df10cb740e4b0e7fba578d1465c1c104125494853f","schema_version":"1.0","event_id":"sha256:28d30377d5eb2e91933b99df10cb740e4b0e7fba578d1465c1c104125494853f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADYCRSBSFK3ACVPNT6N6N7C35F/bundle.json","state_url":"https://pith.science/pith/ADYCRSBSFK3ACVPNT6N6N7C35F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADYCRSBSFK3ACVPNT6N6N7C35F/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-06-29T19:43:15Z","links":{"resolver":"https://pith.science/pith/ADYCRSBSFK3ACVPNT6N6N7C35F","bundle":"https://pith.science/pith/ADYCRSBSFK3ACVPNT6N6N7C35F/bundle.json","state":"https://pith.science/pith/ADYCRSBSFK3ACVPNT6N6N7C35F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADYCRSBSFK3ACVPNT6N6N7C35F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ADYCRSBSFK3ACVPNT6N6N7C35F","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":"bf1ecb055a3b14e25390692ea186058c8d727290b8eb3d2ef89e92db60efe849","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-24T14:19:43Z","title_canon_sha256":"0dbf565de47a7405d2daaf31d72c03b6f86038c3da019e029713590a217a431f"},"schema_version":"1.0","source":{"id":"2606.25870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25870","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25870v1","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25870","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"ADYCRSBSFK3A","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"pith_short_16","alias_value":"ADYCRSBSFK3ACVPN","created_at":"2026-06-25T01:18:41Z"},{"alias_kind":"pith_short_8","alias_value":"ADYCRSBS","created_at":"2026-06-25T01:18:41Z"}],"graph_snapshots":[{"event_id":"sha256:28d30377d5eb2e91933b99df10cb740e4b0e7fba578d1465c1c104125494853f","target":"graph","created_at":"2026-06-25T01:18:41Z","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/2606.25870/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Useful quantum algorithms require many coupled discrete design choices. We study LLM-driven evolutionary program synthesis -- a language model edits a program, an external verifier scores the result, and high-scoring programs are retained and re-mutated -- as a tool for quantum-computing research. As a case study, we apply this loop to the Generalized Superfast Encoding (GSE), a fermion-to-qubit encoding whose prior molecular constructions reach code distance $3$. The search discovered interpretable constructor programs whose codes have \\emph{exact} distance $5$ on the molecular instances test","authors_text":"James Brown, Kenny Heitritter, Tarini Hardikar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-24T14:19:43Z","title":"Evolving Quantum Error-Correcting Encodings for Molecular Simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25870","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:507489560c9394d8fc496a122ff42160b93b64cf62ce4d97a367765868bff6ad","target":"record","created_at":"2026-06-25T01:18:41Z","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":"bf1ecb055a3b14e25390692ea186058c8d727290b8eb3d2ef89e92db60efe849","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-24T14:19:43Z","title_canon_sha256":"0dbf565de47a7405d2daaf31d72c03b6f86038c3da019e029713590a217a431f"},"schema_version":"1.0","source":{"id":"2606.25870","kind":"arxiv","version":1}},"canonical_sha256":"00f028c8322ab60155ed9f9be6fc5be94f30eec55a6230fe5f3b550dde80430e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00f028c8322ab60155ed9f9be6fc5be94f30eec55a6230fe5f3b550dde80430e","first_computed_at":"2026-06-25T01:18:41.837211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:41.837211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SLTbHJBkYslStZJKhjt8Xpth85DUOr3lIGG072o5zpLeAX3RLbFRwhs4xzLBC4Htt+xQ01k6YAB6FlQjNO/XCw==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:41.837717Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.25870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:507489560c9394d8fc496a122ff42160b93b64cf62ce4d97a367765868bff6ad","sha256:28d30377d5eb2e91933b99df10cb740e4b0e7fba578d1465c1c104125494853f"],"state_sha256":"8bea63412c5f2fe7caaa8c004f66117f5ce7f8a11c987133737dc77b0c58f722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCPfn8zZLlPSqvg1xEX5ML0jOO4j5y+r54yNqpT1KnGzTayeEFPC8gMZSvu/zurpsOCZ580OMm7czHyqOJkyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:43:15.042114Z","bundle_sha256":"7c497f1c590ecd38c94f75789ed7bbcd81488395e61d130175c3255b5aa728a6"}}