{"as_of":"2026-08-17T17:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:768de5c1f083b24ca9e650ed9a1584d885a50f91e4b21df90d6c8201efef35d5","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-17T06:30:58.91139+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-16T11:15:34.673919Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":3,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-08T23:02:56.495061Z","title":"Threshold for fault-tolerant quan- tum advantage with the quantum approximate optimiza- tion algorithm,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-17T03:01:11.325670Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T23:02:56.495061Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2502.04277"},"observation_digest":"sha256:3c632c1223cbccc456d9985f81be141c01988a05fdd56109b9149a50bc00ec5b","observation_id":"36eb71c6-8c06-471f-92f1-13f7a2de74de","resolution":{"observed_at":"2026-08-08T23:02:56.495061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-16T11:15:34.673919Z","title":"Threshold for fault- tolerant quantum advantage with the quantum approximate optimization algorithm","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.16303","last_updated":"2025-04-22T22:44:47Z","snapshot_observed_at":"2026-08-16T15:24:16.564421Z","submitted_at":"2025-04-22T22:44:47Z","title":"Flexion: Adaptive In-Situ Encoding for On-Demand QEC in Ion Trap Systems","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-16T11:15:34.673919Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2504.16303"},"observation_digest":"sha256:f20fa579807871c491e0e91696713e657e64b0420fbbc4bde147e881b5ccf171","observation_id":"984fe76d-a46c-4c08-9085-040e9db80085","resolution":{"observed_at":"2026-08-16T11:15:34.673919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"2504.01897","doi":"10.48550/arxiv.2504.01897","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Perlin, Ruslan Shaydulin, and Marco Pistoia","venue":"arXiv (Cornell University)","work_id":"1b78c76e-ab70-4582-b063-d202719e5222","year":2025},"citing_paper":{"arxiv_id":"2504.21172","last_updated":"2026-04-29T17:40:25Z","snapshot_observed_at":"2026-07-06T21:16:46.592336Z","submitted_at":"2025-04-29T20:47:20Z","title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-22T17:43:23.965963Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2504.21172"},"observation_digest":"sha256:29de8171613f8e079347c876e55baf156b650ae17cf7a76160951fae431beb62","observation_id":"e165a640-a6c5-4a90-8f7b-5e46ccd9d6d1","resolution":{"observed_at":"2026-05-22T17:45:00.426806Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-07T14:56:54.525205Z","title":"Omanakuttan, Z","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17185","last_updated":"2025-07-24T13:37:26Z","snapshot_observed_at":"2026-08-15T14:02:05.453237Z","submitted_at":"2025-05-22T18:00:03Z","title":"Role of Nonstabilizerness in Quantum Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:56:54.525205Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2505.17185"},"observation_digest":"sha256:bfde404ab3b8fe86333c9230f0d2718eca3928d999d11f86aec28ba154a08bec","observation_id":"604a2a3a-09c2-486f-9650-7baaaa16d129","resolution":{"observed_at":"2026-08-07T14:56:54.525205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-07T10:17:39.184941Z","title":"Threshold for fault-tolerant quantum advantage with the quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05608","last_updated":"2025-06-05T21:41:38Z","snapshot_observed_at":"2026-08-16T16:07:25.041287Z","submitted_at":"2025-06-05T21:41:38Z","title":"Near-term Application Engineering Challenges in Emerging Superconducting Qudit Processors","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:17:39.184941Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2506.05608"},"observation_digest":"sha256:e435b98a5f808067b16eb52cc019c08eebdf8d6314de46d3560db315968a3ceb","observation_id":"1d5a4d85-8a0c-447e-8182-d6b223caab5a","resolution":{"observed_at":"2026-08-07T10:17:39.184941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-06T20:09:27.221198Z","title":"Perlin, Ruslan Shaydulin, and Marco Pistoia","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.03678","last_updated":"2025-07-04T15:56:28Z","snapshot_observed_at":"2026-08-14T01:30:27.795350Z","submitted_at":"2025-07-04T15:56:28Z","title":"Awesome Quantum Computing Experiments: Benchmarking Experimental Progress Towards Fault-Tolerant Quantum Computation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:09:27.221198Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2507.03678"},"observation_digest":"sha256:1af843d7ff468b9be948ec0a4c12f925e885cce8c7480cb6a0c02f5c99307385","observation_id":"cada15a0-a89f-4a7b-aa41-b7fce3dfba4f","resolution":{"observed_at":"2026-08-06T20:09:27.221198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-03T17:47:05.938641Z","title":"arXiv:2504.01897 [quant-ph]","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.08390","last_updated":"2025-12-11T10:53:52Z","snapshot_observed_at":"2026-08-16T02:49:20.380481Z","submitted_at":"2025-12-09T09:20:15Z","title":"Practical protein-pocket hydration-site prediction for drug discovery on a quantum computer","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T17:47:05.938641Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2512.08390"},"observation_digest":"sha256:41d7648bbcf3b5114602536f7d14e6a4f76c566632364a04a4d19f6d310ef731","observation_id":"f028e053-9c04-42d8-95e8-60076868454e","resolution":{"observed_at":"2026-08-03T17:47:05.938641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"2504.01897","doi":"10.48550/arxiv.2504.01897","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Perlin, Ruslan Shaydulin, and Marco Pistoia","venue":"arXiv (Cornell University)","work_id":"1b78c76e-ab70-4582-b063-d202719e5222","year":2025},"citing_paper":{"arxiv_id":"2601.01516","last_updated":"2026-01-04T12:58:04Z","snapshot_observed_at":"2026-08-15T09:17:31.624415Z","submitted_at":"2026-01-04T12:58:04Z","title":"Constraint-Aware Quantum Optimization via Hamming Weight Operators","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-16T17:46:09.462808Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2601.01516"},"observation_digest":"sha256:5d18de479304c254c1a5ab22f5a35636a51330df8d59aea03e9358c260dce8ea","observation_id":"8d76bcd1-374a-4d49-9036-9875fcb4177f","resolution":{"observed_at":"2026-05-16T17:48:11.555785Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"2504.01897","doi":"10.48550/arxiv.2504.01897","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Perlin, Ruslan Shaydulin, and Marco Pistoia","venue":"arXiv (Cornell University)","work_id":"1b78c76e-ab70-4582-b063-d202719e5222","year":2025},"citing_paper":{"arxiv_id":"2604.27153","last_updated":"2026-04-29T20:00:31Z","snapshot_observed_at":"2026-08-12T22:46:26.598617Z","submitted_at":"2026-04-29T20:00:31Z","title":"Formulating Subgroup Discovery as a Quantum Optimization Problem for Network Security","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T08:51:54.487552Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2604.27153"},"observation_digest":"sha256:adbc61e027ee8ec42146f1cd56cdc4f1d0d6598c2fff40c4c25cfb29c19f342a","observation_id":"1bd9623c-c575-4e54-9060-9f7cd4de066b","resolution":{"observed_at":"2026-05-09T04:30:09.571658Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"2504.01897","doi":"10.48550/arxiv.2504.01897","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Perlin, Ruslan Shaydulin, and Marco Pistoia","venue":"arXiv (Cornell University)","work_id":"1b78c76e-ab70-4582-b063-d202719e5222","year":2025},"citing_paper":{"arxiv_id":"2605.03854","last_updated":"2026-05-05T15:19:56Z","snapshot_observed_at":"2026-08-17T11:59:31.727790Z","submitted_at":"2026-05-05T15:19:56Z","title":"Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-07T16:36:33.311554Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2605.03854"},"observation_digest":"sha256:6a0a872fe17e0bcb8c43f73686336dad20d405219e23b9e171e93dd0cd93b6e2","observation_id":"d166bd20-e8a3-4cdb-a909-b575ec0120fb","resolution":{"observed_at":"2026-05-09T01:54:35.215345Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"2504.01897","doi":"10.48550/arxiv.2504.01897","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Perlin, Ruslan Shaydulin, and Marco Pistoia","venue":"arXiv (Cornell University)","work_id":"1b78c76e-ab70-4582-b063-d202719e5222","year":2025},"citing_paper":{"arxiv_id":"2607.01037","last_updated":"2026-07-13T14:37:21Z","snapshot_observed_at":"2026-07-16T23:19:39.340781Z","submitted_at":"2026-07-01T15:04:48Z","title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-02T11:54:21.536011Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2607.01037"},"observation_digest":"sha256:64533bfc504c93888fafc04c8e5ba0f5dfa7cdbf756946bf0a34ffc9d4651faf","observation_id":"925c3da8-472c-4cd3-916d-a711759895cd","resolution":{"observed_at":"2026-07-02T11:56:54.857492Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01897","snapshot_observed_at":"2026-07-14T16:49:25.319923Z","title":"Boulebnane, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.01037","last_updated":"2026-07-13T14:37:21Z","snapshot_observed_at":"2026-07-16T23:19:39.340781Z","submitted_at":"2026-07-01T15:04:48Z","title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T16:49:25.319923Z"},"links":{"cited_paper":"/paper/2504.01897","citing_paper":"/paper/2607.01037"},"observation_digest":"sha256:d5821305148b9d1722fe4172f4d83abf64afae721495a6c67418b29c1e11f716","observation_id":"2575f125-511d-4e73-b796-2ae462a36b7b","resolution":{"observed_at":"2026-07-14T16:49:25.319923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.01897/citation-record","integrity":"/paper/2504.01897/integrity","json":"/paper/2504.01897/citation-record.json","paper":"/paper/2504.01897"},"outbound":[],"paper":{"arxiv_id":"2504.01897","last_updated":"2025-04-02T16:57:28Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T12:44:31.148215Z","submitted_at":"2025-04-02T16:57:28Z","title":"Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2504.01897."}