{"as_of":"2026-08-04T18:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62c5bff8206d94a2771773fbdb9458fb27ef5d4452023458a1e21bf1954cd8c6","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T21:55:17.540073Z","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-22T21:57:10.365232Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.02342","last_updated":"2024-06-02T13:49:44Z","snapshot_observed_at":"2026-07-06T16:02:30.389222Z","submitted_at":"2023-08-04T14:17:21Z","title":"Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem","version":2},"cited_work":{"arxiv_id":"2308.02342","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.02342","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Evidence of scaling advantage for the quantum approxi- mate optimization algorithm on a classically intractable problem","venue":null,"work_id":"590c1cb3-2465-4168-b2ca-7ec79e85255d","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2308.02342","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:2e16857570d019a35a2e88804fc04ab407dd44c343aa7fd6155aa0d06bbd7252","observation_id":"2322a855-fcc7-4c53-a25d-ff5137372c0b","resolution":{"observed_at":"2026-05-22T21:57:10.374409Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.02342","last_updated":"2024-06-02T13:49:44Z","snapshot_observed_at":"2026-07-06T16:02:30.389222Z","submitted_at":"2023-08-04T14:17:21Z","title":"Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem","version":2},"cited_work":{"arxiv_id":"2308.02342","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.02342","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Evidence of scaling advantage for the quantum approxi- mate optimization algorithm on a classically intractable problem","venue":null,"work_id":"590c1cb3-2465-4168-b2ca-7ec79e85255d","year":2023},"citing_paper":{"arxiv_id":"2508.11765","last_updated":"2026-01-27T20:25:46Z","snapshot_observed_at":"2026-08-02T18:46:25.302981Z","submitted_at":"2025-08-15T18:31:37Z","title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","version":2},"reference_index":236,"source":"pdf_text","source_observed_at":"2026-05-18T22:19:39.677935Z"},"links":{"cited_paper":"/paper/2308.02342","citing_paper":"/paper/2508.11765"},"observation_digest":"sha256:cca17c55f18a1160525a0f6e95512b75804452e452693eb11cb51393f2967f28","observation_id":"3a047234-ee4b-4f66-9881-2181fde45566","resolution":{"observed_at":"2026-05-18T22:21:53.054505Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.02342","last_updated":"2024-06-02T13:49:44Z","snapshot_observed_at":"2026-07-06T16:02:30.389222Z","submitted_at":"2023-08-04T14:17:21Z","title":"Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem","version":2},"cited_work":{"arxiv_id":"2308.02342","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.02342","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Evidence of scaling advantage for the quantum approxi- mate optimization algorithm on a classically intractable problem","venue":null,"work_id":"590c1cb3-2465-4168-b2ca-7ec79e85255d","year":2023},"citing_paper":{"arxiv_id":"2509.13528","last_updated":"2026-01-24T20:44:39Z","snapshot_observed_at":"2026-08-03T14:52:26.921221Z","submitted_at":"2025-09-16T20:48:53Z","title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T15:32:56.280828Z"},"links":{"cited_paper":"/paper/2308.02342","citing_paper":"/paper/2509.13528"},"observation_digest":"sha256:d65d48849874692c111f15bea17540d3c4e355606dbf329a49c9f107cf44f5a3","observation_id":"3847c139-e584-4d74-882f-3cd92b288383","resolution":{"observed_at":"2026-05-18T15:36:34.686786Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2308.02342/citation-record","integrity":"/paper/2308.02342/integrity","json":"/paper/2308.02342/citation-record.json","paper":"/paper/2308.02342"},"outbound":[],"paper":{"arxiv_id":"2308.02342","last_updated":"2024-06-02T13:49:44Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T16:02:30.389222Z","submitted_at":"2023-08-04T14:17:21Z","title":"Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2308.02342."}