{"as_of":"2026-08-10T03:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96da36660cd560a4cd69512dc78e167692e7f2bf59cb5e5d3aeb7dd0e4c821f0","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:12:27.528149Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.01121/citation-record","integrity":"/paper/2608.01121/integrity","json":"/paper/2608.01121/citation-record.json","paper":"/paper/2608.01121"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2603.01809","last_updated":"2026-04-19T08:11:33Z","snapshot_observed_at":"2026-08-06T23:28:09.925515Z","submitted_at":"2026-03-02T12:44:19Z","title":"Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\\'er Filtering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.01809","snapshot_observed_at":"2026-08-07T01:12:24.628968Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:24.628968Z"},"links":{"cited_paper":"/paper/2603.01809","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:286cf532f027cd6b7434b2199969ea1b4e336734690dd4f0627cde828b9241cf","observation_id":"43a5a760-8c13-46f6-b3b8-0d0f364f5306","resolution":{"observed_at":"2026-08-07T01:12:24.628968Z","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-07T01:12:24.701154Z","title":"The complexity of NISQ","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:24.701154Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:caf211cda99763250930b5234fb157dce8677b2c616be2c2d7af3f2d88730b5e","observation_id":"a01344ac-dfcd-4357-806f-3d0424ea8152","resolution":{"observed_at":"2026-08-07T01:12:24.701154Z","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-07T01:12:24.836952Z","title":"QOPTLib: a Quantum-Computing-Oriented Benchmark for Combinatorial Optimisation Problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:24.836952Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:d40fec6d8c4bd12aec518c85ae57b79a5ffcba50160e7d52ed02e549cc4fda81","observation_id":"c594c754-a2fe-40ac-97ad-cb8656dfc838","resolution":{"observed_at":"2026-08-07T01:12:24.836952Z","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-07T01:12:24.921451Z","title":"Papadimitriou and Kenneth Steiglitz.Combinatorial Optimization: Al- gorithms and Complexity","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:24.921451Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:ffa75dcbad58b869cbc105debbf31c6d2fec606583e4a58131e081a0867b1e2b","observation_id":"32a14172-05cc-4535-971e-cb8dcd154170","resolution":{"observed_at":"2026-08-07T01:12:24.921451Z","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-07T01:12:25.075825Z","title":"Ising formulations of many NP problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.075825Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:ed37a38aac06b0a6eecbd317426e4fd4faab37e388541942bb03d86018a26588","observation_id":"fd59914b-9827-4f0f-b9f0-f1624bf03c7a","resolution":{"observed_at":"2026-08-07T01:12:25.075825Z","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-07T01:12:25.231703Z","title":"Lawler et al.The Traveling Salesman Problem: A Guided Tour of Com- binatorial Optimization","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.231703Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:2656b12844d5525cffb9506f5742af1c4fdb4cd43d6291d5d17e5eba8158e46e","observation_id":"0d09a53b-7578-4a26-ba9a-f265957170f6","resolution":{"observed_at":"2026-08-07T01:12:25.231703Z","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-07T01:12:25.386116Z","title":"Garey and David S","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.386116Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:6aa8aab7cb2dbccc7d6cafd6722d0d991dcf729460baad6d2723649d0f60e1a0","observation_id":"23c6bd68-4ab4-42ad-afc9-7df403045ad8","resolution":{"observed_at":"2026-08-07T01:12:25.386116Z","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-07T01:12:25.506654Z","title":"Assignment Problems and the Location of Economic Activities","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.506654Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:abb9cd2896eb5a00291298ed01a4907a6b08cfecf564ccd9d2e6e04b3da3fceb","observation_id":"f8b618ae-660b-49b9-8614-ff9158a145a9","resolution":{"observed_at":"2026-08-07T01:12:25.506654Z","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-07T01:12:25.598523Z","title":"A Survey for the Quadratic Assignment Problem","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.598523Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:42e922e812836996f653eff3650287599db68bab7dda7d4e3e3b13487b40f6f0","observation_id":"8784da39-d68f-4668-a248-ce1dce3a98d7","resolution":{"observed_at":"2026-08-07T01:12:25.598523Z","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-07T01:12:25.708213Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.708213Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:12fd59e1da8c15c22e378271bf603104cef3542a830475e9814ff6f7726d64d7","observation_id":"1495727b-fdc1-49bf-855d-6a649d65cce4","resolution":{"observed_at":"2026-08-07T01:12:25.708213Z","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-07T01:12:25.786501Z","title":"P-Complete Approximation Problems","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.786501Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:b9bc6f61dd46930d77acf18c1e1de4005acc5c2701d633db497ff7f5177d6782","observation_id":"4a5f5410-3150-49f7-9495-ec1e551ce0d5","resolution":{"observed_at":"2026-08-07T01:12:25.786501Z","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-07T01:12:25.880283Z","title":"Wiley, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.880283Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:14659df61a4b714de450b3f06a4a98f342f2e15b0736567ebb14030dcbf992bc","observation_id":"deb0e25e-1771-4ec8-8b2f-2a54de84c1f9","resolution":{"observed_at":"2026-08-07T01:12:25.880283Z","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-07T01:12:25.996135Z","title":"Reducibility among Combinatorial Problems","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:25.996135Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:43d5557a87a45263a834673bd0855d0c4c82ee586d9788c6b7c44af7ff932793","observation_id":"a33bbe4f-0a8c-4169-b332-241557be1393","resolution":{"observed_at":"2026-08-07T01:12:25.996135Z","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-07T01:12:26.078156Z","title":"Garey and David S","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.078156Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:b26f3f1f77c47c12e923dec1437a206f0b03c00f84716a0a7b7245ca7d0c7192","observation_id":"5dd06309-1793-4338-ac7f-914236b869a2","resolution":{"observed_at":"2026-08-07T01:12:26.078156Z","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-07T01:12:26.235105Z","title":"QUEST: QUantum-Enhanced Shared Transportation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.235105Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:9402da443f565da17fb469f9afecd3dd096e665a3fe2661396a72c76c5c21f15","observation_id":"f8e397e3-f539-437b-b486-c62804c93aaf","resolution":{"observed_at":"2026-08-07T01:12:26.235105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.30252","last_updated":"2026-05-28T17:15:46Z","snapshot_observed_at":"2026-08-05T11:20:53.165850Z","submitted_at":"2026-05-28T17:15:46Z","title":"Quantum optimization beyond QUBO for industrial logistics and scheduling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.30252","snapshot_observed_at":"2026-08-07T01:12:26.299109Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.299109Z"},"links":{"cited_paper":"/paper/2605.30252","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:accbc46c23d37df3190b75759b8d46f347d1274c679f6eb50cd83f22a014d90a","observation_id":"28dadb0c-2430-4f95-b74d-d33c11b61154","resolution":{"observed_at":"2026-08-07T01:12:26.299109Z","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-07T01:12:26.362605Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.362605Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:63178e85c1dd784d4f527263e2854a73398b1c0fc25032d229a34f98d7beae39","observation_id":"286f9fab-4f09-42ac-b7ca-5a23ff722711","resolution":{"observed_at":"2026-08-07T01:12:26.362605Z","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-07T01:12:26.428335Z","title":"The Complexity of Flow- shop and Jobshop Scheduling","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.428335Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:a1f668e07b955ca4ac2de3de34302c7ff6e40a8e13fc19441cc551e5f330fd5f","observation_id":"a147e3a1-cecb-436d-a07d-b6bfa9262a2b","resolution":{"observed_at":"2026-08-07T01:12:26.428335Z","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-07T01:12:26.481158Z","title":"Complexity of Machine Scheduling Problems","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.481158Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:49e5e70deb76c4a9658a65a1e83b4b2e34ec368ffb35e55d1583fe1d8b3039f1","observation_id":"eccf39ee-5452-452f-bb7d-bda3e448f958","resolution":{"observed_at":"2026-08-07T01:12:26.481158Z","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-07T01:12:26.503216Z","title":"The Hungarian Method for the Assignment Problem","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.503216Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:a9779172775b3b8855daf10958f3d895c855185177be4407514dd1e7ea9f47b6","observation_id":"24f96584-7e2f-4f2b-ab97-8340559f93f1","resolution":{"observed_at":"2026-08-07T01:12:26.503216Z","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-07T01:12:26.515603Z","title":"Algorithms for the Assignment and Transportation Problems","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.515603Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:dc4acd97311f329e2d7c1257a6457c2cc73e07196dcbef2346f0ba8e9a82d7e0","observation_id":"27153c76-19ad-45d2-9c50-2e03ada6a943","resolution":{"observed_at":"2026-08-07T01:12:26.515603Z","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-07T01:12:26.546092Z","title":"Paths, Trees, and Flowers","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.546092Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:00f524db344b1bc0f09bc2d999c0ddb594623991c7a944d68cf5682c4a8bbbcd","observation_id":"6e4b196d-1c76-4cf9-b4c5-eb4fd45b4186","resolution":{"observed_at":"2026-08-07T01:12:26.546092Z","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-07T01:12:26.581276Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.581276Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:2572b4e415ecd850d3e06e7d9bde2ff15bdba38fde963f7d273e7158f38019c8","observation_id":"4f8e9a6b-737a-4800-9509-e2bb76dfbd8d","resolution":{"observed_at":"2026-08-07T01:12:26.581276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.13630","last_updated":"2026-08-06T09:45:51Z","snapshot_observed_at":"2026-08-09T23:09:53.975787Z","submitted_at":"2026-07-15T09:25:26Z","title":"Separating Geometry From Interference in Constrained Quantum Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.13630","snapshot_observed_at":"2026-08-07T01:12:26.604933Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.604933Z"},"links":{"cited_paper":"/paper/2607.13630","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:cccb4c4230cbb4b42c01fc7473a5f145aaea8cb1005f1d731718ed1fc5382cb9","observation_id":"1de36b95-613b-44a7-b7ca-d26f233c7aba","resolution":{"observed_at":"2026-08-07T01:12:26.604933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.17259","last_updated":"2026-06-10T07:19:35Z","snapshot_observed_at":"2026-08-03T21:06:58.903886Z","submitted_at":"2025-11-21T14:04:01Z","title":"Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.17259","snapshot_observed_at":"2026-08-07T01:12:26.654160Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.654160Z"},"links":{"cited_paper":"/paper/2511.17259","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:0743f4d72768e84d7c92131ea1563ba58e238438126a3d32468e1c3f87197b0d","observation_id":"38a316b2-096d-432e-aba8-1a85e2ba5d39","resolution":{"observed_at":"2026-08-07T01:12:26.654160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.04570","snapshot_observed_at":"2026-08-07T01:12:26.687607Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.687607Z"},"links":{"cited_paper":"/paper/2604.04570","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:ff999f6180756d51519b1b6a4e377f73fe86abdfc15e15d331c14d1e4f6831eb","observation_id":"5727e1b0-04e4-4a22-8113-f3b798d25612","resolution":{"observed_at":"2026-08-07T01:12:26.687607Z","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-07T01:12:26.728128Z","title":"Low-cost error mitigation by symmetry verification","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.728128Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:9e913db0035d307df1aaea2eb79bb710f8d12ea373d4c3f335a6a31bc70d9297","observation_id":"b8c00106-c6a9-45c0-9e87-049873766633","resolution":{"observed_at":"2026-08-07T01:12:26.728128Z","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-07T01:12:26.766683Z","title":"Experimental error mitigation via symmetry verification in a variational quantum eigensolver","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.766683Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:2f81e3cfad5c93e3020b90b22f3aa7961c7114ae2a3d07c170eb662257601cc6","observation_id":"b69c1969-8292-454e-b842-3b8d83b705bd","resolution":{"observed_at":"2026-08-07T01:12:26.766683Z","resolver_source":null,"status":"malformed_identifier"},"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-07T01:12:26.814192Z","title":"Error mitigation for short- depth quantum circuits","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.814192Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:badd18b4fd5a615952750f943ab9c384da1c0399fd6f34b36b9a3d8d4623dacd","observation_id":"4a69f2ad-af93-4459-a672-2fc784bbfc2c","resolution":{"observed_at":"2026-08-07T01:12:26.814192Z","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-07T01:12:26.850326Z","title":"Practical Quantum Error Mitiga- tionforNear-FutureApplications","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.850326Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:d83acadfe6695a97038032ecdca4f17cd4be9a1750a4aa2958ff9b0b018121d7","observation_id":"ade4730e-7325-4db0-b618-76df6ef14cd1","resolution":{"observed_at":"2026-08-07T01:12:26.850326Z","resolver_source":null,"status":"malformed_identifier"},"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-07T01:12:26.893580Z","title":"Mitigating measurement errors in multiqubit experiments","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.893580Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:43fc2398034de7a53d90f04c550529ee670d2c472db44f1c8633cd6014a3eae7","observation_id":"fdf5dae4-c5e4-4bef-a97c-4fe491a13819","resolution":{"observed_at":"2026-08-07T01:12:26.893580Z","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-07T01:12:26.928305Z","title":"Error mitigation with Clifford quantum-circuit data","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.928305Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:37cdb4b0e2e7d40f9a157007721134ebf6f707cab4edab219a5fb3dc9390be1c","observation_id":"e4305ae4-5264-4317-80cc-0c00041023bf","resolution":{"observed_at":"2026-08-07T01:12:26.928305Z","resolver_source":null,"status":"malformed_identifier"},"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-07T01:12:26.966830Z","title":"From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:26.966830Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:d45debf29076a15faae4c9da3460abdef35be4146328e12919b3c2dc4e924522","observation_id":"0ac5c5a8-c81e-4a49-aee6-f29c1777c0c8","resolution":{"observed_at":"2026-08-07T01:12:26.966830Z","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-07T01:12:27.003374Z","title":"Constraint Preserving Mixers for the Quantum Approximate Optimization Algorithm","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.003374Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:a944d313c51dcda4b5b7145e831982d1f06efdc7575d8f618211725e93d842a3","observation_id":"4c32dd8e-554c-4029-9ca3-1cad513db370","resolution":{"observed_at":"2026-08-07T01:12:27.003374Z","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-07T01:12:27.038207Z","title":"Encodingtrade-offsand design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.038207Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:40b6278abdc7ede78b1de25bb9a52506a8df8b50630ecb886f451a649255887f","observation_id":"c65a33ec-cb05-45ea-aaf4-698bc9a054e0","resolution":{"observed_at":"2026-08-07T01:12:27.038207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13787","last_updated":"2024-01-22T00:55:03Z","snapshot_observed_at":"2026-08-05T17:50:06.259234Z","submitted_at":"2023-09-25T00:35:40Z","title":"Symmetries and Dimension Reduction in Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.13787","snapshot_observed_at":"2026-08-07T01:12:27.078889Z","title":"Symmetries and Dimension Reduction in Quantum Approximate Optimization Algorithm","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.078889Z"},"links":{"cited_paper":"/paper/2309.13787","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:145e3085888f09284cb460cd63a89578c7013aef0b92e161b591895346dfd89a","observation_id":"a8155933-32a1-47e8-b8e8-e10ef2b6fdaa","resolution":{"observed_at":"2026-08-07T01:12:27.078889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.02465","last_updated":"2026-05-04T11:08:34Z","snapshot_observed_at":"2026-08-06T19:24:18.237684Z","submitted_at":"2026-05-04T11:08:34Z","title":"Constraint Preserving XY-Mixers under Trotterized Adiabatic Evolution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.02465","snapshot_observed_at":"2026-08-07T01:12:27.131886Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.131886Z"},"links":{"cited_paper":"/paper/2605.02465","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:117b210c9f30c1f57e61dba155e9ff2f09155d4b8869b2b1d3b1418dda4e9991","observation_id":"1b44ba26-dd0e-45bc-abc7-8526b603055e","resolution":{"observed_at":"2026-08-07T01:12:27.131886Z","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-07T01:12:27.167303Z","title":"Constrained quantum optimization for extractive summa- rization on a trapped-ion quantum computer","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.167303Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:17ee7f02a1d1f3a876d8f368c52e21d211e1624d81e5d32a143617ee9b7cafb6","observation_id":"e09f03cc-725e-4f21-ad9c-c53697631ec9","resolution":{"observed_at":"2026-08-07T01:12:27.167303Z","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-07T01:12:27.186902Z","title":"Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.186902Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:688ae418f0c743061250bc6a8c47aa361c838007d3cb24ac38b85caced1c7ff3","observation_id":"963ae623-4c1c-4b14-b584-48d7584d206a","resolution":{"observed_at":"2026-08-07T01:12:27.186902Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.28234","last_updated":"2026-08-03T15:45:51Z","snapshot_observed_at":"2026-08-07T06:44:35.035273Z","submitted_at":"2026-06-26T16:21:57Z","title":"Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.28234","snapshot_observed_at":"2026-08-07T01:12:27.221965Z","title":"Maciejewski, and Davide Venturelli.Noise-Directed Adap- tive Remapping for Integer Optimization: from qubits to (encoded) qudits","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.221965Z"},"links":{"cited_paper":"/paper/2606.28234","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:081daf8d32a53f2050a8e4d2b05c42df2354bf875238991f37f7e5bd3ae9f77e","observation_id":"73e36b7e-d0be-45f0-8b59-8a031cd4143d","resolution":{"observed_at":"2026-08-07T01:12:27.221965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.09368","last_updated":"2026-07-10T12:46:10Z","snapshot_observed_at":"2026-08-06T16:15:12.081866Z","submitted_at":"2026-07-10T12:46:10Z","title":"Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.09368","snapshot_observed_at":"2026-08-07T01:12:27.257921Z","title":"Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.257921Z"},"links":{"cited_paper":"/paper/2607.09368","citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:0fdddf12dfe88b4a932213979bcc35cb7d5ef452bdc9e16826b3167be243d61f","observation_id":"70542232-0e68-44c8-af13-2bf94cc92005","resolution":{"observed_at":"2026-08-07T01:12:27.257921Z","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-07T01:12:27.281789Z","title":"Twisted Hybrid Algorithms for Combinatorial Optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.281789Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:138c06342bd00c638bafdc932328a54e683fe738a889edd3158df13e07379214","observation_id":"6ec8ffc9-bdd0-48dc-957f-d3bac42b0fc4","resolution":{"observed_at":"2026-08-07T01:12:27.281789Z","resolver_source":null,"status":"malformed_identifier"},"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-07T01:12:27.308586Z","title":"Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.308586Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:d07974f2f26fff123e544479262e1d2e9165f02acca354366188e5f6ccb4d185","observation_id":"a9a1c533-1dd7-40f5-ba65-8417e41da561","resolution":{"observed_at":"2026-08-07T01:12:27.308586Z","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-07T01:12:27.349218Z","title":"Finding Repeated Elements","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.349218Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:0f9a0a0e2eb6e1757a283240031afa3f0ae4432a7fffe1aa913fb91ccff77884","observation_id":"dfc5ab2f-ea8f-4ca9-813e-3d0a4e1325d1","resolution":{"observed_at":"2026-08-07T01:12:27.349218Z","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-07T01:12:27.385549Z","title":"An Improved Data Stream Summary: The Count-Min Sketch and Its Applications","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.385549Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:5c2d50d3fdd49581888560a56c21b5fe9c4514e42468c92f1d835f68f1dfe63b","observation_id":"d140b5ef-0416-4d24-a967-feb8675313df","resolution":{"observed_at":"2026-08-07T01:12:27.385549Z","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-07T01:12:27.418057Z","title":"Polynomial-time approximation schemes for Euclidean Traveling Salesman and other geometric problems","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.418057Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:b64c6489a1c459cff5593d7a33371ca7b7ccb7b9f5b16826b21f2a1aea34b6e4","observation_id":"9bb22b2a-e940-4e64-80de-1f48311a1a3a","resolution":{"observed_at":"2026-08-07T01:12:27.418057Z","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-07T01:12:27.445361Z","title":"Wilde.Quantum Information Theory","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.445361Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:c681b8413e6e156a61c79e37f795bd332febb397a6501de81220dcd5a8a9629b","observation_id":"ccdc7b66-badd-4e2a-baa7-766f6d982b78","resolution":{"observed_at":"2026-08-07T01:12:27.445361Z","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-07T01:12:27.468418Z","title":"Algorithm 235: Random Permutation","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.468418Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:84fe05936bd726db2cad3a74ac947a775819f4bd286265a018a39b4a2b50b250","observation_id":"c7fdbae8-04f4-4474-bbbd-bd28d7576182","resolution":{"observed_at":"2026-08-07T01:12:27.468418Z","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-07T01:12:27.492179Z","title":"Ayrton et al.Qiskit: An Open-source Framework for Quantum Computing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.492179Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:b1016179f4bd61a55b0f442c4e9105c8fbb11aec426313c525925be659622c11","observation_id":"1088935f-b512-40e7-ad82-f03369eeb3c6","resolution":{"observed_at":"2026-08-07T01:12:27.492179Z","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-07T01:12:27.528149Z","title":"Nielsen and Isaac L","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T01:12:27.528149Z"},"links":{"citing_paper":"/paper/2608.01121"},"observation_digest":"sha256:2073ff620f6970365d76b6614e687af766305bf8969eca6f103db6a57f5a4be4","observation_id":"917d2bba-7bcb-452a-bf5a-acd495449214","resolution":{"observed_at":"2026-08-07T01:12:27.528149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.01121","last_updated":"2026-08-06T09:13:43Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T23:10:03.146406Z","submitted_at":"2026-08-02T09:35:42Z","title":"Polynomial Time Quantum Approximation Schemes for Constrained Optimisation"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":5,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":50},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2608.01121."}