{"as_of":"2026-08-11T19:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:faef13c0d0af94abca699b1bff3c6bb443ac482f6334dead53e2750e3c2451c5","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:14:03.998060Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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.06094/citation-record","integrity":"/paper/2608.06094/integrity","json":"/paper/2608.06094/citation-record.json","paper":"/paper/2608.06094"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:14:03.728400Z","title":"118.010501","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.728400Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:11bdc6891e6394dd605dcb676e3c1f7d9f03b88b1020c9df57def6653d974921","observation_id":"5f10d339-00f5-4882-a8a6-36d94bf6dff8","resolution":{"observed_at":"2026-08-07T15:14:03.728400Z","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-07T15:14:03.886940Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.886940Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:e0d08e61553f6c5b69d2fa0821342d340ac590f262ec737c3b90de4b94344482","observation_id":"ca842760-8148-4f47-a9ab-a2698244f71a","resolution":{"observed_at":"2026-08-07T15:14:03.886940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.19852","last_updated":"2026-07-22T07:41:32Z","snapshot_observed_at":"2026-08-10T01:36:59.048955Z","submitted_at":"2026-07-22T07:41:32Z","title":"Optimal Lower Bounds for Hamiltonian Simulation","version":1},"cited_work":{"arxiv_id":"2607.19852","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.19852","snapshot_observed_at":"2026-08-07T15:14:04.671970Z","title":"Optimal Lower Bounds for Hamiltonian Simulation","venue":"quant-ph","work_id":"55cf8395-1d7d-4ca1-857c-c02fef0b9c9d","year":2026},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.998060Z"},"links":{"cited_paper":"/paper/2607.19852","citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:99188792123fc45a2c5ed5e7dc4e7d6335ae54a407078bfb3388f062798fd645","observation_id":"3d43b042-3cc3-4e12-ae94-c12b38df2705","resolution":{"observed_at":"2026-08-07T15:14:04.721379Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:14:03.483966Z","title":"[HHL09] Aram W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.483966Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:1536da58415e700290cd7b51a986edbdcbfd0d978098c15aabd7c8f1e80de8af","observation_id":"3b364896-f1ab-4785-bd53-821f72b1511d","resolution":{"observed_at":"2026-08-07T15:14:03.483966Z","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-07T15:14:03.805576Z","title":"[L W18] Guang Hao Low and Nathan Wiebe","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.805576Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:11632562231315e83346ef725b542ecc341b869002df0890702e4513a6ad0838","observation_id":"5fda628f-0e51-4f83-82ed-2ec1dc3c8589","resolution":{"observed_at":"2026-08-07T15:14:03.805576Z","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-07T15:14:02.670776Z","title":"28 [A VDK+07] Dorit Aharonov, Wim Van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:02.670776Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:1a651952360d7e5197cddfd223e8f57e08561fc97710a80cfdac759387d10502","observation_id":"e13fbbeb-468a-44f3-a574-64bd0200c008","resolution":{"observed_at":"2026-08-07T15:14:02.670776Z","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-07T15:14:02.530468Z","title":"[AFL21] Dong An, Di Fang, and Lin Lin","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:02.530468Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:bb76a58e7c24ad8ebc582c8af3d06b010ee3deba14c7a5e5607d659c11b9e14c","observation_id":"54e76b6b-2e0d-4f21-a4b8-449ff070ca40","resolution":{"observed_at":"2026-08-07T15:14:02.530468Z","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-07T15:14:02.845834Z","title":"[BCS+20] Dominic W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:02.845834Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:7a6657f5255e5968c9fb501a660816b4f4ac2d6af23d2c7c0bba69323358438a","observation_id":"fe8b56ae-f69f-4436-9516-ca36e3758ef2","resolution":{"observed_at":"2026-08-07T15:14:02.845834Z","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-07T15:14:03.195930Z","title":"[Eck17] Andr´ e Eckardt","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.195930Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:7d1ba149e5c94adda4a0a83b3539000b081337fca51cda141ed7f3889c29dbb1","observation_id":"8d7c3e53-871f-49cc-b926-035ef82500a5","resolution":{"observed_at":"2026-08-07T15:14:03.195930Z","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-07T15:14:02.757591Z","title":"doi:10.1109/FOCS.2015.54","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:02.757591Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:b419e378d25cad8fc5abc9e0178a4b970e7bce586582804765aa23ff16ddcd5e","observation_id":"149e6578-8500-4140-9d7f-4e7318932fac","resolution":{"observed_at":"2026-08-07T15:14:02.757591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0001106","last_updated":"2000-01-28T22:12:03Z","snapshot_observed_at":"2026-07-07T07:02:58.841967Z","submitted_at":"2000-01-28T22:12:03Z","title":"Quantum Computation by Adiabatic Evolution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0001106","snapshot_observed_at":"2026-08-07T15:14:03.289135Z","title":"[Fey82] Richard P","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.289135Z"},"links":{"cited_paper":"/paper/quant-ph/0001106","citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:a2a095579fd9cbaee6f228d44a3cafff6f7944c1552404c80676165042988535","observation_id":"62bdc27e-1c1b-434a-8c45-bbbec5e8d59c","resolution":{"observed_at":"2026-08-07T15:14:03.289135Z","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-07T15:14:03.374504Z","title":"[HDR90] J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.374504Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:5107877408ade15ca38f193b372e27aa02b8802bf857b12ddf9b380ca1061f3c","observation_id":"199533c0-848a-4eb8-9e1b-a0b8a90803c6","resolution":{"observed_at":"2026-08-07T15:14:03.374504Z","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.22331/q-2020-04-20-254","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"[BCSC24] Dominic W","venue":"Quantum","work_id":"8c24146d-67a8-407b-bac5-3b81d3f5262a","year":2020},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:02.952777Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:653669e61d3f496bb2f4fd90d9d7c5180d08c2ea6eefe156d4e3df934373ee2b","observation_id":"c9f5b6c7-22b7-4fa0-b029-830d013afe30","resolution":{"observed_at":"2026-08-07T15:14:04.549314Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.30013","last_updated":"2026-05-28T14:39:07Z","snapshot_observed_at":"2026-07-30T03:37:13.917659Z","submitted_at":"2026-05-28T14:39:07Z","title":"Elfs, transducers and quantum walks","version":1},"cited_work":{"arxiv_id":"2605.30013","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.30013","snapshot_observed_at":"2026-08-07T15:14:05.179837Z","title":"Elfs, transducers and quantum walks","venue":"quant-ph","work_id":"e75704d0-cc5d-4da3-934f-44ba985b8d3e","year":2026},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:02.576932Z"},"links":{"cited_paper":"/paper/2605.30013","citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:6bcd1e1e32650b3b03e63db9f2270cc577322cb56c486cb908cc5cc1d47b166e","observation_id":"9ff66f1c-b2ea-470f-bf0c-96aff22dc453","resolution":{"observed_at":"2026-08-07T15:14:05.252137Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.02003","last_updated":"2023-01-05T11:05:22Z","snapshot_observed_at":"2026-07-06T14:37:40.074102Z","submitted_at":"2023-01-05T11:05:22Z","title":"One-Way Ticket to Las Vegas and the Quantum Adversary","version":1},"cited_work":{"arxiv_id":"2301.02003","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.02003","snapshot_observed_at":"2026-08-07T15:14:04.948060Z","title":"One-Way Ticket to Las Vegas and the Quantum Adversary","venue":"quant-ph","work_id":"89d16ace-cfd2-4c42-9507-37be367c2a0d","year":2023},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.006131Z"},"links":{"cited_paper":"/paper/2301.02003","citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:0d49cd506ad182585f99832c6485db3c4e14a39f87c31e8b8fc78575f26b60b1","observation_id":"843c0904-13a2-48c1-a6d5-f3e10ed5f78f","resolution":{"observed_at":"2026-08-07T15:14:05.018858Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/fkh5-b669","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"[CW12] Andrew M Childs and Nathan Wiebe","venue":"Physical Review Research","work_id":"951bfeee-f31e-4ba4-a718-6a8a62933f99","year":null},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.087340Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:8e05541e12002deffe7706834018597fa5fdb379a80274479878835fa28cb897","observation_id":"4c42b543-43ee-4c02-bb32-0528313d5842","resolution":{"observed_at":"2026-08-07T15:14:04.386946Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/pwdd-htbf","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"[KSB19] M´ aria Kieferov´ a, Artur Scherer, and Dominic W","venue":"Physical Review Letters","work_id":"83a5ab1c-5276-407c-aa00-b23f5580237a","year":2019},"citing_paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:03.671378Z"},"links":{"citing_paper":"/paper/2608.06094"},"observation_digest":"sha256:2f9b804ef84ace2519ce71fd6b74b55181c966c2a88c1be666405c2a21da9dff","observation_id":"6e3aadd3-a154-4f2a-b225-7eebed4800e5","resolution":{"observed_at":"2026-08-07T15:14:04.207305Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06094","last_updated":"2026-08-06T14:35:47Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T01:19:53.164548Z","submitted_at":"2026-08-06T14:35:47Z","title":"Time-Dependent Hamiltonian Simulation with Optimal Query Complexity"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":3,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":17},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2608.06094."}