{"as_of":"2026-08-08T11:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:37289ca55a18b915c286ffcac7f7d042082cf5d91b36cf85e312b7083b3c9d52","coverage":[{"denominator":84,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":84,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T05:02:02.295263Z","state":"measured"},{"denominator":84,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":84,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2607.22372/citation-record","integrity":"/paper/2607.22372/integrity","json":"/paper/2607.22372/citation-record.json","paper":"/paper/2607.22372"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:02:01.133270Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.133270Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:e9c133d539d06f9449f0fa1d8d05effaa00e37988bf79ba103d1e70345e8cc3f","observation_id":"bea7bbbf-a5b5-4fbf-ad5c-ed91293e347b","resolution":{"observed_at":"2026-08-01T05:02:01.133270Z","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-01T05:02:01.137727Z","title":"[33], we can useregularized warm-start QAOA(R WS-QAOA) to generate correlations that can be supplied to QISS","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.137727Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:43dc7cc001377fccc88af8f45b46ab9e186af252e912c65d490e6c3b99cea2f3","observation_id":"b1ee64a1-b4dd-4535-af75-1e9c11fad3fc","resolution":{"observed_at":"2026-08-01T05:02:01.137727Z","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-01T05:02:01.141795Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.141795Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:7968e1b8e92f78f443b6dc19fd33dc72096e2e43c084bdf05df98950d7512612","observation_id":"f3f0d57f-68ae-4b0c-81b1-cd5f53b49a32","resolution":{"observed_at":"2026-08-01T05:02:01.141795Z","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-01T05:02:01.145632Z","title":"8: (i) Simulated Annealing (SA) and (ii) a low-rank Burer–Monteiro (BM) implementation of the Goemans–Williamson SDP relaxation for MaxCut","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.145632Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:2c027394011305c32fa06aa36f86f03f1ea896d8c1d104b8680ed9679d2ddc89","observation_id":"4e506a7a-e4bb-4451-b484-0079e956aa91","resolution":{"observed_at":"2026-08-01T05:02:01.145632Z","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-01T05:02:01.149264Z","title":"We therefore supply QISS with the one-body expectations⟨Z i⟩for all i∈Vtogether with the two-body correlators⟨Z iZj⟩that do not factorize, i.e","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.149264Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:bbcbe99e68a0bbc64230f9b74ef5c7b7f153d89999353c8aa23e287173bfa07d","observation_id":"5957a23e-17da-4c3e-86d0-a6ae8d0ce283","resolution":{"observed_at":"2026-08-01T05:02:01.149264Z","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-01T05:02:01.152977Z","title":"10, we compare the independence ratios averaged over 40 instances at each system sizeN","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.152977Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:b55d5a1513f7fb8b3ad424a6f75671e954e5adaf86a0dca9d960e4c343e60d3e","observation_id":"16b6a1c5-f615-4afa-92f4-cbad5d01b298","resolution":{"observed_at":"2026-08-01T05:02:01.152977Z","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-01T05:02:01.157098Z","title":"Hogg and D","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.157098Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:d7aaf5e09eb5cdee690189c3810468df0d7626ee60f9eb029bc53eba4497bebb","observation_id":"051a04e6-06e8-4dde-bedf-9b21709c30b3","resolution":{"observed_at":"2026-08-01T05:02:01.157098Z","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-01T05:02:01.160603Z","title":"Hogg, Phys","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.160603Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:969c1e89659ed0703d7171723a195a00857f416e0ca989cfcb13689444409137","observation_id":"290be637-08e0-44ef-98fd-821a0a528901","resolution":{"observed_at":"2026-08-01T05:02:01.160603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-01T05:02:01.163906Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.163906Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:d3bb8e25e31ee8ecd89b0650da872ee704f4ecb0b44f32736ccf806ccbae11e6","observation_id":"1dfd450c-ce43-4129-8d41-5b98d97217aa","resolution":{"observed_at":"2026-08-01T05:02:01.163906Z","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-01T05:02:01.167999Z","title":"Montanaro, Physical Review Research2(2020), 10.1103/physrevresearch.2.013056","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.167999Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:66f2af2b8487a7c7e976eb1982f14b3cc34940d65d771c678efeba4663f9077c","observation_id":"64619ab4-a4e4-4161-911d-3fec0c14e7a1","resolution":{"observed_at":"2026-08-01T05:02:01.167999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02279","last_updated":"2024-11-17T13:01:04Z","snapshot_observed_at":"2026-07-06T16:56:49.877351Z","submitted_at":"2023-12-04T19:00:44Z","title":"Challenges and Opportunities in Quantum Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.02279","snapshot_observed_at":"2026-08-01T05:02:01.171748Z","title":"Abbas, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.171748Z"},"links":{"cited_paper":"/paper/2312.02279","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:da9dcfbb54a65cdb8ca7b24b64544155959c0a879af9275ac94ab3e6e9a9e4cc","observation_id":"d3d21eb0-61a6-4c5b-a513-893fbbc8df95","resolution":{"observed_at":"2026-08-01T05:02:01.171748Z","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-01T05:02:01.176014Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.176014Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:3d8262430c8273c678c7c6d25a300da55714cc558bb60eb0113dc1b456201284","observation_id":"68f2bd95-593b-481f-8dfd-5571873e0d7e","resolution":{"observed_at":"2026-08-01T05:02:01.176014Z","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-01T05:02:01.179420Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.179420Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:40fd07d37d52da573225fc0b883515bf1cf8277943091a12e7adc81ceb4bb35e","observation_id":"32725509-ed3f-404f-aa33-696a9d25cfa1","resolution":{"observed_at":"2026-08-01T05:02:01.179420Z","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-01T05:02:01.182657Z","title":"Mechanisms for quantum advantage in global optimization of nonconvex functions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.182657Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:6b605e647c6d45b090d0c893f598381a3a4bc626e63c4a9f7df3bbb81b64a39a","observation_id":"a41084ec-c162-446e-a984-db755472169a","resolution":{"observed_at":"2026-08-01T05:02:01.182657Z","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-01T05:02:01.186671Z","title":"Pagano andet al., Proc","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.186671Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:a481a97a40c7573e79ec82a84acf4475a48c03f49bdbb22b202609bc45f2b33b","observation_id":"44585dc2-e8be-478b-a34b-ae130b1dca8c","resolution":{"observed_at":"2026-08-01T05:02:01.186671Z","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-01T05:02:01.189951Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.189951Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:74da734dec00b487d57d346dfb178513e667335e2311bc015f45535b5e07f991","observation_id":"b1dbf311-2569-4345-8286-11bda720289b","resolution":{"observed_at":"2026-08-01T05:02:01.189951Z","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-01T05:02:01.193212Z","title":"Ebadi, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.193212Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:4397e72ffea69aafae80b1708a5d5f81df011c271c5b340b5b8dbb125297cbfd","observation_id":"7c0bddcd-14e2-437e-bb91-c96d811c92f9","resolution":{"observed_at":"2026-08-01T05:02:01.193212Z","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-01T05:02:01.196881Z","title":"Pelofske, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.196881Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:54a85d40e1826d9958e5312b31fab6554834df7d7f07d0cbe7300c90b5a909e8","observation_id":"7dca08ff-d014-4801-b066-097ac3af1471","resolution":{"observed_at":"2026-08-01T05:02:01.196881Z","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-01T05:02:01.200782Z","title":"Shaydulin, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.200782Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:c6d9aca0c41f152b66c195abd81ba90dfa390958b776d1f3b2558e18d271a0d5","observation_id":"65c398a0-fba3-4a47-87fa-09eb056b66d4","resolution":{"observed_at":"2026-08-01T05:02:01.200782Z","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-01T05:02:01.204075Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.204075Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:838b6729d846b0299b315d6e61ef6c2e36475efadbd3c47106e6a82798a32f29","observation_id":"9c858c5f-b87d-4eef-a1bd-67d5419eb282","resolution":{"observed_at":"2026-08-01T05:02:01.204075Z","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-01T05:02:01.207306Z","title":"Boulebnane and A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.207306Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:3f2dba58b52bd868a97c608d2be777a4a221e6f050ae127f6bfb4fe1bc520af2","observation_id":"5621a642-4b37-4a3d-8eb6-2518bc3f6677","resolution":{"observed_at":"2026-08-01T05:02:01.207306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-06T00:43:02.153056Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17442","snapshot_observed_at":"2026-08-01T05:02:01.210295Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.210295Z"},"links":{"cited_paper":"/paper/2411.17442","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:3cc0df2f14e0ff61a1086b7674e7d89a114dc1cca0dc6eb0b41a8206b146a5a8","observation_id":"b6f16748-68bc-4d9f-8d47-145822e4e301","resolution":{"observed_at":"2026-08-01T05:02:01.210295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04979","last_updated":"2025-02-24T10:25:45Z","snapshot_observed_at":"2026-07-06T19:46:54.707852Z","submitted_at":"2024-11-07T18:51:44Z","title":"Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04979","snapshot_observed_at":"2026-08-01T05:02:01.213674Z","title":"Quantum speedups in solving near-symmetric optimization problems by low-depth qaoa,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.213674Z"},"links":{"cited_paper":"/paper/2411.04979","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:1d167d032d75f625ffb30949d29115b1e0cf7399a3d04d741ee4757432b04bd7","observation_id":"491c4daf-c759-4a8c-9e2a-967ae166d115","resolution":{"observed_at":"2026-08-01T05:02:01.213674Z","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-01T05:02:01.217773Z","title":"Akshay, D","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.217773Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:aff19828d4623e1a626538e84caed59bf3afa95cc720daeda92e24c8db99792b","observation_id":"2eb4eac1-af4e-4853-ae1d-cc05197c4417","resolution":{"observed_at":"2026-08-01T05:02:01.217773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.09002","last_updated":"2020-04-20T00:48:02Z","snapshot_observed_at":"2026-08-03T14:52:28.443409Z","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-01T05:02:01.220915Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.220915Z"},"links":{"cited_paper":"/paper/2004.09002","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:e5e21f5ab4cf0d3f1df206a27eb2acb2405b206826f9a2b31708d9429ec189fa","observation_id":"e92f342a-c2a8-4dd6-bf76-564ec4e683f8","resolution":{"observed_at":"2026-08-01T05:02:01.220915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06049","last_updated":"2022-02-21T21:49:51Z","snapshot_observed_at":"2026-08-02T23:22:50.522831Z","submitted_at":"2021-08-13T03:55:22Z","title":"Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond","version":3},"cited_work":{"arxiv_id":"2108.06049","doi":"10.48550/arxiv.2108.06049","metadata_source":"pith","pith_arxiv_id":"2108.06049","snapshot_observed_at":"2026-08-01T06:16:24.888925Z","title":"Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond","venue":"quant-ph","work_id":"9162bc17-91c2-41bd-a17a-ada42e055351","year":2021},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.224560Z"},"links":{"cited_paper":"/paper/2108.06049","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:5bc44e1f500296234b26c0c42e4bffc02386116048f2ef9b90b11dad097cc022","observation_id":"c7e721f5-5b45-4eb9-a045-f08bd61c2918","resolution":{"observed_at":"2026-08-01T05:03:24.823286Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:07.00738+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.00738+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+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-01T05:02:01.228940Z","title":"Basso, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.228940Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:1756a353ed95dfd4286e0fae83fa53e72dfa4554f9e6227b12c9a8531d0761e0","observation_id":"7b00b3f6-5317-4d67-b80e-dbbdd67a029b","resolution":{"observed_at":"2026-08-01T05:02:01.228940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.02715","last_updated":"2023-04-30T16:38:26Z","snapshot_observed_at":"2026-08-04T09:39:08.896616Z","submitted_at":"2022-09-06T18:00:02Z","title":"Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.02715","snapshot_observed_at":"2026-08-01T05:02:01.232541Z","title":"Anshu and T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.232541Z"},"links":{"cited_paper":"/paper/2209.02715","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:4b99e48c3749addd940f933e08420a41b7ca69a252d23d5e5be68de6c48c8bfa","observation_id":"517d4228-b1b2-4542-baf8-0b7c9f48f332","resolution":{"observed_at":"2026-08-01T05:02:01.232541Z","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-01T05:02:01.236038Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.236038Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:6c6cf016ed6d0403e4068ceb9e9338ccc034e98b44f99de6c220c6d72252c719","observation_id":"d546cfc3-9d92-4f3b-a5f7-407992a06c1d","resolution":{"observed_at":"2026-08-01T05:02:01.236038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01563","last_updated":"2023-10-02T18:55:26Z","snapshot_observed_at":"2026-08-05T11:48:04.430912Z","submitted_at":"2023-10-02T18:55:26Z","title":"Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01563","snapshot_observed_at":"2026-08-01T05:02:01.239581Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.239581Z"},"links":{"cited_paper":"/paper/2310.01563","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:0c10e488b96b4da71ca35bc29e0f783e7376a5ad844bd3d3b41aec9262651afd","observation_id":"4b14bf33-b8f6-4a1d-a738-1687f8f395a1","resolution":{"observed_at":"2026-08-01T05:02:01.239581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1304.1831","last_updated":"2013-04-05T22:36:46Z","snapshot_observed_at":"2026-07-06T03:10:31.136015Z","submitted_at":"2013-04-05T22:36:46Z","title":"Limits of local algorithms over sparse random graphs","version":1},"cited_work":{"arxiv_id":"1304.1831","doi":"10.48550/arxiv.1304.1831","metadata_source":"pith","pith_arxiv_id":"1304.1831","snapshot_observed_at":"2026-08-01T06:16:24.888925Z","title":"Limits of local algorithms over sparse random graphs","venue":"math.PR","work_id":"75689967-761e-4803-aa93-a029c4511358","year":2013},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.243227Z"},"links":{"cited_paper":"/paper/1304.1831","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:a803ce9b3adfa8ddead8a5a5a6ff2efd69f271338079b5d247cf1513fdedd791","observation_id":"4e90d629-ab45-4edc-a95c-1bf412ecd9d2","resolution":{"observed_at":"2026-08-01T05:03:24.543913Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:07.494862+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.494862+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.06943","last_updated":"2019-11-26T01:56:23Z","snapshot_observed_at":"2026-08-07T04:20:46.240470Z","submitted_at":"2019-11-16T03:05:35Z","title":"The Overlap Gap Property and Approximate Message Passing Algorithms for $p$-spin models","version":2},"cited_work":{"arxiv_id":"1911.06943","doi":"10.48550/arxiv.1911.06943","metadata_source":"pith","pith_arxiv_id":"1911.06943","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"The Overlap Gap Property and Approximate Message Passing Algorithms for $p$-spin models","venue":"math.PR","work_id":"63fef77c-61dd-42df-a8b8-77d5e686743c","year":2019},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.248270Z"},"links":{"cited_paper":"/paper/1911.06943","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:267b7b8c9da5f473238a006779cfc2fe135d7a6cdc36b0bacbc15e61f651953f","observation_id":"9f9053a3-ebf8-43f8-998d-d48e949be11c","resolution":{"observed_at":"2026-08-01T05:03:24.264938Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:07.596396+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:07.596396+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.14409","last_updated":"2021-08-01T22:20:02Z","snapshot_observed_at":"2026-07-06T11:52:36.520607Z","submitted_at":"2021-08-01T22:20:02Z","title":"The Overlap Gap Property: a Geometric Barrier to Optimizing over Random Structures","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.14409","snapshot_observed_at":"2026-08-01T05:02:01.251890Z","title":"Gamarnik, Proceedings of the National Academy of Sciences118(2021), 10.1073/pnas.2108492118, arXiv:2109.14409 [cs.CC]","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.251890Z"},"links":{"cited_paper":"/paper/2109.14409","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:b3c9fb8a98c00aba88525439cf9d332462edd519b0f55d11ec151916a91abebd","observation_id":"1e00da0a-e63b-4793-a49a-60d7a2a9c82b","resolution":{"observed_at":"2026-08-01T05:02:01.251890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.05532","last_updated":"2020-09-11T17:07:26Z","snapshot_observed_at":"2026-07-06T09:54:53.629107Z","submitted_at":"2020-09-11T17:07:26Z","title":"Limitations of optimization algorithms on noisy quantum devices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.05532","snapshot_observed_at":"2026-08-01T05:02:01.255908Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.255908Z"},"links":{"cited_paper":"/paper/2009.05532","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:debb1b103e68cdde4bc67fc640307c1dc5b1e077e09409321f93fd60e5e4376c","observation_id":"eb24c00d-778b-41eb-bc1e-a32e39298775","resolution":{"observed_at":"2026-08-01T05:02:01.255908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.03455","last_updated":"2023-02-20T09:01:20Z","snapshot_observed_at":"2026-08-07T05:09:09.988117Z","submitted_at":"2022-04-07T13:58:44Z","title":"Limitations of variational quantum algorithms: a quantum optimal transport approach","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.03455","snapshot_observed_at":"2026-08-01T05:02:01.259666Z","title":"De Palma, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.259666Z"},"links":{"cited_paper":"/paper/2204.03455","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:20040f4e1cc7c2af3548a2113082e51ddbc09875921ab379e04a869cf129804b","observation_id":"eda8dfe5-a4da-447c-9d6a-ad8d11b1ffba","resolution":{"observed_at":"2026-08-01T05:02:01.259666Z","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-01T05:02:01.263435Z","title":"Dupont, B","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.263435Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:dfc97d263519c0270b1caedfa57cfa1ad834b6fb6a1cc8dd2b31fa19d7eb2586","observation_id":"b97534b6-8ce1-4f63-9617-9d4a59c38fdb","resolution":{"observed_at":"2026-08-01T05:02:01.263435Z","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-01T05:02:01.267094Z","title":"A scalable quantum-enhanced greedy algorithm for maximum independent set problems,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.267094Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:d11e3d04b1ec8b2a837b67c88d97d8894206a73e98d071ff007f0b34dcfec51f","observation_id":"a30c9556-b56e-42cd-8c14-38fc50e0a393","resolution":{"observed_at":"2026-08-01T05:02:01.267094Z","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-01T05:02:01.271238Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.271238Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:1cfa5ff759649a04c164c595f0dc297a45b8bb137a16676e4ba871205adfffde","observation_id":"66ab8ec9-285f-4093-a37c-d19f9d80cf2b","resolution":{"observed_at":"2026-08-01T05:02:01.271238Z","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-01T05:02:01.275029Z","title":"Regularized warm-started quantum approximate optimization and conditions for surpassing classical solvers on the max-cut problem,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.275029Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:21920df35a5bed235dc3dd0c2559355c0e88cfc877a07a8ef7010d1f39e21e32","observation_id":"413f8760-3be8-4a5a-9a47-ae306d537995","resolution":{"observed_at":"2026-08-01T05:02:01.275029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-03T05:17:42.667684Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-01T05:02:01.278340Z","title":"Farhi and A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.278340Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:5df825af98e6f6b5002b264eee4bf63ec59f2cbdfcc77596f9316da2a762f501","observation_id":"d599d0a2-b28e-456f-a858-2ed67c938909","resolution":{"observed_at":"2026-08-01T05:02:01.278340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:02:01.282083Z","title":"Lower bounding the maxcut of high girth 3-regular graphs using the qaoa,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.282083Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:dc59761a4392a89ea9e4d204ae03ac302261c1c1bc4e4ec52e95465f1807f2de","observation_id":"0573fbb4-012b-47ff-a42a-e5b0f15d4ce7","resolution":{"observed_at":"2026-08-01T05:02:01.282083Z","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-01T05:02:01.285843Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.285843Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:db4e39cb3378cab1e0b95042c2a0581fbd3d128159e463acbe22649e99cf78ad","observation_id":"923d428f-d874-4bce-9652-1ac07a70a15c","resolution":{"observed_at":"2026-08-01T05:02:01.285843Z","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-01T05:02:01.289235Z","title":"Layden, G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.289235Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:5036725f14c0e19ecee66e427abcb816e56edf6d512b6ec76555a5b94d0ab172","observation_id":"a5129714-7e20-4881-86eb-9ef3c139681f","resolution":{"observed_at":"2026-08-01T05:02:01.289235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08789","last_updated":"2023-05-15T16:47:31Z","snapshot_observed_at":"2026-07-06T15:27:25.253387Z","submitted_at":"2023-05-15T16:47:31Z","title":"QAOA-MC: Markov chain Monte Carlo enhanced by Quantum Alternating Operator Ansatz","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.08789","snapshot_observed_at":"2026-08-01T05:02:01.292441Z","title":"Nakano, H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.292441Z"},"links":{"cited_paper":"/paper/2305.08789","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:47a0492a4d4c3cb669db6e5e5dbdef1cebeb43f78e7895aeff6fe998d1b52b3a","observation_id":"38a5b2d0-4115-41b9-8438-6d093b73aeae","resolution":{"observed_at":"2026-08-01T05:02:01.292441Z","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-01T05:02:01.295853Z","title":"Quantum-enhanced markov chain monte carlo for combinatorial optimization,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.295853Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:8d058d35972c7243c06401072d9a452dc5e791d889130d782e35a9cb490e4b56","observation_id":"0cd17284-db17-4f0c-890b-d4fb991eecb0","resolution":{"observed_at":"2026-08-01T05:02:01.295853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.20701","last_updated":"2026-04-22T15:44:30Z","snapshot_observed_at":"2026-08-02T06:51:35.522942Z","submitted_at":"2026-04-22T15:44:30Z","title":"Divide-and-Conquer Neural Network Surrogates for Quantum Sampling: Accelerating Markov Chain Monte Carlo in Large-Scale Constrained Optimization Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.20701","snapshot_observed_at":"2026-08-01T05:02:01.298950Z","title":"Divide-and-conquer neural network surrogates for quantum sampling: Accelerating markov chain monte carlo in large-scale constrained optimization problems,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.298950Z"},"links":{"cited_paper":"/paper/2604.20701","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:125bd870b1c94e4bae81b2f060e579fda1a161df6a0d931d70c0761ff6bacb47","observation_id":"b11af5c4-f219-41f3-9eb0-ecf7e6dced07","resolution":{"observed_at":"2026-08-01T05:02:01.298950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.16309","last_updated":"2025-08-22T11:36:19Z","snapshot_observed_at":"2026-08-07T03:30:32.079869Z","submitted_at":"2025-08-22T11:36:19Z","title":"Quantum-Enhanced Optimization by Warm Starts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.16309","snapshot_observed_at":"2026-08-01T05:02:01.302336Z","title":"Quantum-enhanced optimization by warm starts,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.302336Z"},"links":{"cited_paper":"/paper/2508.16309","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:69a0fc03296faa02f9c22af19fe0087a7d9862aa71002899f4a6acfd06b21204","observation_id":"4105295d-328b-4df9-968b-ab875fe6c9a5","resolution":{"observed_at":"2026-08-01T05:02:01.302336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.08980","last_updated":"2019-10-20T13:41:23Z","snapshot_observed_at":"2026-08-03T18:16:05.494055Z","submitted_at":"2019-10-20T13:41:23Z","title":"Obstacles to State Preparation and Variational Optimization from Symmetry Protection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.08980","snapshot_observed_at":"2026-08-01T05:02:01.305616Z","title":"Bravyi, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.305616Z"},"links":{"cited_paper":"/paper/1910.08980","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:fa6e77af0957d5acb12f76e47ab30a3bb77bad09e2f5423f5b5f4575af12f0b1","observation_id":"10e15e11-7e17-4001-ac66-a9fa45e324e0","resolution":{"observed_at":"2026-08-01T05:02:01.305616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.05821","last_updated":"2024-01-24T17:20:57Z","snapshot_observed_at":"2026-08-08T08:35:20.915821Z","submitted_at":"2023-07-11T22:02:01Z","title":"Extending relax-and-round combinatorial optimization solvers with quantum correlations","version":2},"cited_work":{"arxiv_id":"2307.05821","doi":"10.48550/arxiv.2307.05821","metadata_source":"pith","pith_arxiv_id":"2307.05821","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Extending relax-and-round combinatorial optimization solvers with quantum correlations","venue":"quant-ph","work_id":"c6a70b6c-e7d6-4734-802b-15d92cb577b4","year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.308806Z"},"links":{"cited_paper":"/paper/2307.05821","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:521b667097496c4ab0bc55dbf15c5b2d1da7114ca4861553992d5623ccb81466","observation_id":"3fb944e5-cc33-4606-84c7-cc6cab6d06af","resolution":{"observed_at":"2026-08-01T05:03:23.972885Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:08.076154+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:08.076154+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.110.052435","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Physical review. A/Physical review, A","work_id":"cb65a824-2925-46f7-9589-540484d1402d","year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.312096Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:fb3269d0fbad0526b05a47f8a31f0d30388145ba22676ff2bc198ed205e03ad4","observation_id":"122a8624-ff99-4f2b-aa12-20388112a3a4","resolution":{"observed_at":"2026-08-01T05:03:23.679162Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:08.2051+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:08.2051+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+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-01T05:02:01.315399Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.315399Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:8ad0ef1fe6c05bc9c4ff73d64170cfa79c5d2c083b39fd2c4ac198fff1aa0649","observation_id":"d656f980-153f-44f5-9d2a-58bbba6af461","resolution":{"observed_at":"2026-08-01T05:02:01.315399Z","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-01T05:02:01.318418Z","title":"Martinez, O","venue":null,"work_id":null,"year":2068},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.318418Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:114d89881c54cea429470fa6bc2e1e1b6fb158b398f50c47270b6fbb9b784423","observation_id":"87227738-97d4-4f23-b32e-adf9857823f9","resolution":{"observed_at":"2026-08-01T05:02:01.318418Z","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-01T05:02:01.321579Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.321579Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:d54ba404daf09d75364a9875e520a0272dd19ab33ce372fefe3f651db684d999","observation_id":"8688f874-dfc6-4895-8509-bd412552b16a","resolution":{"observed_at":"2026-08-01T05:02:01.321579Z","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-01T05:02:01.324559Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.324559Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:d2cd0a45ee04960f51387fadd171b889665ad79e9c7eb03bc769ca728c47effd","observation_id":"78a946e6-0060-4b2d-af43-18ac04214594","resolution":{"observed_at":"2026-08-01T05:02:01.324559Z","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-01T05:02:01.327677Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.327677Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:8ac535c7e6e3c6f7f11541622a1fd5a770913f0c5a221a47b382a29b82bd5068","observation_id":"6ebb22cb-dad3-482b-b7fb-27411369edad","resolution":{"observed_at":"2026-08-01T05:02:01.327677Z","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-01T05:02:01.330962Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.330962Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:ba5d3a1848d43793948641ee5399c5ae26e62ab9ac90654f74ddd4f3775f5f9a","observation_id":"9457662e-dede-4bf3-8304-d482ef5f0394","resolution":{"observed_at":"2026-08-01T05:02:01.330962Z","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-01T05:02:01.334165Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.334165Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:cefe74ce0653f9f1d33e3b8885957c62742732e1a8e28aff81cd35d0ea9dc949","observation_id":"12378d8f-d349-4ca4-8d2b-0c4ef2671e03","resolution":{"observed_at":"2026-08-01T05:02:01.334165Z","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-01T05:02:01.337420Z","title":"Chancellor, Quantum Science and Technology4, 045004 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.337420Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:d607b4526818535beba6dfff1650c9e0d784ce60b73afac22f4186afe69544b8","observation_id":"0366f6ce-e9f1-472d-a204-5015c03299dd","resolution":{"observed_at":"2026-08-01T05:02:01.337420Z","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-01T05:02:01.341060Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.341060Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:7ccd3c7f31b5c8b6072e2b781e69d8e5056cb71bcaea430bebbfa7308db212af","observation_id":"8124bcbd-9dc2-42bc-92a4-6475a5a9aef1","resolution":{"observed_at":"2026-08-01T05:02:01.341060Z","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-01T05:02:01.344265Z","title":"Bak´ o, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.344265Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:13092b5bbbb58c65aa5e425dc6d4ecc6fee907f1682c8655119a516c6241f14f","observation_id":"8d3fb898-54a1-4483-b573-d1840a03458e","resolution":{"observed_at":"2026-08-01T05:02:01.344265Z","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-01T05:02:01.348003Z","title":"Sciorilli, L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.348003Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:daca6fc3b24a1b555e987712948dcfde8bbacb4c415a2a000b02a7930068745f","observation_id":"634e47ca-9fe3-44d0-9620-ebc49189b81e","resolution":{"observed_at":"2026-08-01T05:02:01.348003Z","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-01T05:02:01.351443Z","title":"An information-minimal geometry for qubit-efficient optimization,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.351443Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:91c6be7b59732e569c99ca966f574fc28ebeb26ec9e68c6ff6ea38ddd2f44e9f","observation_id":"afde56e9-58a3-4abe-aa61-ef5cfe74f8f8","resolution":{"observed_at":"2026-08-01T05:02:01.351443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.00862","last_updated":"2018-07-31T21:46:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-01-02T23:43:08Z","title":"Quantum Computing in the NISQ era and beyond","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00862","snapshot_observed_at":"2026-08-01T05:02:01.354476Z","title":"Preskill, Quantum 2, 79 (2018)2, 79 (2018), arXiv:1801.00862 [quant-ph]","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.354476Z"},"links":{"cited_paper":"/paper/1801.00862","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:5827f098237c27eb127b998278e4544ebf2a6ab8b3aed1fa7adc4df568e572bd","observation_id":"2e3104af-75a0-42d8-9279-1f464fddb792","resolution":{"observed_at":"2026-08-01T05:02:01.354476Z","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-01T05:02:01.359528Z","title":"Lucas, Frontiers in PhysicsV olume 2 - 2014(2014), 10.3389/fphy.2014.00005","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.359528Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:4c7143f25609ba12bcc97f84901b602d93d3a900e779d3258cdfb85491732bb9","observation_id":"538d7428-4612-4c8c-9748-802d07bdc3e3","resolution":{"observed_at":"2026-08-01T05:02:01.359528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14206","last_updated":"2022-07-07T13:35:52Z","snapshot_observed_at":"2026-08-05T12:05:41.063921Z","submitted_at":"2021-10-27T06:35:59Z","title":"The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14206","snapshot_observed_at":"2026-08-01T05:02:01.377768Z","title":"Basso, E","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.377768Z"},"links":{"cited_paper":"/paper/2110.14206","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:88070d9d90c84c2f130b4aa69c819b63c1024d712bcff48a82fa8ae98606a974","observation_id":"a1bc5593-5804-4d28-a7d4-da52611e154d","resolution":{"observed_at":"2026-08-01T05:02:01.377768Z","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-01T05:02:01.415993Z","title":"Regular trees in random regular graphs,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.415993Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:7dab8bf5108b7dafc9b7e912f1a78e25321793b8d071ac758822e4e25d76492a","observation_id":"06cf0065-6cc7-451f-84c2-539acf14e374","resolution":{"observed_at":"2026-08-01T05:02:01.415993Z","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-01T05:02:01.452914Z","title":"Wybo and M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.452914Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:ee3b0135a1d2faf1f0ded5ab9face2f66909222f8128a11dc404a9d5d6bf2741","observation_id":"9dc7a1f3-fbab-438e-a624-36fbb8dd82b9","resolution":{"observed_at":"2026-08-01T05:02:01.452914Z","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-01T05:02:01.500630Z","title":"Gray, Journal of Open Source Software3, 819 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.500630Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:c86ca2a1a331f30cda942212655b933a0be5135b77f6fb940929f715f0706824","observation_id":"4407238c-56e1-4065-9366-2fe2ccd49ae8","resolution":{"observed_at":"2026-08-01T05:02:01.500630Z","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-01T05:02:01.541525Z","title":"Pearl,Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference(Morgan Kaufmann, 1988)","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.541525Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:4de351412a0d0cd3c7005696399402e6d6e59f24eca4511d25951b7d96475ae4","observation_id":"64e6fdc1-26f8-498a-bd42-ff5c9cc83b45","resolution":{"observed_at":"2026-08-01T05:02:01.541525Z","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-01T05:02:01.598483Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.598483Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:16c6299479f630ecdba4baff15e3c431426dd6539db453388c9f18d494992a56","observation_id":"1ac376b5-22f8-48e1-bda7-a0e2e9739865","resolution":{"observed_at":"2026-08-01T05:02:01.598483Z","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-01T05:02:01.649312Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.649312Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:7a23b8b71c1ddbfe9b847f3d202b4ffa6d8814ecd514f1309894ade31ed98a61","observation_id":"43bf5cb3-98f0-465c-b693-a18f5d95082e","resolution":{"observed_at":"2026-08-01T05:02:01.649312Z","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-01T05:02:01.698245Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.698245Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:0f9b3e8c73ca30b52f8d68eb9bdce28d3941b42a91182ebb0a95058ec6464898","observation_id":"f15c02ed-c129-4527-a933-696c8147dfb0","resolution":{"observed_at":"2026-08-01T05:02:01.698245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.00215","last_updated":"2021-05-12T03:43:50Z","snapshot_observed_at":"2026-07-06T10:00:22.881519Z","submitted_at":"2020-10-01T06:52:45Z","title":"Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.00215","snapshot_observed_at":"2026-08-01T05:02:01.742412Z","title":"Hashim, R","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.742412Z"},"links":{"cited_paper":"/paper/2010.00215","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:235da67f457e6fb111252dfd5f825f50f4d2978500aba0865a8e5e696b98b6a1","observation_id":"e54e3f62-420e-4ff8-9393-6b9180b3035f","resolution":{"observed_at":"2026-08-01T05:02:01.742412Z","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-01T05:02:01.820369Z","title":"Temme, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.820369Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:1ed99a8db4fe7e4d532bf81786cda73ba97554ef4803037b10d4612dda6a8087","observation_id":"541a8d4b-12b4-40df-9f38-64947d0dc754","resolution":{"observed_at":"2026-08-01T05:02:01.820369Z","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-01T05:02:01.867875Z","title":"Li and S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.867875Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:c741eeedd19b754b8a816aaad56a17a25facabdceef79d237508e98832cd32be","observation_id":"050584a1-a4e6-4897-b239-e9b4114a7bc1","resolution":{"observed_at":"2026-08-01T05:02:01.867875Z","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-01T05:02:01.979810Z","title":"Halperin, D","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.979810Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:8a28bdd05a2ad75f2ab2c32011721119017b72ee0f6851747ef79c2e1e35a65d","observation_id":"ba6268c4-9e62-4360-ba29-47ac0b8113e2","resolution":{"observed_at":"2026-08-01T05:02:01.979810Z","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-01T05:02:02.015130Z","title":"Kirkpatrick, C","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:02.015130Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:51b59e5fe07a07956721ba40cb0ec3e8252ace238ea65dfa972d185d95a3c74a","observation_id":"75a7975e-bc75-4161-aafa-3027e251c1f5","resolution":{"observed_at":"2026-08-01T05:02:02.015130Z","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-01T05:02:02.060272Z","title":"dwave-samplers: Ocean-compatible classical samplers,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:02.060272Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:e4497533ee83038f8d7e542f3d5a1fc62811310f767a570abc8bc94821eac75e","observation_id":"42dc0b06-cf09-4942-8f59-92ab02cef6b7","resolution":{"observed_at":"2026-08-01T05:02:02.060272Z","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-01T05:02:02.100782Z","title":"Burer, R","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:02.100782Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:8dc37b970021110eb238e548ed11c365b49ea54140c5cd97108c416c28cdcd09","observation_id":"65a0c60e-21d3-472c-872e-322810c1dd05","resolution":{"observed_at":"2026-08-01T05:02:02.100782Z","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-01T05:02:02.135516Z","title":"Dunning, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:02.135516Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:c32aeec6a3e805ce44ea7b794a310a59306454a9d1be8a61a7fd86b1c0bc6814","observation_id":"6982974e-c4cd-45e7-a271-3c59bc53b292","resolution":{"observed_at":"2026-08-01T05:02:02.135516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12293","last_updated":"2021-08-17T10:20:52Z","snapshot_observed_at":"2026-08-08T04:05:43.047650Z","submitted_at":"2020-03-27T09:17:48Z","title":"Large independent sets on random $d$-regular graphs with fixed degree $d$","version":2},"cited_work":{"arxiv_id":"2003.12293","doi":"10.48550/arxiv.2003.12293","metadata_source":"pith","pith_arxiv_id":"2003.12293","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Large independent sets on random $d$-regular graphs with fixed degree $d$","venue":"cs.DS","work_id":"f2d4a1a0-8afe-42c1-8c87-b34a628ebdfc","year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:02.166293Z"},"links":{"cited_paper":"/paper/2003.12293","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:63d9fd4a305ddfa4fa11223bca3ccfc479ed88b72f6ac6c2fcf3c4fa40f91db7","observation_id":"71225f54-6b2e-42e0-b576-9139cdcc0276","resolution":{"observed_at":"2026-08-01T05:03:23.375674Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:08.694726+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:08.694726+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+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-01T05:02:02.196117Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:02.196117Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:9c26dc50ffbbb7c7856981e349ec7328d2d9fb4b6a0578ee6e45b93f88beba7f","observation_id":"a906cf99-6398-4d40-abe7-c9ab3f7eb5a7","resolution":{"observed_at":"2026-08-01T05:02:02.196117Z","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-01T05:02:02.256036Z","title":"Hukushima and K","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:02.256036Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:854bc22f811386c2de98a3df300c64e3686d7ebdaf46f0bade26673e07e76536","observation_id":"b8016006-75bf-4501-b1b5-71570f8d0da8","resolution":{"observed_at":"2026-08-01T05:02:02.256036Z","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-01T05:02:02.295263Z","title":"Parisi, Phys","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:02.295263Z"},"links":{"citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:dace1ac5d811de612de0a23deeb06a24627c87169cfc9f7f78952d84a1a703a9","observation_id":"586ee4d9-d0b7-4c55-ac29-6589709edc69","resolution":{"observed_at":"2026-08-01T05:02:02.295263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization"},"reference_resolution":{"displayed":84,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":76,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":84},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 84 of 84 outbound references and 0 inbound Pith citation observations for arXiv:2607.22372."}