{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MIETHTBXWOTEALS355MICT7C24","short_pith_number":"pith:MIETHTBX","canonical_record":{"source":{"id":"2608.07973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-08T07:15:48Z","cross_cats_sorted":[],"title_canon_sha256":"054e3c74a95c5882222e959ac1ce6b4373d65845e465af8566089565b890d148","abstract_canon_sha256":"c0dfdbc2281ef549962b4d04dd694a09f85d0367c7f83eb466210a6cdf6a37d1"},"schema_version":"1.0"},"canonical_sha256":"620933cc37b3a6402e5bef58814fe2d7261d77739b068fc39c87473588cf6caa","source":{"kind":"arxiv","id":"2608.07973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07973","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07973v1","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07973","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"MIETHTBXWOTE","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"pith_short_16","alias_value":"MIETHTBXWOTEALS3","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"pith_short_8","alias_value":"MIETHTBX","created_at":"2026-08-11T01:21:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MIETHTBXWOTEALS355MICT7C24","target":"record","payload":{"canonical_record":{"source":{"id":"2608.07973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-08T07:15:48Z","cross_cats_sorted":[],"title_canon_sha256":"054e3c74a95c5882222e959ac1ce6b4373d65845e465af8566089565b890d148","abstract_canon_sha256":"c0dfdbc2281ef549962b4d04dd694a09f85d0367c7f83eb466210a6cdf6a37d1"},"schema_version":"1.0"},"canonical_sha256":"620933cc37b3a6402e5bef58814fe2d7261d77739b068fc39c87473588cf6caa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:21:16.639987Z","signature_b64":"Jsys+wxuCxn4DCqHIxm4i5CBRQF61e/imJhv5N38bpK9qvjsKOOG7Uca2ACUxXczO0lFsGZsz5lD9lFOkfavBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"620933cc37b3a6402e5bef58814fe2d7261d77739b068fc39c87473588cf6caa","last_reissued_at":"2026-08-11T01:21:16.636863Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:21:16.636863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.07973","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:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FcOSIhbK2a9xG8cE+hQzyayN7gVyZGT1OZifib5zlm1lj0Xf8U4Vw2sRWDZZOg1/J9d6B8lA3+Q8c0EziaYUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:26:00.220547Z"},"content_sha256":"943b6db7cc65d2444b2862dd5f2b7f669cc4b202efdf647d2be75e940c14f716","schema_version":"1.0","event_id":"sha256:943b6db7cc65d2444b2862dd5f2b7f669cc4b202efdf647d2be75e940c14f716"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MIETHTBXWOTEALS355MICT7C24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Huiling Wu, Yuxin Deng","submitted_at":"2026-08-08T07:15:48Z","abstract_excerpt":"Quantum oracles are essential to many quantum algorithms, and their specifications may involve recursive control flow that depends on runtime quantum data. However, existing reversible compilation frameworks provide limited support for such quantum-controlled recursive structures.\n  We present ReOC, a compilation framework that transforms high-level recursive oracle specifications with quantum control flow into reversible quantum programs. The framework comprises RQIMP, a high-level imperative source language for specifying recursive oracles, and a method of compiling programs in that language"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07973","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.07973/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:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAIPe/Ih/9sbFenQEaspSXjH//WaoYjTimDUHviIRGkAEQWuSnVlBB8LzPBIprn5k73t/E300wUii/pjvGEpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:26:00.221462Z"},"content_sha256":"9fe760b1e0cf96a34420b71c13294c84919446d95cb4cca808b7a4475b50e4d3","schema_version":"1.0","event_id":"sha256:9fe760b1e0cf96a34420b71c13294c84919446d95cb4cca808b7a4475b50e4d3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:MIETHTBXWOTEALS355MICT7C24","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-90-481-9579-4) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Robert Wille and Rolf Drechsler. 2010.Towards a design flow for reversible logic. Springer Netherlands. doi:10.1007/978- 90-481-9579-4","arxiv_id":"2608.07973","detector":"doi_compliance","evidence":{"ref_index":33,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-","reconstructed_doi":"10.1007/978-90-481-9579-4"},"severity":"advisory","ref_index":33,"audited_at":"2026-08-12T00:48:35.976684Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-90-481-9579-4","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"bada7d22bf2f5f5ac5583868793475473183f8387f05c55019965abbca8c990e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19232,"payload_sha256":"9e46b611a4b88b708df97ab1060ca81ea12a6d410a12c726c3134b2a10db4b99","signature_b64":"annErNjagMMUs1s07D5aonV2uLvWmMJZGYt4BCgRGxuIT8LIzBlM/0MuOx09He5A9nEm374NtU1LiGnsF4+EBw==","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-12T00:53:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgWcco0Arok6f+Cf6MiAE3jSlxnJVyY1z1ez+FZum5L9uEkabyACUg/YgFZmZkfDQb6HhXLsmwSly5CLCx1UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:26:00.226946Z"},"content_sha256":"a2178a635186d3015a58451621f55d6034c2727da521780728b983b50bfe6ddd","schema_version":"1.0","event_id":"sha256:a2178a635186d3015a58451621f55d6034c2727da521780728b983b50bfe6ddd"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:MIETHTBXWOTEALS355MICT7C24","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1147/rd.176.0525) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"C. H. Bennett. 1973. Logical reversibility of computation.IBM J. Res. Dev.17, 6 (Nov. 1973), 525–532. doi:10.1147/rd. 176.0525","arxiv_id":"2608.07973","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1147/rd","reconstructed_doi":"10.1147/rd.176.0525"},"severity":"advisory","ref_index":4,"audited_at":"2026-08-12T00:48:35.976684Z","event_type":"pith.integrity.v1","detected_doi":"10.1147/rd.176.0525","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"00868c6ea80ca4a78195a61aaded23b548eca9d6bee7356ebe331d06496dd82a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19231,"payload_sha256":"3b88cde20460073978adf5971dc32a7764f082bdd13c14e2a09ef7d1ff36a6b5","signature_b64":"rJtUiBsSt2LjC22mWxu5qvIzTQs2xHZDaUM8XJkeYJUyYgOnzMuRXWZ5HpT4spPG9XkI+Ldq9wsf66M9HSQSCQ==","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-12T00:53:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FCcApcpBwTVax8EBHK4cYKeyrtejDghX4TPuwj6nrAtNXYgk7Koa5jWBRYi0kAwORsbQXJDCqbaWUUB4DMghAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:26:00.227538Z"},"content_sha256":"ba79cd89008d5595fd5ca7e6dfc3e98a4083367228b5039fb0682af92d46f9ce","schema_version":"1.0","event_id":"sha256:ba79cd89008d5595fd5ca7e6dfc3e98a4083367228b5039fb0682af92d46f9ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIETHTBXWOTEALS355MICT7C24/bundle.json","state_url":"https://pith.science/pith/MIETHTBXWOTEALS355MICT7C24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIETHTBXWOTEALS355MICT7C24/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-12T23:26:00Z","links":{"resolver":"https://pith.science/pith/MIETHTBXWOTEALS355MICT7C24","bundle":"https://pith.science/pith/MIETHTBXWOTEALS355MICT7C24/bundle.json","state":"https://pith.science/pith/MIETHTBXWOTEALS355MICT7C24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIETHTBXWOTEALS355MICT7C24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MIETHTBXWOTEALS355MICT7C24","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":"c0dfdbc2281ef549962b4d04dd694a09f85d0367c7f83eb466210a6cdf6a37d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-08T07:15:48Z","title_canon_sha256":"054e3c74a95c5882222e959ac1ce6b4373d65845e465af8566089565b890d148"},"schema_version":"1.0","source":{"id":"2608.07973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07973","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07973v1","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07973","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"MIETHTBXWOTE","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"pith_short_16","alias_value":"MIETHTBXWOTEALS3","created_at":"2026-08-11T01:21:16Z"},{"alias_kind":"pith_short_8","alias_value":"MIETHTBX","created_at":"2026-08-11T01:21:16Z"}],"graph_snapshots":[{"event_id":"sha256:9fe760b1e0cf96a34420b71c13294c84919446d95cb4cca808b7a4475b50e4d3","target":"graph","created_at":"2026-08-11T01:21:16Z","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.07973/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum oracles are essential to many quantum algorithms, and their specifications may involve recursive control flow that depends on runtime quantum data. However, existing reversible compilation frameworks provide limited support for such quantum-controlled recursive structures.\n  We present ReOC, a compilation framework that transforms high-level recursive oracle specifications with quantum control flow into reversible quantum programs. The framework comprises RQIMP, a high-level imperative source language for specifying recursive oracles, and a method of compiling programs in that language","authors_text":"Huiling Wu, Yuxin Deng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07973","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:943b6db7cc65d2444b2862dd5f2b7f669cc4b202efdf647d2be75e940c14f716","target":"record","created_at":"2026-08-11T01:21:16Z","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":"c0dfdbc2281ef549962b4d04dd694a09f85d0367c7f83eb466210a6cdf6a37d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-08-08T07:15:48Z","title_canon_sha256":"054e3c74a95c5882222e959ac1ce6b4373d65845e465af8566089565b890d148"},"schema_version":"1.0","source":{"id":"2608.07973","kind":"arxiv","version":1}},"canonical_sha256":"620933cc37b3a6402e5bef58814fe2d7261d77739b068fc39c87473588cf6caa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"620933cc37b3a6402e5bef58814fe2d7261d77739b068fc39c87473588cf6caa","first_computed_at":"2026-08-11T01:21:16.636863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:21:16.636863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jsys+wxuCxn4DCqHIxm4i5CBRQF61e/imJhv5N38bpK9qvjsKOOG7Uca2ACUxXczO0lFsGZsz5lD9lFOkfavBw==","signature_status":"signed_v1","signed_at":"2026-08-11T01:21:16.639987Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.07973","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:a2178a635186d3015a58451621f55d6034c2727da521780728b983b50bfe6ddd","sha256:ba79cd89008d5595fd5ca7e6dfc3e98a4083367228b5039fb0682af92d46f9ce"]}],"invalid_events":[],"applied_event_ids":["sha256:943b6db7cc65d2444b2862dd5f2b7f669cc4b202efdf647d2be75e940c14f716","sha256:9fe760b1e0cf96a34420b71c13294c84919446d95cb4cca808b7a4475b50e4d3"],"state_sha256":"b80afaf5d82365ab0042ff5c92d7aaeccbee5a5e00fa19d866b1388e297ddde9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YE67XBf0PEm68U3Dd2OhHotBo/0OJOIaTZUyYDJBMYo+nON28w+F7SSa1dcVoUgQzfzIYxRJ3Xnb1Zz3HTPrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:26:00.231336Z","bundle_sha256":"5d209367f401ea44a79d0af44f93b393c8436fd469431aede4f2a9deba50dc34"}}