{"as_of":"2026-08-10T07:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83487e8e4813b37b77c39e7fe2b541f9fce21b6512ce9c641be13dc249112930","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-10T06:31:04.303077+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-10T00:49:59.630536Z","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:fd95f5e3986ca634f89ec0d231b4e8ec9f27d162cfa5688b53ddfa2bb4dcd1ad","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-10T00:49:59.630536Z","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:50558f7be9d9dbad030646b6a6f63fb63ef8e75c1a32ef9296aaf48b3895461d","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-10T00:49:59.630536Z","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:57bb111d337b5932d6c77ed76c42e48750ab81c883bd9baaf4a0bd340689c98b","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-10T00:49:59.630536Z","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:6c98279c1051a3b0cc487a3610f1933604b8b4b653c4061795e36556dff755e0","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-10T00:49:59.630536Z","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:9ed4e7e12ba9bee8e61200659b6f8302390dda524aba2df5ff14fde3896a054a","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-10T00:49:59.630536Z","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:abfb5d7eab462ac71c81df29240f2fd56298c1ddd1f2f44c5632877c9fb1290d","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-10T00:49:59.630536Z","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:73b9e1540acc81349c68c921ce25c8eeeff6504f9473ffc772e10f751934a0ab","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-10T00:49:59.630536Z","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:55dff051140ef3775f7adfe89f145cd6b3a6fb932aed5289c99ba5cf17c1fa37","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-10T00:49:59.630536Z","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:00185474911cde435f9b887242255d1702c076bed0884e27475c4f768a80811a","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-10T00:49:59.630536Z","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:b6b6c1b18a2833e871b3c66238a3df86b1165e96a3f3473fd752e9f25f220c55","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-10T00:49:59.630536Z","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:7cd5f0ea3b5e51c8a524dd28100b7b66be3e119398e4b126f2ec22292c3d5457","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-10T00:49:59.630536Z","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:fcab677ea6b3513c75d833818c60f4d6d8531124c5ac6f5003344993ad0db06d","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-10T00:49:59.630536Z","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:13b2e1c0a0d743d28b898ff2a5fba04ea879c886f847fb325b376cbfdf106875","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-10T00:49:59.630536Z","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:b25699374331ff54577ae1238f8877eaf8cffcd58955e73d7258aa3d149b80b0","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-10T00:49:59.630536Z","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:7b52380d0d7dc6ce9c9df52aa93eadc159f2277ea0bb0b1f951e5d0bbbe26dc1","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-10T00:49:59.630536Z","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:128c8682581b007d71ae325f9aa6912e6e30e1e2fbc7f21e40cbcd502045d315","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-10T00:49:59.630536Z","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:13e9c83ce3b60deb549f16fbf6ab0c2fab808691773d221ad264c7f84b3dd92d","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-10T00:49:59.630536Z","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:ccf448879bef61bd76a83d1f2dfa8677e518d9b6823742bcf04a284c7a405d58","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-10T00:49:59.630536Z","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:b96e6867d512ab479e872689370ca4d1739fda19aee958bef2d990e2b875c9c0","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-10T00:49:59.630536Z","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:873450d93fffac9b36bd5c83cfe9440bb5b46247016ccf57d6e6f598038d256a","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-10T00:49:59.630536Z","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:2158bbe52f79c0a39878a0068036b5ae67790f62730002bc34e574627c815316","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-10T00:49:59.630536Z","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:b76deee6989811fb517d898b72b4220456d771aabaebb733bacadc903dd45a1f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-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-10T00:49:59.630536Z","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:cd161cdfdfac86411e34877ad82570e3062bb0bcca4383aafc976bb1ad33f4e3","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-10T00:49:59.630536Z","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:61885127921155f33eb0b5a22449a31b39bed65264a4bdf9b518c0b8fb9c83de","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-10T00:49:59.630536Z","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:b9805295fd6bbe8a4da9e3769d2d86f60567aa84874c2a07a7f77a2485386aac","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-10T00:49:36.581242Z","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-10T00:49:59.630536Z","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:be7173d52a518be42844fb299e6ecf803c07fef7973979f52a7454ffc698d2ac","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-10T00:49:59.630536Z","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:bf7234b9cb8b3d7fd781542658ce5a4c4eba5e10231ef8b3c9bb15618b8a7598","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-10T00:49:59.630536Z","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:fe2f3bd11386995cef21f2ef918620d6b416f48ff89c8f993b7c5f20e905ada2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-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-10T00:49:59.630536Z","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:122b326fe282d24697aebd0c82ab14f30e8f7a96717c4168119db675f266c619","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-10T00:49:59.630536Z","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:c93ffbb0a9e4c6f2974bff68e50b6a98b599cbbd0d52a658868eab08fc13bb14","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-10T00:49:59.630536Z","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:6206c12652a57409d0c3c4bbedf3d00d24f581fc65181a0c5dd39e2cde8cf523","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-10T00:49:59.630536Z","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:59636e7317589349eefbc80cf48c846e56bd31191b6757bb9b4c808c1056fd97","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-10T00:49:59.630536Z","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:aea16972a3115b61c1172a8ed1636b8552246edbece25dcffffc0603f996a8ba","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-10T00:49:59.630536Z","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:a3bcaa57efacf96a92f977ac5575a9ef5777dd8f493244527e6885b1786585ad","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-10T00:49:59.630536Z","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:b5e9719a0c6eb139bfe79126994f20b04bc2f07ca8e8162f02a8db3c52bda868","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-10T00:49:59.630536Z","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:68c9d586079634855831aa26c6c8f0eea0782a956694a1db304c7ff2a9056fe4","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-10T00:49:59.630536Z","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:15287c90be4a8c8556b35e5e780009caea92e27ec3be88ff6146bcfd04f039fb","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-10T00:49:59.630536Z","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:7a522abcfacb864705d37a68d04fd6b64d2c70b31926f93a87b1e60d7f30a20a","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-10T00:49:59.630536Z","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:ec0f938a6c27cc05ecd22bdc2c879340d6c2a005971b746141ba5ea833c9ce6a","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-10T00:49:59.630536Z","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:ab4e959be8aaa5f0ce74acf50ded097f0dabacbbd90c7b9764d6583089d48434","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-10T00:49:59.630536Z","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:2620fda5aa220954582d9e5819ef037f7a9517e1aaef86914382f4574353bc81","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-10T00:49:59.630536Z","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:96185fa02a082461dfad8882fafd8c7d4ae362da098ee46d3fa2fc01111f8eda","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-10T00:49:59.630536Z","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:9e7b3a10f32600af2fe45bc512f397b7f85d4baa5cfe70a1fdc9f3e75898ab91","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-10T00:49:59.630536Z","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:e0fe6d6a074da7c63a319e3cae18847c483258a75019e0e74e1dd6f76bb80790","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-10T00:49:59.630536Z","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:3d1ba7c8e7d152705780f577297e69f559286bf2c9c623b8f54eaa646dc03cee","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-10T00:49:59.630536Z","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:02310819c4ccf5ccc767753fcab66470fe35d22e399d7d014c0c0a275018bad2","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-10T00:49:59.630536Z","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:e10ef756e867cefc48559d0bf0a4f6d057c223b556f32819b285106267a34846","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-10T00:49:59.630536Z","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-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 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2607.27915."}