{"as_of":"2026-08-10T13:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:85a0aab811935b5b4a3e35aafd745f04cf93103c8966336f20d45638aa531a7b","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:03:33.779847Z","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-05-23T07:27:42.576387Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":"2306.16372","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beguˇ si´ c and G","venue":null,"work_id":"7ba0d545-46fb-4597-a31e-f85e6d4babf0","year":2023},"citing_paper":{"arxiv_id":"2412.15134","last_updated":"2026-03-24T12:38:35Z","snapshot_observed_at":"2026-07-06T20:10:19.704368Z","submitted_at":"2024-12-19T18:15:55Z","title":"Use of Faulty States in Cat-Code Error Correction","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T07:13:24.521355Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2412.15134"},"observation_digest":"sha256:fba65065d1a8d4040252cc9733610082153f12ba3257f34d3b6e9fbe039b8dc3","observation_id":"7a25f612-1fa5-4445-be99-7b61d054540b","resolution":{"observed_at":"2026-05-23T07:15:28.632059Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":"2306.16372","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beguˇ si´ c and G","venue":null,"work_id":"7ba0d545-46fb-4597-a31e-f85e6d4babf0","year":2023},"citing_paper":{"arxiv_id":"2412.15572","last_updated":"2025-07-12T03:22:28Z","snapshot_observed_at":"2026-08-08T15:52:22.249970Z","submitted_at":"2024-12-20T05:09:30Z","title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-23T07:27:03.544032Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2412.15572"},"observation_digest":"sha256:5261d591f597b8cd2abcec9755115928bd05b6b88c7ff5b2eabbbaac3d25593d","observation_id":"f12efe05-50aa-4a91-98e5-440ab4cd3e78","resolution":{"observed_at":"2026-05-23T07:27:42.579011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-08-07T13:03:33.779847Z","title":"Fast classi- cal simulation of evidence for the utility of quantum com- puting before fault tolerance,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22932","last_updated":"2025-07-16T20:06:16Z","snapshot_observed_at":"2026-08-07T20:55:00.885094Z","submitted_at":"2025-05-28T23:20:20Z","title":"Variational Quantum Simulations of a Two-Dimensional Frustrated Transverse-Field Ising Model on a Trapped-Ion Quantum Computer","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:03:33.779847Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2505.22932"},"observation_digest":"sha256:0e3372fde0a2b7b281488375efcf608fac220d7469719a75fa348b9364514e49","observation_id":"41063384-8365-4972-a6ec-ef35719db70f","resolution":{"observed_at":"2026-08-07T13:03:33.779847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-08-07T04:40:09.384747Z","title":"& Chan, G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10191","last_updated":"2025-06-11T21:29:23Z","snapshot_observed_at":"2026-08-07T06:35:52.088300Z","submitted_at":"2025-06-11T21:29:23Z","title":"Constructive interference at the edge of quantum ergodic dynamics","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:40:09.384747Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2506.10191"},"observation_digest":"sha256:9dbc9125f8f5279c5fa356a0426f53518b8d958b092a645a6288ddfefb98dd48","observation_id":"a9eafe95-1184-4030-8b4d-83e199047c57","resolution":{"observed_at":"2026-08-07T04:40:09.384747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-08-07T00:41:27.304985Z","title":"Begušić and G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13241","last_updated":"2025-06-16T08:41:54Z","snapshot_observed_at":"2026-08-10T09:42:07.968686Z","submitted_at":"2025-06-16T08:41:54Z","title":"Scalable Simulation of Quantum Many-Body Dynamics with Or-Represented Quantum Algebra","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:41:27.304985Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2506.13241"},"observation_digest":"sha256:44021fc64cb31420a3230fe663cc77a5f998d59321ffbce6af641aebe9e0055a","observation_id":"32c639fe-c1e9-4fbf-9bed-84c3ca5fbf61","resolution":{"observed_at":"2026-08-07T00:41:27.304985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":"2306.16372","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beguˇ si´ c and G","venue":null,"work_id":"7ba0d545-46fb-4597-a31e-f85e6d4babf0","year":2023},"citing_paper":{"arxiv_id":"2508.10997","last_updated":"2026-04-22T10:27:43Z","snapshot_observed_at":"2026-08-05T18:12:34.372188Z","submitted_at":"2025-08-14T18:02:44Z","title":"Reliable high-accuracy error mitigation for utility-scale quantum circuits","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-05-18T22:36:45.926883Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2508.10997"},"observation_digest":"sha256:7eaf0eb66011c0edf40aebdfaccad8eb7b6eb0c70db237e7fd0d75e4d569739d","observation_id":"5f3d6284-4332-4bb1-b22e-e3e038aa0277","resolution":{"observed_at":"2026-05-18T22:36:53.184067Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":"2306.16372","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beguˇ si´ c and G","venue":null,"work_id":"7ba0d545-46fb-4597-a31e-f85e6d4babf0","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":201,"source":"pdf_text","source_observed_at":"2026-05-18T01:51:39.522057Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:41f564af0fc6916116a30ff46d0331fae2501761425da108f89b7b909acc6337","observation_id":"18b2edb9-f424-49f9-ad97-09bdba54f370","resolution":{"observed_at":"2026-05-18T01:51:39.806417Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":"2306.16372","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beguˇ si´ c and G","venue":null,"work_id":"7ba0d545-46fb-4597-a31e-f85e6d4babf0","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":201,"source":"pdf_text","source_observed_at":"2026-05-22T13:08:57.425184Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:93b8ac78b151e544f83bc1f2c83d235c6bae40e8ad90737021dff97e8b6a4887","observation_id":"b506fab2-159d-479b-8f82-e2b75d25376a","resolution":{"observed_at":"2026-05-22T13:11:34.648355Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-08-04T00:39:24.839548Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.05534","last_updated":"2026-07-31T21:41:34Z","snapshot_observed_at":"2026-08-09T09:41:29.578162Z","submitted_at":"2026-01-09T05:20:02Z","title":"BloQBench: A Blockchain Benchmarking Framework for Quantum Supremacy","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T00:39:24.839548Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2601.05534"},"observation_digest":"sha256:50971e2e4e237cec4de96c2a7e59dce769d35a36cc1368a0a6c9839a6c8d1551","observation_id":"cd2e3f39-c844-49f9-97ad-8e7fec8b9bfe","resolution":{"observed_at":"2026-08-04T00:39:24.839548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-08-02T22:56:25.662691Z","title":"Beguˇ si´ c and G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.15942","last_updated":"2026-02-22T16:57:09Z","snapshot_observed_at":"2026-08-07T18:17:36.188973Z","submitted_at":"2026-02-17T19:01:26Z","title":"Limits of Clifford Disentangling in Tensor Network States","version":2},"reference_index":109,"source":"pdf_text","source_observed_at":"2026-08-02T22:56:25.662691Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2602.15942"},"observation_digest":"sha256:fb5c4b6292c5d3c5bf7bd2a4ef94c47efb574729f6d191d192f2ad76dcccb9d1","observation_id":"72fb3e12-838c-4a55-9c08-14cf8dd805d3","resolution":{"observed_at":"2026-08-02T22:56:25.662691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-07-14T14:51:51.760814Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09882","last_updated":"2026-07-10T18:15:12Z","snapshot_observed_at":"2026-08-07T05:22:29.038555Z","submitted_at":"2026-07-10T18:15:12Z","title":"Benchmarking Zero-Setup Quantum Circuit Simulators","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T14:51:51.760814Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2607.09882"},"observation_digest":"sha256:af228e9c6f7b378175192903ff9edca31f3b8fa544d303bd35826d13c36af5e2","observation_id":"e2034cf2-56b0-467e-9168-1f4f3795c300","resolution":{"observed_at":"2026-07-14T14:51:51.760814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16372","snapshot_observed_at":"2026-07-31T05:49:54.147026Z","title":"Beguˇ si´ c and G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24924","last_updated":"2026-07-27T18:00:03Z","snapshot_observed_at":"2026-08-06T21:36:16.178074Z","submitted_at":"2026-07-27T18:00:03Z","title":"Efficient computation of real-time correlators using Pauli Propagation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T05:49:54.147026Z"},"links":{"cited_paper":"/paper/2306.16372","citing_paper":"/paper/2607.24924"},"observation_digest":"sha256:6402ea6ecfa1b8c43551681e124743d7b48978413341fed9bad2fbe07aae7bf2","observation_id":"75f8c135-ceb6-4da2-9eba-0cfe03044c12","resolution":{"observed_at":"2026-07-31T05:49:54.147026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2306.16372/citation-record","integrity":"/paper/2306.16372/integrity","json":"/paper/2306.16372/citation-record.json","paper":"/paper/2306.16372"},"outbound":[],"paper":{"arxiv_id":"2306.16372","last_updated":"2023-06-28T17:08:00Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T15:47:57.565746Z","submitted_at":"2023-06-28T17:08:00Z","title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2306.16372."}