Paper Citation Record · LEDGER

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem

As of 17 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:2512.02940.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2512.02940 v2

Coverage vector

measured 29 of 29 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T18:59:12.424222Z

measured 30 of 30 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-31T23:12:42.250918Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

29 of 29 outbound references displayed

verified exact0
verified fuzzy0
unresolved29
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5c5baa2c-8fa2-4330-982a-2d4b7e424bc3 · outbound

This paper cites an unresolved cited work.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:09.830786Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eaeaa7c9-de72-4dba-a076-d2625411b338 · outbound

This paper cites Flum and M.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Flum and M

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:09.914455Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 711dd853-fbe0-43f1-af32-934f3f8e8aec · outbound

This paper cites Cygan, F.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Cygan, F

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:09.981591Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fffb8328-2167-427c-a357-408b6458def0 · outbound

This paper cites an unresolved cited work.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.093132Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 26dc4a1f-bf07-4807-b216-39175ff1f107 · outbound

This paper cites Hochbaum,Approximation Algorithms for NP-hard Prob- lems, Computer science (PWS Publishing Company, 1997).

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Hochbaum,Approximation Algorithms for NP-hard Prob- lems, Computer science (PWS Publishing Company, 1997)

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.178344Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation abd9cdce-bb8e-41fd-819a-5212e8526ece · outbound

This paper cites Dinur and S.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Dinur and S

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.287505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b468e60-07cb-4b5a-932b-79722c1b8ff5 · outbound

This paper cites Farhi, J.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Farhi, J

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.341537Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1121291-0029-4181-9ec5-75a34104440c · outbound

This paper cites Blekos, D.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Blekos, D

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.422416Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e33b2405-8c8d-4488-8363-0f7fc7c1c3f6 · outbound

This paper cites Hadfield, Z.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Hadfield, Z

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.503542Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bdf545e-9e95-4c97-bbd1-0b27af598836 · outbound

This paper cites The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.602345Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f851f8b-b705-4f71-93d7-3be589438d83 · outbound

This paper cites Bravyi and M.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Bravyi and M

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.667647Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dcf9ab7d-2e76-4556-8602-22c0ec7f0e54 · outbound

This paper cites Preskill, Quantum computing in the nisq era and beyond, Quantum2, 79 (2018).

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Preskill, Quantum computing in the nisq era and beyond, Quantum2, 79 (2018)

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.774748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb89cb37-ce2a-4ea1-9139-1b3c01d250ec · outbound

This paper cites an unresolved cited work.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.855689Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8af030c9-12e4-4ae2-886a-c12f9c01807f · outbound

This paper cites an unresolved cited work.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.938980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 481e80f2-329c-48db-a126-284f44a6ee5a · outbound

This paper cites 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.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem 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

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:10.995591Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56b29534-1575-421d-b76b-76c53584dd29 · outbound

This paper cites Miyamoto and K.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Miyamoto and K

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.073659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 106ff007-9242-477f-82ec-2ae7c71adccc · outbound

This paper cites Chevignard, P.-A.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Chevignard, P.-A

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.156621Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b7e7d15d-a2ba-4532-b681-d10d9ff61d3b · outbound

This paper cites Farhi and S.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Farhi and S

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.245899Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 88d9f4c1-3aa9-4d07-ba15-5e6784450480 · outbound

This paper cites an unresolved cited work.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Unresolved cited work

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.326685Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d288cced-52b2-4cd8-8647-881817e1246b · outbound

This paper cites an unresolved cited work.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Unresolved cited work

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.432123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 969c38a2-568b-4c9d-bdf3-32b9ace452c3 · outbound

This paper cites Kempe, Quantum random walks: An introductory overview, Contemporary Physics44, 307 (2003).

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Kempe, Quantum random walks: An introductory overview, Contemporary Physics44, 307 (2003)

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.490576Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba1d02c4-1b8b-497b-8fee-1edf3e17737f · outbound

This paper cites A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.580304Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1afdf98f-6b55-48aa-afd3-b9c2e68ce2a0 · outbound

This paper cites an unresolved cited work.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.681636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 301e6465-d5c2-4429-89ea-7b88a5706e39 · outbound

This paper cites Chung,Spectral Graph Theory, CBMS Regional Conference Series No.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Chung,Spectral Graph Theory, CBMS Regional Conference Series No

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.810732Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a8d8a897-e6bb-4e64-8fc9-6f7ffac9a28d · outbound

This paper cites an unresolved cited work.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Unresolved cited work

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.904325Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ca8d971-2ffc-483e-81f9-3d84be1a30b5 · outbound

This paper cites Bollobas and P.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Bollobas and P

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:11.920498Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc83fcbb-0eec-41fd-942f-69a4599bc360 · outbound

This paper cites Karo ´nski and A.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Karo ´nski and A

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:12.043263Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79a07783-7172-47f1-8755-b126b6b18855 · outbound

This paper cites Barabási and R.

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Barabási and R

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:12.210294Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a5bf054-bec5-4f1e-853c-3a86a9dfb341 · outbound

This paper cites Chen,Graph Theory and Its Engineering Applications, Ad- 9 vanced series in electrical and computer engineering (World Scientific, 1997).

Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem Chen,Graph Theory and Its Engineering Applications, Ad- 9 vanced series in electrical and computer engineering (World Scientific, 1997)

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-03T18:59:12.424222Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation c46a8f7e-1208-49fb-925f-32dbaea66f4e · inbound

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks cites this paper.

Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-31T23:12:42.250918Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.