{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MBZNY3VCQXIXIKQO3H565UP3SA","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":"099386aa6b4ae815d183fbaff916a447fb58071516b4181ffc594df0fb6e34ca","cross_cats_sorted":["cs.ET","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-05T19:07:48Z","title_canon_sha256":"a389c4aab2492173601d673b5c81d6c77aeaee3a638d433bc476bd34e6faab80"},"schema_version":"1.0","source":{"id":"2607.04462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04462","created_at":"2026-07-07T02:19:20Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04462v1","created_at":"2026-07-07T02:19:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04462","created_at":"2026-07-07T02:19:20Z"},{"alias_kind":"pith_short_12","alias_value":"MBZNY3VCQXIX","created_at":"2026-07-07T02:19:20Z"},{"alias_kind":"pith_short_16","alias_value":"MBZNY3VCQXIXIKQO","created_at":"2026-07-07T02:19:20Z"},{"alias_kind":"pith_short_8","alias_value":"MBZNY3VC","created_at":"2026-07-07T02:19:20Z"}],"graph_snapshots":[{"event_id":"sha256:f29bbd1af9a43d3af74d4c37854c5a4b9c7c949614f1c5efdafc6a7a36b93215","target":"graph","created_at":"2026-07-07T02:19:20Z","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/2607.04462/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum low-density parity-check (LDPC) codes are a promising route to fault-tolerant quantum computation, but their use requires efficient preparation of encoded states. Standard encoder constructions generate circuits through fixed algebraic procedures, yet the resulting circuit can contain substantial redundancy. We formulate LDPC encoder preparation as a circuit-resynthesis problem: given the linear-reversible matrix implemented by the encoder's CNOT block, we seek a lower-cost equivalent circuit that can be routed efficiently on the target hardware and which mitigates noise. We propose a ","authors_text":"Aditya Sodhani (1), Keshab K. Parhi (1) ((1) University of Minnesota)","cross_cats":["cs.ET","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-05T19:07:48Z","title":"Noise-Aware Synthesis of Quantum LDPC Encoder Circuits via Two-Sided Hamming Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04462","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:722035ee46b66a9ab5f0976c9eedd522fe30da67650b95fbe607780f595a9736","target":"record","created_at":"2026-07-07T02:19:20Z","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":"099386aa6b4ae815d183fbaff916a447fb58071516b4181ffc594df0fb6e34ca","cross_cats_sorted":["cs.ET","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-05T19:07:48Z","title_canon_sha256":"a389c4aab2492173601d673b5c81d6c77aeaee3a638d433bc476bd34e6faab80"},"schema_version":"1.0","source":{"id":"2607.04462","kind":"arxiv","version":1}},"canonical_sha256":"6072dc6ea285d1742a0ed9fbeed1fb901f6912464dede416a1e37ffeb3db7d64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6072dc6ea285d1742a0ed9fbeed1fb901f6912464dede416a1e37ffeb3db7d64","first_computed_at":"2026-07-07T02:19:20.504982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:20.504982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OYb74CrT8XSyS3wMYqZKZ3rinOFvU4j9AyhA4jnkmN7rS68PERLEJRTiItPmclh4w4Ro3bwOUCE4Q8DCLtcvBw==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:20.505723Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:722035ee46b66a9ab5f0976c9eedd522fe30da67650b95fbe607780f595a9736","sha256:f29bbd1af9a43d3af74d4c37854c5a4b9c7c949614f1c5efdafc6a7a36b93215"],"state_sha256":"bb83e5a3f277bee0e646df66b4031a1dfc544b26aeea6a424047a87ec9861217"}