{"as_of":"2026-08-09T08:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc93211b3f14158effbbebdefe5b6401effcba4df084c7b09a72d12a7bfc5156","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T23:12:45.195313Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.27915/citation-record","integrity":"/paper/2607.27915/integrity","json":"/paper/2607.27915/citation-record.json","paper":"/paper/2607.27915"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:12:39.137580Z","title":null,"venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:39.137580Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:61934e04dcfb5144ce0cf4fa90fe9080e95b45207d5eb710cb09d8549b255e67","observation_id":"3f8a77e3-bd1f-4bac-95f0-6f5653c740d6","resolution":{"observed_at":"2026-07-31T23:12:39.137580Z","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-07-31T23:12:39.289107Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:39.289107Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:1099b34c6b92248a77d84539df1d29a6d5ab76dfa4059d9f81fca7715b38d532","observation_id":"635668df-5bd1-42ea-8104-3b030c6317df","resolution":{"observed_at":"2026-07-31T23:12:39.289107Z","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-07-31T23:12:39.494564Z","title":"Khot, On the power of unique 2-prover 1-round games, inProceedings of the thiry-fourth annual ACM sympo- sium on Theory of computing(2002) pp","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:39.494564Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:73aa4355e9dde12f34085a73a2c378146f11c440121ba9425a713c7a8d5ea5da","observation_id":"f0bdcf27-85c9-4ebc-b26a-460f81506f73","resolution":{"observed_at":"2026-07-31T23:12:39.494564Z","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-07-31T23:12:39.693368Z","title":"Halld´ orsson and J","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:39.693368Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:31ce85fa389f016865bffe6f1f1ce85a549b6ae37e8c1dd8a8d9a1cc92872a87","observation_id":"9e5a21f9-7ec6-4116-9e3e-91c06810c1d8","resolution":{"observed_at":"2026-07-31T23:12:39.693368Z","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-07-31T23:12:39.902194Z","title":"Krysta, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:39.902194Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:8dcdc416916d82920edd9b85dc8dbfdb6945179cb13f15f1ac3985cbed0e87f0","observation_id":"ee986671-4c58-490c-97a7-af9d4d24d1e0","resolution":{"observed_at":"2026-07-31T23:12:39.902194Z","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-07-31T23:12:40.156230Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:40.156230Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:3ac1d3babbe3ff4a27818dea91f57199336d189420c457db0b494ec0cf303da2","observation_id":"ea1f4b82-ab28-42d9-9a3e-ac9e044cd101","resolution":{"observed_at":"2026-07-31T23:12:40.156230Z","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-07-31T23:12:40.408155Z","title":"Bang-Jensen, G","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:40.408155Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:ca88e39518de95e167735aa0f499e0a9cef1408298402ddd82ea49d85d2bcb6f","observation_id":"e2566ec5-ffe5-4473-8af2-676b5e225b9b","resolution":{"observed_at":"2026-07-31T23:12:40.408155Z","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-07-31T23:12:40.528357Z","title":"Lucas, Ising formulations of many np problems, Fron- tiers in Physics2, 5 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:40.528357Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:d1e39cd1f91d82a89160ce28bf9e376b5d2ea3ad1861918795779aaf38eff524","observation_id":"ae396c29-4c5c-4e42-8a93-0090aff3c86b","resolution":{"observed_at":"2026-07-31T23:12:40.528357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.00051","last_updated":"2019-05-01T03:53:10Z","snapshot_observed_at":"2026-07-06T07:42:38.082715Z","submitted_at":"2019-03-29T18:58:04Z","title":"Solving large Minimum Vertex Cover problems on a quantum annealer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.00051","snapshot_observed_at":"2026-07-31T23:12:40.621721Z","title":"Pelofske, G","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:40.621721Z"},"links":{"cited_paper":"/paper/1904.00051","citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:302f72c7883ee75195bab6fb4844ab6ac7265810e47bf6157c4622ef38267701","observation_id":"ff3f85ef-aec4-4060-9aaa-63dc084eeb31","resolution":{"observed_at":"2026-07-31T23:12:40.621721Z","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-07-31T23:12:40.774898Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:40.774898Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:3826b7404e2b38a5223e2aba7c4b784ed648834c98f9a73c81c03fa097908a5b","observation_id":"1e382892-0d36-4188-a9a3-6fe418c590d6","resolution":{"observed_at":"2026-07-31T23:12:40.774898Z","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-07-31T23:12:40.909074Z","title":"Peruzzo, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:40.909074Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:f20eb40ff31067d4790abbc3a0b90c2f938bb18f062e72e91619b9da610335b0","observation_id":"a546ac90-b95c-4962-8f75-3d9bcbc0582f","resolution":{"observed_at":"2026-07-31T23:12:40.909074Z","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-07-31T23:12:40.983608Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:40.983608Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:fc2d1e7ce36fec1cd6b7b8730fcf0a147b493470fac302a6e6086ffd3536a8e5","observation_id":"fbe2373e-37a4-4725-b154-23abe4e1a977","resolution":{"observed_at":"2026-07-31T23:12:40.983608Z","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-07-31T23:12:41.100588Z","title":"Herman, R","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.100588Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:d4b1cee4babf29654b01d2046b22734de3230d04ab670870d93aa1629c9c3baa","observation_id":"f4425f2f-4f17-4c9b-b5a2-cf1409380fb6","resolution":{"observed_at":"2026-07-31T23:12:41.100588Z","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-07-31T23:12:41.190845Z","title":"Hadfield, Z","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.190845Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:144a326a68c4c791c736c1fbd9af46409c82f38c332ed7880cd85ef2195b656b","observation_id":"210b8db4-d2fc-4c6f-a53c-ffb88c876fcb","resolution":{"observed_at":"2026-07-31T23:12:41.190845Z","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-07-31T23:12:41.277040Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.277040Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:2ebfc5ff3ef9fe4eee9981ef70ad4e052b3ece418cb4f8dee29a464e6212bec0","observation_id":"95d4a07a-f4a8-42bc-a7b8-c683f881308d","resolution":{"observed_at":"2026-07-31T23:12:41.277040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.00354","last_updated":"2020-10-02T21:02:15Z","snapshot_observed_at":"2026-07-06T09:24:42.431144Z","submitted_at":"2020-05-30T20:24:53Z","title":"Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.00354","snapshot_observed_at":"2026-07-31T23:12:41.345862Z","title":"B¨ artschi and S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.345862Z"},"links":{"cited_paper":"/paper/2006.00354","citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:fb727e0929426b043c2e0ccc6f57ef4d2a2f0aefe4c335e28bfe6a1f27a20fc9","observation_id":"d51906eb-e3c8-447c-a505-e4acafa5cce2","resolution":{"observed_at":"2026-07-31T23:12:41.345862Z","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-07-31T23:12:41.420642Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.420642Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:3e62f46a4d556cd5f84eda35fdb5d9ad1a9fbddbebb6a109aed803e20b080bd5","observation_id":"d7c86ae4-7863-4c9c-ab16-9bc675701fd6","resolution":{"observed_at":"2026-07-31T23:12:41.420642Z","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-07-31T23:12:41.502120Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.502120Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:8c5dd34509641049eb0aeed893000ec3639f9589fb59804211be858de643c9ec","observation_id":"25f12b41-92ef-47c0-878f-4e79ff6241b8","resolution":{"observed_at":"2026-07-31T23:12:41.502120Z","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-07-31T23:12:41.622713Z","title":"Bucher, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.622713Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:0206623170f36d3b2b4c301ed574f854a10a841ef230fd5723e1981b257d7a81","observation_id":"92900795-e819-4d8a-b239-f3a4d13c127e","resolution":{"observed_at":"2026-07-31T23:12:41.622713Z","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-07-31T23:12:41.689671Z","title":"Montanaro, Quantum speedup of branch-and-bound algorithms, Physical Review Research2, 013056 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.689671Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:d853abd932ffd7eb8016da9a74167c30710f54ec37a7027d9355e53d962912e4","observation_id":"eaaba28a-aef7-46c7-9d05-facde4aae593","resolution":{"observed_at":"2026-07-31T23:12:41.689671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03210","last_updated":"2022-10-06T21:08:46Z","snapshot_observed_at":"2026-08-04T06:18:12.212580Z","submitted_at":"2022-10-06T21:08:46Z","title":"Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03210","snapshot_observed_at":"2026-07-31T23:12:41.774715Z","title":"Chakrabarti, P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.774715Z"},"links":{"cited_paper":"/paper/2210.03210","citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:abc230ecd5583b59e16779f7adf089ec4711bd068ac5c9b9f322dc1e3b952d70","observation_id":"c771dc67-9ccd-4d97-8388-1374b410a4b2","resolution":{"observed_at":"2026-07-31T23:12:41.774715Z","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":"10.1038/s41534-025-01097-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Wilkening, A.-I","venue":"npj Quantum Information","work_id":"dfe4137c-0b88-4d8e-ae6d-ef3b9c366314","year":2025},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.848026Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:f56fedd9d204f29b45f98c8f3cbb9c96c90d71881cace99f4653ca2dfafb0da6","observation_id":"7fe91d6d-1836-4469-a210-6cfd239d1f73","resolution":{"observed_at":"2026-07-31T23:15:54.629022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:12:41.929052Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:41.929052Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:30cc22b7db737c3b9bc1d01b981ec8b7c80bb96fab1ae053c28ca0a15c878183","observation_id":"b944450e-f645-4b08-8948-7f061f2509ca","resolution":{"observed_at":"2026-07-31T23:12:41.929052Z","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-07-31T23:12:42.049967Z","title":"Bravyi, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.049967Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:21facf27adb182fb21daf8956a6d1ebbfc41dcbc1e5cad0ee459bf8f9ed0f7d8","observation_id":"37f8a1be-2d58-41c3-acf9-f8bf172c80f6","resolution":{"observed_at":"2026-07-31T23:12:42.049967Z","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-07-31T23:12:42.133030Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.133030Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:732ea1ed77b818ef085d5c10da3052c62ab6712d8dac23d0a07609a32f81b186","observation_id":"fd600999-03dc-46ee-bf3b-8bcb9940f421","resolution":{"observed_at":"2026-07-31T23:12:42.133030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.02940","last_updated":"2026-05-23T13:30:26Z","snapshot_observed_at":"2026-08-05T18:45:29.934945Z","submitted_at":"2025-12-02T17:04:57Z","title":"Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.02940","snapshot_observed_at":"2026-07-31T23:12:42.250918Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.250918Z"},"links":{"cited_paper":"/paper/2512.02940","citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:91240ab532afe367abad8edc267e9f70f79bc5f441957a0f080efa136f8ac8ec","observation_id":"c46a8f7e-1208-49fb-925f-32dbaea66f4e","resolution":{"observed_at":"2026-07-31T23:12:42.250918Z","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-07-31T23:12:42.377223Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.377223Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:40a8c05c769a29860a8b095e9353b782996230e0076071d7895ef7c9a06d2ab4","observation_id":"2b677fb5-7014-4207-93ce-1c6f29076878","resolution":{"observed_at":"2026-07-31T23:12:42.377223Z","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":"10.1126/sciadv.adi0487","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dupont, B","venue":"Science Advances","work_id":"90d0e084-15ae-4f2b-95a3-9f7a9b076464","year":2023},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.460060Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:ac40dbd2d240e18128250c748851639a6c2fdb0eae204bb95d077c8f389c578b","observation_id":"423aa2f2-0580-4e8d-9bb3-3083bed88a58","resolution":{"observed_at":"2026-07-31T23:15:54.476586Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:12:42.564021Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.564021Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:69edb22514d5288fd5fc95043f1026c5e86630bb2a3ea41b766e5477d915c8a2","observation_id":"ac9f777f-f700-4255-8013-eb2db4ba3481","resolution":{"observed_at":"2026-07-31T23:12:42.564021Z","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-07-31T23:12:42.626488Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.626488Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:1b84a389ff58c4c9058f01906b1daff229c281e6c8aa312ed0611e0dcc49980f","observation_id":"f87ecf6c-4c23-4311-8531-3e6a2b476c42","resolution":{"observed_at":"2026-07-31T23:12:42.626488Z","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-07-31T23:12:42.727033Z","title":"Barenco, C","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.727033Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:f0546a022a719f9177123388fd2f251271381133f5a26271618848e9c2715273","observation_id":"a2cf7dc9-ad96-4814-8d3b-2ca72b065796","resolution":{"observed_at":"2026-07-31T23:12:42.727033Z","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-07-31T23:12:42.814735Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.814735Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:4fa66a11175c3ee3dbfc204ebadd49cf98d2ea4e25f2430c21b00cbc671b37e8","observation_id":"a3c04181-8a18-45a2-9ed2-291216c918d4","resolution":{"observed_at":"2026-07-31T23:12:42.814735Z","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-07-31T23:12:42.874764Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.874764Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:a2df1dbe2d85f54545685b1da1bc8dfbe63108077d3e3e6100b411d9e27696f3","observation_id":"cd3d2e17-25f1-4658-b6d0-519651f4b4f0","resolution":{"observed_at":"2026-07-31T23:12:42.874764Z","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-07-31T23:12:42.968311Z","title":"Claudon, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:42.968311Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:f1aa9f5e980c1a84887f71191e3e5c1e3c1c6e25bbfecf3de873250b7c19b7b6","observation_id":"2b9cb814-19d6-4348-88ac-818187d80af0","resolution":{"observed_at":"2026-07-31T23:12:42.968311Z","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-07-31T23:12:43.156109Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:43.156109Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:fd06f43d0648f638774bfee4759f6300d50c6fa37c83684c5fb73328ad76a76c","observation_id":"3759833b-5356-4938-91bf-efac58bdd890","resolution":{"observed_at":"2026-07-31T23:12:43.156109Z","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-07-31T23:12:43.288570Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:43.288570Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:deabb639240af15c793a9a502fdf063bb744305ad5ab787ad2df8de8f87df20f","observation_id":"4c7c0bb0-f9eb-44e1-a193-98e520005de3","resolution":{"observed_at":"2026-07-31T23:12:43.288570Z","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-07-31T23:12:43.448588Z","title":"Wilkening, Constraint-oriented biased quantum search for general constrained combinatorial optimization prob- lems (2025), arXiv:2512.08384 [quant-ph]","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:43.448588Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:1456b1d7eab1680c36c8359df266c46b42a75c2f915ab8853b63042cdef90c55","observation_id":"e58869f9-9478-48c6-9896-5638afaa93c8","resolution":{"observed_at":"2026-07-31T23:12:43.448588Z","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-07-31T23:12:43.642888Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:43.642888Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:b14fad221d06957776ec25c6c95be1174e19532b29260e7739b43148758651c8","observation_id":"b3e233d9-4038-409b-a059-39d49227f180","resolution":{"observed_at":"2026-07-31T23:12:43.642888Z","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-07-31T23:12:43.829861Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:43.829861Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:508e37533bdb0dd6a209da087c5f16bdab35f65163b55ae1fb4d11dcd09cbe54","observation_id":"5e4ef7d1-9dbc-4498-ae1b-b720306b63c3","resolution":{"observed_at":"2026-07-31T23:12:43.829861Z","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-07-31T23:12:44.013125Z","title":"A transpose-symmetry argument eliminates all odd-order contributions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:44.013125Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:d65b63b8e8f77a45d7d479172220441fe1930ab183a7093a28fcd0ac06e685e6","observation_id":"b30b9559-a128-4aef-93b2-02f5cfd71fdb","resolution":{"observed_at":"2026-07-31T23:12:44.013125Z","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-07-31T23:12:44.211384Z","title":"A single Trotter step of the walk unitary is Ustep(τ) = Y i∈V eiτΠ N(i) Xi = Y i∈V CN(i) RXi (τ), τ= t p .(C1) The full state-preparation circuit is Up(t) =U step(τ) p","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:44.211384Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:68d58369272ac90c5fff16b7422fd18f179836f49babfbd99d24257e446527ad","observation_id":"52ac6752-535e-4d55-98e7-605ceec84f3f","resolution":{"observed_at":"2026-07-31T23:12:44.211384Z","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-07-31T23:12:44.402767Z","title":"The exact continuous-time evolution is U(t) =e itHMVC","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:44.402767Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:27a20639674bc810b788ae34443938787aa397442ac1df3f1f2ffbe025d921be","observation_id":"9613cb29-9af4-45b8-a23d-0a955513de98","resolution":{"observed_at":"2026-07-31T23:12:44.402767Z","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-07-31T23:12:44.571366Z","title":"Over the tested system sizes, the approximately linear growth of the maximum block entropy withnis consistent with volume-law entanglement","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:44.571366Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:0bcc87c2557ebb935ad2d744acca097b00cb1e4998cbf0ae47b74ffb1ee2b137","observation_id":"201c7bad-41df-4bd8-ab4d-160f197a10d7","resolution":{"observed_at":"2026-07-31T23:12:44.571366Z","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-07-31T23:12:44.707490Z","title":"The final quantum state can be written as |ψ(t)⟩= Y i∈V CN(i) RXi(t)|Ω⟩, where the ordering of vertices induces a sequential structure in the circuit","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:44.707490Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:36e1665d7cb83008a2403c40acf1930225829bb64a655de1dce11086e01ddc8f","observation_id":"595811a0-491f-4e52-90ce-d7db93f4534d","resolution":{"observed_at":"2026-07-31T23:12:44.707490Z","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-07-31T23:12:44.857717Z","title":"Introducing the change of variablesx:= cos 2(t), x∈[0,1], the expectation value can be expressed as a relaxed pseudo-Boolean function","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:44.857717Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:b440eeb50a12858f97ce869bcbf74072e50e7d111cedd51e4e14fe5e508996e3","observation_id":"0a12b1b7-043b-4e14-9e33-e42a1051c160","resolution":{"observed_at":"2026-07-31T23:12:44.857717Z","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-07-31T23:12:45.042465Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:45.042465Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:d236fea6aca7f1c09d0ee8a0331f7f1b38f1df0430f91fabb798bb68110a5292","observation_id":"b797cd06-ac48-43b4-ba81-8ab687673a05","resolution":{"observed_at":"2026-07-31T23:12:45.042465Z","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-07-31T23:12:45.195313Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-31T23:12:45.195313Z"},"links":{"citing_paper":"/paper/2607.27915"},"observation_digest":"sha256:9c48855ba9fcc3141ff612f9e2447016af247066034edc74c58450ac283a6e6a","observation_id":"2addc057-66dd-43a7-9a94-32423c0d243d","resolution":{"observed_at":"2026-07-31T23:12:45.195313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27915","last_updated":"2026-07-30T09:29:26Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-05T06:13:44.288839Z","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2607.27915."}