{"as_of":"2026-08-07T05:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8b3d3b6596ebb64a9c86b5d18175c1bf376f2526a3efb9a707c0143f17221a6f","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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-06T06:34:29.942622+00:00","state":"measured"},{"denominator":29,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:54:34.112698Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2406.12086","last_updated":"2026-04-08T23:55:31Z","snapshot_observed_at":"2026-08-02T20:06:35.567731Z","submitted_at":"2024-06-17T20:54:11Z","title":"A shortcut to an optimal quantum linear system solver","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-23T23:46:47.300069Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2406.12086"},"observation_digest":"sha256:ccdd507fa1497dd85c12b8f59fb1b6cf2afcca04fcf32f7a5f97578afd201b80","observation_id":"6e52054a-b5af-46f1-9c06-4ed66e2f80ee","resolution":{"observed_at":"2026-05-23T23:48:39.517763Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2410.04435","last_updated":"2026-05-13T08:15:37Z","snapshot_observed_at":"2026-07-06T19:28:35.110264Z","submitted_at":"2024-10-06T10:11:57Z","title":"QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-23T20:14:02.080356Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2410.04435"},"observation_digest":"sha256:59781618827d4369dbb58facf71158020bf0956f86c7fdbd77eb0eeb960b63b7","observation_id":"32556ad0-99f4-486f-b357-97299a2eac39","resolution":{"observed_at":"2026-05-23T20:15:48.297491Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2502.03962","last_updated":"2025-04-28T12:38:48Z","snapshot_observed_at":"2026-08-05T12:48:25.221591Z","submitted_at":"2025-02-06T10:52:11Z","title":"Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T04:25:36.159871Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2502.03962"},"observation_digest":"sha256:14fffbb1974a56e286d75e3fbe6338bf3fb042daf0c7870c5d9409dd9a6d40de","observation_id":"03055e03-c609-433f-ba91-a846256cecfd","resolution":{"observed_at":"2026-05-23T04:27:31.411283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-07T04:54:34.112698Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09308","last_updated":"2026-06-20T15:54:46Z","snapshot_observed_at":"2026-08-07T04:49:20.665424Z","submitted_at":"2025-06-11T00:24:03Z","title":"Quantum Algorithm Software for Condensed Matter Physics","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:54:34.112698Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2506.09308"},"observation_digest":"sha256:e6a8e7cd4e9c6b3c3f134e0ee05cf56ce1e778fc6b76f807fb12ebcf91c60d9d","observation_id":"e9360f26-4664-4aa7-ade3-ce8fcce24ca1","resolution":{"observed_at":"2026-08-07T04:54:34.112698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T23:47:31.259057Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16246","last_updated":"2025-06-19T12:05:47Z","snapshot_observed_at":"2026-08-06T23:41:42.991693Z","submitted_at":"2025-06-19T12:05:47Z","title":"Towards reliable quantum software, algorithm and use-case development: Multidisciplinary analysis from the perspective of Finnish industries","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:47:31.259057Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2506.16246"},"observation_digest":"sha256:1e0d23c670fed92fef2773a7c14610aa7515753c59cead066617187e8cf44fc5","observation_id":"b742b409-aa26-4c82-8230-cd248f8d7a3d","resolution":{"observed_at":"2026-08-06T23:47:31.259057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T22:59:21.013028Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20478","last_updated":"2025-07-18T07:09:34Z","snapshot_observed_at":"2026-08-06T23:56:11.285427Z","submitted_at":"2025-06-25T14:23:38Z","title":"Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:21.013028Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2506.20478"},"observation_digest":"sha256:caeb72abd8d79a9aad3c0e10cc2729c8f5c165a6c4b059343a549a0021d99c69","observation_id":"7d673a97-8d6a-467a-833e-4f5322a2c9e3","resolution":{"observed_at":"2026-08-06T22:59:21.013028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T22:12:28.615245Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22345","last_updated":"2025-06-27T15:54:14Z","snapshot_observed_at":"2026-08-06T22:03:53.920812Z","submitted_at":"2025-06-27T15:54:14Z","title":"Linearization Scheme of Shallow Water Equations for Quantum Algorithms","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:12:28.615245Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2506.22345"},"observation_digest":"sha256:b42c56b395b6768cf0576e1448d9f272c7ab8bae06f0980114265683477e4958","observation_id":"48912794-32fd-4f4f-9d47-16c8c37beb56","resolution":{"observed_at":"2026-08-06T22:12:28.615245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T18:56:43.048641Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.06862","last_updated":"2025-07-09T14:02:16Z","snapshot_observed_at":"2026-08-06T18:50:07.570815Z","submitted_at":"2025-07-09T14:02:16Z","title":"Quantum Simulation and Optimization of Water Distribution Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:56:43.048641Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2507.06862"},"observation_digest":"sha256:40ec99f787a68f68d16637d734143e50d9b63a75a17c9d03d6be0a5db2e40229","observation_id":"069be84a-39bc-4172-ad8e-44b6cf06722e","resolution":{"observed_at":"2026-08-06T18:56:43.048641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T16:53:43.663388Z","title":"Quantum algo- rithms: A survey of applications and end-to-end com- plexities,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.12438","last_updated":"2025-07-16T17:27:01Z","snapshot_observed_at":"2026-08-06T22:41:20.433039Z","submitted_at":"2025-07-16T17:27:01Z","title":"Heisenberg limited multiple eigenvalue estimation via off-the-grid compressed sensing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:53:43.663388Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2507.12438"},"observation_digest":"sha256:38f3894b0e500734fcc4dfb6ed3a1c52a575c7cc3499526c5d64898229b4b1ee","observation_id":"241ec05e-8eb7-4174-8e82-67783114eb2f","resolution":{"observed_at":"2026-08-06T16:53:43.663388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T16:48:38.071164Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.12511","last_updated":"2025-07-16T18:00:00Z","snapshot_observed_at":"2026-08-06T16:42:30.539435Z","submitted_at":"2025-07-16T18:00:00Z","title":"Unfolded distillation: very low-cost magic state preparation for biased-noise qubits","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:48:38.071164Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2507.12511"},"observation_digest":"sha256:e58d6ee82449b485ad340e916653af51d298bf9cb7e7528d18e4d5d3de498562","observation_id":"eaf0ec71-1405-4eeb-a088-2a2838c143d0","resolution":{"observed_at":"2026-08-06T16:48:38.071164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T16:10:14.877296Z","title":"Quantum algorithms: A survey of applica- tions and end-to-end complexities,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.14383","last_updated":"2025-07-22T09:27:01Z","snapshot_observed_at":"2026-08-06T15:55:05.606154Z","submitted_at":"2025-07-18T22:07:54Z","title":"Quantum Internet in a Nutshell -- Advancing Quantum Communication with Ion Traps","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:14.877296Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2507.14383"},"observation_digest":"sha256:8b31b99a3cdadc063d21bf8346a71f5446a08bb823b68eaa2a583b68d73f37d5","observation_id":"4a030dff-6d33-410b-89cc-20a63b0b713c","resolution":{"observed_at":"2026-08-06T16:10:14.877296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T15:48:05.394095Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.15148","last_updated":"2026-07-11T00:29:01Z","snapshot_observed_at":"2026-08-06T15:37:11.227794Z","submitted_at":"2025-07-20T22:56:00Z","title":"Ground and excited-state energies with analytic errors and short time evolution on a quantum computer","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T15:48:05.394095Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2507.15148"},"observation_digest":"sha256:78af2e4937a2e73ddfa1139209cb181817a8c6d94bbe661ec4143a85acc0b635","observation_id":"48bb40d9-f563-43a8-abcb-552397aebd82","resolution":{"observed_at":"2026-08-06T15:48:05.394095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-06T05:27:34.846669Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.01879","last_updated":"2025-08-03T18:21:34Z","snapshot_observed_at":"2026-08-06T22:41:18.806619Z","submitted_at":"2025-08-03T18:21:34Z","title":"Distributed fault-tolerant quantum memories over a 2xL array of qubit modules","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T05:27:34.846669Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2508.01879"},"observation_digest":"sha256:916d2d00f36f815480825fff0c5a527f47c4d29d2427ed4d5865af0dfcea0ffa","observation_id":"5faf1bd2-492e-477f-b511-de62abd1ffb8","resolution":{"observed_at":"2026-08-06T05:27:34.846669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-05T23:33:59.267893Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.05720","last_updated":"2025-08-13T08:41:34Z","snapshot_observed_at":"2026-08-05T23:33:46.599201Z","submitted_at":"2025-08-07T14:26:26Z","title":"The vast world of quantum advantage","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-05T23:33:59.267893Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2508.05720"},"observation_digest":"sha256:6f216a2dbecf4f30b2b3b59f0314f69cae566cdce8a9f480a589045e1a620ddc","observation_id":"b0ccb198-8578-46dc-a479-f1611808db29","resolution":{"observed_at":"2026-08-05T23:33:59.267893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-05T20:57:07.201784Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09683","last_updated":"2025-08-13T10:22:20Z","snapshot_observed_at":"2026-08-05T20:57:06.651451Z","submitted_at":"2025-08-13T10:22:20Z","title":"Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T20:57:07.201784Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2508.09683"},"observation_digest":"sha256:e9599e2a3959e0ab236211d4838c1afd465ce13aca0ff4537c0a9b6ebf3a1010","observation_id":"c521a18c-2a05-4d4a-b1ea-dee66a437fc5","resolution":{"observed_at":"2026-08-05T20:57:07.201784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2509.05206","last_updated":"2026-04-20T09:39:04Z","snapshot_observed_at":"2026-07-16T23:17:42.960384Z","submitted_at":"2025-09-05T16:10:15Z","title":"Adiabatic preparation of thermal states and entropy-noise relation on noisy quantum computers","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T18:59:42.595975Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2509.05206"},"observation_digest":"sha256:27077ac7f348faf190bcbf30fe16316e96c2c908c15ecc449c50202197c76f70","observation_id":"1214188b-60db-4e1b-bbd5-1ba42024f5c8","resolution":{"observed_at":"2026-05-18T19:01:45.612956Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-04T18:37:22.916345Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09882","last_updated":"2025-09-11T22:26:57Z","snapshot_observed_at":"2026-08-04T18:37:19.655046Z","submitted_at":"2025-09-11T22:26:57Z","title":"Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:22.916345Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2509.09882"},"observation_digest":"sha256:0b6b45e0ec83c77d52b278515d6981b38d14aac694f43f724d74960d585f51e8","observation_id":"45b05ac7-c440-48f6-ab26-8f271dfece00","resolution":{"observed_at":"2026-08-04T18:37:22.916345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2510.05221","last_updated":"2026-05-02T10:58:00Z","snapshot_observed_at":"2026-07-06T22:31:53.944103Z","submitted_at":"2025-10-06T18:00:47Z","title":"Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-18T09:07:58.878012Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2510.05221"},"observation_digest":"sha256:0d0c8013e5c48e25b69ce21dcb8372c2097d4c4d251023a114004fb96b22f3fb","observation_id":"df70e607-f458-4308-8592-75817381520f","resolution":{"observed_at":"2026-05-18T09:11:09.816619Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2510.19928","last_updated":"2026-05-21T06:22:22Z","snapshot_observed_at":"2026-07-06T22:33:48.680749Z","submitted_at":"2025-10-22T18:00:19Z","title":"Mind the gaps: The fraught road to quantum advantage","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-18T01:51:39.522057Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:b004cb47cae1e21b5ce364f16971eb7045ef2af10d7692dfeafcb47836ac25d8","observation_id":"55c01304-9348-4d63-8df5-59cee20a4bd2","resolution":{"observed_at":"2026-05-18T01:51:39.613828Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2510.19928","last_updated":"2026-05-21T06:22:22Z","snapshot_observed_at":"2026-07-06T22:33:48.680749Z","submitted_at":"2025-10-22T18:00:19Z","title":"Mind the gaps: The fraught road to quantum advantage","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-22T13:08:57.425184Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:8e4c3929f30aa042772d3ad0106fb369f7321e1401a36d5dad0a8d1a63ac2d35","observation_id":"c92bc496-b03b-4acf-a537-6fa96e60a088","resolution":{"observed_at":"2026-05-22T13:11:34.724721Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-03T09:22:54.406607Z","title":"Dalzell et al.Quantum Algorithms: A Survey of Applications and End-to-End Complexities","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.14024","last_updated":"2026-06-30T07:42:22Z","snapshot_observed_at":"2026-08-06T18:13:16.939613Z","submitted_at":"2026-01-20T14:47:50Z","title":"Performance enhancing of hybrid quantum-classical Benders approach for MILP optimization","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T09:22:54.406607Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2601.14024"},"observation_digest":"sha256:f3085fb4f95486795fb765c65567799abef9decc818a3b0e6247378e38fc3473","observation_id":"71df6de7-7e02-40a3-bb2c-218801a4e681","resolution":{"observed_at":"2026-08-03T09:22:54.406607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-03T08:42:17.934504Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.16474","last_updated":"2026-07-20T01:41:36Z","snapshot_observed_at":"2026-08-06T23:28:55.585149Z","submitted_at":"2026-01-23T06:05:11Z","title":"Quantum phase estimation with optimal confidence interval using three control qubits","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T08:42:17.934504Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2601.16474"},"observation_digest":"sha256:07cc8c9fee60c21ba415a9d658ff2b0cbbbc9c7ed85dceb7f5ed659ed54549fe","observation_id":"9e7b7a8e-dda8-41c5-9f47-998ddd7b6fa4","resolution":{"observed_at":"2026-08-03T08:42:17.934504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2604.04600","last_updated":"2026-04-06T11:25:16Z","snapshot_observed_at":"2026-07-06T22:53:33.177713Z","submitted_at":"2026-04-06T11:25:16Z","title":"Phase-Stable Hologram Updates for Large-Scale Neutral-Atom Array Reconfiguration","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-10T19:55:53.013917Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2604.04600"},"observation_digest":"sha256:ac2675602dcb9e389530bb5673851e9eac9aa257a3b23e201f01ecc6ce39fc79","observation_id":"e744f9af-7e0f-4da0-b67b-a94d089e0043","resolution":{"observed_at":"2026-05-10T22:20:48.943968Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2604.18533","last_updated":"2026-04-20T17:28:28Z","snapshot_observed_at":"2026-07-06T23:05:21.974248Z","submitted_at":"2026-04-20T17:28:28Z","title":"Hamiltonian dynamics from pure dissipation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T05:11:06.054692Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2604.18533"},"observation_digest":"sha256:a3d3fc3e468cdbac52b6e859b77c9e5c0cf660aeebf6e86a61863fef16d6baa6","observation_id":"252656a9-f4d4-4cba-bdb5-c722425c2a53","resolution":{"observed_at":"2026-05-10T09:38:43.069485Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2606.00581","last_updated":"2026-05-30T07:15:43Z","snapshot_observed_at":"2026-08-02T22:17:31.971849Z","submitted_at":"2026-05-30T07:15:43Z","title":"Analog photonic simulator for large-scale transport","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-28T18:52:01.450666Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2606.00581"},"observation_digest":"sha256:c1343d549afc124c9cae9a4b0a8cb9a65936acac44b2ec08eff092324c614b89","observation_id":"51885c86-ea5e-4256-80f8-5785669dd0c4","resolution":{"observed_at":"2026-06-28T18:52:30.700984Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2606.17158","last_updated":"2026-06-15T18:00:50Z","snapshot_observed_at":"2026-08-03T00:57:21.873408Z","submitted_at":"2026-06-15T18:00:50Z","title":"Fermionic Hamiltonian engineering with local control","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-27T03:37:37.039449Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2606.17158"},"observation_digest":"sha256:0603e6dfb3899eb6624f582383674708519814a7e7e5756949c60c36ad8bfd90","observation_id":"dc0a138e-e249-4b21-befe-32c0ebc7893c","resolution":{"observed_at":"2026-07-03T17:48:46.527945Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2606.20173","last_updated":"2026-06-18T12:40:43Z","snapshot_observed_at":"2026-07-06T23:55:20.134506Z","submitted_at":"2026-06-18T12:40:43Z","title":"Qiskit Code Migration with LLMs","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-06-26T16:24:25.357338Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2606.20173"},"observation_digest":"sha256:d5c60ce19c90f50cf5fd9fcd71c981f1f36182b2e79e501a6c4cedde7fd46877","observation_id":"212eddb5-c0fe-4023-88dc-bb1d04878eea","resolution":{"observed_at":"2026-06-26T16:29:35.622974Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":"2310.03011","doi":"10.48550/arxiv.2310.03011","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","venue":null,"work_id":"a8c8317f-cfda-460e-93d1-ced8c8adf0bf","year":2023},"citing_paper":{"arxiv_id":"2606.26162","last_updated":"2026-06-24T04:52:42Z","snapshot_observed_at":"2026-08-04T07:22:04.627156Z","submitted_at":"2026-06-24T04:52:42Z","title":"Dissipative Quantum Multiplicative Weights with Sampling Feedback: A Classically Hard Primitive Realized via Engineered Open-System Dynamics","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T01:57:09.444180Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2606.26162"},"observation_digest":"sha256:8be681a8723d22adf8482381fa5a8f61aaa2f2fc0f26c005e835ff1878aa0f55","observation_id":"723d70a1-21b0-410e-9d5a-e8e9e6d3fb79","resolution":{"observed_at":"2026-07-04T14:59:56.024823Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03011","snapshot_observed_at":"2026-08-05T10:49:42.585394Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.03873","last_updated":"2026-08-04T16:13:40Z","snapshot_observed_at":"2026-08-07T05:16:21.831323Z","submitted_at":"2026-08-04T16:13:40Z","title":"High-level quantum structured programs as quantum registers compositions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T10:49:42.585394Z"},"links":{"cited_paper":"/paper/2310.03011","citing_paper":"/paper/2608.03873"},"observation_digest":"sha256:21b65fbdd3f7bbd16eb8c8d0062c3d8c47e11d3abfd958a36224c43d19596954","observation_id":"d1031ec9-d6f6-4165-a3d6-c93aed7acf9b","resolution":{"observed_at":"2026-08-05T10:49:42.585394Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.03011/citation-record","integrity":"/paper/2310.03011/integrity","json":"/paper/2310.03011/citation-record.json","paper":"/paper/2310.03011"},"outbound":[],"paper":{"arxiv_id":"2310.03011","last_updated":"2025-08-05T00:02:02Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T16:27:47.445841Z","submitted_at":"2023-10-04T17:53:55Z","title":"Quantum algorithms: A survey of applications and end-to-end complexities"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 29 inbound Pith citation observations for arXiv:2310.03011."}