{"as_of":"2026-08-11T06:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16fbfad9a852c1241522bb2da26ee170ac52c225961b39034fbb424450d08332","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:14:24.835086Z","state":"measured"},{"denominator":80,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":80,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:14:24.790458Z","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-08-10T16:14:24.896901Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"cited_work":{"arxiv_id":"2501.13469","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.13469","snapshot_observed_at":"2026-08-10T16:14:24.896901Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","venue":"quant-ph","work_id":"91e617fc-4902-45f9-9784-474d82b3dc37","year":2025},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.790458Z"},"links":{"cited_paper":"/paper/2501.13469","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:270b04052e3b6c96e9501815093c4c3bc40716bf050d74e120c47b71cbeb35c1","observation_id":"8af4499f-e6bd-4e49-950c-a7a31c1d258e","resolution":{"observed_at":"2026-08-10T16:14:24.901910Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.13469/citation-record","integrity":"/paper/2501.13469/integrity","json":"/paper/2501.13469/citation-record.json","paper":"/paper/2501.13469"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:26.005688Z","title":"Lucas, Ising formulations of many NP problems, Front","venue":null,"work_id":"05a4fe18-1890-4753-9577-20e357b4b4e9","year":2014},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.465378Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:52ca149b17e6b8d961ee7fb89058fc44f5fb04a384f541a99984b372b56eb08f","observation_id":"bc973988-c2bd-4bb0-8b9f-5044a4874991","resolution":{"observed_at":"2026-08-10T16:14:26.010601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.991476Z","title":"Glover, G","venue":null,"work_id":"0f6a39f2-ca73-4d48-ac30-4a389b026b2a","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.471860Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:7b0c5dd62395fb065e1d4b2386fdbd12bed5e3552710c8fc84900d170fd3431a","observation_id":"d57913ec-3f32-4902-b828-d4c2508ef3d1","resolution":{"observed_at":"2026-08-10T16:14:25.996353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.977801Z","title":"Herman, R","venue":null,"work_id":"c19dadd0-6409-49b6-9837-090911bc3d7e","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.476902Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:5653296b4dd4bddd109ed009a559151e72d91dacec413740ca904ad018f8886a","observation_id":"aa74f6b8-f4c5-4929-a2a3-67c079e6d926","resolution":{"observed_at":"2026-08-10T16:14:25.981846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.963290Z","title":"Buonaiuto, F","venue":null,"work_id":"b8bbcfb3-ee16-4f56-b4dc-ed53229b197f","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.481760Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:959065f06a988e9d2b8849ef754c481171f5d5a18c355e69d0a067f67ee68b88","observation_id":"98ec662b-3791-4e88-81b5-ed558ee2d92c","resolution":{"observed_at":"2026-08-10T16:14:25.967901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.947755Z","title":null,"venue":null,"work_id":"ca944d1f-d4da-46b0-b348-3edf3809b4c0","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.486421Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:aa7a816b3056fe4d256dcea7649aa7c49fcf74f5f1173c077229c089c71ea240","observation_id":"84f0f2e8-f9f9-49b5-9a32-e251f6eee03e","resolution":{"observed_at":"2026-08-10T16:14:25.952391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.933655Z","title":"Brandhofer, D","venue":null,"work_id":"cfa2b1a2-97d8-4694-bc15-0d331372e17e","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.490958Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:92a193606cad6f0bd775bf8d059072aa1a37e389c3f2ee8352305f7329b9dba4","observation_id":"97830b4b-d5a4-43d2-bf22-0edf2dd29574","resolution":{"observed_at":"2026-08-10T16:14:25.938010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.919084Z","title":"Stollenwerk, S","venue":null,"work_id":"3fec591e-5a19-416a-85b7-aaf03e31e1bb","year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.496466Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:81b26bc58f29bc1a70990c7bbf5a6de5c67134626fdf5c28f62bb5d0bd16289f","observation_id":"901f082b-197a-4b05-b060-2a1233976c76","resolution":{"observed_at":"2026-08-10T16:14:25.923626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.904337Z","title":"Vikst˚ al, M","venue":null,"work_id":"0066145e-ba79-4373-928e-7db236ae8f39","year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.501341Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:59635fc26544f59f1a55c8ebab09b915b317cb4d0c7577e71339aa3eebb11bf3","observation_id":"2357ff18-ae9b-42bb-9db1-1e38034f9797","resolution":{"observed_at":"2026-08-10T16:14:25.909192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.888958Z","title":null,"venue":null,"work_id":"b740dc75-e318-4344-8553-78deb6aef3d7","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.506150Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:6810dfc4e18125f789e8b18a2c638392a53bebc2388f3e156c370ecdad9b9db8","observation_id":"83d74af7-f0fa-4e4f-becd-c1f9ac960252","resolution":{"observed_at":"2026-08-10T16:14:25.893848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.873130Z","title":"Ding, Y.-M","venue":null,"work_id":"6de320b1-658e-4f71-a5b6-3616f5e61b84","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.511470Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:7910b9541a2845225cee9f96ffe06db3464cbc1e805f80c2d54cc9fa1805db97","observation_id":"9f217f20-dcd0-444b-90e1-a245bb14afe2","resolution":{"observed_at":"2026-08-10T16:14:25.877938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.857219Z","title":"Zaborniak, J","venue":null,"work_id":"98e21171-9d5f-4a81-8e65-6eee00aab5b3","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.515933Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:92bf87bd581cf5d432fde148a4fa0ad09d10eb9b1b77c207239abbc3849dee71","observation_id":"e6cac0e4-8a97-47b1-b4a8-e607adeeae38","resolution":{"observed_at":"2026-08-10T16:14:25.861629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.842552Z","title":null,"venue":null,"work_id":"77c3f881-580d-4e31-9514-ef8d1702bd06","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.520649Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:b66443c40c5cbc992ce5828509512a756871980bd015fd48eae1c8afde753545","observation_id":"f2f99a29-d5c2-4e1d-8b5b-9a1069529fd8","resolution":{"observed_at":"2026-08-10T16:14:25.846963Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.827684Z","title":"Chandarana, N","venue":null,"work_id":"3cbaffca-05ae-4df2-aff4-2ac90d1df11e","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.525005Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:41de37dac1f923bca4fecf707ed129c7e8a3e2b0c150b25e8067758137f9818c","observation_id":"09e6aed1-4eef-40e5-8bdd-15e3524adb86","resolution":{"observed_at":"2026-08-10T16:14:25.832217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.812675Z","title":"Robert, P","venue":null,"work_id":"6e94367a-1007-4e56-8afe-f6b3679694bd","year":2021},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.529292Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:479546ac0efeb9d823a8eed9ec8c284bd7dcb9031c31cca1316e3dba1cb59a5b","observation_id":"bb9172ac-f85e-473a-b41f-883a92b0fc8e","resolution":{"observed_at":"2026-08-10T16:14:25.817360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:24.533721Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.533721Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:63d3b19658e4a33582cb776f4900c3bc8740933dc440df279e8aacc951b866e1","observation_id":"abe23610-0a7e-4d17-af2f-c68e8cf78e07","resolution":{"observed_at":"2026-08-10T16:14:24.533721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.786794Z","title":"Pagano, A","venue":null,"work_id":"9de2fb6c-d99b-4fbe-b2d3-7a1f233da4aa","year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.538563Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:da558119ce20b12867cd6e71c525c0d79dec610d54550ed20aa846bbb8d56ba8","observation_id":"56e3bd67-305c-4b66-909c-1e5e5ca240db","resolution":{"observed_at":"2026-08-10T16:14:25.791744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.771569Z","title":"Dupont, B","venue":null,"work_id":"11b366da-ab33-4b9f-8c61-1c5053d0bcdd","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.542948Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:57da6779f2a13c77681185621a0fd3608aa1d99e784a7a6ad44d9a3485318311","observation_id":"ec7182b4-bd07-4350-a766-4c34fe13bfa5","resolution":{"observed_at":"2026-08-10T16:14:25.776281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.754352Z","title":"Pelofske, A","venue":null,"work_id":"84b9e268-ca0c-4313-b877-ba98dcc115e2","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.547548Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:1a4dd2c0d1d5185de19ece694f9af469385e46db1cc66bc4730835c88eed73f1","observation_id":"28a7c6a6-27cd-442a-be92-53c1c54afc23","resolution":{"observed_at":"2026-08-10T16:14:25.759931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.738266Z","title":null,"venue":null,"work_id":"9d8975c9-2ba9-49b7-8245-2a51cbeda310","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.552045Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:2e58300b3e5f617925cc87dc5b1542008e52fd3b658c902df4e6d62c99218a26","observation_id":"c7c23f8f-4143-4089-9470-084cc4c12802","resolution":{"observed_at":"2026-08-10T16:14:25.742784Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.721673Z","title":null,"venue":null,"work_id":"676b794e-a525-4ce6-9547-00464d7ed787","year":2021},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.556373Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:c83155b0e572b4826665278ce857d2e0f4cafd70e7ceafd9c0107bab6b7bee2a","observation_id":"82d7d44b-4ad1-493d-bbff-6a6d1f640455","resolution":{"observed_at":"2026-08-10T16:14:25.727093Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.705924Z","title":"Ebadi, A","venue":null,"work_id":"110c9ffd-1432-47dd-ae34-2b2211bc071a","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.561001Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:a46e545e2201b622f42b73d146161ad9bb7669b68e8080b82f04cbdeb99c186d","observation_id":"e5a5a480-37fa-46b5-9f46-b0d7f9b58990","resolution":{"observed_at":"2026-08-10T16:14:25.711049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.692104Z","title":null,"venue":null,"work_id":"db54762a-3b3a-4e35-a89c-fb6b4102e766","year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.565580Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:c044fc9ec09849b49437a35b34037d31f487a717888956641eb7cbdabd71bca5","observation_id":"a94eca2d-9fdf-4237-941d-d64dfa0da621","resolution":{"observed_at":"2026-08-10T16:14:25.696062Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.678194Z","title":null,"venue":null,"work_id":"243ab256-7b13-4cba-af80-1aa6e3210d14","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.569978Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:aac299935c0f238b5350c5d9369590fd959f3f575fc4f3604ffe20ee356afc8e","observation_id":"c593ce5a-60fb-44fb-8c15-974146b8c147","resolution":{"observed_at":"2026-08-10T16:14:25.682568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-10T16:14:24.574085Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.574085Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:73f7ce8889e65af9d5aa8d3a19025a48905e585b7eec9150b491af8372de0726","observation_id":"5583cc28-ca16-4c35-89ab-441ca3573e43","resolution":{"observed_at":"2026-08-10T16:14:24.574085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:24.578313Z","title":"Hadfield, Z","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.578313Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:4679b354c65985981758a2ec6c11687b14223f89f2a62fd45b01dc84a3ab3f19","observation_id":"f5dbb188-4c0c-4cea-aabb-7ee6288eebf0","resolution":{"observed_at":"2026-08-10T16:14:24.578313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:24.582378Z","title":"Farhi, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.582378Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:ceb5042af9298192493713544a6d8a32562a32afbc672393f974fb19013e590d","observation_id":"cb07ebc3-719b-44ad-8d54-7a43b834ad67","resolution":{"observed_at":"2026-08-10T16:14:24.582378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.644301Z","title":"Shaydulin, C","venue":null,"work_id":"e7ebeaee-b87b-482f-b6a4-4bc3f4601861","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.586532Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:0adc53622b42cc8fdafa7cb4e2b0acf718d94edce36a9c29522fb9dacdb91353","observation_id":"dbd8782b-db5b-4d67-b610-fa1fe99f6aba","resolution":{"observed_at":"2026-08-10T16:14:25.649912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:24.590579Z","title":"Zhou, S.-T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.590579Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:9fd550f08a6f3027fa4cb2d6a4bed38fea0dde69145ac049f2c9106eb1343004","observation_id":"e6784eb8-8d83-4967-b1c9-388c18020955","resolution":{"observed_at":"2026-08-10T16:14:24.590579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.620006Z","title":"Bonet-Monroig, H","venue":null,"work_id":"ad97fc25-2869-4eac-b1a3-f4512b594d72","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.594551Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:6af8924d173893b9c5880c9e371c1f7aa4265a212343fbf32ff5a39c90191f81","observation_id":"fc07691a-f3dc-4393-8e8e-e7c70f917b4a","resolution":{"observed_at":"2026-08-10T16:14:25.624624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.605606Z","title":"Blekos, D","venue":null,"work_id":"d2f5bd70-2624-4da0-9287-7e39af6a7e29","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.598546Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:ad3be597a3ee7e118b5f4cf3c3b575f15e7eac0cdbf9a8754535c70a9a2d8704","observation_id":"a7f3b272-4565-4ab7-b544-285eadc5011f","resolution":{"observed_at":"2026-08-10T16:14:25.610118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.590322Z","title":"Wierichs, C","venue":null,"work_id":"5a2be4cf-77b5-4516-83a1-920097e7bda3","year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.602371Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:bd68ffab0d0a9c332b7524143b2d9be129f30d1ffdf4b1e14573102fb8d976fa","observation_id":"c360f6b0-e7ef-4dac-aab2-645890ca9e6e","resolution":{"observed_at":"2026-08-10T16:14:25.594726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.576188Z","title":"Koczor and S","venue":null,"work_id":"c34c8d5d-1129-4a60-99c8-829383d628c4","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.606172Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:3a1fcbfcc82914a0dddd2d0d25e32974d7505b031b2358dbd0e9a49d22ebd7b9","observation_id":"841226ad-d61c-434c-823c-6185d8ede0da","resolution":{"observed_at":"2026-08-10T16:14:25.580403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.561424Z","title":"Bittel and M","venue":null,"work_id":"9cb927d7-d501-4265-a272-2cb2f8429c3b","year":2021},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.610104Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:960160f269653fbcd0f2d15b35286629a34b4631d3b539d3b1d772c0c0cdcd67","observation_id":"17dda134-d06d-4974-9d9f-ba51e789c374","resolution":{"observed_at":"2026-08-10T16:14:25.566275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.544772Z","title":"Akshay, D","venue":null,"work_id":"51ddd523-a7f8-4e83-b829-b3f3df965861","year":2021},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.614601Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:8c53982148c69699b7a2f601ad96f0a8ced9e953f12ece3fbf657a6f4e4ce293","observation_id":"63d197ce-62df-45e1-8d7a-241d815cc7a4","resolution":{"observed_at":"2026-08-10T16:14:25.549609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.530211Z","title":"Wurtz and D","venue":null,"work_id":"49478ef5-78f6-49f6-bdf6-55f2fef050da","year":2021},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.619025Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:47489787867aab7edb106e8d02a2a08926dd549ba02d1726163fbd15895d2efe","observation_id":"d045b423-3888-4641-a024-e797360f3b57","resolution":{"observed_at":"2026-08-10T16:14:25.534720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.515265Z","title":"Shaydulin, P","venue":null,"work_id":"6277d023-4a8c-4492-85b8-db1eb891126c","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.623066Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:b422210dc853ea4419983325ffbf68624090c76bd319a5b34f33ebe369b3b6ea","observation_id":"30e2fd46-7927-4191-8b87-76af2486c25e","resolution":{"observed_at":"2026-08-10T16:14:25.520259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.500381Z","title":"Galda, X","venue":null,"work_id":"73b783f5-f195-4c85-b1f9-ffdf3a3548ed","year":2021},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.627223Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:19cc87c40522a29ddeb1281e8a4a22810816093fda16288dfd043b000fef6c13","observation_id":"3cd6d36d-c400-4a83-9b34-828dbdea620f","resolution":{"observed_at":"2026-08-10T16:14:25.505125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.485980Z","title":null,"venue":null,"work_id":"ab92fb85-3738-41d1-b157-bb45a7673495","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.631574Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:0b73fa5e3d97518d14c1780852b8095a086134c70bde4d6e60984a0d9b9dd061","observation_id":"45aa26b4-55d7-435c-bfdf-02f6d773ecec","resolution":{"observed_at":"2026-08-10T16:14:25.490441Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:24.636007Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.636007Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:e7b63abdb591eca5ae5beecdc57f1eba9e8811a120246741661c5885239f089b","observation_id":"a2a04151-36b0-47b6-9c9c-68cf3aa28d27","resolution":{"observed_at":"2026-08-10T16:14:24.636007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.459675Z","title":null,"venue":null,"work_id":"1016d8a0-48cf-4178-99ff-02b20f909e93","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.640323Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:69ae7f8618af310e9288a00fcbf3a3e52bb88b384998c15cdc6cfd39d403de9b","observation_id":"d0d1534b-aec8-4e11-baf0-5a143516a6d9","resolution":{"observed_at":"2026-08-10T16:14:25.464967Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.442712Z","title":null,"venue":null,"work_id":"ab45b8ce-d37f-482e-95ec-78b609e80d68","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.645201Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:98bad9c0eb97b84bd29df63713186557a5e3a149f61d4ee50db4b2fa049eb792","observation_id":"dd93626a-3196-40f2-9c69-79ab703f48f7","resolution":{"observed_at":"2026-08-10T16:14:25.447518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.427765Z","title":null,"venue":null,"work_id":"a5cfaaa3-82fe-4255-97b0-3807b3d786cf","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.650311Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:44bb0c2283af7b4de55d40ac09abde64d912e066a775c2c5ad7678789c094166","observation_id":"4ec6049c-0521-4739-a816-2ad31c5d6400","resolution":{"observed_at":"2026-08-10T16:14:25.432106Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12525","last_updated":"2024-09-19T07:39:34Z","snapshot_observed_at":"2026-08-08T03:38:25.723862Z","submitted_at":"2024-09-19T07:39:34Z","title":"Lyapunov Controlled Counterdiabatic Quantum Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12525","snapshot_observed_at":"2026-08-10T16:14:24.654658Z","title":"Chandarana, K","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.654658Z"},"links":{"cited_paper":"/paper/2409.12525","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:2bf834e2aa72af9a4f13b00b4c00da04f2cb928bf8813f308cc13a8d01728973","observation_id":"eed80baa-a88a-4307-9f31-b9bddcb2b2d5","resolution":{"observed_at":"2026-08-10T16:14:24.654658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.414116Z","title":null,"venue":null,"work_id":"6cc21fb8-ee88-411a-98ec-c1fa8e950a8a","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.659577Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:a4a8b370948a8bf22b7a50726b079577d9e19832889dfa4d01e96e3bfcdc8379","observation_id":"0222f516-ad00-4564-97f9-de5d9033261e","resolution":{"observed_at":"2026-08-10T16:14:25.418355Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15426","last_updated":"2024-09-23T18:00:06Z","snapshot_observed_at":"2026-08-06T03:10:02.780074Z","submitted_at":"2024-09-23T18:00:06Z","title":"FOCQS: Feedback Optimally Controlled Quantum States","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15426","snapshot_observed_at":"2026-08-10T16:14:24.664331Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.664331Z"},"links":{"cited_paper":"/paper/2409.15426","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:7494c75acc409eb2ee2d44b519b6d89637c77f538f5a63ce44c9628a14e5e614","observation_id":"9d6de8f0-ccc1-446a-863f-aa242573a969","resolution":{"observed_at":"2026-08-10T16:14:24.664331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.399593Z","title":"Abbas, A","venue":null,"work_id":"adb7b634-71f8-41df-b09e-79ec42e05c1b","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.669377Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:e3366cc569e6b24ccec4d636cee14883d55c19a046f0dd20725c649040fedc4c","observation_id":"c33ddb4e-b519-42c1-b070-26a117699c94","resolution":{"observed_at":"2026-08-10T16:14:25.404186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.385179Z","title":"Hauke, H","venue":null,"work_id":"443740a8-abce-41a8-be64-ada192500ccf","year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.673803Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:f7fee40ec56bb6b2871d6a90d9426ced82f043762217029a9113f42eb805c0f4","observation_id":"d5336565-4f58-41d7-91fe-b59c04832a8f","resolution":{"observed_at":"2026-08-10T16:14:25.389854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:24.678273Z","title":"Kadowaki and H","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.678273Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:8e844618119c972624db53f8150137c9101febe775db0500f0f0fefa364c1d18","observation_id":"5b539e77-bd09-4729-8413-bf2f2284deff","resolution":{"observed_at":"2026-08-10T16:14:24.678273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0001106","last_updated":"2000-01-28T22:12:03Z","snapshot_observed_at":"2026-07-07T07:02:58.841967Z","submitted_at":"2000-01-28T22:12:03Z","title":"Quantum Computation by Adiabatic Evolution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0001106","snapshot_observed_at":"2026-08-10T16:14:24.682626Z","title":"Farhi, J","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.682626Z"},"links":{"cited_paper":"/paper/quant-ph/0001106","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:8e77c693c0c06457ab11160be4fa83ae31229259a3e08b1577350a09db110aef","observation_id":"91428a9e-90ef-43c6-8698-5de6ff14753b","resolution":{"observed_at":"2026-08-10T16:14:24.682626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.360621Z","title":null,"venue":null,"work_id":"02821ae3-5bbd-42e9-88b9-92df37d2de81","year":2018},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.687542Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:a6951b773e12f2dce3ad83583ecc3b0812b663fde5f96dc4df5865db5a18c642","observation_id":"f99049d3-6e2c-40b0-b8a0-fc6dabb068fc","resolution":{"observed_at":"2026-08-10T16:14:25.365158Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.344727Z","title":"Bravyi, A","venue":null,"work_id":"2db4cc73-c988-40ab-b671-d7858f8d3666","year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.692200Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:246e67f0100e05681abb07205a5d7807880516e17ec45bdce902f8ad1b6526c8","observation_id":"a380337b-0b35-4028-afaa-f5687892d77e","resolution":{"observed_at":"2026-08-10T16:14:25.349991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:24.696628Z","title":"Bravyi, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.696628Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:55795ab07c0ca1ca322e42be5119192fe4954294a26df4a234b8a5e31c79d1c3","observation_id":"263e204d-32fb-4f94-8667-283826e664cf","resolution":{"observed_at":"2026-08-10T16:14:24.696628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.321524Z","title":"Ozaeta, W","venue":null,"work_id":"6a398e38-847e-452c-9620-f8f1916e2120","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.701332Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:ac37c9881878ff76342da87e156a43ceef30c1b706402569409ca93362df3857","observation_id":"e943b392-7572-44d3-9e93-52b102f1a284","resolution":{"observed_at":"2026-08-10T16:14:25.326035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.307391Z","title":null,"venue":null,"work_id":"e902af45-dc9c-4071-a07e-e12d1bc69928","year":null},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.706541Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:edba98042b3b233be8b665e8668e1cc709c085addfb522f2c5404a63048bcb37","observation_id":"d0ccff9a-8865-473c-8b3d-b08f20c3849e","resolution":{"observed_at":"2026-08-10T16:14:25.311724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.292801Z","title":"Berman and M","venue":null,"work_id":"bdd1ae4c-3c05-4dc4-a36d-d15130b12599","year":1999},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.720740Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:610971887eb900a7688d104c859dc268cbd7583a23f941c2d9554a26daec862e","observation_id":"3360fad3-f8f0-4451-a2ce-71278e1286aa","resolution":{"observed_at":"2026-08-10T16:14:25.297429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:24.725268Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.725268Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:74bce2591d4090b57c671ecb29cbe7e2981d6525b43119b878e1774363cac39c","observation_id":"37db4d51-718f-4d41-ab0e-839d333e2af6","resolution":{"observed_at":"2026-08-10T16:14:24.725268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.253500Z","title":null,"venue":null,"work_id":"d1bb5238-1d36-4965-bf98-e5509dfd611c","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.733156Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:cb2ad60ddcb8c216ffaac9e0c0191edc70a716777d301c96cdba80220eb030a2","observation_id":"8683f550-fe21-4db1-a1b2-372633daaefa","resolution":{"observed_at":"2026-08-10T16:14:25.257901Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08810","last_updated":"2024-06-19T01:39:44Z","snapshot_observed_at":"2026-07-06T18:14:20.889736Z","submitted_at":"2024-05-14T17:55:32Z","title":"Quantum computing with Qiskit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08810","snapshot_observed_at":"2026-08-10T16:14:24.737173Z","title":"Javadi-Abhari, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.737173Z"},"links":{"cited_paper":"/paper/2405.08810","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:6a1152a4733dddd7ed18092c470522c655f205d2a85279221e78d1ee91bbce89","observation_id":"87783bcb-1866-4c85-88cf-28938bbcef43","resolution":{"observed_at":"2026-08-10T16:14:24.737173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.239558Z","title":"Alimonti and V","venue":null,"work_id":"6f6cf955-a805-4d8c-a108-3d5e24d70e36","year":2000},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.741506Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:d02b35aedd93f10d7055ca67f34250fe68966a3c1e00f317723ee4f5816edeb7","observation_id":"1caa05e8-28a9-4236-8a22-45d17cb5a782","resolution":{"observed_at":"2026-08-10T16:14:25.244059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.225592Z","title":"Halperin, D","venue":null,"work_id":"12a98b9a-3086-444f-a775-cff80247c729","year":2004},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.745312Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:3c77937a9011c78d10868af24aa78dc695aadaf82636c093bc64ab21b298d48d","observation_id":"c7793cd0-ca64-4816-8546-d2769c0aab83","resolution":{"observed_at":"2026-08-10T16:14:25.230008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.211457Z","title":"Charikar and A","venue":null,"work_id":"1f0cc09a-bccf-4fc4-a0ef-1cdbbf2fabc4","year":2004},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.749349Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:627b4a0134101e5584bdd735eeb3a872c28e11af5fabf5ec7fff0027033b1211","observation_id":"88e30ce9-943a-41c9-9a87-e0bf1b6df5a0","resolution":{"observed_at":"2026-08-10T16:14:25.215795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.197316Z","title":"Panchenko, The Sherrington-Kirkpatrick model (Springer New York, 2013)","venue":null,"work_id":"c77f1e24-c376-48bd-aa6d-c370c1b7ae4f","year":2013},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.753972Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:f0e0df65ac39601930ef245c79af12a5f86451af074c759da0e164530719e20c","observation_id":"f91a5634-a824-4c27-bddc-780e0f58cb48","resolution":{"observed_at":"2026-08-10T16:14:25.201772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.183396Z","title":"Talagrand, Mean field models for spin glasses: Volume I: Basic examples , Vol","venue":null,"work_id":"e1e78fbc-10d4-4f48-b675-2bb6adb1e150","year":2010},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.758052Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:158097c2715ddb4fa743afe0d0b8252de566f524040c1b198e6940041753efd5","observation_id":"99b78e60-f862-4814-87d6-fb78d784ffd4","resolution":{"observed_at":"2026-08-10T16:14:25.187983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.155330Z","title":null,"venue":null,"work_id":"52b7e07b-0262-4be0-aa32-c2c4b609a88b","year":2019},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.767352Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:69402470771eb1a531173ef2775455a9d45d7f58692589b6c30d6ce9838d86b0","observation_id":"a26ffc0f-da00-4947-be0c-f522af3cfe7a","resolution":{"observed_at":"2026-08-10T16:14:25.159774Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.139409Z","title":"D´ ıez-Valle, D","venue":null,"work_id":"35aa44b4-a5bf-4faf-929c-60a4a94cdc3f","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.771930Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:024f61f11f748d6519f089a7b0871de63fb702c7fab3d52de46dda209b4452b3","observation_id":"49d436de-2dd8-4d8b-aea0-6909eea519de","resolution":{"observed_at":"2026-08-10T16:14:25.144969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.125303Z","title":null,"venue":null,"work_id":"ab09d3e3-c93a-467b-96fb-392bc3439916","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.776827Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:3b1f919bf49c753556ade55efc4baa82ed3bf809b6726fb82ad49aab355d4658","observation_id":"aa8ef004-d4ad-4c4e-b0a3-fadf7dc3500f","resolution":{"observed_at":"2026-08-10T16:14:25.129749Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07047","last_updated":"2019-08-01T19:12:32Z","snapshot_observed_at":"2026-08-10T04:18:08.543479Z","submitted_at":"2019-05-16T21:52:22Z","title":"Classical and Quantum Bounded Depth Approximation Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07047","snapshot_observed_at":"2026-08-10T16:14:24.781542Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.781542Z"},"links":{"cited_paper":"/paper/1905.07047","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:b5673d499cf058028cdcf97a5b3e6517637a69f4eb522247425595b8015027fa","observation_id":"bb2e73c4-94ef-41f8-87f1-cdb851dd9973","resolution":{"observed_at":"2026-08-10T16:14:24.781542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.110249Z","title":"Akshay, H","venue":null,"work_id":"ce245fb3-3bec-457d-9eb9-38166d891623","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.786187Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:ad1d9367d01df6c23e6b32c1059c331e836e976d339ab0c0f985c09efe8b8b65","observation_id":"39e7da7c-8fd0-4388-9032-52dcb4284527","resolution":{"observed_at":"2026-08-10T16:14:25.114966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"cited_work":{"arxiv_id":"2501.13469","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.13469","snapshot_observed_at":"2026-08-10T16:14:24.896901Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","venue":"quant-ph","work_id":"91e617fc-4902-45f9-9784-474d82b3dc37","year":2025},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.790458Z"},"links":{"cited_paper":"/paper/2501.13469","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:270b04052e3b6c96e9501815093c4c3bc40716bf050d74e120c47b71cbeb35c1","observation_id":"8af4499f-e6bd-4e49-950c-a7a31c1d258e","resolution":{"observed_at":"2026-08-10T16:14:24.901910Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.094635Z","title":"Ozaeta, W","venue":null,"work_id":"f2efc432-a50b-45ae-ad9b-efd2d476f89f","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.795640Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:31cfd9b98943429e2992d1b9e24a6d6ff72fd7a0d5cff8055883884dc10b52d2","observation_id":"a3e24f7c-a364-458b-9cb1-e212fc052b4b","resolution":{"observed_at":"2026-08-10T16:14:25.099282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.080174Z","title":"Bravyi, A","venue":null,"work_id":"bfb0d674-087c-4d7d-bbb7-8827d0ccf4ba","year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.800050Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:cc899ffef59ddb66ccabc03e6e0af49e3d6ca8baeaf73d02ea647d08dc8d43e8","observation_id":"51d0d4ee-60c8-48fe-bb44-d1c20d4a53d1","resolution":{"observed_at":"2026-08-10T16:14:25.084675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.268296Z","title":"Coolsaet, S","venue":null,"work_id":"bfd28c98-3bc0-47c5-a961-db26a314d709","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.804251Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:836833b3717027904f5810bcf0647ed342d9678f555933d71f57869bef86565f","observation_id":"5ff76da5-7151-4d78-ac3f-588ec8bd474b","resolution":{"observed_at":"2026-08-10T16:14:25.272808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.065440Z","title":"Misra and D","venue":null,"work_id":"463d3a7a-b0db-4c97-afa5-fbbd2fc305e4","year":1992},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.808567Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:a1327bb35bf39015d418cc4ce26199eab87743120e06b38c6e83cae40dd8fa97","observation_id":"70c377ef-cf89-49e3-aaf3-7c799d00d490","resolution":{"observed_at":"2026-08-10T16:14:25.070264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03064","last_updated":"2024-08-06T09:35:42Z","snapshot_observed_at":"2026-08-04T14:36:31.574525Z","submitted_at":"2024-08-06T09:35:42Z","title":"Measurement-Based Long-Range Entangling Gates in Constant Depth","version":1},"cited_work":{"arxiv_id":"2408.03064","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.03064","snapshot_observed_at":"2026-08-10T16:14:24.872745Z","title":"Measurement-Based Long-Range Entangling Gates in Constant Depth","venue":"quant-ph","work_id":"8a9c59ad-578b-42fe-bd58-1e0fd2612cde","year":2024},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.812903Z"},"links":{"cited_paper":"/paper/2408.03064","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:5d555109035d648d3b9439ba9540e36d093a3a3cd6b75440883903c5702f9988","observation_id":"8c360ab5-88d3-4dc8-ab40-a604cb0c34ec","resolution":{"observed_at":"2026-08-10T16:14:24.880652Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.169453Z","title":null,"venue":null,"work_id":"4c3db0db-8dd9-4b64-abf1-5826d7bbf489","year":2022},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.817410Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:c4eb68b5df405af70c0db43bb19ee2c0771f3501b2dcbf94d39c144a3709e1bc","observation_id":"5ed8d3c2-9b4d-4c72-97ab-78624fc3222a","resolution":{"observed_at":"2026-08-10T16:14:25.173570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.09002","last_updated":"2020-04-20T00:48:02Z","snapshot_observed_at":"2026-08-10T16:52:45.931674Z","submitted_at":"2020-04-20T00:48:02Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.09002","snapshot_observed_at":"2026-08-10T16:14:24.821625Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.821625Z"},"links":{"cited_paper":"/paper/2004.09002","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:8642de6dec3dcbdfcd18835dfeb060f3abc0ce739dcd9054a9c5aa0d658bb1d4","observation_id":"0adf2022-1d3e-49f3-a1b5-6ca40808381b","resolution":{"observed_at":"2026-08-10T16:14:24.821625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-08-10T16:14:24.826007Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.826007Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:28fda0aed258ac91a29c88a1c9bb1fb964a4bccea5ee7ef4ec51c01036f8fbbd","observation_id":"15f44085-c82d-4701-a1a6-f86b67855ae8","resolution":{"observed_at":"2026-08-10T16:14:24.826007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:14:25.051084Z","title":"De Palma, M","venue":null,"work_id":"e0bc4a73-264c-4536-bd4e-1a25813a8614","year":2023},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.830563Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:7f23220d23d420c489ec81b8a7044ae199fc42012db02ba7eb13c8cca6ad2e16","observation_id":"3cf48bc5-eafe-45cc-9344-af3e191552c6","resolution":{"observed_at":"2026-08-10T16:14:25.055564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T16:14:25.035698Z","title":null,"venue":null,"work_id":"c80c8b79-509c-4cb8-acc4-0138dfc0c1c2","year":2019},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.835086Z"},"links":{"citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:8d3725dc91d51ee337dd65dc069d7a5557bf60f197daff3a727d43fcb13b0d7a","observation_id":"8a19f96e-c3f0-4147-bc15-2652fc43f947","resolution":{"observed_at":"2026-08-10T16:14:25.040256Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T00:47:30.404765Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":2,"verified_fuzzy":42},"total_outbound_references":79},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 1 inbound Pith citation observation for arXiv:2501.13469."}