{"as_of":"2026-08-13T10:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d9ca43e68b890d66ce5ab0474d02b6292192b41365f353d34e702647aae3127","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":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":35,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T21:29:34.462688Z","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-10T18:51:40.981282Z","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-12T21:29:34.462688Z","title":"Quantum supremacy through the quantum approximate optimization algorithm","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.08824","last_updated":"2024-11-13T18:04:01Z","snapshot_observed_at":"2026-08-12T21:15:47.584567Z","submitted_at":"2024-11-13T18:04:01Z","title":"Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T21:29:34.462688Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2411.08824"},"observation_digest":"sha256:8ad12b12e29c9b2ae9460639cd8db567c14e233f88a07a886b5a17de9b7aafb9","observation_id":"7d6c6c56-1322-4b2d-826a-e79aa285d81d","resolution":{"observed_at":"2026-08-12T21:29:34.462688Z","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-10T18:51:40.981282Z","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-12T20:30:26.282852Z","title":"Farhi and A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.09745","last_updated":"2024-11-14T19:00:09Z","snapshot_observed_at":"2026-08-12T23:56:58.410624Z","submitted_at":"2024-11-14T19:00:09Z","title":"Analytical Expressions for the Quantum Approximate Optimization Algorithm and its Variants","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-12T20:30:26.282852Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2411.09745"},"observation_digest":"sha256:b45fd93877bb57ffe00b4dad959c355e63dca76f08dd57dbb797bf7b61fb619b","observation_id":"30881061-65c8-4f0c-b054-c10c56874b1a","resolution":{"observed_at":"2026-08-12T20:30:26.282852Z","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-10T18:51:40.981282Z","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-12T19:50:04.121242Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.10303","last_updated":"2024-11-15T15:59:46Z","snapshot_observed_at":"2026-08-12T19:43:44.142744Z","submitted_at":"2024-11-15T15:59:46Z","title":"Quantum-assisted Stacking Sequence Retrieval and Laminated Composite Design","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T19:50:04.121242Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2411.10303"},"observation_digest":"sha256:4d57272804444b56a07d9b6c881f3fa79219b6058f39d2a7caaf144efd793788","observation_id":"d429bfc4-8ea5-4c6e-8227-b20db0ebd9b6","resolution":{"observed_at":"2026-08-12T19:50:04.121242Z","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-10T18:51:40.981282Z","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-11T23:00:22.411979Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.02955","last_updated":"2024-12-06T14:34:12Z","snapshot_observed_at":"2026-08-13T09:15:07.531040Z","submitted_at":"2024-12-04T02:04:51Z","title":"Variational quantum classifiers via a programmable photonic microprocessor","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:00:22.411979Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2412.02955"},"observation_digest":"sha256:e03624344190f9c00009babe136c18535e972901266189ac31f7641fca630a49","observation_id":"b957255a-6375-4641-a3a2-37b4c3af71ae","resolution":{"observed_at":"2026-08-11T23:00:22.411979Z","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-10T18:51:40.981282Z","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-11T18:43:29.225016Z","title":"and Harrow, A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.07686","last_updated":"2024-12-10T17:20:44Z","snapshot_observed_at":"2026-08-11T18:34:33.517488Z","submitted_at":"2024-12-10T17:20:44Z","title":"Optimizing Sensor Redundancy in Sequential Decision-Making Problems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T18:43:29.225016Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2412.07686"},"observation_digest":"sha256:ac2f76cc5c1cc5870f505d8ff1de36f06c5db47260f3e8bc32333c02e931fe94","observation_id":"936928cf-1c5a-4539-811c-3f3bf84694b5","resolution":{"observed_at":"2026-08-11T18:43:29.225016Z","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-10T18:51:40.981282Z","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-11T13:54:53.152715Z","title":"Farhi and A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.152715Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:5ea3c9a1c479086d76fdf63867d2f62f07123c92cf9cd544ccaefc2e57bb685e","observation_id":"1eb49561-9ec3-444f-91b1-1a834a292147","resolution":{"observed_at":"2026-08-11T13:54:53.152715Z","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-10T18:51:40.981282Z","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-11T05:34:33.216606Z","title":"Farhi and A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.17485","last_updated":"2024-12-23T11:28:44Z","snapshot_observed_at":"2026-08-12T15:14:15.916939Z","submitted_at":"2024-12-23T11:28:44Z","title":"Distribution-Adaptive Dynamic Shot Optimization for Variational Quantum Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T05:34:33.216606Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2412.17485"},"observation_digest":"sha256:35e56ac4c8e68deb696eb874b646d0171adaae2809046e13094f75b373d23a0b","observation_id":"fdf76625-2d1c-4719-af53-4867f67551fe","resolution":{"observed_at":"2026-08-11T05:34:33.216606Z","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-10T18:51:40.981282Z","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-11T12:55:04.509963Z","title":"and Harrow, A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.17841","last_updated":"2024-12-27T16:49:23Z","snapshot_observed_at":"2026-08-11T18:42:37.151100Z","submitted_at":"2024-12-18T12:05:18Z","title":"Reducing QUBO Density by Factoring Out Semi-Symmetries","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T12:55:04.509963Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2412.17841"},"observation_digest":"sha256:b3df5cf9b15f24e58910c60f3e3498d2e6ffa4d56af77bea667d26561ec237db","observation_id":"ec381a94-c6b3-4815-a0ba-0354b299867d","resolution":{"observed_at":"2026-08-11T12:55:04.509963Z","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-10T18:51:40.981282Z","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:7986c45b016a4ebb9daad83e7e984e372ae50c59b4efc0a0a23d50757e15a52a","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-08T21:23:34.501059Z","title":"Quantum supremacy through the quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.04830","last_updated":"2025-02-07T11:05:41Z","snapshot_observed_at":"2026-08-12T00:51:07.154070Z","submitted_at":"2025-02-07T11:05:41Z","title":"Quantum Supremacy in Tomographic Imaging: Advances in Quantum Tomography Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T21:23:34.501059Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2502.04830"},"observation_digest":"sha256:230462966ac76ebb8cd134f4b987d9fa7222642e4a027352356afff47271c9ef","observation_id":"602820af-0a7c-4f6b-b4a5-750c2da0869a","resolution":{"observed_at":"2026-08-08T21:23:34.501059Z","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-10T18:51:40.981282Z","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-12T01:16:12.237372Z","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:a27555ab9e58ca37c7fcdbe2b7b4d05c1f21a019ac8fa03cea02a1e751e4a783","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-10T18:51:40.981282Z","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-09T09:41:58.187862Z","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:c60631401564c09f8c366611f993cadf1715abfd44e9697065054b224e377ba5","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-10T18:51:40.981282Z","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-13T08:00:48.705987Z","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:30abe4b251228932721559ced063c7b85a119a34015334029d44793514e58c90","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-10T18:51:40.981282Z","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:f1c6e7fced5ea4dabb90ed8189c63c25963358de7a0f6372774f2822942c9051","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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:8020e2a6dc44100a37e56407ec3ed0472aeb469551c90d9ef8f5b8e656523a70","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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:d8cb3c28f9a8e8d638cd63479e32e97b88a3d3d69d53edcaaebbbe44821da387","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-08-11T12:32:46.480676Z","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:bf9516a7fb29506df01aa4a4f83961d70796ca00a394185fac0c8a69252f6610","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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:7f25f866021d8d8610b6f28225960ff088f2ef47fa24ab49d5d551fa0f379397","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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:abb7d06244eb30c1ca8002246cfd24585dbe44d379bf2628c9c51252e6c06056","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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:1341f7c1582996cf8b2b1351b5847297a296f877d07f30a210c0d5e09e3ef724","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-10T18:51:40.981282Z","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-08-11T16:01:18.260289Z","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:76abfd747f1791e81301d84cd7c0ecf29fe034fdeccad23c0a86b9c428ac5766","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-10T18:51:48.892731Z","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:39a3ddc47578d498a101a8841ebd2b147e8593ee37ed19b06279369600c98443","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-10T18:51:40.981282Z","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:9b9fac4362fc7e94bfa4830999453e2468fbcf478f0a0aa86be48670d2da3e76","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-08-12T06:18:29.225877Z","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:489ba6613f0dfbcf58736dd632a6ea99b6cce8069208a187d501d59d9f2d3a5a","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-13T02:00:18.144129Z","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:f2b02b1bcd69a9a29d91bb87e37ae1875b535d67ea983c1541cca485eb1462cb","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-13T02:00:18.144129Z","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:fbdcbef087cb9e3e41cac2a048aa4c6e7f7b1d25a0d953cefe78bd25da0213a3","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-10T18:51:40.981282Z","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-08-13T02:59:20.694396Z","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:cda728422497bb0aa76eb01b1d467fce989a0bfa4a7ba1a3175eae699372a428","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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:0da1f61445bd845e422aceb0b924c696d8daa711660d21aa9a717087e9491459","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-08-12T17:47:27.776933Z","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:a9c63f18078d04c691bf2b9b81693125b174e929f6af84b78cbdbd5e9aa41de4","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-12T18:59:00.133750Z","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:9dde61697cf7d695b0bf6f8c0b07a049cadf243569a97c8c123eb2c0d49ccd5b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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:e291dce7373bf091b6b394db392900a1c3477ffa792fb742bc5532df16997dc9","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-08-10T01:05:12.288651Z","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:46b277273f5204121c18e822e8aedb127fb5728cbf703a0807ee17be1c79ab01","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-08-10T01:05:12.288651Z","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:524eae8f23b314448fc9b94b79c73679f810ea991728aa195671ead58ac65c13","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+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-13T06:31:53.387327+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-10T18:51:40.981282Z","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-08T06:39:19.664846Z","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:188df5d6dadee359876cf7b7572ed3b3f16051752d871222b4f7d89a97229a7a","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-10T18:51:40.981282Z","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-09T23:13:07.257387Z","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:75549229352af2fa7ae24c5394bc4208633a925234aacda198aa8f27d8743dec","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-10T18:51:40.981282Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 35 inbound Pith citation observations for arXiv:1602.07674."}