{"as_of":"2026-08-10T10:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:474f06cf82400bea0f0b9d031682db191c0158c9750dbc21cda978acb5cc46fa","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T23:37:36.514897Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2509.07041/citation-record","integrity":"/paper/2509.07041/integrity","json":"/paper/2509.07041/citation-record.json","paper":"/paper/2509.07041"},"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-04T23:37:36.929498Z","title":"PhD thesis, Hebrew University, July 1999","venue":null,"work_id":"7fb73a0e-f581-4ea1-a164-0b2ea1714464","year":1999},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.414740Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:ab47de4e2a5358e553c7cad885d38fc5275e767629ad97113cd3f957c900147c","observation_id":"7c6b80cd-bd15-4329-9a8f-16a8c4aede63","resolution":{"observed_at":"2026-08-04T23:37:36.933173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9701001","last_updated":"1997-01-01T13:55:07Z","snapshot_observed_at":"2026-07-07T07:26:36.286170Z","submitted_at":"1997-01-01T13:55:07Z","title":"Strengths and Weaknesses of Quantum Computing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9701001","snapshot_observed_at":"2026-08-04T23:37:36.418925Z","title":"Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.418925Z"},"links":{"cited_paper":"/paper/quant-ph/9701001","citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:a0854b2f856e8665e7dcd52910b799998f1edab6beeaeaf70b996e2dda5a8b7d","observation_id":"d591895b-f532-4b21-b9a6-e53a923058dc","resolution":{"observed_at":"2026-08-04T23:37:36.418925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9605034","last_updated":"1996-05-23T18:26:36Z","snapshot_observed_at":"2026-07-07T07:26:17.833366Z","submitted_at":"1996-05-23T18:26:36Z","title":"Tight bounds on quantum searching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9605034","snapshot_observed_at":"2026-08-04T23:37:36.423488Z","title":"Tight bounds on quan- tum searching.Fortschritte der Physik, 46:493, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.423488Z"},"links":{"cited_paper":"/paper/quant-ph/9605034","citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:19b537ec0c61c149590508e72faaef5b15c9c30bca892069186dd49fd05930c8","observation_id":"c3d20120-c61b-4e75-861e-8c9bb166399a","resolution":{"observed_at":"2026-08-04T23:37:36.423488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0005055","last_updated":"2000-05-15T18:19:59Z","snapshot_observed_at":"2026-07-07T07:03:25.387553Z","submitted_at":"2000-05-15T18:19:59Z","title":"Quantum Amplitude Amplification and Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0005055","snapshot_observed_at":"2026-08-04T23:37:36.427336Z","title":"Brassard, P","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.427336Z"},"links":{"cited_paper":"/paper/quant-ph/0005055","citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:e38e1e4a3a79af30c82943a492bfb838c0da56b0102b3c6af06746d0752538c0","observation_id":"05c97cfa-9448-4ba4-bba9-fe24d9698e12","resolution":{"observed_at":"2026-08-04T23:37:36.427336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9805082","last_updated":"1998-05-27T22:35:27Z","snapshot_observed_at":"2026-07-07T07:27:52.311088Z","submitted_at":"1998-05-27T22:35:27Z","title":"Quantum Counting","version":1},"cited_work":{"arxiv_id":"quant-ph/9805082","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/9805082","snapshot_observed_at":"2026-08-04T23:37:36.743867Z","title":"Quantum Counting","venue":"quant-ph","work_id":"b39ccab6-658d-4fe9-a534-e98025b25a3b","year":1998},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.431109Z"},"links":{"cited_paper":"/paper/quant-ph/9805082","citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:5068db54cd54ffd86a9fb95b4b494b4dfbc79cba55786e29ad081513a45efd78","observation_id":"60d89cb7-2b3f-4022-945f-a033e2740bf5","resolution":{"observed_at":"2026-08-04T23:37:36.747493Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.920025Z","title":"Cerf, Lov K","venue":null,"work_id":"b16e9885-c9e4-40ac-946d-4a7c8c61b8cb","year":2000},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.435454Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:301b9741f6de1da3b8ce53a56c502904a80024f78602bc7e55f448151397ffac","observation_id":"f12e5249-5084-4fc7-b07c-920e7dde09b5","resolution":{"observed_at":"2026-08-04T23:37:36.923436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.01644","last_updated":"2022-06-03T15:42:04Z","snapshot_observed_at":"2026-08-09T14:09:32.404236Z","submitted_at":"2022-06-03T15:42:04Z","title":"Mirror modular cloning and fast quantum associative retrieval","version":1},"cited_work":{"arxiv_id":"2206.01644","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.01644","snapshot_observed_at":"2026-08-04T23:37:36.730372Z","title":"Mirror modular cloning and fast quantum associative retrieval","venue":"quant-ph","work_id":"6f0f4bc8-9184-43af-bd86-55ea87112ad2","year":2022},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.440169Z"},"links":{"cited_paper":"/paper/2206.01644","citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:047c3c109ff9c599406e1aa6dc57c2cede6b6e839141d1f930f48cd390b86572","observation_id":"50d254d2-6f32-4866-a71c-0062998e702a","resolution":{"observed_at":"2026-08-04T23:37:36.734295Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T23:37:36.443609Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.443609Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:026a824ac5f65627c27e1812c678e39f4d09d5ce54e014d34c517a8a611e9baf","observation_id":"bc0becef-96e8-437d-a614-528012ac21f1","resolution":{"observed_at":"2026-08-04T23:37:36.443609Z","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-04T23:37:36.446777Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.446777Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:af9e37ac11a03125732fc60532bfd88fa333a32427700d2519a49891e961a2c6","observation_id":"1fa363f3-0318-4f28-93ee-5d4c1a5e499f","resolution":{"observed_at":"2026-08-04T23:37:36.446777Z","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":"6698.27671","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.644761Z","title":null,"venue":null,"work_id":"7a40f961-ca9d-4f39-9c31-933d367d7f46","year":1998},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.450255Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:e55d68d9b5246d469b1eb60dae6ef13b212cb4666e64cf54fd34107148173aab","observation_id":"a9792fea-5982-4679-9d39-7f5906ff799a","resolution":{"observed_at":"2026-08-04T23:37:36.649999Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T23:37:36.453630Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.453630Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:5fc3012aea495b81a18e2adc274a462c2ae18f52f21a522f05471c11e227a4ca","observation_id":"430bdc48-fe40-4697-b189-809fd28687cd","resolution":{"observed_at":"2026-08-04T23:37:36.453630Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.909244Z","title":"Kaye, Raymond Laflamme, and Michele Mosca.An Introduction to Quantum Computing","venue":null,"work_id":"9645cc24-6b16-41db-b26e-9e4d300c798b","year":2007},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.457193Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:cb464bdae22275f73a2bc29b84b5f8f7f2d001908ecde895d082f450331a5cfd","observation_id":"530ab35c-6953-4705-a173-f7457fdb52a4","resolution":{"observed_at":"2026-08-04T23:37:36.912833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T23:37:36.460743Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.460743Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:4cd7a010751fced5a48b34dfd57f242d1dc26220a329b12100de853a683fe069","observation_id":"91a95035-3ec3-473c-863e-019e257d1cb3","resolution":{"observed_at":"2026-08-04T23:37:36.460743Z","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-04T23:37:36.463883Z","title":"Quantum-walk speedup of backtracking algorithms.Theory of Computing, 14(15):1–24, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.463883Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:103ceecff4018db267b7573212e74cb627be7aafae443e6e24c1eebe1578ea9e","observation_id":"84b49282-2f6d-45ec-9004-04f115c5e147","resolution":{"observed_at":"2026-08-04T23:37:36.463883Z","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-04T23:37:36.466960Z","title":"Qiskit: An open-source framework for quantum computing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.466960Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:5c8773a86eff2b4a0efc4564add6152a8044509456b289e69b4c34780e433dc9","observation_id":"4e00b2cb-f65d-413c-a121-0568b72b7d5f","resolution":{"observed_at":"2026-08-04T23:37:36.466960Z","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-04T23:37:36.894022Z","title":"Hybrid divide-and-conquer approach for tree search algorithms.Quantum, 7:959, 2023","venue":null,"work_id":"45bd981d-34b0-432e-bf34-bf75d88d275e","year":2023},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.470214Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:3bd02c8c14d1dec93ff0095c408a69fc1dd59a875170f5d6b986dbcb795e357a","observation_id":"076bb09d-f8e6-4424-9848-4af27ab3db2a","resolution":{"observed_at":"2026-08-04T23:37:36.897486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.884600Z","title":"Russell and P","venue":null,"work_id":"e2f2caa1-9beb-41cc-8e59-712684e7f284","year":2010},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.473245Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:c0f26f6b327315221c6ae5ba164e29bc2051210715a3111c23628f19e8ebc387","observation_id":"68fcef71-28aa-4e02-8f4f-b3e60499b3fd","resolution":{"observed_at":"2026-08-04T23:37:36.887924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-04T23:37:36.477318Z","title":"Tree search and quantum computation.Quan- tum Information Processing, 10(4):475–500, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.477318Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:211fede8c1c0df779d28ad3866c3b221f3cd5587fcec98f7d02242c3c283f6ac","observation_id":"4d51ece2-5621-4daa-a252-d575c51129e0","resolution":{"observed_at":"2026-08-04T23:37:36.477318Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.875328Z","title":"Iterative quantum tree search","venue":null,"work_id":"8a82a782-37d2-4df2-ba95-143a6a2df72c","year":2012},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.481429Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:94cb46eaed288b6d1e1de1875499695fbd98cc306b6a2b16cac99f06d94433eb","observation_id":"2b0f8a7d-2153-4d47-bdc1-f6df7ac9f15d","resolution":{"observed_at":"2026-08-04T23:37:36.878376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.865840Z","title":"Quantum iterative deepening with an applica- tion to the halting problem.PLOS ONE, 8(3), 2013","venue":null,"work_id":"07fbb1b7-ddb7-498e-8712-1db4af0ba688","year":2013},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.485400Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:4a9cc3db959e3d5cbb7dfac4e0304cfa4bce3920c9ce43973928a26b0ba85faa","observation_id":"c3a79422-533d-4c49-90c6-fb39422bc94d","resolution":{"observed_at":"2026-08-04T23:37:36.869139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.855788Z","title":"Face recognition with quantum associative networks using overcomplete gabor wavelet.Cognitive Computation, pages 1–6,","venue":null,"work_id":"3ce57511-3827-47df-8ad7-fa43f81d4e7a","year":null},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.488666Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:c7794ac605c5270510799a198b13831279da0cc9265b43732c7bb0f2769599a4","observation_id":"de485565-8205-490c-93be-1301fd088d22","resolution":{"observed_at":"2026-08-04T23:37:36.859644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.845025Z","title":"Trugenberger","venue":null,"work_id":"660f1626-024a-4b96-a19a-8c0cb29780e5","year":2001},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.495489Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:a39bdc4403d5133c78cb8b3888fec076b369afe2a5602042524bc66e6d153519","observation_id":"a668f106-a10d-40d9-9603-d492fdd348ee","resolution":{"observed_at":"2026-08-04T23:37:36.849324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.833586Z","title":"Trugenberger","venue":null,"work_id":"722f77de-94a0-499b-8955-098ce8c0e559","year":2003},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.498511Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:f2ae8e80e71180794265005d6d8d1e08d93f6a11ff3814ac9cc25ede04fffa95","observation_id":"8bb70357-b8b6-4a3b-8acb-fb99392d5534","resolution":{"observed_at":"2026-08-04T23:37:36.837954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.822750Z","title":"Ventura and T","venue":null,"work_id":"ae50795e-d2f8-4d7e-a237-1b80fa87250f","year":1998},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.501730Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:334a562b2b7e9282a1abfa6d0fff62249ebd256a53280038702580270c2c1835","observation_id":"fad1ab4a-b5f1-4855-b44f-d641428bb29e","resolution":{"observed_at":"2026-08-04T23:37:36.826424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.812818Z","title":"Ventura and T","venue":null,"work_id":"434c0abe-62f1-4de1-992b-36c868f9733f","year":2000},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.505129Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:f5c63564517276cba7c38b87361aee58506817433fcf4f82403650ef90e5a61c","observation_id":"3cd8c49d-336c-4740-8d4d-8ef721beb00b","resolution":{"observed_at":"2026-08-04T23:37:36.816643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.802502Z","title":"World Scientific, 2020","venue":null,"work_id":"3c4a9a0c-b3e4-424c-975b-05fc3a0c6bdb","year":2020},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.508295Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:b527964fd89a20b81c35897aac30b914dbb3881af2f339b00338f9bf6a2c37ac","observation_id":"2ea30891-1c8d-4f47-8da8-09edfbe2b97f","resolution":{"observed_at":"2026-08-04T23:37:36.805971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.790698Z","title":"Quantum tree search with qiskit.Mathematics, 10(17):3013, 2022","venue":null,"work_id":"f5ec74a4-b2ae-4451-b1be-35001b8ac89c","year":2022},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.511584Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:3413c6467d0233ab86ee4f3355d5fbd15a40bd1a35b17bdacb1ac626e62535f1","observation_id":"ecebdbd2-aaff-4b50-b7ff-cd2398b23b95","resolution":{"observed_at":"2026-08-04T23:37:36.794933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:37:36.780942Z","title":"CRC Press, 2024","venue":null,"work_id":"21922ebc-4f8f-463a-b737-d0033482a681","year":2024},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.514897Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:757e0e621add6f6a5297825bf42fa96ebe8edb03e0dfa598cb82e7ae23065346","observation_id":"e5875d12-069e-4286-9b50-d6f17a143b50","resolution":{"observed_at":"2026-08-04T23:37:36.784207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s12559-010-9047-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttp://dx.doi.org/10.1007/s12559-010-9047-2","venue":"Cognitive Computation","work_id":"dbde0c46-00dd-497e-a081-0de651a89ee5","year":null},"citing_paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-04T23:37:36.491921Z"},"links":{"citing_paper":"/paper/2509.07041"},"observation_digest":"sha256:f92f87d754552b0e9427d839ac7f829ffb4b75a233b3a38ec4620d9f7d2f5196","observation_id":"a323b4ee-8d6c-41b5-b6b8-c8252a316d5a","resolution":{"observed_at":"2026-08-04T23:37:36.542994Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.07041","last_updated":"2025-09-08T10:12:32Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T19:46:59.475549Z","submitted_at":"2025-09-08T10:12:32Z","title":"Nested Grover's Algorithm for Tree Search"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":3,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":3,"verified_fuzzy":15},"total_outbound_references":29},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2509.07041."}