{"as_of":"2026-08-07T15:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:572a272959d456b0884541921f72450e80393524e7e69fcdb68612ee741dfcfd","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:14:41.214773Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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.01467/citation-record","integrity":"/paper/2608.01467/integrity","json":"/paper/2608.01467/citation-record.json","paper":"/paper/2608.01467"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:14:36.815729Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:36.815729Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:313febd9db6cde87e1138882471fc86b1d800cde79d07d1e81d8bb205c3fe8b1","observation_id":"5c17fe7b-9cf1-458c-bf48-6f7159fa40a5","resolution":{"observed_at":"2026-08-06T00:14:36.815729Z","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-06T00:14:46.200020Z","title":"5 petabyte simulation of a 45-qubit quantum circuit,","venue":null,"work_id":"50c30ab5-da60-4fc5-9416-5f8be6e52c32","year":2017},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:36.888938Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:d9d3add20b655a7f68d46ac6917f56cce5e9410f8bb358d99fc38cbe3f53fcfa","observation_id":"b44a4c3f-d53e-41da-a8bc-6527af00653b","resolution":{"observed_at":"2026-08-06T00:14:46.302801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:46.034116Z","title":"qHiPSTER: The quantum high performance software testing environment,","venue":null,"work_id":"2d9239ec-f3e7-4120-9256-1fcbc80bbf50","year":2016},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.048704Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:2f3e5f77da003b3eb259f706d329effc330b26132e35b36b2bd9ac7d49080adc","observation_id":"451cfc99-ca68-45dc-904b-24e1b8787ec0","resolution":{"observed_at":"2026-08-06T00:14:46.110874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:45.890573Z","title":"QuEST and high performance simulation of quantum computers,","venue":null,"work_id":"7a1444c5-11b5-4bd5-8920-14ed7c44765e","year":2019},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.158559Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:b88281696cc7b2200681adb2382ca85ec0fa32eccae8226f8e10f83b739bff92","observation_id":"f2c121e3-0486-4296-b961-a773f26dcd1e","resolution":{"observed_at":"2026-08-06T00:14:45.975736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:45.721846Z","title":"ProjectQ: An open source software framework for quantum computing,","venue":null,"work_id":"76c47621-1664-4e78-975d-749adaac6e41","year":2018},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.242997Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:194f9a8e611bbcdb718b4f3c22b43145ce2ad3898fbab6032bbea89268a2bd45","observation_id":"c52ed81d-a8a1-4579-afdd-56b590d0d51d","resolution":{"observed_at":"2026-08-06T00:14:45.797588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:37.341608Z","title":"Simulating quantum computation by contract- ing tensor networks,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.341608Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:7bec736d91d061ea8d8ddc6d84d2b5f6454a9ad0487d2b8685ff629f682bf4b4","observation_id":"2de8d34d-71cd-45dc-87c9-9db80e0ef7ee","resolution":{"observed_at":"2026-08-06T00:14:37.341608Z","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-06T00:14:37.439399Z","title":"A practical introduction to tensor networks: Matrix product states and projected entangled pair states,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.439399Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:b54eb5633b8e383b4875782a558304fe6c2cefd0ce02c13c493cdc19a75d9125","observation_id":"ac50063c-faa3-4916-9e88-b9e00e3c8338","resolution":{"observed_at":"2026-08-06T00:14:37.439399Z","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-06T00:14:45.544388Z","title":"quimb: a python library for quantum information and many- body calculations,","venue":null,"work_id":"0b69aa3e-9579-43d0-941b-33c3b0f96f21","year":2018},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.621350Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:859725382b746841bef6515bbeffaa1367781a8f2cb833d3b9419908817dd8c8","observation_id":"538ba11c-7418-46ef-a51c-3380cf201c0e","resolution":{"observed_at":"2026-08-06T00:14:45.634222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:37.738698Z","title":"Quantum supremacy using a programmable supercon- ducting processor,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.738698Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:9960d89945e1dad18383f4f821a8ac2937acc7ccb94d878edcd70a8a2cbd81d5","observation_id":"2d7cc9ad-4418-4aaa-b8e3-966520268004","resolution":{"observed_at":"2026-08-06T00:14:37.738698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.10749","last_updated":"2018-09-26T22:11:10Z","snapshot_observed_at":"2026-08-04T13:52:53.614754Z","submitted_at":"2018-07-27T17:58:05Z","title":"Quantum Supremacy Is Both Closer and Farther than It Appears","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.10749","snapshot_observed_at":"2026-08-06T00:14:37.879218Z","title":"Quantum supremacy is both closer and farther than it appears","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.879218Z"},"links":{"cited_paper":"/paper/1807.10749","citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:f9dca2a1ac079fc0daf15e246a2aa58c4c67786ad3cc81b207195902a1d19a9c","observation_id":"4a36afea-ff7e-4784-8662-6e5bfcd49a83","resolution":{"observed_at":"2026-08-06T00:14:37.879218Z","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.1103/physreva.95.062337","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:14:41.721956Z","title":"Unbiased simulation of near-Clifford quantum circuits,","venue":null,"work_id":"e2670df6-de26-4ee9-9e6e-3043a0f2ce3b","year":2017},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:37.985900Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:4dae41537c4cf31f74e8fdc503c2a3f985215f5336db895cab657a8b6552856e","observation_id":"ea171c97-5661-4125-9827-02429cdd0884","resolution":{"observed_at":"2026-08-06T00:14:41.856984Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:45.337264Z","title":"Simulation of quantum circuits by low-rank stabilizer decompositions,","venue":null,"work_id":"4f841e30-05de-44cd-8fa8-bf35e2719570","year":2019},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:38.112269Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:c87a047fcb8f15c94c3bef9df6957bb42b823be2ed7b6a2645e4f4888c565517","observation_id":"50eef8d1-aa8a-4541-abbb-52230ff4e0fe","resolution":{"observed_at":"2026-08-06T00:14:45.423290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:45.183199Z","title":"Simulation of qubit quantum circuits via Pauli propagation,","venue":null,"work_id":"951e4389-ebaf-4602-bcdd-cc3ce71d7136","year":2019},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:38.207401Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:5db7e27ba33d625be49fd4cb45bedd91ca3d602cd1357062bd35fc6ac2c7bf64","observation_id":"0d428763-23a9-4079-8800-a0b797b163cb","resolution":{"observed_at":"2026-08-06T00:14:45.261740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.21606","last_updated":"2026-05-30T19:34:36Z","snapshot_observed_at":"2026-08-07T13:24:38.192756Z","submitted_at":"2025-05-27T17:52:57Z","title":"Pauli Propagation: A Computational Framework for Simulating Quantum Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.21606","snapshot_observed_at":"2026-08-06T00:14:38.290474Z","title":"Pauli Propagation: A Computational Framework for Simulating Quantum Systems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:38.290474Z"},"links":{"cited_paper":"/paper/2505.21606","citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:b0b014ee2fff4e15b11cf5ae84b466a8d681b6d8d7b0e40edc904494aaf9ee1d","observation_id":"8a79bbdf-5559-4ea8-8343-d617e88283e8","resolution":{"observed_at":"2026-08-06T00:14:38.290474Z","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-06T00:14:38.409843Z","title":"Simulating physics with computers,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:38.409843Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:e1d7c3202d474da6f043879119da4c5c70f8cc3b9babb9f271605be618ea71e6","observation_id":"eb61c9d6-f483-4242-af5b-adbc74f026c7","resolution":{"observed_at":"2026-08-06T00:14:38.409843Z","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-06T00:14:44.990163Z","title":"A sum-over-paths description of quantum circuits,","venue":null,"work_id":"7bb6cda4-2ffa-456d-ada7-3622a24b4ad6","year":2006},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:38.508888Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:2d435a4b7cfb96935ff3afa1c9d6d39a04fe7ce0629ebc81fa78bd5522b2d364","observation_id":"7275b86b-997f-41d6-908a-a9022b392ad9","resolution":{"observed_at":"2026-08-06T00:14:45.079468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:44.789725Z","title":"Feynman path-sum quantum computer simulator,","venue":null,"work_id":"b27f7f8d-e9d3-48d3-8455-7c273f307af7","year":2023},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:38.606839Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:de5fa4e80c40daaa974749f41c3a52236138336f949461b52e35ce1b442ac35a","observation_id":"8aa424ce-ce67-4704-a7d3-9d7aafd1a577","resolution":{"observed_at":"2026-08-06T00:14:44.894506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:44.647140Z","title":"Simulation of low-depth quantum circuits as complex undirected graphical models,","venue":null,"work_id":"edb56e31-81a1-4a0e-9d1c-17d140d58633","year":2017},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:38.720626Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:7cd3bcabe68ba873fe224b577db3edff4b11ce11aedc5c76c24c0d39db0bd550","observation_id":"557bafdd-c8c4-4fee-9f7a-9d66e39f3ebf","resolution":{"observed_at":"2026-08-06T00:14:44.721502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:44.498152Z","title":null,"venue":null,"work_id":"d6decde4-983d-4cf2-a953-ba10ae86411c","year":2007},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:38.845375Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:645b010d75191dea4119ce1dba8b9bd0ef82b21f76143889eb87671539dce6c3","observation_id":"dd3710ce-1763-4067-8b7a-e9856d368045","resolution":{"observed_at":"2026-08-06T00:14:44.554518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:44.328203Z","title":"What is quantum parallelism, anyhow?","venue":null,"work_id":"729cb377-0802-4aeb-9b80-a6e72542652a","year":2024},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:39.009821Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:d5c78ef443cfff450211d5b8ee4df58753676b02faa5aa01decfbcb59754f371","observation_id":"b1c66100-1801-45f0-887e-a7a1e7477756","resolution":{"observed_at":"2026-08-06T00:14:44.386641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:44.135465Z","title":"Quantum computer simulations at warp speed: Assessing the impact of GPU acceleration: A case study with IBM Qiskit Aer, Nvidia Thrust & cuQuantum,","venue":null,"work_id":"ac84ba26-549c-452e-bca3-75950b447dce","year":2023},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:39.129552Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:2dfd132b9c52932ca19866d90f102fbd14f75e444d0acb7019c43e1e0ce13068","observation_id":"f88a983c-895b-4be1-977c-7e9ac9cca645","resolution":{"observed_at":"2026-08-06T00:14:44.221468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:43.947583Z","title":"Enabling quantum computer simulations on AMD GPUs: a HIP backend for Google’s qsim,","venue":null,"work_id":"8d88b062-e751-4edc-929b-6623264fe1e1","year":2023},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:39.250851Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:484f4ecc617b843c00dc0910edbe8ef4e703708ee0b9a7c0f6a7b0b5cf11b60e","observation_id":"5b30adf9-00a1-4909-b582-3decb995a46f","resolution":{"observed_at":"2026-08-06T00:14:44.026838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.09599","last_updated":"2019-10-10T23:52:12Z","snapshot_observed_at":"2026-07-06T07:16:41.821990Z","submitted_at":"2018-11-23T18:52:47Z","title":"A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware","version":3},"cited_work":{"arxiv_id":"1811.09599","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.09599","snapshot_observed_at":"2026-08-06T00:14:42.283326Z","title":"A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware","venue":"quant-ph","work_id":"0cb9907c-cbc6-427c-931e-98ce68fbcdea","year":2018},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:39.403534Z"},"links":{"cited_paper":"/paper/1811.09599","citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:a4b3cb24ffd75412e60ca199547c8bc0ea414be978314c2313ea223f8556d28e","observation_id":"dc5d0fb0-090a-487b-b0b4-0ba82ed5e01e","resolution":{"observed_at":"2026-08-06T00:14:42.418002Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:43.732606Z","title":"HybridQ: A hybrid simulator for quantum circuits,","venue":null,"work_id":"0a6b9961-5b1a-4994-a978-9076bdfb870e","year":2021},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:39.568350Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:4748ff29b7133dadc3fb6a74cdbef84be9b7fdf2641e4954e5fb13d852d824f0","observation_id":"0b702b66-22c3-4d14-8b35-1ca300734a5e","resolution":{"observed_at":"2026-08-06T00:14:43.846370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:43.561866Z","title":"Hyper-optimized tensor network contraction,","venue":null,"work_id":"c9fb13df-f72c-4c2d-ae3f-9d43f88fc5a5","year":2021},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:39.706511Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:3f35171a643e93d0c156d9873c2aca52c931bcfdd9c96f2bf5b91352df626aea","observation_id":"27d4480b-8171-4612-91c2-1e96a5bd3172","resolution":{"observed_at":"2026-08-06T00:14:43.663472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.07045","last_updated":"2021-05-14T19:38:56Z","snapshot_observed_at":"2026-08-02T13:44:47.066405Z","submitted_at":"2021-05-14T19:38:56Z","title":"Hybrid Schr\\\"odinger-Feynman Simulation of Quantum Circuits With Decision Diagrams","version":1},"cited_work":{"arxiv_id":"2105.07045","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.07045","snapshot_observed_at":"2026-08-06T00:14:42.021566Z","title":"Hybrid Schr\\\"odinger-Feynman Simulation of Quantum Circuits With Decision Diagrams","venue":"quant-ph","work_id":"efa82611-152a-4b90-b844-cb199feb538a","year":2021},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:39.847423Z"},"links":{"cited_paper":"/paper/2105.07045","citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:3ccf9c3ed27c61b838f22106199cda2bb1f9db8378816b5d04dbe9e5a23810c6","observation_id":"6a807c43-fec8-4ad3-99bd-3e94d4a57cf1","resolution":{"observed_at":"2026-08-06T00:14:42.125540Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:43.411710Z","title":"Graph-based simulation of quantum computation in the density matrix representation,","venue":null,"work_id":"ccccb0a9-f193-4f90-ab5d-689620d917bb","year":2007},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:39.985490Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:c59e30be247a19829ae454e9bcac469c9d7b3f604fc241aede22c38152e1381f","observation_id":"aa35f75d-2e77-4792-a106-8c4d4c6c49e6","resolution":{"observed_at":"2026-08-06T00:14:43.471732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:43.221440Z","title":"A polynomial-time classical algorithm for noisy random circuit sampling,","venue":null,"work_id":"c65217bf-8ef3-4b8a-9997-99a88682b595","year":2023},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:40.120405Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:828f297a62d0caccdd16bf202333a0fe5f12c6dc9cb0e7b3a673aea84d7f0a35","observation_id":"773bcb6e-b8a5-4dc8-838d-aca1e70f5463","resolution":{"observed_at":"2026-08-06T00:14:43.306489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:43.058648Z","title":"Gropp, E","venue":null,"work_id":"c40ef082-bdab-406b-a8e1-3b0b901515f5","year":1999},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:40.276495Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:a3dee9c5e7e04fa27a97ae5d415f1c177e05385e185b5b7a265945477ae919b5","observation_id":"94c7812f-16d5-4159-8c8e-f94ed43ee3cc","resolution":{"observed_at":"2026-08-06T00:14:43.150692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:42.873105Z","title":"Chapman, G","venue":null,"work_id":"d88adad5-47a9-4760-afd6-a190589f437e","year":2007},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:40.420330Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:13b0b3edfe947ceed9652481729da6d7c283810ebaa4d85fe35c2f3fb4b7149e","observation_id":"4ac04d56-a63b-4f8e-8e8b-258f5a7a3ee8","resolution":{"observed_at":"2026-08-06T00:14:42.962527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T00:14:42.713047Z","title":null,"venue":null,"work_id":"40dcaf4b-6ec2-4e10-9f6e-053137efcd04","year":2019},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:40.581511Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:3d77cfe9259f7284564a58e0ba88ae7bbc2cd505d618cb3f0431575fcc71ca6a","observation_id":"7acea363-4f42-4842-a6fc-e839e28fd77c","resolution":{"observed_at":"2026-08-06T00:14:42.802794Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-06T00:14:40.707237Z","title":"A Quantum Approximate Optimization Algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:40.707237Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:5a2ce6a3aded4bcff7fceb9ce02c8b914835db262f9fcd923b087230f10a9427","observation_id":"c33795b5-8333-4f80-9006-acfe85e2913f","resolution":{"observed_at":"2026-08-06T00:14:40.707237Z","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-06T00:14:42.564376Z","title":"Quantum random walks: an introductory overview,","venue":null,"work_id":"0cd79f62-adad-490e-9633-9e9e4e6101e8","year":2003},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:40.818541Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:96b21893e8dd4f55386ea508c4007f7ce410cee8ebf3c129ef8b20d2e7c4dd2b","observation_id":"1b3f1f0d-4d8c-4fad-84bb-d4a1e181918e","resolution":{"observed_at":"2026-08-06T00:14:42.613147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.02396","last_updated":"2021-11-03T17:59:03Z","snapshot_observed_at":"2026-07-06T12:05:07.980255Z","submitted_at":"2021-11-03T17:59:03Z","title":"Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.02396","snapshot_observed_at":"2026-08-06T00:14:40.959051Z","title":"Simulations of quantum circuits with approximate noise using qsim and cirq,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:40.959051Z"},"links":{"cited_paper":"/paper/2111.02396","citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:f0df3139c4c51836130932f541d2ed7155c3130b8bcfde3d2bda53e27a633efe","observation_id":"f53fb897-768e-4c76-a214-f173b901cebb","resolution":{"observed_at":"2026-08-06T00:14:40.959051Z","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-06T00:14:41.086673Z","title":"Pulse-level noisy quantum circuits with QuTiP,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:41.086673Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:74ef945da85a5f86b0fb9f19b307a63facc5fa9068cd94680215953a821b7425","observation_id":"80b92c3d-4d28-49e6-ab4d-6067a9b97165","resolution":{"observed_at":"2026-08-06T00:14:41.086673Z","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.1103/physreva.69.062317","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:14:41.384447Z","title":"Simulating noisy quantum protocols with quantum trajectories,","venue":null,"work_id":"12f98003-654d-4be8-b81f-4f10245fefab","year":2004},"citing_paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T00:14:41.214773Z"},"links":{"citing_paper":"/paper/2608.01467"},"observation_digest":"sha256:71c16758ae0d5506db574249c620a0d922b7fa1f39dad6ed52d8c5007aeaa419","observation_id":"d5906d6d-f222-4455-bfee-e3ec7ab6892a","resolution":{"observed_at":"2026-08-06T00:14:41.552110Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.01467","last_updated":"2026-08-02T20:01:59Z","latest_version":1,"primary_category":"cs.ET","snapshot_observed_at":"2026-08-06T23:26:37.125177Z","submitted_at":"2026-08-02T20:01:59Z","title":"Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":4,"verified_fuzzy":20},"total_outbound_references":36},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2608.01467."}