{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RSAN2B4CLS5CSKIQ7QWFUQXQCT","short_pith_number":"pith:RSAN2B4C","canonical_record":{"source":{"id":"2608.09578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-10T13:13:54Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"7dd2a8c69564fd244f6af46f7f59d8ff7cedc5c983764ad057241360312646ee","abstract_canon_sha256":"97d6b113b17d2eb0afe083712040773749f918b6a45d7b4672f2d40d1052cc9c"},"schema_version":"1.0"},"canonical_sha256":"8c80dd07825cba292910fc2c5a42f014ee15fa45c4ab7dcb57c29f49ddfde91f","source":{"kind":"arxiv","id":"2608.09578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.09578","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"arxiv_version","alias_value":"2608.09578v1","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09578","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"pith_short_12","alias_value":"RSAN2B4CLS5C","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"pith_short_16","alias_value":"RSAN2B4CLS5CSKIQ","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"pith_short_8","alias_value":"RSAN2B4C","created_at":"2026-08-11T02:24:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RSAN2B4CLS5CSKIQ7QWFUQXQCT","target":"record","payload":{"canonical_record":{"source":{"id":"2608.09578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-10T13:13:54Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"7dd2a8c69564fd244f6af46f7f59d8ff7cedc5c983764ad057241360312646ee","abstract_canon_sha256":"97d6b113b17d2eb0afe083712040773749f918b6a45d7b4672f2d40d1052cc9c"},"schema_version":"1.0"},"canonical_sha256":"8c80dd07825cba292910fc2c5a42f014ee15fa45c4ab7dcb57c29f49ddfde91f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:24:32.608902Z","signature_b64":"mBdg36xAlodXUgZxXdlf1q7qkn5ey/TrqQS50fPmk1eS5q+U0xOoKA7QTlMMGUsrGbKvp0CUAJyMB+r0yY/KDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c80dd07825cba292910fc2c5a42f014ee15fa45c4ab7dcb57c29f49ddfde91f","last_reissued_at":"2026-08-11T02:24:32.606673Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:24:32.606673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.09578","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-11T02:24:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skExGaAER1/OJFyGkxY7N3RkDUnuL9zHAxpr8CGJJJbnSTe/wLoYyKtkhGA2pwC8+z9CqmYICYOUGH3VngtyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:45:42.582254Z"},"content_sha256":"cba02beb40fe1558b29bcc36f5441c109730654f59a1bb6045cc81958e92d511","schema_version":"1.0","event_id":"sha256:cba02beb40fe1558b29bcc36f5441c109730654f59a1bb6045cc81958e92d511"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RSAN2B4CLS5CSKIQ7QWFUQXQCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Uncomputation of Clean and Dirty Ancilla Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.PL","authors_text":"Boning Meng, Chenke Liu, Li Zhou","submitted_at":"2026-08-10T13:13:54Z","abstract_excerpt":"Automatic uncomputation aims to provide programming-language-level support to facilitate the correct and safe use of ancilla qubits in quantum computing, but efforts have only been made for clean ancillas, leaving dirty ancillas unexplored. We present a unified formalization of the uncomputation of both clean and dirty ancillas. For the first time, we prove that checking the existence of uncomputation is coNP-hard. We introduce two complementary synthesis-oriented existence-checking methods: a rewrite-based normalization algorithm (RwUn) and a template-based reasoning system (TpUn) that guaran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09578","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.09578/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-11T02:24:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsLn/oNX1gMsxowNDxm3zqjQ/pzWRMSUxQo0SKrw/mGqa8BAmyA7ZaKjT8gxlJp009A92pgud5N4fvN8ltHsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:45:42.582996Z"},"content_sha256":"c901e3c33eb7386ebe39ed9f66db0bf1513aee69f6cb56a3b79e0fd23c0018b6","schema_version":"1.0","event_id":"sha256:c901e3c33eb7386ebe39ed9f66db0bf1513aee69f6cb56a3b79e0fd23c0018b6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:RSAN2B4CLS5CSKIQ7QWFUQXQCT","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-031-38100-3_11) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Raphael Seidel, Nikolay Tcholtchev, Sebastian Bock, and Manfred Hauswirth. 2023. Uncomputation in the Qrisp High-Level Quantum Programming Framework. Springer-Verlag, Berlin, Heidelberg, 150–165. doi:10.1007/978-3-031- 38100-3_11","arxiv_id":"2608.09578","detector":"doi_compliance","evidence":{"ref_index":49,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-3-031-","reconstructed_doi":"10.1007/978-3-031-38100-3_11"},"severity":"advisory","ref_index":49,"audited_at":"2026-08-11T14:58:11.993454Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-031-38100-3_11","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"30fa0dc103bca2c870d8271df2bf3e4e0f120590c93bc259967c3c5c47a75853","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19027,"payload_sha256":"581389ac8575655693ebd7834f83da60738a9265ab5bcc9072e0526f0df0ce0f","signature_b64":"krh960KFzPWi5ftQ/Hc5/YAReIZfPSqEQdAOu9LFO4oG8arhFQuqdVbABu4m0LrWestk8uSnAU1SNVRlhsHKCQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-11T14:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdFDbQRhiYTHz2nesgrC22EydieT3KDRgQwVDtWc3MfKAKZs6Mm2MhHRPPPBP8LvzQyOrrwHP52Vh0YF5BUCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:45:42.587682Z"},"content_sha256":"4b7168fbf696edd1419fc167f515d71f30b57c862919a5cc5c7d35625f84bcef","schema_version":"1.0","event_id":"sha256:4b7168fbf696edd1419fc167f515d71f30b57c862919a5cc5c7d35625f84bcef"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:RSAN2B4CLS5CSKIQ7QWFUQXQCT","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4204/eptcs.287.17) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Robert Rand, Jennifer Paykin, Dong-Ho Lee, and Steve Zdancewic. 2019. ReQWIRE: Reasoning about Reversible Quantum Circuits.Electronic Proceedings in Theoretical Computer Science287 (Jan. 2019), 299–312. doi:10.4204/eptcs. 287.17","arxiv_id":"2608.09578","detector":"doi_compliance","evidence":{"ref_index":45,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.4204/eptcs","reconstructed_doi":"10.4204/eptcs.287.17"},"severity":"advisory","ref_index":45,"audited_at":"2026-08-11T14:58:11.993454Z","event_type":"pith.integrity.v1","detected_doi":"10.4204/eptcs.287.17","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8e28f6669ca653d7b6dead942edfc05b38bbdc67080c0f3ea532c6575c70dac5","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19026,"payload_sha256":"c2dd12c36359ffb7080964ed7d6a749863054f975b8367ca312a4916cfeaffb7","signature_b64":"ZVxR2CelYoglRcZr4otVh5eBmygSQbJv5o/bmutcimlIm5RamBru7o8rKWqsd0kSWcgXfynTa6WRHRxAt2/5Bg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-11T14:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ayzwM8qZQgTJaoINg8LvHtbADndv3V93r7b5LI7FzftoFFgvSWHb0zgEBI8lJJHchUjCTK+LJEdREsMcc9lBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:45:42.588215Z"},"content_sha256":"b3e15f2091005463fd7823ccd47aad99893b28e6fcf3d92ee53ce25a9f327c4a","schema_version":"1.0","event_id":"sha256:b3e15f2091005463fd7823ccd47aad99893b28e6fcf3d92ee53ce25a9f327c4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/bundle.json","state_url":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/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-12T13:45:42Z","links":{"resolver":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT","bundle":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/bundle.json","state":"https://pith.science/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSAN2B4CLS5CSKIQ7QWFUQXQCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RSAN2B4CLS5CSKIQ7QWFUQXQCT","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"97d6b113b17d2eb0afe083712040773749f918b6a45d7b4672f2d40d1052cc9c","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-10T13:13:54Z","title_canon_sha256":"7dd2a8c69564fd244f6af46f7f59d8ff7cedc5c983764ad057241360312646ee"},"schema_version":"1.0","source":{"id":"2608.09578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.09578","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"arxiv_version","alias_value":"2608.09578v1","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09578","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"pith_short_12","alias_value":"RSAN2B4CLS5C","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"pith_short_16","alias_value":"RSAN2B4CLS5CSKIQ","created_at":"2026-08-11T02:24:32Z"},{"alias_kind":"pith_short_8","alias_value":"RSAN2B4C","created_at":"2026-08-11T02:24:32Z"}],"graph_snapshots":[{"event_id":"sha256:c901e3c33eb7386ebe39ed9f66db0bf1513aee69f6cb56a3b79e0fd23c0018b6","target":"graph","created_at":"2026-08-11T02:24:32Z","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.09578/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Automatic uncomputation aims to provide programming-language-level support to facilitate the correct and safe use of ancilla qubits in quantum computing, but efforts have only been made for clean ancillas, leaving dirty ancillas unexplored. We present a unified formalization of the uncomputation of both clean and dirty ancillas. For the first time, we prove that checking the existence of uncomputation is coNP-hard. We introduce two complementary synthesis-oriented existence-checking methods: a rewrite-based normalization algorithm (RwUn) and a template-based reasoning system (TpUn) that guaran","authors_text":"Boning Meng, Chenke Liu, Li Zhou","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-10T13:13:54Z","title":"Quantum Uncomputation of Clean and Dirty Ancilla Qubits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09578","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:cba02beb40fe1558b29bcc36f5441c109730654f59a1bb6045cc81958e92d511","target":"record","created_at":"2026-08-11T02:24:32Z","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":"97d6b113b17d2eb0afe083712040773749f918b6a45d7b4672f2d40d1052cc9c","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-10T13:13:54Z","title_canon_sha256":"7dd2a8c69564fd244f6af46f7f59d8ff7cedc5c983764ad057241360312646ee"},"schema_version":"1.0","source":{"id":"2608.09578","kind":"arxiv","version":1}},"canonical_sha256":"8c80dd07825cba292910fc2c5a42f014ee15fa45c4ab7dcb57c29f49ddfde91f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c80dd07825cba292910fc2c5a42f014ee15fa45c4ab7dcb57c29f49ddfde91f","first_computed_at":"2026-08-11T02:24:32.606673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T02:24:32.606673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mBdg36xAlodXUgZxXdlf1q7qkn5ey/TrqQS50fPmk1eS5q+U0xOoKA7QTlMMGUsrGbKvp0CUAJyMB+r0yY/KDg==","signature_status":"signed_v1","signed_at":"2026-08-11T02:24:32.608902Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.09578","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:4b7168fbf696edd1419fc167f515d71f30b57c862919a5cc5c7d35625f84bcef","sha256:b3e15f2091005463fd7823ccd47aad99893b28e6fcf3d92ee53ce25a9f327c4a"]}],"invalid_events":[],"applied_event_ids":["sha256:cba02beb40fe1558b29bcc36f5441c109730654f59a1bb6045cc81958e92d511","sha256:c901e3c33eb7386ebe39ed9f66db0bf1513aee69f6cb56a3b79e0fd23c0018b6"],"state_sha256":"2a52193ed648c62532cf46f1d7635247ccb2496c987999f24a7d3a066ecc9a2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qPCPk5zxOloUVeSbNeZlaJosq5kyDGuzAsSRrBJMC30jbT/vu83CRObjV8sd2l0YWJIc3g1GfFXadoZq5W3OBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T13:45:42.591157Z","bundle_sha256":"2d678257e10ec1ca2ee26b2585355ae47b4008659b159068410e7786fd5a8367"}}