{"as_of":"2026-08-13T03:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68f37022a37ad0f21e247fc7028a18af7243fece76d8080483fa71b34a845351","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T21:55:17.540073Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T13:24:18.692644Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T09:16:49.159804Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2504.01694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-07-02T09:16:49.159804Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"69aaabbd-6869-4886-8bb2-a347da44f7cd","year":2025},"citing_paper":{"arxiv_id":"2505.07929","last_updated":"2026-04-22T01:12:30Z","snapshot_observed_at":"2026-08-02T16:02:47.699142Z","submitted_at":"2025-05-12T18:00:01Z","title":"Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-22T15:15:06.267828Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2505.07929"},"observation_digest":"sha256:5720bf03ecae03e79cb92672e9d61b482765962406e360860ca34b168e298aaa","observation_id":"192d17c9-f1c9-42b8-ae84-6d8693e8b9f0","resolution":{"observed_at":"2026-05-22T15:16:43.771830Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2504.01694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-07-02T09:16:49.159804Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"69aaabbd-6869-4886-8bb2-a347da44f7cd","year":2025},"citing_paper":{"arxiv_id":"2505.16444","last_updated":"2026-04-28T11:32:01Z","snapshot_observed_at":"2026-07-06T21:28:24.644692Z","submitted_at":"2025-05-22T09:33:29Z","title":"End-to-End Speedup for Quantum Simulation-Based Optimization in Power Grid Management","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-22T14:13:39.130213Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2505.16444"},"observation_digest":"sha256:7385100c7395dbcf5059f83c8b6afd7de778eca7c3b2e03abfa04cd42dc4e4d7","observation_id":"a2a78917-dc5a-4add-a2ba-5227df77cc55","resolution":{"observed_at":"2026-05-22T14:14:55.594637Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2504.01694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-07-02T09:16:49.159804Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"69aaabbd-6869-4886-8bb2-a347da44f7cd","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":49,"source":"pdf_text","source_observed_at":"2026-05-18T15:32:56.280828Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2509.13528"},"observation_digest":"sha256:4df8da9d9aa35f32eb86284ddcb97c5e466a2565b8bbec8da2ea4e800b4c13db","observation_id":"aa7bb49f-5427-4f80-8c56-03d9dda682f6","resolution":{"observed_at":"2026-05-18T15:36:34.480148Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2504.01694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-07-02T09:16:49.159804Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"69aaabbd-6869-4886-8bb2-a347da44f7cd","year":2025},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:aa50efc6570855d025275c3a28fe0f501ef065f52c48c3a8c02a4f07c4e7b8fc","observation_id":"e9802974-de50-4912-918a-a41ef8ac76e6","resolution":{"observed_at":"2026-05-22T11:44:50.194386Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2504.01694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-07-02T09:16:49.159804Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"69aaabbd-6869-4886-8bb2-a347da44f7cd","year":2025},"citing_paper":{"arxiv_id":"2604.20180","last_updated":"2026-04-22T04:53:39Z","snapshot_observed_at":"2026-08-11T12:31:33.887235Z","submitted_at":"2026-04-22T04:53:39Z","title":"Tensor network surrogate models for variational quantum computation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T00:50:54.243622Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2604.20180"},"observation_digest":"sha256:a22cb59e334541cb1c6dd2da5be6688ff7803eaa5199b35f20111f06ec6ce1a8","observation_id":"0205b58d-845d-45ea-b806-dd0d1924967a","resolution":{"observed_at":"2026-05-10T00:54:48.743801Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2504.01694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-07-02T09:16:49.159804Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"69aaabbd-6869-4886-8bb2-a347da44f7cd","year":2025},"citing_paper":{"arxiv_id":"2605.23377","last_updated":"2026-07-21T05:42:22Z","snapshot_observed_at":"2026-08-02T13:24:14.349611Z","submitted_at":"2026-05-22T08:43:07Z","title":"SAFE ma-QAOA: Surrogate-Assisted and Fine-Tuning Enhanced Multi-Angle QAOA with Parameter Distillation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-25T04:27:33.133626Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2605.23377"},"observation_digest":"sha256:19c0e52334620f62a0b842fbfd25639d2111b94ca7ac54e01ad7fdb7083fb7e5","observation_id":"e9033ce6-6636-4aa2-ac75-44d69a6949ab","resolution":{"observed_at":"2026-05-25T04:30:20.225374Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-08-02T13:24:18.692644Z","title":"Iterative interpolation schedules for quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.23377","last_updated":"2026-07-21T05:42:22Z","snapshot_observed_at":"2026-08-02T13:24:14.349611Z","submitted_at":"2026-05-22T08:43:07Z","title":"SAFE ma-QAOA: Surrogate-Assisted and Fine-Tuning Enhanced Multi-Angle QAOA with Parameter Distillation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T13:24:18.692644Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2605.23377"},"observation_digest":"sha256:7942277e467c491543821b3b6c049a8d890d37e143c327edf47a5e9d9f0a5550","observation_id":"1de9f0e4-bc72-43c8-95c2-9c7460b0716b","resolution":{"observed_at":"2026-08-02T13:24:18.692644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2504.01694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-07-02T09:16:49.159804Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"69aaabbd-6869-4886-8bb2-a347da44f7cd","year":2025},"citing_paper":{"arxiv_id":"2606.05311","last_updated":"2026-06-03T18:02:26Z","snapshot_observed_at":"2026-08-02T01:33:39.943775Z","submitted_at":"2026-06-03T18:02:26Z","title":"Setting angles in quantum approximate optimization at utility-scale","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-06-28T05:36:16.703269Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2606.05311"},"observation_digest":"sha256:e883936413c59cbd655f1d17cd14d586365709c36380403b79f0f6bbd9255e54","observation_id":"b6f8e215-05c0-4c35-9cf2-582e82f4bc43","resolution":{"observed_at":"2026-07-02T09:16:49.161115Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.01694/citation-record","integrity":"/paper/2504.01694/integrity","json":"/paper/2504.01694/citation-record.json","paper":"/paper/2504.01694"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices","venue":null,"work_id":"08710937-1692-4a86-b916-edbfa143b465","year":2020},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:b3282dbe70979fa3502e8ec88c5a5c7e656252b25d797a72d25ed63f78824864","observation_id":"a67c9252-7e6a-4f41-961c-86a6a9cc5f93","resolution":{"observed_at":"2026-05-22T21:57:10.610878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum optimization","venue":null,"work_id":"58b53e27-18e8-4edc-a0c9-bd437ce8b4bc","year":2000},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:cb0c57c686efd8872ade9fe3e16408f09ae46729c4be4a8ff002780b8886cf78","observation_id":"57c9576d-1e85-474a-8c29-9caeafb26c1e","resolution":{"observed_at":"2026-05-22T21:57:10.534792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum search heuristics","venue":null,"work_id":"5fc601a4-93fa-4d31-9763-8b74cddd88d2","year":2000},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:b2d0cffdc68550b2ce83f0403daba14b5564ddc044047b5747e756c8d58b6111","observation_id":"6729bd38-eff2-4dd6-90ce-04a190042647","resolution":{"observed_at":"2026-05-22T21:57:10.509820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"1411.4028","doi":"10.48550/arxiv.1411.4028","metadata_source":"pith","pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"5a33d9f3-407a-4c7e-a119-ff581c66b173","year":2014},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:22e0642b66353b2d36c4be18e74a5ab3ddfd48c8e1cfd14293e9e63b3477f8db","observation_id":"afc7e311-bfee-410f-9aff-ba8dfd763864","resolution":{"observed_at":"2026-05-22T21:57:10.390452Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Qaoa with n · p ≥","venue":null,"work_id":"61da3de2-3572-483b-9dcf-524081152efb","year":null},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:02beed4a05cc932c310a1d474c24088703d55c31c9d7bf679b0077e6426df8c9","observation_id":"844fdee2-e514-4864-a23a-da2471bb28a6","resolution":{"observed_at":"2026-05-22T21:57:10.619547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"IEEE, September 2023","venue":null,"work_id":"159dcef5-0b88-4311-8e5a-a0dde12480e8","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:1c478f5e2659faef2d5f26af53f439fe07e67774aed3b2558a1a0bbc1d983d69","observation_id":"23849d48-cf6e-4194-bce7-5a7790c8e742","resolution":{"observed_at":"2026-05-22T21:57:10.590416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum annealing vs","venue":null,"work_id":"b67ca757-a2f2-4d36-9794-39dfe540a1bb","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:bef67ca729636f7338a2fd7f5d75f9cd5c2542ef84bd2227534a67188c41fb0e","observation_id":"48fbaef4-b9d5-4132-acc2-9e55a7121e40","resolution":{"observed_at":"2026-05-22T21:57:10.613357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scaling whole-chip qaoa for higher-order ising spin glass models on heavy- hex graphs","venue":null,"work_id":"d5add702-a9cd-4ab4-9aee-c0772d1e44fe","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:8c471a1c591ece25280ba66d86565ff32dcf5a2eea21810771d2250f818b8d3c","observation_id":"b3019adf-a8c8-45e7-bd50-2984927284b7","resolution":{"observed_at":"2026-05-22T21:57:10.632568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.12104","doi":"10.48550/arxiv.2409.12104","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Performance of quantum approximate optimiza- tion with quantum error detection","venue":null,"work_id":"1334f2f7-1edd-430a-9625-f5da7d1da93e","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:acea2f49aab15bc39932191c0579bf2aebc35b928ea3ba857dddd0ed07eb9520","observation_id":"0e54152e-50da-48f8-8159-9565b31382bd","resolution":{"observed_at":"2026-05-22T21:57:10.467211Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-12T23:01:51.843604Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":"2408.09538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-07-04T01:09:19.801142Z","title":"Pa- rameter setting heuristics make the quantum approxi- mate optimization algorithm suitable for the early fault- tolerant era","venue":null,"work_id":"1000ece0-73c7-4139-bf02-81fd2bbf790a","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:f24df5e1589ff127675da39d618a79d3cf7c39435c7ce871cb9fccbb98b43a73","observation_id":"8d393efc-a4f8-4f6a-a241-904091eca7cf","resolution":{"observed_at":"2026-05-22T21:57:10.460379Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.06909","last_updated":"2022-08-14T20:39:48Z","snapshot_observed_at":"2026-08-12T21:52:14.290971Z","submitted_at":"2022-08-14T20:39:48Z","title":"Solving boolean satisfiability problems with the quantum approximate optimization algorithm","version":1},"cited_work":{"arxiv_id":"2208.06909","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.06909","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Boulebnane and A","venue":null,"work_id":"fd8ee130-4d38-432d-82d5-4802c41e739d","year":2022},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2208.06909","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:c02a5894216ea57a476cb86ceac363ec5c36d5d44cf915ddf094c5be118467cb","observation_id":"deb8906f-646a-4eb8-81e7-8769f9694490","resolution":{"observed_at":"2026-05-22T21:57:10.423370Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.02342","last_updated":"2024-06-02T13:49:44Z","snapshot_observed_at":"2026-08-11T17:50:27.839572Z","submitted_at":"2023-08-04T14:17:21Z","title":"Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem","version":2},"cited_work":{"arxiv_id":"2308.02342","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.02342","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Evidence of scaling advantage for the quantum approxi- mate optimization algorithm on a classically intractable problem","venue":null,"work_id":"590c1cb3-2465-4168-b2ca-7ec79e85255d","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2308.02342","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:794ef62aef5e90ef7670a0e7f2c60698eefb7aa6a2001fbb2d06024d95bafa58","observation_id":"2322a855-fcc7-4c53-a25d-ff5137372c0b","resolution":{"observed_at":"2026-05-22T21:57:10.374409Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"cited_work":{"arxiv_id":"2411.17442","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.17442","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Applying the quantum approximate optimization algorithm to gen- eral constraint satisfaction problems","venue":null,"work_id":"a2ab6827-beda-453b-ba02-17f674a88369","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2411.17442","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:06dce586f8b9358b35667f9f28018c350b70fc3bc61438dac840f5b3fd996a9d","observation_id":"29faec16-421a-418c-b39e-4e8a477df5d1","resolution":{"observed_at":"2026-05-22T21:57:10.473276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04979","last_updated":"2025-02-24T10:25:45Z","snapshot_observed_at":"2026-08-12T23:57:23.487916Z","submitted_at":"2024-11-07T18:51:44Z","title":"Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA","version":2},"cited_work":{"arxiv_id":"2411.04979","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.04979","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Montanaro and L","venue":null,"work_id":"a9d51d00-8690-4da8-9618-53aa104607ac","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2411.04979","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:d721e913ec5e61212474ff9b105a82e827b752dac87bbe00ba1c848b6fcfd8f0","observation_id":"46a2bf4e-981b-461c-8808-d3885aa42a8a","resolution":{"observed_at":"2026-05-22T21:57:10.453777Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameter setting in quantum ap- proximate optimization of weighted problems","venue":null,"work_id":"528e69cc-14f5-4e81-af45-c18e7c249b6d","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:f6285767e5edf72151bd4f346258d5ac4d29655e5862552412b7a519989cefa6","observation_id":"d89c869e-4701-41dd-bfe7-7f71dddc3b02","resolution":{"observed_at":"2026-05-22T21:57:10.581475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14206","last_updated":"2022-07-07T13:35:52Z","snapshot_observed_at":"2026-08-09T13:15:31.543040Z","submitted_at":"2021-10-27T06:35:59Z","title":"The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model","version":3},"cited_work":{"arxiv_id":"2110.14206","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.14206","snapshot_observed_at":"2026-07-04T06:59:38.239972Z","title":"The quantum approximate op- timization algorithm at high depth for maxcut on large- girth regular graphs and the sherrington-kirkpatrick model","venue":null,"work_id":"9e369b5f-b7aa-4335-b3d3-b0ce7f8e23f1","year":2021},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2110.14206","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:8955a63e892a4d2bd5dc14be0a6e4edb0960b5fce1e7dcd54c9154e39040d601","observation_id":"a5487d22-71ee-4859-9a7b-67ef780958bf","resolution":{"observed_at":"2026-05-22T21:57:10.479832Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The quantum approximate optimization algo- rithm and the sherrington-kirkpatrick model at infinite size","venue":null,"work_id":"14b44643-273b-4d0d-91e4-ff98d2db9972","year":2022},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:36af20750d85274ae2842a05f30457a986fc44000b459cf5531904707edce6e6","observation_id":"325fc7bf-e4b5-4e34-819e-cd9f24144652","resolution":{"observed_at":"2026-05-22T21:57:10.530949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04277","last_updated":"2025-07-24T15:44:25Z","snapshot_observed_at":"2026-08-08T23:50:05.715977Z","submitted_at":"2025-02-06T18:25:31Z","title":"Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz","version":2},"cited_work":{"arxiv_id":"2502.04277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04277","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Non-variational quantum random access optimization with alternating operator ansatz","venue":null,"work_id":"9dcd365e-870a-4dc4-bd79-22184be31130","year":2025},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2502.04277","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:f13cb83f5b1c95d276f7485427e22ef236d9c245c19c7dbbe4544e4facb2b181","observation_id":"fb6b2a8b-7354-4c01-8c41-6f6d83649f24","resolution":{"observed_at":"2026-05-22T21:57:10.404765Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2408.00557","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"End-to-end protocol for high- quality QAOA parameters with few shots","venue":null,"work_id":"d941beaa-cf24-4d23-a749-13b26289efd5","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:e4a1a8de6677660c2f398ae2bc58e9386b2c21417bce98ca37bd2e48b0cf505d","observation_id":"a3fcec3a-40cb-435f-bbb3-ca55cf294667","resolution":{"observed_at":"2026-05-22T21:57:10.431295Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sack and Maksym Serbyn","venue":null,"work_id":"e1f16506-331e-4e1c-a397-71f9847f6fc8","year":2021},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:4310ae7ca91164e9530e47fe66d459593a6ff23da6b660ab4da1340e342f6de6","observation_id":"b9c515ca-b158-4c07-92f8-b94a20c2ce41","resolution":{"observed_at":"2026-05-22T21:57:10.596286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.13056","last_updated":"2021-10-26T19:38:38Z","snapshot_observed_at":"2026-07-06T11:42:33.225865Z","submitted_at":"2021-08-30T08:24:38Z","title":"Quantum Alternating Operator Ansatz (QAOA) Phase Diagrams and Applications for Quantum Chemistry","version":2},"cited_work":{"arxiv_id":"2108.13056","doi":"10.48550/arxiv.2108.13056","metadata_source":"arxiv_reference","pith_arxiv_id":"2108.13056","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum alternating operator ansatz (qaoa) phase diagrams and applications for quantum chemistry","venue":"arXiv (Cornell University)","work_id":"e96cacfb-00dc-4537-9829-0d8c68ee0b18","year":2021},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2108.13056","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:0a6e0aa4c1ed83f3fe87bf6cf0f4f9da3c50747a97cfb1b661b3374ddf4070e2","observation_id":"caa596b2-d79b-4652-8857-4b796fa7e02e","resolution":{"observed_at":"2026-05-22T21:57:10.486985Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04455","last_updated":"2023-07-22T04:24:18Z","snapshot_observed_at":"2026-08-11T17:53:10.473082Z","submitted_at":"2023-05-08T04:21:42Z","title":"Quantum Alternating Operator Ansatz (QAOA) beyond low depth with gradually changing unitaries","version":2},"cited_work":{"arxiv_id":"2305.04455","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04455","snapshot_observed_at":"2026-07-04T17:50:00.466883Z","title":"Quantum alternating operator ansatz (qaoa) beyond low depth with gradu- ally changing unitaries","venue":null,"work_id":"cf9eaa83-2ccc-4cd7-881a-3f246cb68cf3","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2305.04455","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:1e423f2a9ea194b66aaec0e47ff2be9e88830e171982e7eef1f26e57dc51791b","observation_id":"ab5e8599-13f6-4fe1-b200-7441048b77be","resolution":{"observed_at":"2026-05-22T21:57:10.493597Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameter-setting heuristic for the quantum alternating operator ansatz","venue":null,"work_id":"39af503f-0081-43cf-902d-48f1cb01ebc8","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:43e51874ae2d71743f14d13fc9a3652ef0653b3f2761d80bdf292b281ced6484","observation_id":"41840270-7a37-4cf9-b26a-d4461009f2ab","resolution":{"observed_at":"2026-05-22T21:57:10.593550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c1d36df7-2ccd-43b7-8ab3-ddf05755616d","year":1972},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:e7a20d70f1089da8207be07c17410981b69df0e7e51136ddafe295cfc7d6da12","observation_id":"d1d86597-861d-46d9-91ba-c4d051bc6bdd","resolution":{"observed_at":"2026-05-22T21:57:10.525775Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9fa03de9-a9b1-41fc-9b87-a5151d75f52c","year":2000},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:ef0140e036fdcc7c8592350c21bde0c1965d133ac074dcdf6945feb8a15d8017","observation_id":"4808fe80-eb99-40b7-bf78-23200f757bea","resolution":{"observed_at":"2026-05-22T21:57:10.616515Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Low autocorre- lation binary sequences","venue":null,"work_id":"8aabcd4d-bd62-48b8-9a6e-01f269915232","year":2016},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:36325c59d6926ae38b3bd66b9a8bf2b5304005f3ee8b18a5564b4142c4cb2f2c","observation_id":"f23204c7-32fb-4dcd-8c63-07bf5b84b128","resolution":{"observed_at":"2026-05-22T21:57:10.635678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Portfolio selection","venue":null,"work_id":"ca3e3af1-8c98-45fe-aef3-2e607813fb1b","year":1952},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:6b6599f6f5c4160653a396d6a01ee35b2cd45ff3fc58631c67933a08d12d2b08","observation_id":"f022df9e-4f41-49e5-9ab7-2acb4f271c28","resolution":{"observed_at":"2026-05-22T21:57:10.587471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Global portfolio optimization","venue":null,"work_id":"8d5ca808-70e7-4ce0-bfcc-08986898011c","year":1992},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:ddee751a4bc99b2a133069eeb9ba845b07f7336a6c4ab50c4d54fb45284a9104","observation_id":"ca5d5ff3-6ab8-4f4d-ad3c-38e4249ea8ba","resolution":{"observed_at":"2026-05-22T21:57:10.598819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal versus naive diversification: How inefficient is the 1/n portfolio strategy? Review of Financial Studies , 22(5):1915–1953, December 2007","venue":null,"work_id":"2706d86b-08a5-4794-a4ce-431166065e85","year":1915},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:03079d1f6905bf5548e9a783acab219381a14c4b21b24041726874a725e5a5ed","observation_id":"2a869380-6036-4fe1-b283-6d58414addee","resolution":{"observed_at":"2026-05-22T21:57:10.564210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bench- marking the performance of portfolio optimization with qaoa","venue":null,"work_id":"0f2cf50b-4306-48dd-b99f-18715293dd44","year":2022},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:819cfda66898ed736c0d7bcb92f6bb9482c088872a55fbc8d031dd7330136b56","observation_id":"1936b790-125d-4a1a-b397-09a603b063e3","resolution":{"observed_at":"2026-05-22T21:57:10.521765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Best practices for portfolio optimization by quantum comput- ing, experimented on real quantum devices","venue":null,"work_id":"1c9ac37f-7544-4256-a511-fb73bf3b01a3","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:64d90152ebf2f7514ed9e685c411d596e972fe8f8daf06e28c206c75d0108593","observation_id":"344101a8-4a9c-4846-8f85-a804b42e3590","resolution":{"observed_at":"2026-05-22T21:57:10.578228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16265","last_updated":"2024-10-21T17:59:05Z","snapshot_observed_at":"2026-08-12T22:18:17.162182Z","submitted_at":"2024-10-21T17:59:05Z","title":"Quantifying the advantages of applying quantum approximate algorithms to portfolio optimisation","version":1},"cited_work":{"arxiv_id":"2410.16265","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.16265","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantifying the advantages of ap- plying quantum approximate algorithms to portfolio op- timisation","venue":null,"work_id":"fe728fdb-1576-4666-b52d-ac3a98e1c14b","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2410.16265","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:b5e9558fce3cc1785cf463365d73f3635241a71a467410102a025a540e844532","observation_id":"bb4ade2b-647c-44d9-9365-702941cff314","resolution":{"observed_at":"2026-05-22T21:57:10.413027Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Alignment between initial state and mixer im- proves qaoa performance for constrained optimization","venue":null,"work_id":"6d7fa1c0-b434-4a99-b4aa-1375b6010bd6","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:a8587d6cfcb91c9f335332d1fa3800f05f1d814c2ec2b6d8f31de771936842eb","observation_id":"4c5b3a0e-b72c-40f7-9b1e-477cc1f8875d","resolution":{"observed_at":"2026-05-22T21:57:10.501912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploiting in-constraint energy in con- strained variational quantum optimization","venue":null,"work_id":"be664cf0-7a38-468e-928b-5acf19fa3793","year":2022},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:386e9e16119f82e3a08207b71b568a68d304a3ace2370eb583b1be27d61e1506","observation_id":"cade966e-7f71-4748-973e-419fa6d4262a","resolution":{"observed_at":"2026-05-22T21:57:10.552590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Solv- able model of a spin-glass","venue":null,"work_id":"074c5821-6381-4c63-bcb7-cde58453c096","year":1975},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:791486d86a1cfb6faf83024bfa55ff8e8f41454d60a5ebc9274d6023dbbc3a64","observation_id":"dca182e0-68e8-42a1-b757-7f9e5a94d80c","resolution":{"observed_at":"2026-05-22T21:57:10.548886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A sequence of approximated solutions to the s-k model for spin glasses","venue":null,"work_id":"dac9d255-3eb0-4b66-9b17-ec3e630c87cd","year":1980},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:4cbdc5c9f76a46ad1128c54e6215ce92eb9d58313caf68b0eb5e202e5d7a84e1","observation_id":"b00d14f3-1f5d-434d-82df-54df71c83be6","resolution":{"observed_at":"2026-05-22T21:57:10.497604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Virasoro","venue":null,"work_id":"d7652b91-df6e-471f-a68a-34b72084029e","year":1986},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:0caa297ad8fe71107b0e3e45354536a663f5da05616bc30d6ee5616ec6c78ad7","observation_id":"f3a61549-ba02-454e-b507-ba4c466a1021","resolution":{"observed_at":"2026-05-22T21:57:10.545270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the computational complexity of ising spin glass models","venue":null,"work_id":"9ae4cd53-5615-4f94-bfc6-925b45374a9b","year":1982},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:b489c228a486c230500fe66aa47755bd0e1e64be70e51f7ca2dcc6387cb7e13a","observation_id":"438f26ca-a6bb-4303-b285-d1b890a4e2b1","resolution":{"observed_at":"2026-05-22T21:57:10.607608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Inack, Roeland Wiersema, Roger G","venue":null,"work_id":"c34ebf2d-713e-45f0-a756-7c7f1959d866","year":2021},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:b85eed48d1495522d3387b270d8d4f8d39518c3931b32a11bd9006ec73d7da34","observation_id":"4850d6f6-775c-41ca-92f5-771f92f8e1a9","resolution":{"observed_at":"2026-05-22T21:57:10.568142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Non- convex optimization by hamiltonian alternation","venue":null,"work_id":"c275276d-d408-41db-ba29-37f9aa06a13d","year":2022},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:965afb693ce55b2d3a60a234566a61eefca01aee93474a9cbd49c193d1f21ec8","observation_id":"b73917a7-f4e0-43ae-a423-19a0c8816441","resolution":{"observed_at":"2026-05-22T21:57:10.514055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimization of the sherrington- kirkpatrick hamiltonian","venue":null,"work_id":"a536a932-c0d2-4581-b3ad-0b1b35d9f1a9","year":2019},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:99f17e4372b50136a8bd9ee75f5a903d386544c2a1bd271583dc6e2c49a65f84","observation_id":"bb55706b-0aa4-40a6-a2b1-1e98f3382d9b","resolution":{"observed_at":"2026-05-22T21:57:10.556302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum optimization of fully connected spin glasses","venue":null,"work_id":"ea828542-8a73-40ae-97da-ba30c29b5780","year":2015},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:990b06849a1e869d03cf6d1cb43da5f58b98020df75583844157280f8bcfed27","observation_id":"dc6642aa-5d62-45fa-8ee8-f244118d1366","resolution":{"observed_at":"2026-05-22T21:57:10.622716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The quantum approxi- mate optimization algorithm at high depth for max- cut on large-girth regular graphs and the sherrington- kirkpatrick model","venue":null,"work_id":"ceef954e-d726-4b02-8df4-9f2ff2c5529c","year":2022},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:4b340d990ca3e4ced733d663fce41fe8cc43b73b5be53925351ad02bbcd50572","observation_id":"15f9d416-383c-4c60-8914-2c2fd4666c19","resolution":{"observed_at":"2026-05-22T21:57:10.641889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The quantum approximate optimization algo- rithm and the sherrington-kirkpatrick model at infinite size","venue":null,"work_id":"e0b23f02-50e0-4455-b562-3e7893a9e59d","year":2022},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:f5db09f272368ab03a1a1ce3e6608c6e821e4f399a2a8280619213baea955cfc","observation_id":"75434fce-cb09-4db2-a212-ea6242a56039","resolution":{"observed_at":"2026-05-22T21:57:10.574901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.04170","last_updated":"2018-12-11T01:03:58Z","snapshot_observed_at":"2026-08-03T15:33:14.715290Z","submitted_at":"2018-12-11T01:03:58Z","title":"For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances","version":1},"cited_work":{"arxiv_id":"1812.04170","doi":"10.48550/arxiv.1812.04170","metadata_source":"pith","pith_arxiv_id":"1812.04170","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances","venue":"quant-ph","work_id":"6c181a5f-e31b-48f1-be25-056ebf54c78f","year":2018},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/1812.04170","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:875aa3e36f20c81f093dab56a76be5dc16e31950d0e0fd8995c096df03987d3c","observation_id":"16f858d1-9fae-44fc-b7fe-dbd5d9211132","resolution":{"observed_at":"2026-05-22T21:57:10.445727Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multi- start methods for quantum approximate optimization","venue":null,"work_id":"d2869e16-434f-4bdd-8f9f-cbf5848e7a76","year":2019},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:3e88178a422a5a26c2dbd05d1513f736de1647631b74e17dd9519001dcf5226d","observation_id":"8a6926cc-db04-4cf9-b417-d130a760863c","resolution":{"observed_at":"2026-05-22T21:57:10.625979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Transferability of optimal qaoa pa- rameters between random graphs","venue":null,"work_id":"7df53383-34ae-487f-be03-00629936ff33","year":2021},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:4e39c791ec1c3cdb50269309ec3c022e35265290d41e0ea50871e19c60d68a20","observation_id":"4dcfe868-1757-4b0e-97dc-a3963aed932e","resolution":{"observed_at":"2026-05-22T21:57:10.584920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameter trans- fer for quantum approximate optimization of weighted maxcut","venue":null,"work_id":"fa7ac674-577a-4ad9-b2dc-4050f6fdbb0d","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:7b7d9bfe9291c12b57f752c49f7d36bdfb93e079a2631b3156f3a1bffbfc1b71","observation_id":"6eb9c8b3-e317-472f-a24a-12bf955964b6","resolution":{"observed_at":"2026-05-22T21:57:10.517844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Collins, Arinjoy De, Paul W","venue":null,"work_id":"92a28ebf-2752-4a8b-a121-3bd9075cfd02","year":2020},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:3bb844b50ffc8219b1325e019e03d41a8379ce3ad9175562c43d52da96811f38","observation_id":"61b4e596-4a20-4a69-b9ce-04f2524233fd","resolution":{"observed_at":"2026-05-22T21:57:10.506111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.01218","last_updated":"2021-07-02T18:00:07Z","snapshot_observed_at":"2026-08-08T03:14:27.411627Z","submitted_at":"2021-07-02T18:00:07Z","title":"Behavior of Analog Quantum Algorithms","version":1},"cited_work":{"arxiv_id":"2107.01218","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.01218","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Behavior of analog quantum algorithms","venue":null,"work_id":"b84a3ea4-16fb-4349-89e3-097c7939bc4c","year":2021},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2107.01218","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:765fb2475a31d44ae56028737ad136fbae4815e3fee20cde32bb7422b13927fc","observation_id":"7d06bf73-4c49-4c57-bbfc-e444420e9fbb","resolution":{"observed_at":"2026-05-22T21:57:10.438337Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Classical symmetries and the quantum approxi- mate optimization algorithm","venue":null,"work_id":"95180bb3-4c1a-4453-b7b3-cabd6fb016ec","year":2021},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:2987c6fa1ce2066687bfde5e54d3ad2937a117a95cddaa607c9a2b75d0b3883f","observation_id":"3893eac6-fc26-4e76-a8e2-72795ab83174","resolution":{"observed_at":"2026-05-22T21:57:10.604335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"db68e13c-7d49-45d6-af3e-04234e89faf0","year":1977},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:bf1b6d82ba2adc7d9324b2668888a9551c755b0799ef4f16602bd34e269eca73","observation_id":"0b74560d-0186-4918-8063-10c78feea40a","resolution":{"observed_at":"2026-05-22T21:57:10.601393Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"213ff00b-6245-4a24-952a-e162b4bbc65a","year":2001},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:69ac730fabac9edf0e19996315f2a86833ad9b58987301e855f6c953c9666634","observation_id":"dce87292-5cf3-4e48-898a-d8a60ee13dd2","resolution":{"observed_at":"2026-05-22T21:57:10.644913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, St´ efan J","venue":null,"work_id":"043e9aed-f393-4084-a361-6da175cfed45","year":2020},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:958bcb592220f9b4517eca07a0b4e86d5c68c2e573f077f84af729ad722ae618","observation_id":"eba54525-aed2-4020-afe3-8d6a77db0c4a","resolution":{"observed_at":"2026-05-22T21:57:10.541130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trefethen","venue":null,"work_id":"a5616dd5-0851-438d-b4b6-0204df7a8d3b","year":2000},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:7ba6465d400899de272eddd97a00421b60c17aa2f6fe12d611e20f2fbdc4b4e6","observation_id":"b13aa5fb-2e94-4f00-a0df-e7c203e79dc2","resolution":{"observed_at":"2026-05-22T21:57:10.560149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cooley and John W","venue":null,"work_id":"8c5b85e8-9aac-45a5-ba96-890145717c28","year":1965},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:9c2023ab3da4853d9ed1df8b18dcee341631f910f19d3f2980c739ff897e95cf","observation_id":"4648047d-25ee-4f35-8d6f-24052356ef53","resolution":{"observed_at":"2026-05-22T21:57:10.571688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ebadi, A","venue":null,"work_id":"3df917f5-8d78-445c-b4ee-7e00e980a0b5","year":2022},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:dd45f53a177de3fbf41e6a0b7c1c260a2aec90262053e5de6cb2e187a4452f73","observation_id":"3968638e-b95b-423f-8410-8c3cfed6ed45","resolution":{"observed_at":"2026-05-22T21:57:10.628945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Andrist, Martin J","venue":null,"work_id":"94cff617-0efd-4333-b0ee-72e97816a2f7","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:a68f4bd63379acb78934e11fb57536789554a237d6222c6161f8319b638cfa23","observation_id":"075ff493-d16b-4a6a-b014-6225b1a2f580","resolution":{"observed_at":"2026-05-22T21:57:10.638754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast simulation of high-depth QAOA circuits","venue":null,"work_id":"1d30eac4-fc78-4dc7-aae5-460b577ee03b","year":2023},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:6e4dda8afa02ec603f5e4713dd337c108f8ce95dba64d033846da0616727fb7c","observation_id":"a2239cbe-41e8-454b-871f-3c5d0c9e7596","resolution":{"observed_at":"2026-05-22T21:57:10.649964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":4,"verified_exact":13,"verified_fuzzy":40},"total_outbound_references":59},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 8 inbound Pith citation observations for arXiv:2504.01694."}