{"as_of":"2026-08-10T10:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64a51b3608d3e84c6566433d4c49338c7804c1436a58de2995f68bbc998d848f","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:56:46.735001Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T03:16:10.677408Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T12:41:03.590428Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"cited_work":{"arxiv_id":"2502.02245","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02245","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Qubit-efficient quantum local search for combinatorial optimization","venue":null,"work_id":"431df939-d06e-4b93-be89-9faa56352b18","year":2025},"citing_paper":{"arxiv_id":"2604.18285","last_updated":"2026-04-20T13:57:49Z","snapshot_observed_at":"2026-07-06T23:05:13.178333Z","submitted_at":"2026-04-20T13:57:49Z","title":"EQE-QAOA: An Equivalence-Preserving Qubit Efficient Framework for Combinatorial Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T03:16:10.677408Z"},"links":{"cited_paper":"/paper/2502.02245","citing_paper":"/paper/2604.18285"},"observation_digest":"sha256:6a198e684fbea28cec7837645c33bac7755d1956ff21b26d06b9dc485ba8bc21","observation_id":"64f34aa6-4820-4648-b418-4dbe4372c5b7","resolution":{"observed_at":"2026-05-11T12:41:03.595696Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02245/citation-record","integrity":"/paper/2502.02245/integrity","json":"/paper/2502.02245/citation-record.json","paper":"/paper/2502.02245"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.297092Z","title":"An efficient closed-form formula for evaluating r-flip moves in quadratic unconstrained binary optimization","venue":null,"work_id":"b59b6679-e8da-4c5a-84f7-ceb310ab41f0","year":2023},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.594756Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:35be759f69751a81658677e12c9abc171331e7e1ce306b86f30e5b0ca7358fc9","observation_id":"fd19223b-b90d-4c61-8543-1cb5757281d8","resolution":{"observed_at":"2026-08-09T12:56:47.300886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.286809Z","title":"Optimization by simulated annealing","venue":null,"work_id":"6002c7de-370c-4755-94c4-7268557af12e","year":1983},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.599743Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:6b1bb5642ba5207a2c67b76f1e199ce726bac290c76b383b15b30d25544a1fa9","observation_id":"325e1008-bd9f-454f-8d72-4bbbd404d7fc","resolution":{"observed_at":"2026-08-09T12:56:47.290324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.276796Z","title":"Multistart tabu search strategies for the unconstrained binary quadratic optimization problem","venue":null,"work_id":"09063909-1351-4605-b550-be2a02122b20","year":2004},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.603423Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:a41be14388dfc305d71a27439bc52358c775c82bce4016be789299ef79305232","observation_id":"10c40755-50b4-4bd3-a156-6606a61bdf45","resolution":{"observed_at":"2026-08-09T12:56:47.280413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.266371Z","title":"Memetic algorithms for the unconstrained binary quadratic programming problem","venue":null,"work_id":"00b8b4f5-26b6-48a3-8b9d-e55012219616","year":2005},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.607176Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:d3720b36e00821ccf6e30a7be91cb3cc65d252e322dd4cbc0c645902fb99f3b0","observation_id":"c00af852-fe0e-4da5-8416-366ec96ac611","resolution":{"observed_at":"2026-08-09T12:56:47.270039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.256100Z","title":"Metaheuristic algorithms","venue":null,"work_id":"9de65814-f7ab-4d76-9d75-796e8a507c3d","year":2022},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.611073Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:c3458d9f15b652ae5089d86894c301df22f3abb3f0533c59797061e900e45418","observation_id":"bf09fe08-a42b-46af-9277-a7cff1f32382","resolution":{"observed_at":"2026-08-09T12:56:47.259477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.245747Z","title":"Quantum Local Search with the Quantum Alternating Operator Ansatz","venue":null,"work_id":"c3970559-7655-4e0b-b8d5-79c70c484c25","year":2022},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.614664Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:290c771e883429e8d9c61f9338962ff6f6be328134cdc64ae87bc2564853f966","observation_id":"8ead2aaa-c5c7-49a7-bf68-b2853a99276e","resolution":{"observed_at":"2026-08-09T12:56:47.249753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.235496Z","title":"Reinforcement learning quantum local search","venue":null,"work_id":"95741feb-4005-4de6-89b1-8d94cd3ab013","year":2023},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.618271Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:4c7027e0aadceb37ab1175c70e1a31eb4e74caba3870107a489528e8996ffc84","observation_id":"20fe3025-2979-443e-b53d-bc1bd3978f4e","resolution":{"observed_at":"2026-08-09T12:56:47.239437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.225047Z","title":"Qubit-efficient encoding schemes for binary optimisation problems","venue":null,"work_id":"4a0abb23-cf1f-4840-ac2a-1aaa840ac15a","year":2021},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.621507Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:d26ac8714aadfaea1da58289da595cc9cc9fd4afae28c6f0062dbb85ab9a7e9a","observation_id":"de068fc8-2f02-4380-83c6-9f70fa3e9aaf","resolution":{"observed_at":"2026-08-09T12:56:47.228514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.214687Z","title":"NISQ-compatible approximate quantum algorithm for unconstrained and constrained discrete optimiza- tion","venue":null,"work_id":"fd78b0d3-4764-404a-a3a0-a085aab1639c","year":2023},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.624800Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:f13fe7aa81dac753131fb6e321dbdef4e9b63e242e03fd80e5b2f9ff29c66f7b","observation_id":"285f37ca-3021-4129-86eb-8d534d08a037","resolution":{"observed_at":"2026-08-09T12:56:47.218309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.10383","last_updated":"2023-11-23T18:49:54Z","snapshot_observed_at":"2026-07-06T16:08:17.076884Z","submitted_at":"2023-08-20T23:06:18Z","title":"A Variational Qubit-Efficient MaxCut Heuristic Algorithm","version":2},"cited_work":{"arxiv_id":"2308.10383","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.10383","snapshot_observed_at":"2026-08-09T12:56:46.934125Z","title":"A Variational Qubit-Efficient MaxCut Heuristic Algorithm","venue":"quant-ph","work_id":"379853e5-ec95-48b0-942d-67fc6a6a7760","year":2023},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.628044Z"},"links":{"cited_paper":"/paper/2308.10383","citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:3c711a0e2516a7b23064ffeb468b05ffa0b025d56b14f0c8fa7f4f8edb0248a7","observation_id":"c44ddff6-0145-4ce7-b0e0-37d0a60d9c72","resolution":{"observed_at":"2026-08-09T12:56:46.938747Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.204376Z","title":"Solving various NP-hard problems using exponentially fewer qubits on a quantum computer","venue":null,"work_id":"a69e99ee-73ee-44fb-8300-71147a7b7c67","year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.631747Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:9378fe38704dcc2c0f6e51ba96de1d417009117091442f0e7fadcd5ea847d37a","observation_id":"3d6afbe2-42ba-4acd-9f19-0c437b674f4b","resolution":{"observed_at":"2026-08-09T12:56:47.208050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.194048Z","title":"Noisy intermediate-scale quantum computing algorithm for solving an n-vertex maxcut problem with log(n) qubits","venue":null,"work_id":"0e0fed68-6cea-4785-9e43-cba9365a37ec","year":2023},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.635134Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:9eb837f55cf3cf6eb268b6063c539ef80de2ec1cb3fbf4cdd16452221cbfaed5","observation_id":"88f51423-d85e-46e2-9602-e4d00e19035b","resolution":{"observed_at":"2026-08-09T12:56:47.197674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.183654Z","title":"Differential evolution - a simple and efficient heuris- tic for global optimization over continuous spaces","venue":null,"work_id":"853024d5-ae14-4e01-8655-60320ec2d7ba","year":1997},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.638368Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:7b396736d501e10ac51b634f907ca9cf10a88911658f8ebd493ca824a2e197b5","observation_id":"e252bf1e-d4f6-4ac2-9be7-898a98cfb28a","resolution":{"observed_at":"2026-08-09T12:56:47.187274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.173512Z","title":"A variational eigenvalue solver on a photonic quantum processor","venue":null,"work_id":"0f360ac4-f167-454c-895d-8cb1f5f00081","year":2014},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.641755Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:dd13a0eab1d1c612e9f19dda7de5cfe3cfaa239ff102a8f179409df351eb4c86","observation_id":"943c0d32-dc93-447c-aa7a-9ed14c3e4d18","resolution":{"observed_at":"2026-08-09T12:56:47.177149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.163151Z","title":"Quantum variational optimization: The role of entanglement and problem hardness","venue":null,"work_id":"05acbc08-edcd-4a10-99da-f4aa36d1ef00","year":2021},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.644984Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:745c766f22f9c94c2a10778cedda3c253ffbaaebce6cc059efdf8183fe30c992","observation_id":"918b84ed-e1a2-498f-8c71-f7876544ceb3","resolution":{"observed_at":"2026-08-09T12:56:47.167049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-09T12:56:46.648164Z","title":"A quantum approximate opti- mization algorithm","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.648164Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:8d4db5538d63e54fbc14a0318ca04df67465379d40e5e8600a7c669928a2fa1b","observation_id":"67b76e5d-d53b-4ee3-b549-5ebf4f2b0550","resolution":{"observed_at":"2026-08-09T12:56:46.648164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.153241Z","title":"A review on quantum approximate optimization algorithm and its variants","venue":null,"work_id":"d9c705ee-5f37-4c6e-bb26-f13de8f870c7","year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.651895Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:a007a1af458a7fcad9de324611e6094990b92c3d83a4c2f3c274f32a2f51fada","observation_id":"879b2b44-4f33-4455-9054-1e1444b2382f","resolution":{"observed_at":"2026-08-09T12:56:47.156724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.143265Z","title":"Approx- imate solutions of combinatorial problems via quantum relaxations","venue":null,"work_id":"1e413c9b-d9f5-4849-a3ab-948c53243880","year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.655292Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:aa6e2d5d0aa17e22e18435f8cc80b8611b3e72f912d584c8dff945d4bb620d6d","observation_id":"ae8f9957-0c4f-4697-9d58-861622d77bed","resolution":{"observed_at":"2026-08-09T12:56:47.146750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.133272Z","title":"Variational quantum optimization with multibasis encodings","venue":null,"work_id":"740e8957-fad1-467e-97ff-66d8f3d5adad","year":2022},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.658460Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:315659a83f445b48bbb3d0b491187c205965096e1d68ee0ccec3e5ae65cd7c88","observation_id":"8ce751b2-4ef7-4430-b15c-06ce3e5d27dd","resolution":{"observed_at":"2026-08-09T12:56:47.136782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09421","last_updated":"2024-03-25T19:43:00Z","snapshot_observed_at":"2026-08-04T11:17:26.112784Z","submitted_at":"2024-01-17T18:59:38Z","title":"Towards large-scale quantum optimization solvers with few qubits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09421","snapshot_observed_at":"2026-08-09T12:56:46.661840Z","title":"Towards large-scale quantum optimization solvers with few qubits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.661840Z"},"links":{"cited_paper":"/paper/2401.09421","citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:cc883a5a2001b5fde589d58254696ee9306826ba3a6b90b65058e3d8fe594a4b","observation_id":"0ed6cdcd-7670-43f2-b5a1-fd9d814f2e46","resolution":{"observed_at":"2026-08-09T12:56:46.661840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.123479Z","title":"Quantum bridge analytics I: a tutorial on formulating and using QUBO models","venue":null,"work_id":"d98bcb17-6ca6-4702-ae75-da2b592b54a3","year":2019},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.665816Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:532fe1f260d8ef0aa06afda9971f9b3d12baf8dca693b4bf08970cd3d3d809d2","observation_id":"ae9d0439-0005-4a5c-8be2-1a1fed8b6c91","resolution":{"observed_at":"2026-08-09T12:56:47.127084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.113511Z","title":"Ising formulations of many NP problems","venue":null,"work_id":"cda3a6d3-bd1e-4e0d-9b4e-4d58f88bece9","year":2014},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.669299Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:00de37eab4a0d5c8f5cff21bc6785babebcbcec1350125899b5c07e7319e17cc","observation_id":"ac1f6e08-9383-4e16-b36e-bcce591d8426","resolution":{"observed_at":"2026-08-09T12:56:47.117341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.103272Z","title":"Pseudo-boolean optimization","venue":null,"work_id":"6a3230b6-60e7-474f-8591-0c6394703bb3","year":2002},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.672580Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:f8f928b23e204b82680eea1c91a112039377f7c3e3f6d2374aed805cfb4ba12f","observation_id":"bdcd2e69-4454-400b-9f0d-8aaad6b09783","resolution":{"observed_at":"2026-08-09T12:56:47.106787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.093444Z","title":"The interval analysis of multilin- ear expressions","venue":null,"work_id":"7f7cbec8-ec75-4464-8780-0b135ca3d01f","year":2010},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.676082Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:171ee060436dc9cffcfb89c6e8c065f48f6a4df78e1df4cc36554b1afacff09b","observation_id":"34adc116-38b7-4133-8cb7-ed51aa22f83e","resolution":{"observed_at":"2026-08-09T12:56:47.096942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.082863Z","title":"Barren plateaus in quantum neural network training landscapes","venue":null,"work_id":"dee0d844-7688-4eed-abbc-2d43696306af","year":2018},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.679392Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:5c489bcbce0e3ae0a7a8a9b814a2e755f6ffdb9469e0081872379067ddb089ce","observation_id":"2b5b9a66-ad84-47d9-aa4f-009f8c1ed41a","resolution":{"observed_at":"2026-08-09T12:56:47.086638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.073063Z","title":"Modern computer arithmetic","venue":null,"work_id":"d3b09183-0f42-4d40-92b8-5d9a8931d872","year":2010},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.682724Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:148892a7efc9db6555452b1d0a0969aff8f923cad982abbfa8e486d0d6a75d62","observation_id":"387700de-5125-42ac-8aed-c0cf36e48e6b","resolution":{"observed_at":"2026-08-09T12:56:47.076437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.063140Z","title":"Approximate counting","venue":null,"work_id":"758b0a1a-1d93-4716-8694-9e47b27df3a2","year":1997},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.686027Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:d71883b5ae7d13ec0239604ce6f109a64d4173aa6126200c5c7c186c3eecfc7f","observation_id":"34e11682-43cb-4df3-b538-5dc3f61238b7","resolution":{"observed_at":"2026-08-09T12:56:47.066524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.053133Z","title":"Counting Unlabelled Subtrees of a Tree is #P- Complete","venue":null,"work_id":"aeb63f68-b451-45ed-8877-20579f2ddc98","year":2000},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.689276Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:69b760fccc2c293a1baac335e89e32c1dd9a83e84944e3f60405011eeffb601e","observation_id":"d976dc80-b699-4aaa-945c-be11715c48ad","resolution":{"observed_at":"2026-08-09T12:56:47.056582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.042790Z","title":"On the practical usefulness of the Hardware Efficient Ansatz","venue":null,"work_id":"eda49a1c-2dab-4009-aadb-7a699c86ae52","year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.692790Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:27c4082c1c0b9c1ed4522fde4f80875e77476c8ee561395810ffbb6d8737aa7f","observation_id":"bf980e23-bebf-4534-a8ff-16fd3980b397","resolution":{"observed_at":"2026-08-09T12:56:47.046514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.032807Z","title":"Evaluating analytic gradients on quantum hardware","venue":null,"work_id":"1334358a-20b7-4b89-8ec7-f67ec11b1134","year":2019},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.696060Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:2f2d6da5f5f7e5367b53ecd79ba4f76d395760fcb70b1bc027971bfacd9fd815","observation_id":"addf0afb-d578-4fa1-ab64-35243d0599c4","resolution":{"observed_at":"2026-08-09T12:56:47.036345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00781","last_updated":"2025-05-08T17:14:28Z","snapshot_observed_at":"2026-08-07T23:00:28.134283Z","submitted_at":"2024-05-01T18:00:10Z","title":"Barren Plateaus in Variational Quantum Computing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00781","snapshot_observed_at":"2026-08-09T12:56:46.699305Z","title":"Are- view of barren plateaus in variational quantum computing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.699305Z"},"links":{"cited_paper":"/paper/2405.00781","citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:b6f9b6bcc2de651eae9cb832a74e95697c3faedb6f575497a648c0f320871a8f","observation_id":"a48f7111-e038-4481-b779-4086bab9047c","resolution":{"observed_at":"2026-08-09T12:56:46.699305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.022484Z","title":"TensorCir- cuit: a Quantum Software Framework for the NISQ Era","venue":null,"work_id":"dce3ad51-c92a-49af-ba56-9b541094e493","year":2023},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.703094Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:cd5aa6ff1099fe3b9d0a34140084c9ffadaafe79cdb31a5a2d28383e3d76d2cc","observation_id":"b407e40f-fc33-4536-8acb-0d711124ea67","resolution":{"observed_at":"2026-08-09T12:56:47.026000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.012197Z","title":"A limited memory algorithm for bound constrained optimization","venue":null,"work_id":"87eabc40-1338-424a-bdec-0713f44e3d55","year":1995},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.706565Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:cf7f36f06f2187ee9b7b4362013d431aa9a604e2af7d420e9bd18eca1764d456","observation_id":"105e91ff-8ddf-4eda-a70f-6b8d4bd78037","resolution":{"observed_at":"2026-08-09T12:56:47.015831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:47.001803Z","title":"The SCIP Optimization Suite 9.0","venue":null,"work_id":"b5de2450-dcf0-44ef-af63-f80d25df2439","year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.710069Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:b2675b8b8e392d5f2b46a26a0aa771756f55c49cf7d0137232aecbd993210a1e","observation_id":"b72b12ff-3222-4f6a-a423-156f4d4300a4","resolution":{"observed_at":"2026-08-09T12:56:47.005487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:46.990594Z","title":"Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding","venue":null,"work_id":"cb31fccf-6ba1-4a48-b9c3-c5ac1fb147be","year":2020},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.713463Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:f19ea5c0928cf588042d38a2669099d2b79d5a02a91660f7fd3e0468233978ce","observation_id":"9bfcebf3-1e15-4e7f-9468-2ff380c3a6e7","resolution":{"observed_at":"2026-08-09T12:56:46.994627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:46.979926Z","title":"Graph coloring Instances","venue":null,"work_id":"c1c17915-c33d-40ef-b2a6-c75a5792ae0b","year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.716840Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:4e9c38bf9a690b018852d11aa713e2e8e64f6449c73885a91c46f2a084c718f5","observation_id":"4be285fe-c827-4582-bbeb-4f1ce9b62b63","resolution":{"observed_at":"2026-08-09T12:56:46.983421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:46.968875Z","title":"An overview of the simultaneous perturbation method for efficient optimization","venue":null,"work_id":"8a82684c-bfc8-4489-8f34-67e6eb2225ad","year":1998},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.720482Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:3cbfe17d68c5e578c685f7c66b80e5b9c5701a621510403be6ec5653d7804233","observation_id":"2b56d73d-a92a-4bef-b4b4-e110f4e52578","resolution":{"observed_at":"2026-08-09T12:56:46.972507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:46.958056Z","title":"IBM quantum","venue":null,"work_id":"a1554165-a91d-414a-bb1b-89bbeecbd7a8","year":2024},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.723808Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:52295fb5e436d422667620179b835a03923efa542d4af4b8c573b4fa9f06f37d","observation_id":"af7b44cf-e5c6-4b82-8fa5-772cdc432db5","resolution":{"observed_at":"2026-08-09T12:56:46.961688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.01450","last_updated":"2017-01-05T19:04:19Z","snapshot_observed_at":"2026-07-06T05:25:11.492805Z","submitted_at":"2017-01-05T19:04:19Z","title":"Practical optimization for hybrid quantum-classical algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.01450","snapshot_observed_at":"2026-08-09T12:56:46.727325Z","title":"Practical optimization for hybrid quantum-classical algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.727325Z"},"links":{"cited_paper":"/paper/1701.01450","citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:ea7dd3555e310c6ac38eebeabe8756bc359a37c712185eca5add7d9e9dc8a97c","observation_id":"d0a53934-13a2-4ea6-9ddf-4b7d130af386","resolution":{"observed_at":"2026-08-09T12:56:46.727325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03426","last_updated":"2022-12-07T03:18:05Z","snapshot_observed_at":"2026-08-05T10:29:40.083036Z","submitted_at":"2022-12-07T03:18:05Z","title":"Efficient Optimization with Higher-Order Ising Machines","version":1},"cited_work":{"arxiv_id":"2212.03426","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.03426","snapshot_observed_at":"2026-08-09T12:56:46.764388Z","title":"Efficient Optimization with Higher-Order Ising Machines","venue":"cs.ET","work_id":"cda3091a-005e-440b-a3c8-b141f1d6248f","year":2022},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.731257Z"},"links":{"cited_paper":"/paper/2212.03426","citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:b4fe95e8936761565da8ea6bbfed0b6321d927a77ef7d0a7915f5e52c6aa9f41","observation_id":"1083a317-ff69-4112-82be-cb8ca77481d0","resolution":{"observed_at":"2026-08-09T12:56:46.770737Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:56:46.946898Z","title":"Lexicographic unranking of combinations revis- ited","venue":null,"work_id":"210c5e4a-f461-4e79-be80-fe86bc1ba9e9","year":2021},"citing_paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T12:56:46.735001Z"},"links":{"citing_paper":"/paper/2502.02245"},"observation_digest":"sha256:412d8c59ca45729a8e6d4bf54591f188369e13c7552efcc93c34c75cea254303","observation_id":"e1d55a02-5727-456b-a1ff-b7afb9761049","resolution":{"observed_at":"2026-08-09T12:56:46.950850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.02245","last_updated":"2025-02-04T11:44:34Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T12:47:11.799004Z","submitted_at":"2025-02-04T11:44:34Z","title":"Qubit-efficient quantum local search for combinatorial optimization"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":35},"total_outbound_references":41},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 1 inbound Pith citation observation for arXiv:2502.02245."}