Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2210.03210.
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-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T21:56:07.706183Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-07T05:29:31.500067Z
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 39350c7c-57de-4092-baf6-a1f8f4bea3a4 · inbound
Quantum Annealing Approaches to Solving the Shipment Rerouting Problems cites this paper.
Quantum Annealing Approaches to Solving the Shipment Rerouting Problems Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T21:17:58.717903Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ccb14914-620e-4f70-8316-a92af7c74556 · inbound
Runtime Quantum Advantage with Digital Quantum Optimization cites this paper.
Runtime Quantum Advantage with Digital Quantum Optimization Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T21:56:07.706183Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3242291e-dd92-459a-992a-e6cb660bb8ac · inbound
Protein folding with an all-to-all trapped-ion quantum computer cites this paper.
Protein folding with an all-to-all trapped-ion quantum computer Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
Reference 28
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T05:29:31.529623Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation bc1ab194-de97-4122-9187-ea924600fcd2 · inbound
Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization cites this paper.
Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
Reference 2014
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T17:15:59.776369Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c771dc67-9ccd-4d97-8388-1374b410a4b2 · 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 Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T23:12:41.774715Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.