{"as_of":"2026-08-18T03:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:82137cd76d1217b9372611b40e0093773756b91ed414ad18de3810948f55a32e","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T18:59:12.424222Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T23:12:42.250918Z","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":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2512.02940/citation-record","integrity":"/paper/2512.02940/integrity","json":"/paper/2512.02940/citation-record.json","paper":"/paper/2512.02940"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:09.830786Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:09.830786Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:ee67cb765bc2a7dcf0d81ea35a5930ea629844f3259cbf6acec103f75f237121","observation_id":"5c5baa2c-8fa2-4330-982a-2d4b7e424bc3","resolution":{"observed_at":"2026-08-03T18:59:09.830786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:09.914455Z","title":"Flum and M","venue":null,"work_id":null,"year":2006},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:09.914455Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:83b7171dd1071cc76591e7e41fd59587e9c040c8a66324783519dd690d8262eb","observation_id":"eaeaa7c9-de72-4dba-a076-d2625411b338","resolution":{"observed_at":"2026-08-03T18:59:09.914455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:09.981591Z","title":"Cygan, F","venue":null,"work_id":null,"year":2015},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:09.981591Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:585a0e8953dc4cd49f6bc1a393dc32faba57741c10180291786118c9b4869630","observation_id":"711dd853-fbe0-43f1-af32-934f3f8e8aec","resolution":{"observed_at":"2026-08-03T18:59:09.981591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.093132Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.093132Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:2d32032a4494ba6cb664ed486119416b894eda88429585e8df2f7eb53f2a8c19","observation_id":"fffb8328-2167-427c-a357-408b6458def0","resolution":{"observed_at":"2026-08-03T18:59:10.093132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.178344Z","title":"Hochbaum,Approximation Algorithms for NP-hard Prob- lems, Computer science (PWS Publishing Company, 1997)","venue":null,"work_id":null,"year":1997},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.178344Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:b562862a90f117c9aa679794d7a0697907bd2d816ca05beb1d01258bc95b502d","observation_id":"26dc4a1f-bf07-4807-b216-39175ff1f107","resolution":{"observed_at":"2026-08-03T18:59:10.178344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.287505Z","title":"Dinur and S","venue":null,"work_id":null,"year":2005},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.287505Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:76e96306a19b76324b5ff42d07caff3f61ddaac7f65d09da5b5b3ccacbe68719","observation_id":"abd9cdce-bb8e-41fd-819a-5212e8526ece","resolution":{"observed_at":"2026-08-03T18:59:10.287505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.341537Z","title":"Farhi, J","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.341537Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:f1036d811306680bc70a49f7d9d91c59d02116fdf5c02d85d0aa46062b6f07c8","observation_id":"8b468e60-07cb-4b5a-932b-79722c1b8ff5","resolution":{"observed_at":"2026-08-03T18:59:10.341537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.422416Z","title":"Blekos, D","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.422416Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:039ecdcde31664b98868b7ed4da344e3c2ef342c872f0aef97b76116d130e64a","observation_id":"e1121291-0029-4181-9ec5-75a34104440c","resolution":{"observed_at":"2026-08-03T18:59:10.422416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.503542Z","title":"Hadfield, Z","venue":null,"work_id":null,"year":2019},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.503542Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:620b92a1ff4a066d60259b54b2c8692f8bf7929456e5961a2fe57c342507aee7","observation_id":"e33b2405-8c8d-4488-8363-0f7fc7c1c3f6","resolution":{"observed_at":"2026-08-03T18:59:10.503542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.13483","last_updated":"2020-10-02T21:33:02Z","snapshot_observed_at":"2026-08-10T12:53:23.979674Z","submitted_at":"2019-10-29T19:14:00Z","title":"The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.13483","snapshot_observed_at":"2026-08-03T18:59:10.602345Z","title":null,"venue":null,"work_id":null,"year":1910},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.602345Z"},"links":{"cited_paper":"/paper/1910.13483","citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:a4d62e6acc1834f255a1c556107a48726c2f7cbf8cbb911e272cf18781432cf0","observation_id":"7bdf545e-9e95-4c97-bbd1-0b27af598836","resolution":{"observed_at":"2026-08-03T18:59:10.602345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.667647Z","title":"Bravyi and M","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.667647Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:4d54582018e06eb9a5cf080a6e69936f2e56a7349d7cf9c3a8c57782ec5a8fca","observation_id":"1f851f8b-b705-4f71-93d7-3be589438d83","resolution":{"observed_at":"2026-08-03T18:59:10.667647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.774748Z","title":"Preskill, Quantum computing in the nisq era and beyond, Quantum2, 79 (2018)","venue":null,"work_id":null,"year":2018},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.774748Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:1a1d1ec2a1b4e757131595dcec2614a4186e0a4707ac1e86b0ba2396aa51ca26","observation_id":"dcf9ab7d-2e76-4556-8602-22c0ec7f0e54","resolution":{"observed_at":"2026-08-03T18:59:10.774748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.855689Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.855689Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:db4fd3c1e1f00bb3de0fca7abf3559e349da7bcad7e6cb72d1c17724e92210a4","observation_id":"bb89cb37-ce2a-4ea1-9139-1b3c01d250ec","resolution":{"observed_at":"2026-08-03T18:59:10.855689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:10.938980Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.938980Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:6303c257a073a2daae94ca76d67cfe437bc2390b0063181e4bfc6d020fcd83a0","observation_id":"8af030c9-12e4-4ae2-886a-c12f9c01807f","resolution":{"observed_at":"2026-08-03T18:59:10.938980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18530","last_updated":"2024-02-28T18:08:52Z","snapshot_observed_at":"2026-08-16T14:14:25.811610Z","submitted_at":"2024-02-28T18:08:52Z","title":"Reducing the Number of Qubits from $n^2$ to $n\\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18530","snapshot_observed_at":"2026-08-03T18:59:10.995591Z","title":"Ramezani, S","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.995591Z"},"links":{"cited_paper":"/paper/2402.18530","citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:36d0eef2a7e6d772ceeb8473d7b8b6d6b8bce399b48f6ab051fc75b9c53b87b4","observation_id":"481e80f2-329c-48db-a126-284f44a6ee5a","resolution":{"observed_at":"2026-08-03T18:59:10.995591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.073659Z","title":"Miyamoto and K","venue":null,"work_id":null,"year":2020},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.073659Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:0518f5a92abd7ffc880e0c75083a90df11161d77c1725e23184cc550174865ff","observation_id":"56b29534-1575-421d-b76b-76c53584dd29","resolution":{"observed_at":"2026-08-03T18:59:11.073659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.156621Z","title":"Chevignard, P.-A","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.156621Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:b5f7f23193f79305b9d26a8c52054a4b311b8e173a2bbb26f6f3b7d37b14c052","observation_id":"106ff007-9242-477f-82ec-2ae7c71adccc","resolution":{"observed_at":"2026-08-03T18:59:11.156621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.245899Z","title":"Farhi and S","venue":null,"work_id":null,"year":1998},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.245899Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:76dcdd8917ab4e4af3cbea379a4d650da855bea41e4725ad7bc6dc0e9cffe967","observation_id":"b7e7d15d-a2ba-4532-b681-d10d9ff61d3b","resolution":{"observed_at":"2026-08-03T18:59:11.245899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.326685Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.326685Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:e71b68f5c481b6961348cc674cce10ef0ff660abe6dfe50341e70665746745e6","observation_id":"88d9f4c1-3aa9-4d07-ba15-5e6784450480","resolution":{"observed_at":"2026-08-03T18:59:11.326685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.432123Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.432123Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:1d68c6d4a13a2d1d1ecb15afb57ce190780766c709f6efda60f0ca21bef428ba","observation_id":"d288cced-52b2-4cd8-8647-881817e1246b","resolution":{"observed_at":"2026-08-03T18:59:11.432123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.490576Z","title":"Kempe, Quantum random walks: An introductory overview, Contemporary Physics44, 307 (2003)","venue":null,"work_id":null,"year":2003},"citing_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},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.490576Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:a799032771ed9f070242358bc665804883513f26a08fc29572ab738729f73820","observation_id":"969c38a2-568b-4c9d-bdf3-32b9ace452c3","resolution":{"observed_at":"2026-08-03T18:59:11.490576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.07007","snapshot_observed_at":"2026-08-03T18:59:11.580304Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.580304Z"},"links":{"cited_paper":"/paper/2508.07007","citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:f1be342925d3afe052857d62224224ddb922383f5a070e39df6a69fe89eb5e4e","observation_id":"ba1d02c4-1b8b-497b-8fee-1edf3e17737f","resolution":{"observed_at":"2026-08-03T18:59:11.580304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.681636Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.681636Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:3956183d71f721e84c8f786b568d8f9c4125bf1d8bd92f99466198d82c8323cd","observation_id":"1afdf98f-6b55-48aa-afd3-b9c2e68ce2a0","resolution":{"observed_at":"2026-08-03T18:59:11.681636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.810732Z","title":"Chung,Spectral Graph Theory, CBMS Regional Conference Series No","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.810732Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:6b405036fd6ee10684369df3eccb29d18fa23d259fb0459e74d1eee462dd88f7","observation_id":"301e6465-d5c2-4429-89ea-7b88a5706e39","resolution":{"observed_at":"2026-08-03T18:59:11.810732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.904325Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.904325Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:39958dfd36b51dd8599453fb187448f07f1a0e7d9f730358d87e06e7b61dac1d","observation_id":"a8d8a897-e6bb-4e64-8fc9-6f7ffac9a28d","resolution":{"observed_at":"2026-08-03T18:59:11.904325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:11.920498Z","title":"Bollobas and P","venue":null,"work_id":null,"year":1976},"citing_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},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.920498Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:63fda28ed9737793f01fe63fdbb3acced5f612618e4572121b43a8e38c0ceb78","observation_id":"5ca8d971-2ffc-483e-81f9-3d84be1a30b5","resolution":{"observed_at":"2026-08-03T18:59:11.920498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:12.043263Z","title":"Karo ´nski and A","venue":null,"work_id":null,"year":1997},"citing_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},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:12.043263Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:d236392145ef1a9378512c28c3971264b3cf041005f5c99f7d3fa27376738f35","observation_id":"bc83fcbb-0eec-41fd-942f-69a4599bc360","resolution":{"observed_at":"2026-08-03T18:59:12.043263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:12.210294Z","title":"Barabási and R","venue":null,"work_id":null,"year":1999},"citing_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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:12.210294Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:fd2ffa7aef903cbc4aeeda0f4bce98bcc16e73e6a8b661034e02be8d0c1040fd","observation_id":"79a07783-7172-47f1-8755-b126b6b18855","resolution":{"observed_at":"2026-08-03T18:59:12.210294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T18:59:12.424222Z","title":"Chen,Graph Theory and Its Engineering Applications, Ad- 9 vanced series in electrical and computer engineering (World Scientific, 1997)","venue":null,"work_id":null,"year":1997},"citing_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},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:12.424222Z"},"links":{"citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:58a58978a8f9848ad89490a65eaf5cdfe2be1a42baf68c5c9bbbd81f0d1062d1","observation_id":"9a5bf054-bec5-4f1e-853c-3a86a9dfb341","resolution":{"observed_at":"2026-08-03T18:59:12.424222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.02940","last_updated":"2026-05-23T13:30:26Z","latest_version":2,"primary_category":"quant-ph","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"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":29},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:2512.02940."}