Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem
As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2207.07460.
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-13T06:32:02.005865+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-08T13:24:15.352034Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-18T21:36:51.954063Z
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 a84f1643-e80a-499d-b36b-fb6592cc9edd · inbound
Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization cites this paper.
Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem
Reference 32
- Resolution
- verified exact
- arxiv_id, observed 2026-05-18T21:36:51.957697Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation aa21826f-fea4-47a8-93e2-5e1bd80d584d · inbound
Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem cites this paper.
Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem
Reference 41
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-05-11T13:46:04.624254Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 48370379-feed-48db-b9f1-56681cb9bfcd · inbound
School network reorganization under educational and spatial constraints using classical and quantum optimization cites this paper.
School network reorganization under educational and spatial constraints using classical and quantum optimization Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T13:24:15.352034Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.