{"as_of":"2026-08-16T01:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5956c374fd467012749dda72117e1bbdfddec237f406b7d06ba24f648ba1df75","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T00:43:08.540917Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.07973/citation-record","integrity":"/paper/2608.07973/integrity","json":"/paper/2608.07973/citation-record.json","paper":"/paper/2608.07973"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:09.697198Z","title":"Abhari, Arvin I","venue":null,"work_id":"fbfb5584-0fb4-4cd1-9d20-261fd4c6ea5f","year":2012},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.430775Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:33fac26a2ea46748be29fb3aa1be80e35861ee9cbce9058dd602dc97440b8754","observation_id":"08373c4a-18aa-47a0-b7f7-d0824510af03","resolution":{"observed_at":"2026-08-12T00:43:09.700071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.05209","last_updated":"2018-07-13T17:47:00Z","snapshot_observed_at":"2026-08-14T18:52:10.842386Z","submitted_at":"2018-07-13T17:47:00Z","title":"Quantum Speedups for Exponential-Time Dynamic Programming Algorithms","version":1},"cited_work":{"arxiv_id":"1807.05209","doi":"10.48550/arxiv.1807.05209","metadata_source":"pith","pith_arxiv_id":"1807.05209","snapshot_observed_at":"2026-08-12T06:16:15.957210Z","title":"Quantum Speedups for Exponential-Time Dynamic Programming Algorithms","venue":"quant-ph","work_id":"6804548f-f741-4431-b26a-65fd1194f501","year":2018},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.434130Z"},"links":{"cited_paper":"/paper/1807.05209","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:365cc6de9ede52ebaeb6e423225d37cc137f96ec49bad973b62b8acf6aafaaa2","observation_id":"9d5cd719-f219-412a-8bac-6158d71f117b","resolution":{"observed_at":"2026-08-12T00:43:08.675059Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-13T23:08:11.424331+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T23:08:11.424331+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-63390-9_1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":null,"venue":"Lecture notes in computer science","work_id":"fb4a0171-d343-4fe5-ac29-271ac9bc8cfe","year":2017},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.437815Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:323f9b5b3d5565f80dd592899dcf31ddd9bbece3357b7dbcfdbdfe51914bed0c","observation_id":"60ee6877-c30a-45ff-8f1c-dc439bc99564","resolution":{"observed_at":"2026-08-12T00:43:08.660234Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-13T23:08:11.574755+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T23:08:11.574755+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.440898Z","title":null,"venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.440898Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:72d7e39e28ca4288a5bbbc8b49931eb2ce76df1d5875d13d13679078c0dfbac7","observation_id":"1d8efec1-d7e5-4cc2-9bba-b787d48ec159","resolution":{"observed_at":"2026-08-12T00:43:08.440898Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.443982Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.443982Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:1817b3cf22240943cacd03a3215a5c99daba3a10842ffce479d5a07fd4606afd","observation_id":"3fe9d231-2362-4fc6-b25d-f5770312fe17","resolution":{"observed_at":"2026-08-12T00:43:08.443982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.447466Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.447466Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:a040632040711660116a3aaafb5dcb7dd495b924d69fe1d01afe34a7bd4f5be1","observation_id":"e5687874-2f57-4162-95d1-0beccdd24e17","resolution":{"observed_at":"2026-08-12T00:43:08.447466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0401091","last_updated":"2004-06-08T10:07:38Z","snapshot_observed_at":"2026-08-01T16:05:26.113405Z","submitted_at":"2004-01-15T20:37:14Z","title":"Quantum query complexity of some graph problems","version":2},"cited_work":{"arxiv_id":"quant-ph/0401091","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0401091","snapshot_observed_at":"2026-08-12T00:43:09.378475Z","title":"Quantum query complexity of some graph problems","venue":"quant-ph","work_id":"3d3e992e-3ef2-413d-83fc-a1ba63d0bd9d","year":2004},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.452966Z"},"links":{"cited_paper":"/paper/quant-ph/0401091","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:6151a453802c085cbf80607dfec9b7bdc0d2064c24cccf50865e52d157b11cd9","observation_id":"bf3c9a1c-81c0-4fd2-8684-b530a5bc94ba","resolution":{"observed_at":"2026-08-12T00:43:09.381834Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.456338Z","title":"Green, Peter LeFanu Lumsdaine, Neil J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.456338Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:cfa72444385176afaadcc57a3d19b90a5623097afe2bbbf37c17ec242544f066","observation_id":"9339389d-efe6-4c23-b346-120a1bb86432","resolution":{"observed_at":"2026-08-12T00:43:08.456338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.458960Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.458960Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:7c1c50196baf0b99380dd50f7bd7a3edb419e612301e0bc82d005f936b4564f2","observation_id":"d8ccd91d-e900-4433-9caf-2f80ba201479","resolution":{"observed_at":"2026-08-12T00:43:08.458960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.461693Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.461693Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:edf6ade223106eb1c3ed1b4140a94a273628862f12d90c6c453a26fa63d716eb","observation_id":"d076064a-9fd7-433a-8148-9dac3306e8d3","resolution":{"observed_at":"2026-08-12T00:43:08.461693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.tqc.2022.11","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.639079Z","title":null,"venue":null,"work_id":"ea99ab2f-4edb-422c-a761-ae289ccc6428","year":2022},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.464588Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:ebb2dc9c5b22f2a59549981ca96e990aa125b9719372813fc91d59bb65cf2412","observation_id":"497bb9ce-9cea-4807-ae5b-313df5a6963d","resolution":{"observed_at":"2026-08-12T00:43:08.642077Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-13T23:08:11.844881+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T23:08:11.844881+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17966","last_updated":"2025-05-20T02:51:14Z","snapshot_observed_at":"2026-08-14T18:10:01.954751Z","submitted_at":"2024-07-25T11:38:04Z","title":"Rise of conditionally clean ancillae for efficient quantum circuit constructions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17966","snapshot_observed_at":"2026-08-12T00:43:08.467396Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.467396Z"},"links":{"cited_paper":"/paper/2407.17966","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:716725209d10564983d4a2dbdbe511292e80e170e4a7b3b75cdc6568e82bb724","observation_id":"2fc270dc-4404-4c63-99ab-f37e79957f75","resolution":{"observed_at":"2026-08-12T00:43:08.467396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.470309Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.470309Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:fa2778a75a1897c033891c049b50c8de932e438d6fcb64cb1a558fafb8a01440","observation_id":"c74c8a86-79a9-49aa-bc5d-c3d1e12a73db","resolution":{"observed_at":"2026-08-12T00:43:08.470309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2564923","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.626251Z","title":null,"venue":null,"work_id":"65c8b8b5-738a-4c93-9a87-0c6bf6c47034","year":2014},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.473006Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:cf4cebb6d3e9e7cd9413f14d923eb63133b42b043c93eee8dcc2aabf7549d87f","observation_id":"a66e07f4-a876-49d2-81b6-35d4e573b97d","resolution":{"observed_at":"2026-08-12T00:43:08.629156Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-13T23:08:12.121781+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T23:08:12.121781+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8349.12783","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:09.216395Z","title":"Maslov, G","venue":null,"work_id":"527ce868-36f0-4351-ad82-ff2584df7dfe","year":2007},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.475674Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:ca4576f32ecbb1778a8bc87073187d173c4efdf9ad66bf501d07063128f2be37","observation_id":"f018fddd-481a-4060-a8dc-95c7c26df256","resolution":{"observed_at":"2026-08-12T00:43:09.220603Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.479537Z","title":"Michael Miller, Dmitri Maslov, and Gerhard W","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.479537Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:f1e6e496ad8bad168762e6509aee98c221da792dcab2000ca2b37196763e9476","observation_id":"57c0d95b-eef9-4b41-8a25-e769618c85ea","resolution":{"observed_at":"2026-08-12T00:43:08.479537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:09.684782Z","title":"2000.Quantum Programming in QCL","venue":null,"work_id":"175166f3-6d81-4f41-ba64-6c61bb85ec88","year":2000},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.482121Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:61fd119c4ce45899924b0af5d6e14475597a1adbaebd7f745bcfebdfad44bb82","observation_id":"d8446c80-bb47-43cb-bef0-3a81e7659a57","resolution":{"observed_at":"2026-08-12T00:43:09.687628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.484813Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.484813Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:f32e98705c3b963e7df21115ae99d8221298632a9f26e70fc2a4550846f79937","observation_id":"76574a6e-8fd5-4f89-9ca9-7797e9c8854d","resolution":{"observed_at":"2026-08-12T00:43:08.484813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.487572Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.487572Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:627f27660d6900429a98f458a1031d8454b9b9b044b146c4f6e2d1e41a1f42d4","observation_id":"e8f8ebc1-2853-484f-8d16-e965a6e950d1","resolution":{"observed_at":"2026-08-12T00:43:08.487572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00377","last_updated":"2015-10-01T19:48:52Z","snapshot_observed_at":"2026-08-14T22:29:54.165675Z","submitted_at":"2015-10-01T19:48:52Z","title":"Reversible circuit compilation with space constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00377","snapshot_observed_at":"2026-08-12T00:43:08.490036Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.490036Z"},"links":{"cited_paper":"/paper/1510.00377","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:0f6a48f9daf60f8271a69c417257d5dd48a4cfa3b269d146303fda717c772af5","observation_id":"76ff6ff2-1697-4889-9ef0-42882f064ceb","resolution":{"observed_at":"2026-08-12T00:43:08.490036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10118","last_updated":"2019-01-29T05:40:06Z","snapshot_observed_at":"2026-08-14T17:24:29.564756Z","submitted_at":"2019-01-29T05:40:06Z","title":"ReQWIRE: Reasoning about Reversible Quantum Circuits","version":1},"cited_work":{"arxiv_id":"1901.10118","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.10118","snapshot_observed_at":"2026-08-12T00:43:09.015298Z","title":"ReQWIRE: Reasoning about Reversible Quantum Circuits","venue":"cs.LO","work_id":"01791ee6-490f-4a00-9a33-f431b9496943","year":2019},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.492968Z"},"links":{"cited_paper":"/paper/1901.10118","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:58699dd979e9843f4a175427e418f9e8d43eebf7708ac1ef6f41668485420a58","observation_id":"658dc3e4-cbd6-4319-b410-6455b279100c","resolution":{"observed_at":"2026-08-12T00:43:09.018756Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00699","last_updated":"2018-03-02T03:46:53Z","snapshot_observed_at":"2026-08-14T19:40:25.621436Z","submitted_at":"2018-03-02T03:46:53Z","title":"QWIRE Practice: Formal Verification of Quantum Circuits in Coq","version":1},"cited_work":{"arxiv_id":"1803.00699","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.00699","snapshot_observed_at":"2026-08-12T00:43:09.004759Z","title":"QWIRE Practice: Formal Verification of Quantum Circuits in Coq","venue":"cs.LO","work_id":"686d17f4-5cb1-4735-9399-743662f89eb2","year":2018},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.496148Z"},"links":{"cited_paper":"/paper/1803.00699","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:8f29d631263af9385ccfaf83c71e230994e73d44100a1ddfa246cb23eb3e852d","observation_id":"d0d84b38-5e4c-4785-ba62-bb8e3b922d63","resolution":{"observed_at":"2026-08-12T00:43:09.008033Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.499058Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.499058Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:7048b2fd68b8fbef9f04e4889783446054f9c03030c29c72ba0a89d6780a826c","observation_id":"d07ff7e8-ab21-434a-b15f-41d596616d7f","resolution":{"observed_at":"2026-08-12T00:43:08.499058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-38100-3_11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":null,"venue":"Lecture notes in computer science","work_id":"de9de3ef-e81d-4575-bf69-a61f0ca007bc","year":2023},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.501544Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:15ba452235b8c098ca52128f84495ae36c492da933dba962b254bde884c02c8b","observation_id":"3042efa8-2eb9-4ff5-9f66-c07641a46901","resolution":{"observed_at":"2026-08-12T00:43:08.615992Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-13T23:08:12.412984+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T23:08:12.412984+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7873/date.2013.256","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.603390Z","title":null,"venue":null,"work_id":"683e7e77-d0e4-4343-bbb0-83bf8fce192d","year":2013},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.504273Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:c3dd2f780cd730743aef513f02439e9cd2b68e8c157507cfff12e809ad17d36e","observation_id":"063cef4f-bd33-4d3d-bdb7-d0a910ee3200","resolution":{"observed_at":"2026-08-12T00:43:08.607246Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-13T23:08:12.494765+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T23:08:12.494765+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.506909Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.506909Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:0783e7156f559451ee243b6d79f87fd6fcee19a94d12e9eac6bbe4d1a1bbb433","observation_id":"fb67a0a8-7d98-45a3-ade0-a43ec4823510","resolution":{"observed_at":"2026-08-12T00:43:08.506909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:09.676449Z","title":null,"venue":null,"work_id":"73654a08-6bb0-4700-8b52-9aa9d7527305","year":1997},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.509737Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:430b18e05c811bcbf52166b448aa1b29b86e24357f2cb5b9f7a33306ed1c8708","observation_id":"916a5dc1-7e70-410d-a539-e1328a82cbf5","resolution":{"observed_at":"2026-08-12T00:43:09.679544Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.512542Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.512542Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:c6bbf0fd8af6cf10efff3ad44d3c66e9ea595d3fea2ea75abc707f696a7f4213","observation_id":"f21b099c-578b-4790-b43f-481e0cc57714","resolution":{"observed_at":"2026-08-12T00:43:08.512542Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.515240Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.515240Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:1911ecb035c039e700dcd67b3a22820f4943c55eb412c9484a3b8b9c1d562935","observation_id":"fbe40f0a-528a-456b-8df9-a34953e2ea62","resolution":{"observed_at":"2026-08-12T00:43:08.515240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:09.668191Z","title":null,"venue":null,"work_id":"810ec32e-555f-494f-aaa9-f410174ae174","year":2012},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.517971Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:56421727b273879953f42353e9b3d89303a1644f4ab4d9be020f7f3fcab85fdd","observation_id":"c546c39f-3e6b-4870-a922-370330297827","resolution":{"observed_at":"2026-08-12T00:43:09.671233Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.520612Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.520612Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:75e8f50798cd22969b95b9a93f4a8a50f9353f0000dfbd80e68e1c4732bff3f2","observation_id":"d6cd7faf-5c9f-4f8c-9a03-eaef8de73c25","resolution":{"observed_at":"2026-08-12T00:43:08.520612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.523590Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.523590Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:4174513b236d6305335f8dec12f61beca8bfbc7d808ef52321177dadd4a6fe55","observation_id":"d093a93f-aa43-41ca-9d23-2a3a3bb1ec92","resolution":{"observed_at":"2026-08-12T00:43:08.523590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.526306Z","title":"2010.Towards a design flow for reversible logic","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.526306Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:e34ce145e29732f79d990b4aa084f8c73a5651974db93eb0c92195c6ed3859cc","observation_id":"9981f149-2214-4a06-8c94-bf5c28840539","resolution":{"observed_at":"2026-08-12T00:43:08.526306Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2010.0150","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.815187Z","title":null,"venue":null,"work_id":"90c889d7-294a-453c-851d-14b4399a9d16","year":2010},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.529151Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:7f4498273ed089c707e129f6d6162d35803ae9f1087b5fa1f1ccd9319be69dc5","observation_id":"f0d90e52-e07f-49ea-b6ff-fc98d1e64ba1","resolution":{"observed_at":"2026-08-12T00:43:08.819894Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05934","last_updated":"2024-11-06T20:54:12Z","snapshot_observed_at":"2026-08-15T02:14:56.514375Z","submitted_at":"2024-04-09T01:35:13Z","title":"Verification of Recursively Defined Quantum Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05934","snapshot_observed_at":"2026-08-12T00:43:08.531952Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.531952Z"},"links":{"cited_paper":"/paper/2404.05934","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:250121fa83a4eae29a8cbc072888642b0220bbec113498b39242434151e74e06","observation_id":"7c83bbd2-c049-45cf-b0ca-2c7356c19b83","resolution":{"observed_at":"2026-08-12T00:43:08.531952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.535154Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.535154Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:0d70b1f72103ce978a3063a5ca21277f7f508fe7ec934145f78606c88a92bf8a","observation_id":"40824519-19f9-4653-8d63-81de46eb5498","resolution":{"observed_at":"2026-08-12T00:43:08.535154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.537760Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.537760Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:df243549c5cbf4eeaac872ee9d5a75f90eb6e64c034c2e81464d16c9c7f5833e","observation_id":"505523fe-bb71-44d7-ab28-7fb624123718","resolution":{"observed_at":"2026-08-12T00:43:08.537760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10054","last_updated":"2025-06-14T05:21:49Z","snapshot_observed_at":"2026-08-12T23:01:23.014798Z","submitted_at":"2024-08-19T14:48:41Z","title":"Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10054","snapshot_observed_at":"2026-08-12T00:43:08.540917Z","title":"per-level immediate cleanup","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.540917Z"},"links":{"cited_paper":"/paper/2408.10054","citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:b0add6f0dc832ceeaf44a39a22351004ed2342102d5acb3376b9d720dfe9cbb4","observation_id":"8c89949f-7ce4-4cac-917d-189718531765","resolution":{"observed_at":"2026-08-12T00:43:08.540917Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:43:08.450254Z","title":"In2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T00:43:08.450254Z"},"links":{"citing_paper":"/paper/2608.07973"},"observation_digest":"sha256:e04924b1f1c636d75538aac4417325a3e99fe54fbec60f7d3eee5cf9e6a9bcb6","observation_id":"483dfa4c-dea6-45c0-a555-6d8fa80840ca","resolution":{"observed_at":"2026-08-12T00:43:08.450254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.07973","last_updated":"2026-08-08T07:15:48Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-15T19:42:57.249361Z","submitted_at":"2026-08-08T07:15:48Z","title":"ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":4,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":22,"verified_exact":10,"verified_fuzzy":2},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2608.07973."}