Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2207.13030.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-05T16:14:35.130326Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-06-30T06:24:19.207467Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 40dbf28a-a224-4bc0-8e46-279193ca7ef4 · inbound
Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem cites this paper.
Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors
Reference 48
- Resolution
- unresolved
- no resolver link, observed 2026-08-05T16:14:35.130326Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2cf05e85-bbe0-45ee-bd28-b16ea1f0619e · inbound
Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems cites this paper.
Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors
Reference 29
- Resolution
- verified exact
- arxiv_id, observed 2026-06-30T06:24:19.209160Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.