{"as_of":"2026-08-07T20:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:90db0ad501b9ca26634e2d1d0107d1796158058694165ad2093d86b3b23f282b","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":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":26,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:56:54.351382Z","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":194,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2501.04776","last_updated":"2026-05-07T15:27:16Z","snapshot_observed_at":"2026-08-05T02:15:57.223362Z","submitted_at":"2025-01-08T19:00:02Z","title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T05:35:50.375623Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2501.04776"},"observation_digest":"sha256:58179b574659e4da9716e4451500552e28a990fc87d78e0cf6f563aceeebb1d1","observation_id":"4d2efcb6-faab-4d13-9374-a8e4ad11f1c2","resolution":{"observed_at":"2026-05-23T05:37:36.898257Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-07T14:56:54.351382Z","title":"Farhi and A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.17185","last_updated":"2025-07-24T13:37:26Z","snapshot_observed_at":"2026-08-07T14:49:03.412230Z","submitted_at":"2025-05-22T18:00:03Z","title":"Role of Nonstabilizerness in Quantum Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:56:54.351382Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2505.17185"},"observation_digest":"sha256:e16bd0479f0a8e33a8aef2ab24a553705cf8f807a703dce4840d3c2ea45f4705","observation_id":"899050ba-b3cc-44d8-ab1c-1943338a0224","resolution":{"observed_at":"2026-08-07T14:56:54.351382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-07T13:46:41.649097Z","title":"Farhi \\ and\\ author A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.21618","last_updated":"2025-05-27T18:00:03Z","snapshot_observed_at":"2026-08-07T13:24:10.216654Z","submitted_at":"2025-05-27T18:00:03Z","title":"From simulatability to universality of continuous-variable quantum computers","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T13:46:41.649097Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2505.21618"},"observation_digest":"sha256:8bedbadb7031df005c48e56b8a933863e73bf3c74baa8d11563ebf4503686659","observation_id":"0f028f4e-0c47-48d2-a76f-f9f31463f60f","resolution":{"observed_at":"2026-08-07T13:46:41.649097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-06T18:45:53.222876Z","title":"Farhi, A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.07457","last_updated":"2025-07-10T06:18:58Z","snapshot_observed_at":"2026-08-06T18:38:01.721530Z","submitted_at":"2025-07-10T06:18:58Z","title":"Enhanced Quantum behavior on frustrated Ising model: Quantum Approximate Optimization Algorithm study","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:45:53.222876Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2507.07457"},"observation_digest":"sha256:581b5e226225b6c6108e9e83c305e4d67a96eddf784215e6c4d9647f2d73882e","observation_id":"2f52412c-8a09-4ce6-8dbc-250e8956dbf8","resolution":{"observed_at":"2026-08-06T18:45:53.222876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2508.21122","last_updated":"2026-05-17T16:17:00Z","snapshot_observed_at":"2026-07-06T22:20:16.962764Z","submitted_at":"2025-08-28T18:00:06Z","title":"Quantum algorithms for equational reasoning","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-21T23:01:32.436890Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2508.21122"},"observation_digest":"sha256:19dd800b2bb0c5028fdc1cc020f4c20916425444cbb5c8363c2f81d0102ee2bb","observation_id":"771662a0-c5ce-482e-8f69-cf1e97fb76b9","resolution":{"observed_at":"2026-05-21T23:04:25.691299Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2509.13528","last_updated":"2026-01-24T20:44:39Z","snapshot_observed_at":"2026-08-04T21:26:50.547443Z","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":7,"source":"pdf_text","source_observed_at":"2026-05-18T15:32:56.280828Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2509.13528"},"observation_digest":"sha256:89fccfb9f3159dce85b255eec3b4c63178b642052ecd80adc7345d33d793fa89","observation_id":"56f67328-95fa-40e5-886c-114e831a6fcd","resolution":{"observed_at":"2026-05-18T15:36:34.752308Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2510.02141","last_updated":"2025-10-02T15:49:36Z","snapshot_observed_at":"2026-08-05T19:39:44.065310Z","submitted_at":"2025-10-02T15:49:36Z","title":"Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T10:33:22.540486Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2510.02141"},"observation_digest":"sha256:6180ab994fd719bdb9fca06b89ac204e4b51995d9f4fec821037e897c44077e6","observation_id":"d7bbc282-4d5a-4523-b1ef-20b57f9f0aaf","resolution":{"observed_at":"2026-05-18T10:36:15.373418Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2510.08153","last_updated":"2026-05-04T10:50:12Z","snapshot_observed_at":"2026-07-06T22:32:07.945004Z","submitted_at":"2025-10-09T12:35:30Z","title":"Going off Pattern? QAOA Parameter Heuristics and Potentials of Parsimony","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-18T09:21:52.825351Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2510.08153"},"observation_digest":"sha256:70dba2890f07b4dda96ad2ebdb59599700e7425ae3e360e644915bdef8f08fbe","observation_id":"e69a0916-32ed-427d-a70f-be7c2ebc2fe2","resolution":{"observed_at":"2026-05-18T09:22:30.514957Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"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":141,"source":"pdf_text","source_observed_at":"2026-05-18T01:51:39.522057Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:c9d685141a3323a3851b56dbfcabc8b4f3f176f8dc543a0b4284318438006515","observation_id":"31d71d3e-06da-4442-89fb-5b2f121473cc","resolution":{"observed_at":"2026-05-18T01:51:39.822102Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"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":141,"source":"pdf_text","source_observed_at":"2026-05-22T13:08:57.425184Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:fbde3f57b0052e5e7cf89ebfe9fb093ec72f892a154c5109dd5acee4e7125263","observation_id":"f27f8f2b-c51d-4faf-bbaf-4fc718a3a802","resolution":{"observed_at":"2026-05-22T13:11:34.848410Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-03T13:47:40.242956Z","title":"Farhi and A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.23026","last_updated":"2026-06-03T10:51:34Z","snapshot_observed_at":"2026-08-04T02:07:59.757559Z","submitted_at":"2025-12-28T18:01:20Z","title":"Applying Grover-mixer quantum alternating operator ansatz algorithm to higher-order unconstrained binary optimization problems","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T13:47:40.242956Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2512.23026"},"observation_digest":"sha256:3c3d5dd3366ec9b22a8b07304207201f3481975349de1059de424784c5d4abee","observation_id":"f6c15660-f3bf-484c-9030-9ab8de95cbd1","resolution":{"observed_at":"2026-08-03T13:47:40.242956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2601.01516","last_updated":"2026-01-04T12:58:04Z","snapshot_observed_at":"2026-07-06T22:40:41.626783Z","submitted_at":"2026-01-04T12:58:04Z","title":"Constraint-Aware Quantum Optimization via Hamming Weight Operators","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-16T17:46:09.462808Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2601.01516"},"observation_digest":"sha256:f5bbfc6bc985e098f2e6519735ec77a3e59104c02b6aa855c8d8479b74bdbab6","observation_id":"085950ae-9830-4811-b63b-386995d7f60f","resolution":{"observed_at":"2026-05-16T17:48:11.540099Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-04T00:39:28.078292Z","title":"Quantum supremacy through the quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.05534","last_updated":"2026-07-31T21:41:34Z","snapshot_observed_at":"2026-08-07T01:40:45.317766Z","submitted_at":"2026-01-09T05:20:02Z","title":"BloQBench: A Blockchain Benchmarking Framework for Quantum Supremacy","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T00:39:28.078292Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2601.05534"},"observation_digest":"sha256:c0a9e7badf3b95c6c965877a2c632e9ac237fbd712606d15745b8d623ab55624","observation_id":"a81409f4-4b43-4253-94e9-b34e1f69dfb3","resolution":{"observed_at":"2026-08-04T00:39:28.078292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2604.08367","last_updated":"2026-04-24T14:15:34Z","snapshot_observed_at":"2026-07-06T22:57:26.678728Z","submitted_at":"2026-04-09T15:33:37Z","title":"Per-Shot Evaluation of QAOA on Max-Cut: A Black-Box Implementation Comparison with Goemans-Williamson","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T18:07:41.848436Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2604.08367"},"observation_digest":"sha256:c30908aa96db158ea487783bab7fed99f9d4834c6952ffd671650a3e4a2fec8c","observation_id":"0ca8fec1-fee3-4463-9a74-32bc0f729d2e","resolution":{"observed_at":"2026-05-10T18:10:42.255097Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2604.16718","last_updated":"2026-04-17T21:37:07Z","snapshot_observed_at":"2026-07-06T23:03:57.199731Z","submitted_at":"2026-04-17T21:37:07Z","title":"Potential Energy Savings from Quantum Computing-Based Route Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T06:28:05.712729Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2604.16718"},"observation_digest":"sha256:7f13ce4228945baa673ac2ede651206453e068d6372b50df0b489abb1f31c160","observation_id":"da7dd821-cd40-4559-a78b-2ee96fc48437","resolution":{"observed_at":"2026-05-10T06:31:30.672732Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2604.20088","last_updated":"2026-07-19T02:24:10Z","snapshot_observed_at":"2026-08-02T15:49:30.750294Z","submitted_at":"2026-04-22T01:08:38Z","title":"CVaR-Assisted Custom Penalty Function for Constrained Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T01:21:52.136754Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2604.20088"},"observation_digest":"sha256:945a2c4f1ea3c3dfe6fd20b4db970fe2221ff4899eb80494ceac177505bc2647","observation_id":"2351126f-aaf1-4d73-a4b8-3368ddb1a2cd","resolution":{"observed_at":"2026-05-11T13:36:09.121099Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-02T15:49:31.702894Z","title":"Farhi and A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2604.20088","last_updated":"2026-07-19T02:24:10Z","snapshot_observed_at":"2026-08-02T15:49:30.750294Z","submitted_at":"2026-04-22T01:08:38Z","title":"CVaR-Assisted Custom Penalty Function for Constrained Optimization","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T15:49:31.702894Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2604.20088"},"observation_digest":"sha256:07d7346f192d0f79ffac71282d509fc44f9292d4bf06cde095ea90dae8ea6bd1","observation_id":"ac470fa3-5c2d-49bc-b1bf-f75b3799e252","resolution":{"observed_at":"2026-08-02T15:49:31.702894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2605.11375","last_updated":"2026-05-12T00:58:42Z","snapshot_observed_at":"2026-07-06T23:23:11.928199Z","submitted_at":"2026-05-12T00:58:42Z","title":"TuniQ: Autotuning Compilation Passes for Quantum Workloads at Scale for Effectiveness and Efficiency","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-13T02:50:20.040271Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2605.11375"},"observation_digest":"sha256:3c824b28fa3b2bf50a017c81b1c0deecd9403664a9089b8b2121387ee907e2e3","observation_id":"9dbd0acc-323f-441b-b197-0092b0489f8f","resolution":{"observed_at":"2026-05-13T02:52:08.803847Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2605.22758","last_updated":"2026-06-17T09:47:17Z","snapshot_observed_at":"2026-07-06T23:33:04.856017Z","submitted_at":"2026-05-21T17:24:00Z","title":"A sharp interaction-degree threshold for simulating QAOA","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-22T05:34:06.000413Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2605.22758"},"observation_digest":"sha256:29e93a99c8373f3c36c28e08adaf51d815f1c10c49864cf4555b3220ba20cfa4","observation_id":"c2f1a07a-2909-4ec1-ac93-01f8d1e91fc7","resolution":{"observed_at":"2026-05-22T05:34:39.990705Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2606.02721","last_updated":"2026-06-04T06:27:12Z","snapshot_observed_at":"2026-07-06T23:43:02.654629Z","submitted_at":"2026-06-01T18:00:07Z","title":"Simulating Condensed Matter Physics on Quantum Hardware","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T12:35:56.048993Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2606.02721"},"observation_digest":"sha256:7d628e111119db9fce1b05623f0d063c6ed496bfdf61daf7e914997b4720fb5f","observation_id":"5ba34599-d963-4cba-b444-b546993fccd3","resolution":{"observed_at":"2026-06-28T12:42:08.889824Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2606.07084","last_updated":"2026-06-05T09:23:56Z","snapshot_observed_at":"2026-08-02T09:19:40.691510Z","submitted_at":"2026-06-05T09:23:56Z","title":"Projector Quantum Variational Ansatz","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T21:45:13.490325Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2606.07084"},"observation_digest":"sha256:e03420cc4f43baee32645cd4e826b4618232e6d784680baee1494881a858988e","observation_id":"0985a100-5cdf-4326-b6fc-7706672fd850","resolution":{"observed_at":"2026-07-02T18:57:16.977648Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2606.08707","last_updated":"2026-06-07T16:05:44Z","snapshot_observed_at":"2026-08-05T14:48:45.095824Z","submitted_at":"2026-06-07T16:05:44Z","title":"Simulating quantum circuits with a neural statebank","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T18:26:12.038661Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2606.08707"},"observation_digest":"sha256:f828b617d9bea9019af0616b6133cbc7ee20ecfbefc2e8f050643777df4deaac","observation_id":"41e69cb3-cdb9-497e-8cbe-2f7234afee54","resolution":{"observed_at":"2026-07-02T23:07:27.389162Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2606.13481","last_updated":"2026-07-02T15:53:40Z","snapshot_observed_at":"2026-07-06T23:52:14.348914Z","submitted_at":"2026-06-11T15:31:26Z","title":"Towards a Control interpretation of Quantum Advantage","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-27T05:54:32.676663Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2606.13481"},"observation_digest":"sha256:9174a7dae5971f3094687bd237efa77174006b32551c8d0bb901ccb832b47b89","observation_id":"3518ce67-c1a7-41a2-bbe5-32fe0270d498","resolution":{"observed_at":"2026-07-03T16:18:37.920656Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"1602.07674","doi":"10.48550/arxiv.1602.07674","metadata_source":"arxiv_reference","pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum supremacy through the quantum approx- imate optimization algorithm","venue":"arXiv (Cornell University)","work_id":"382954e1-961b-418f-a905-be9a72b4f166","year":2016},"citing_paper":{"arxiv_id":"2606.13481","last_updated":"2026-07-02T15:53:40Z","snapshot_observed_at":"2026-07-06T23:52:14.348914Z","submitted_at":"2026-06-11T15:31:26Z","title":"Towards a Control interpretation of Quantum Advantage","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-03T23:52:50.301363Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2606.13481"},"observation_digest":"sha256:e395237485a2dcc8a4bc71a4037670711bcddeca47609ba990ea85c776c27a14","observation_id":"a336ebc2-8745-4237-8b1e-0a22b06992fb","resolution":{"observed_at":"2026-07-03T23:59:06.190005Z","resolver_source":"arxiv_id","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-03T20:38:07.962851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.962851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-01T05:02:01.278340Z","title":"Farhi and A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-07T01:37:22.044504Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.278340Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:880f4e39397913942b782708c50b30c77740da4e46d0dde3179fb9e6feebda72","observation_id":"d599d0a2-b28e-456f-a858-2ed67c938909","resolution":{"observed_at":"2026-08-01T05:02:01.278340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-07T12:27:19.155068Z","title":"Quantum supremacy through the quantum approximate optimization algorithm.arXiv preprint arXiv:1602.07674, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-07T20:20:40.788691Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:19.155068Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:aa27b6ca7e1fdc53a7bf47cdab7945b8dff34f762ac3c4d1b15271812cfab7c3","observation_id":"092e40c6-b4f6-4aad-8027-351aba12b722","resolution":{"observed_at":"2026-08-07T12:27:19.155068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1602.07674/citation-record","integrity":"/paper/1602.07674/integrity","json":"/paper/1602.07674/citation-record.json","paper":"/paper/1602.07674"},"outbound":[],"paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through 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-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 0 of 0 outbound references and 26 inbound Pith citation observations for arXiv:1602.07674."}