{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MBZNY3VCQXIXIKQO3H565UP3SA","short_pith_number":"pith:MBZNY3VC","canonical_record":{"source":{"id":"2607.04462","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-05T19:07:48Z","cross_cats_sorted":["cs.ET","cs.IT","math.IT"],"title_canon_sha256":"a389c4aab2492173601d673b5c81d6c77aeaee3a638d433bc476bd34e6faab80","abstract_canon_sha256":"099386aa6b4ae815d183fbaff916a447fb58071516b4181ffc594df0fb6e34ca"},"schema_version":"1.0"},"canonical_sha256":"6072dc6ea285d1742a0ed9fbeed1fb901f6912464dede416a1e37ffeb3db7d64","source":{"kind":"arxiv","id":"2607.04462","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MBZNY3VCQXIXIKQO3H565UP3SA","target":"record","payload":{"canonical_record":{"source":{"id":"2607.04462","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-05T19:07:48Z","cross_cats_sorted":["cs.ET","cs.IT","math.IT"],"title_canon_sha256":"a389c4aab2492173601d673b5c81d6c77aeaee3a638d433bc476bd34e6faab80","abstract_canon_sha256":"099386aa6b4ae815d183fbaff916a447fb58071516b4181ffc594df0fb6e34ca"},"schema_version":"1.0"},"canonical_sha256":"6072dc6ea285d1742a0ed9fbeed1fb901f6912464dede416a1e37ffeb3db7d64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:20.505723Z","signature_b64":"OYb74CrT8XSyS3wMYqZKZ3rinOFvU4j9AyhA4jnkmN7rS68PERLEJRTiItPmclh4w4Ro3bwOUCE4Q8DCLtcvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6072dc6ea285d1742a0ed9fbeed1fb901f6912464dede416a1e37ffeb3db7d64","last_reissued_at":"2026-07-07T02:19:20.504982Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:20.504982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.04462","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-07T02:19:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RrOA4cw5raI/WZmwa7Af7ChZ08rif8N5OtGWfx75FVs0u7ab56ql+IR6cd1Vy79wYIEQKNpMHayF2j5HUaX1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:48:43.483260Z"},"content_sha256":"722035ee46b66a9ab5f0976c9eedd522fe30da67650b95fbe607780f595a9736","schema_version":"1.0","event_id":"sha256:722035ee46b66a9ab5f0976c9eedd522fe30da67650b95fbe607780f595a9736"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MBZNY3VCQXIXIKQO3H565UP3SA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noise-Aware Synthesis of Quantum LDPC Encoder Circuits via Two-Sided Hamming Descent","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.ET","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Aditya Sodhani (1), Keshab K. Parhi (1) ((1) University of Minnesota)","submitted_at":"2026-07-05T19:07:48Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04462","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/2607.04462/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-07T02:19:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMFlqkQ6gcWjW5d78BWvIUQWjptaNLZ44cN9Xnvq8L5METzVZfpVssS++w8GPNwUQJu6D2MdHi1TjIjK8ULjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:48:43.483914Z"},"content_sha256":"f29bbd1af9a43d3af74d4c37854c5a4b9c7c949614f1c5efdafc6a7a36b93215","schema_version":"1.0","event_id":"sha256:f29bbd1af9a43d3af74d4c37854c5a4b9c7c949614f1c5efdafc6a7a36b93215"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBZNY3VCQXIXIKQO3H565UP3SA/bundle.json","state_url":"https://pith.science/pith/MBZNY3VCQXIXIKQO3H565UP3SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBZNY3VCQXIXIKQO3H565UP3SA/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-06T18:48:43Z","links":{"resolver":"https://pith.science/pith/MBZNY3VCQXIXIKQO3H565UP3SA","bundle":"https://pith.science/pith/MBZNY3VCQXIXIKQO3H565UP3SA/bundle.json","state":"https://pith.science/pith/MBZNY3VCQXIXIKQO3H565UP3SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBZNY3VCQXIXIKQO3H565UP3SA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xi5S4gYq3HMtwj9pCuw1dc08QIILKSPgrR8T0+RohYM7wUwmP46yJE4PWGVaJAzYPPkekvhXxwacpE5e5nc/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:48:43.489935Z","bundle_sha256":"9df76036035227d431c96bb9b113e8d24e652b75a439f93ab0033094556823e0"}}