{"as_of":"2026-08-09T11:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e998e5dc6dde0e2b143140da4978b049eec8a135f24e7893e0c29e8d229891cb","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":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":17,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T00:50:33.758899Z","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":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":"2405.09169","doi":"10.48550/arxiv.2405.09169","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards a uni- versal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","venue":"arXiv (Cornell University)","work_id":"6286ced6-9d56-49fc-9ae7-8c26ad1f97f5","year":2025},"citing_paper":{"arxiv_id":"2405.08810","last_updated":"2024-06-19T01:39:44Z","snapshot_observed_at":"2026-07-06T18:14:20.889736Z","submitted_at":"2024-05-14T17:55:32Z","title":"Quantum computing with Qiskit","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-10T19:16:38.435343Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2405.08810"},"observation_digest":"sha256:c30b4b7ee45c38d582dda08b37f288483834d3fe8263afef287f9eece860afa7","observation_id":"1e8937a7-3daf-4fd2-8805-04ec50232fd5","resolution":{"observed_at":"2026-05-10T19:16:38.520740Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-09T00:50:33.758899Z","title":"Optimum consumption and portfolio rules in a continuous-time model","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05226","last_updated":"2025-02-06T05:09:48Z","snapshot_observed_at":"2026-08-09T09:51:04.323018Z","submitted_at":"2025-02-06T05:09:48Z","title":"Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T00:50:33.758899Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2502.05226"},"observation_digest":"sha256:50c12afa91682ded35ef2a19c93ccbde9dc5693b10743315dc9dbd5c5cf302d0","observation_id":"63efb117-fcfa-4419-a8cd-a67590845d48","resolution":{"observed_at":"2026-08-09T00:50:33.758899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-08T15:24:49.839476Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06471","last_updated":"2025-05-28T08:55:27Z","snapshot_observed_at":"2026-08-08T15:18:17.813977Z","submitted_at":"2025-02-10T13:50:50Z","title":"Evaluating the performance of quantum processing units at large width and depth","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:49.839476Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2502.06471"},"observation_digest":"sha256:7a8b97b29cb3b4c5a6a699070c39d3fc019dad19658f4cf091cb3a513542476c","observation_id":"c0cda2f0-3541-4439-92fb-fa3f4bda8c26","resolution":{"observed_at":"2026-08-08T15:24:49.839476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-07T14:43:42.144719Z","title":"Towards a universal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17944","last_updated":"2025-05-23T14:20:40Z","snapshot_observed_at":"2026-08-09T10:50:18.258486Z","submitted_at":"2025-05-23T14:20:40Z","title":"Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:42.144719Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2505.17944"},"observation_digest":"sha256:28b91a5346bb96b55208f73fb6441e044800a7985166c1c2709c34734eeba143","observation_id":"a40f247f-fa89-4a94-b7fd-2f5c750b1159","resolution":{"observed_at":"2026-08-07T14:43:42.144719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":"2405.09169","doi":"10.48550/arxiv.2405.09169","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards a uni- versal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","venue":"arXiv (Cornell University)","work_id":"6286ced6-9d56-49fc-9ae7-8c26ad1f97f5","year":2025},"citing_paper":{"arxiv_id":"2508.02590","last_updated":"2026-05-18T18:00:54Z","snapshot_observed_at":"2026-08-01T16:50:47.701174Z","submitted_at":"2025-08-04T16:44:53Z","title":"Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T23:02:50.850801Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2508.02590"},"observation_digest":"sha256:07d8977caa9fb3fd91616c77c9ec535ebcc46b08a354ca7104ef8d484c7d2125","observation_id":"5acb6b76-8763-40db-824c-22e1cc54cd5a","resolution":{"observed_at":"2026-05-21T23:04:25.673985Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T14:08:14.263591Z","title":"arXiv preprint arXiv:2405.09169 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21686","last_updated":"2025-08-29T14:53:56Z","snapshot_observed_at":"2026-08-08T14:53:08.233739Z","submitted_at":"2025-08-29T14:53:56Z","title":"An Exclusive-Sum-of-Products Pipeline for QAOA","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T14:08:14.263591Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2508.21686"},"observation_digest":"sha256:ef53b65f81147e6650b9b0da3037e2cee443bcb3e6433c68c5da5c6c7cf8907c","observation_id":"9d602556-f439-4e28-a25a-aec26575d12e","resolution":{"observed_at":"2026-08-05T14:08:14.263591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":"2405.09169","doi":"10.48550/arxiv.2405.09169","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards a uni- versal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","venue":"arXiv (Cornell University)","work_id":"6286ced6-9d56-49fc-9ae7-8c26ad1f97f5","year":2025},"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":36,"source":"pdf_text","source_observed_at":"2026-05-18T15:32:56.280828Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2509.13528"},"observation_digest":"sha256:f3b3cb34641a19871db5b652c9949715ae420a617bbc6e33fcad65ab6bbe41de","observation_id":"cbb81548-4792-4329-bf13-a6d65180f4d0","resolution":{"observed_at":"2026-05-18T15:36:34.567170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-04T15:59:28.167636Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.17876","last_updated":"2026-07-09T10:45:26Z","snapshot_observed_at":"2026-08-08T18:45:32.298383Z","submitted_at":"2025-09-22T15:13:31Z","title":"Quantum Portfolio Optimization: An Extensive Benchmark","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T15:59:28.167636Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2509.17876"},"observation_digest":"sha256:c1e0817fbb8090e7910d61b2ec78c3d04a248da448465b7c5a6e1fdcd0837e0b","observation_id":"3e5a6d3c-7d18-4544-b58b-ce5b7ec51a95","resolution":{"observed_at":"2026-08-04T15:59:28.167636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":"2405.09169","doi":"10.48550/arxiv.2405.09169","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards a uni- versal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","venue":"arXiv (Cornell University)","work_id":"6286ced6-9d56-49fc-9ae7-8c26ad1f97f5","year":2025},"citing_paper":{"arxiv_id":"2511.17259","last_updated":"2026-06-10T07:19:35Z","snapshot_observed_at":"2026-08-03T21:06:58.903886Z","submitted_at":"2025-11-21T14:04:01Z","title":"Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-17T20:53:54.478821Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2511.17259"},"observation_digest":"sha256:acdbac1f75d97531c8d2162e8c09f6434954cf5db1ffe0bd9564aadbeb16b4d5","observation_id":"26470dfc-751a-468c-a17e-f28572c194af","resolution":{"observed_at":"2026-05-17T20:55:15.065807Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-03T21:07:05.020832Z","title":"Towards a universal QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.17259","last_updated":"2026-06-10T07:19:35Z","snapshot_observed_at":"2026-08-03T21:06:58.903886Z","submitted_at":"2025-11-21T14:04:01Z","title":"Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T21:07:05.020832Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2511.17259"},"observation_digest":"sha256:c8b95207a781b2050f02039391af430895fc8d5812e11b61cec47a911ed10383","observation_id":"73132680-c441-42e1-af42-933502b2df96","resolution":{"observed_at":"2026-08-03T21:07:05.020832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":"2405.09169","doi":"10.48550/arxiv.2405.09169","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards a uni- versal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","venue":"arXiv (Cornell University)","work_id":"6286ced6-9d56-49fc-9ae7-8c26ad1f97f5","year":2025},"citing_paper":{"arxiv_id":"2603.01809","last_updated":"2026-04-19T08:11:33Z","snapshot_observed_at":"2026-08-06T23:28:09.925515Z","submitted_at":"2026-03-02T12:44:19Z","title":"Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\\'er Filtering","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-15T18:31:23.726409Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2603.01809"},"observation_digest":"sha256:7e4fc4748ca03fd5b7f3bd53ec4caf15969d038065172bc3bf315c42acfd6222","observation_id":"1d0022e7-0c12-4ed4-a6ee-4701beb72764","resolution":{"observed_at":"2026-05-15T18:31:27.628155Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":"2405.09169","doi":"10.48550/arxiv.2405.09169","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards a uni- versal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","venue":"arXiv (Cornell University)","work_id":"6286ced6-9d56-49fc-9ae7-8c26ad1f97f5","year":2025},"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":12,"source":"pdf_text","source_observed_at":"2026-05-10T18:07:41.848436Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2604.08367"},"observation_digest":"sha256:a021449005140cd9e0bb442fcab9c91bd58e55b2425ac81748513ccc851233db","observation_id":"bdb9976a-bfe6-4631-b5c7-ba78183c68a5","resolution":{"observed_at":"2026-05-10T18:10:42.270032Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":"2405.09169","doi":"10.48550/arxiv.2405.09169","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards a uni- versal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","venue":"arXiv (Cornell University)","work_id":"6286ced6-9d56-49fc-9ae7-8c26ad1f97f5","year":2025},"citing_paper":{"arxiv_id":"2604.25275","last_updated":"2026-04-28T06:33:55Z","snapshot_observed_at":"2026-08-02T11:36:46.712626Z","submitted_at":"2026-04-28T06:33:55Z","title":"Graph-Conditioned Meta-Optimizer for QAOA Parameter Generation on Multiple Problem Classes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-07T16:51:24.821614Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2604.25275"},"observation_digest":"sha256:0782a759053d7c514d30d53f4a2d2f1dbf25dd19a6f1f697e11043d28cacee8a","observation_id":"53d27df7-027e-4c02-afb4-611a31bb09ce","resolution":{"observed_at":"2026-05-11T23:31:16.034305Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":"2405.09169","doi":"10.48550/arxiv.2405.09169","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards a uni- versal qaoa protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","venue":"arXiv (Cornell University)","work_id":"6286ced6-9d56-49fc-9ae7-8c26ad1f97f5","year":2025},"citing_paper":{"arxiv_id":"2607.01037","last_updated":"2026-07-13T14:37:21Z","snapshot_observed_at":"2026-07-16T23:19:39.340781Z","submitted_at":"2026-07-01T15:04:48Z","title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-02T11:54:21.536011Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2607.01037"},"observation_digest":"sha256:468ba18471136d541214bbd955432df3e8f4ed7c819705577fd4c1914ad11bad","observation_id":"976c6e7a-932c-4f27-9f17-4a87592da35c","resolution":{"observed_at":"2026-07-02T11:56:54.877894Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-07-14T16:49:25.319923Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.01037","last_updated":"2026-07-13T14:37:21Z","snapshot_observed_at":"2026-07-16T23:19:39.340781Z","submitted_at":"2026-07-01T15:04:48Z","title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T16:49:25.319923Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2607.01037"},"observation_digest":"sha256:967e08df58dd8708cfbf0ac3ec57b4085a51e347293a3552a2c8488a31f79cdb","observation_id":"5bd49b90-8ae4-43dd-9fd1-859d7a091f8b","resolution":{"observed_at":"2026-07-14T16:49:25.319923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-02T05:33:40.656933Z","title":"Towards a universal qaoa protocol: Evidence of quantum advantage in solving combinatorial optimization problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13325","last_updated":"2026-07-14T23:18:36Z","snapshot_observed_at":"2026-08-06T09:05:01.354746Z","submitted_at":"2026-07-14T23:18:36Z","title":"A Reality Check on Quantum Optimisation: Evidence from an Industrial Case Study","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T05:33:40.656933Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2607.13325"},"observation_digest":"sha256:9af0373470a1c5ab7bb7e4f984371e9f5f2a165d95f8d6b166b4f3db27e43542","observation_id":"0ea91a59-82e9-4c3c-8055-d35da91bdd3e","resolution":{"observed_at":"2026-08-02T05:33:40.656933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09169","snapshot_observed_at":"2026-08-02T08:03:26.757800Z","title":"doi:10.1038/s41534-025-01082-1","venue":null,"work_id":null,"year":2056},"citing_paper":{"arxiv_id":"2607.16277","last_updated":"2026-07-08T19:44:55Z","snapshot_observed_at":"2026-08-04T08:13:03.184780Z","submitted_at":"2026-07-08T19:44:55Z","title":"A Hybrid Classical-Quantum Approach for Multi-Constrained Location Optimization Problem","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T08:03:26.757800Z"},"links":{"cited_paper":"/paper/2405.09169","citing_paper":"/paper/2607.16277"},"observation_digest":"sha256:260b0fed2cb9778a201428dd5da96efe786ffdba7fea186879f8c4fb876cdb97","observation_id":"7f2b3e07-04b2-4899-8794-76aa4c2d49bc","resolution":{"observed_at":"2026-08-02T08:03:26.757800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.09169/citation-record","integrity":"/paper/2405.09169/integrity","json":"/paper/2405.09169/citation-record.json","paper":"/paper/2405.09169"},"outbound":[],"paper":{"arxiv_id":"2405.09169","last_updated":"2025-08-04T14:10:48Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 17 inbound Pith citation observations for arXiv:2405.09169."}