{"as_of":"2026-08-14T01:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:07668bbc56278d9dcc1bb760a6dfc4c3c37dc9073873b4c80992c0e36412b95f","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T08:30:41.721277Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2607.28402/citation-record","integrity":"/paper/2607.28402/integrity","json":"/paper/2607.28402/citation-record.json","paper":"/paper/2607.28402"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T08:30:41.431287Z","title":"Quantum Linear System Solver Based on Time-optimal Adiabatic Quantum Computing and Quantum Approximate Optimization Algorithm","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.431287Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:37ec2428714ca3b08d97a5e338a0dad05828c680baf78b8448b82d7c283d1f32","observation_id":"6640bf1d-4eb4-4d1d-9d7c-46cc678b9647","resolution":{"observed_at":"2026-07-31T08:30:41.431287Z","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-07-31T08:30:41.434669Z","title":"Multiplicative complexity of vector valued Boolean functions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.434669Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:017b5258ecf047a74d128ccf49a54794aa5e625d081b4ef3a46895dd14aaaffd","observation_id":"4e2951c6-d543-46e5-a5f7-f3182a8f6cbb","resolution":{"observed_at":"2026-07-31T08:30:41.434669Z","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-07-31T08:30:41.438211Z","title":"Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.438211Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:08e71c955353817d5850e600409b19d1ba8185dab28bcec0eef9c82e2a678690","observation_id":"0e2b8616-507f-430f-b8ed-8d902e47a758","resolution":{"observed_at":"2026-07-31T08:30:41.438211Z","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-07-31T08:30:41.442093Z","title":"Optimal T depth quantum circuits for implementing arbitrary Boolean functions, June 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.442093Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:25cad913b5db71209dd50c46b3f7265aebee66e12f7d72d8add2e6642a21dc76","observation_id":"f3973c86-cd3d-4bb1-9ad0-b327fc67d7ec","resolution":{"observed_at":"2026-07-31T08:30:41.442093Z","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-07-31T08:30:41.445068Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.445068Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:8036784d7510212e79dc7d3c9f59d4389857ead110f626bb1c2d904a921d2066","observation_id":"c7600876-1c6c-4ff9-bd73-f499de104cde","resolution":{"observed_at":"2026-07-31T08:30:41.445068Z","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-07-31T08:30:41.451654Z","title":"Kumar, and David Zuckerman","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.451654Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:be61bc9c4ce0970fa661d6b7c77dc79d980093b396f45a38d0f5e48be6b729af","observation_id":"af2e2b03-9fde-4fbb-8408-4028f6d46e97","resolution":{"observed_at":"2026-07-31T08:30:41.451654Z","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-07-31T08:30:41.465142Z","title":"Implementing grover oracles for quantum key search on AES and LowMC","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.465142Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:6dc6550bd7a52a9890312ca45fa29cff2c228d3f79eb7dcda3973e6cf2a717db","observation_id":"072599b5-c9cc-4591-b0ff-33aa81b1439f","resolution":{"observed_at":"2026-07-31T08:30:41.465142Z","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-07-31T08:30:41.484816Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.484816Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:f79e9d257120d5c3952b73dcf36e08619df9d97571942bf3d1fd1051e13958c6","observation_id":"bb81aee2-d541-41b8-9d75-17a6cb22e84b","resolution":{"observed_at":"2026-07-31T08:30:41.484816Z","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-07-31T08:30:41.487792Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.487792Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:eab7e9c034fa9b23b298697b17a9589e37bf89aa6912f18a1ac79be24837ca50","observation_id":"b3046183-13ba-4312-aea3-239d538c1bbb","resolution":{"observed_at":"2026-07-31T08:30:41.487792Z","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-07-31T08:30:41.494739Z","title":"Trading T gates for dirty qubits in state preparation and unitary synthesis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.494739Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:8ad2e494bc65fa45bc0e65cb19cf7e266f345f35a3b30fe3472388291af648df","observation_id":"d0aca38d-14c5-4827-b8cb-ab74c624d257","resolution":{"observed_at":"2026-07-31T08:30:41.494739Z","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-07-31T08:30:41.515150Z","title":null,"venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.515150Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:bf64f5b038aaa07bc31c41ccf81e5a135e15c3151cc0310a456c99414b3e2aa4","observation_id":"2962dfc3-a846-43b4-b25f-bd20b0517e0c","resolution":{"observed_at":"2026-07-31T08:30:41.515150Z","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-07-31T08:30:41.524810Z","title":"Halving the cost of QROM , May 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.524810Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:5f830ed583c9e0c9b6b697f0bed895e375cc6a22cdba8d18d99034db0665e114","observation_id":"4c266055-610f-48ff-9e98-1f69ed480334","resolution":{"observed_at":"2026-07-31T08:30:41.524810Z","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-07-31T08:30:41.527608Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.527608Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:bfdb80902e261fa496a9bdffa4ab34a348bdd72df20d45bdf34f49a148d54410","observation_id":"63da6b13-a0cd-4159-8ba5-18d7c40ea127","resolution":{"observed_at":"2026-07-31T08:30:41.527608Z","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-07-31T08:30:41.536663Z","title":"Quantum circuit for multi-qubit Toffoli gate with optimal resource, February 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.536663Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:43619432a2f5ed1e3861d0d0205aeb9202f4350a188f4fabcc2ec845e10fb383","observation_id":"2eb15c84-9e4d-43d7-b955-3541f1886d09","resolution":{"observed_at":"2026-07-31T08:30:41.536663Z","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-07-31T08:30:41.545244Z","title":"Optimization of Quantum Read-Only Memory Circuits , April 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.545244Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:a2e8f772a72920f4253ac729711bec89f1a0d9b82051d1d98b24ad275173e272","observation_id":"ce33d3aa-f61b-44c9-bf4c-8d57ac99b8ab","resolution":{"observed_at":"2026-07-31T08:30:41.545244Z","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-07-31T08:30:41.574741Z","title":null,"venue":null,"work_id":null,"year":1949},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.574741Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:d28bbaec6da803035b0a2f177e390e633699dd56888bf6d6449abfc814088d47","observation_id":"d1d64f62-a6cb-49eb-a0ea-8668a22b4afb","resolution":{"observed_at":"2026-07-31T08:30:41.574741Z","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-07-31T08:30:41.625714Z","title":"LUT-Based Hierarchical Reversible Logic Synthesis","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.625714Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:9e8a5a0675d89d5fc028e04f272a0cfc55717eccd133468fbce2de8ff7098139","observation_id":"02de5550-1450-4875-b889-d4d0b3ad39d3","resolution":{"observed_at":"2026-07-31T08:30:41.625714Z","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-07-31T08:30:41.664316Z","title":"BDD-based synthesis of reversible logic for large functions","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.664316Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:46dc4a8c158a9066933eebd79c77e1ee50edddec915132ce416fa40f9d2289b2","observation_id":"11efaed1-89bb-4a63-84fb-874654a9f008","resolution":{"observed_at":"2026-07-31T08:30:41.664316Z","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-07-31T08:30:41.667265Z","title":"Asymptotically optimal synthesis of reversible circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.667265Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:8aa64bf7d4fed48adf529f692c1c1c26b04d340025f3d2d89de53ddf61dde2f5","observation_id":"7348e8e0-36bf-4dd1-a93d-e7fd84d3d591","resolution":{"observed_at":"2026-07-31T08:30:41.667265Z","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-07-31T08:30:41.670042Z","title":"Zakablukov","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.670042Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:f2657a29b68c2bb3b0eeda85f2c9bfbd13c88ed183326a89c5ac8b3d658ec4cc","observation_id":"f96b62ca-7e58-4250-8edd-61dc09ac7274","resolution":{"observed_at":"2026-07-31T08:30:41.670042Z","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-07-31T08:30:41.672435Z","title":"Zakablukov","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.672435Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:1483dde77d975f7c6220d4e87b3ab3b50a64198be2985160d7b95d815aa968d5","observation_id":"1bab19ff-4aac-4488-8ff6-129739e3089a","resolution":{"observed_at":"2026-07-31T08:30:41.672435Z","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-07-31T08:30:41.674799Z","title":"Zakablukov","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.674799Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:a43dddaca9f34340be62d4ba75c538b04ec78416b5db9e93b493ca9f92bf5169","observation_id":"4525b224-f343-4cdc-8212-d094fc8387ab","resolution":{"observed_at":"2026-07-31T08:30:41.674799Z","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-07-31T08:30:41.696598Z","title":"Quantum State Preparation with Optimal Circuit Depth : Implementations and Applications","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.696598Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:1b92159d7967a3dbd05c8b846232d86b59991a79729f9d361f82813083753047","observation_id":"54e810ac-17a6-42d2-890c-0680c7e7814f","resolution":{"observed_at":"2026-07-31T08:30:41.696598Z","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-07-31T08:30:41.699034Z","title":"Unified architecture for quantum lookup tables","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.699034Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:a66edd8351ab28f94caeaff44e06e0f905ec39e358d8e599d43f4a7ee21280e5","observation_id":"13212f74-5981-45bc-a7cf-16dce3d8fb49","resolution":{"observed_at":"2026-07-31T08:30:41.699034Z","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-07-31T08:30:41.721277Z","title":"Circuit complexity of quantum access models for encoding classical data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-31T08:30:41.721277Z"},"links":{"citing_paper":"/paper/2607.28402"},"observation_digest":"sha256:09ecbba4918522ed83dc270a521e97fd68fc0beb6896d14b4eee6142dd43a33c","observation_id":"13daeb30-8464-4160-96b7-117e65f3a9ae","resolution":{"observed_at":"2026-07-31T08:30:41.721277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28402","last_updated":"2026-07-30T15:51:53Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-03T00:11:53.436687Z","submitted_at":"2026-07-30T15:51:53Z","title":"Nearly optimal quantum circuits for Boolean oracles"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":25},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.28402."}