Paper Citation Record · LEDGER

A quantum central path algorithm for linear optimization

As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2311.03977.

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

pith.paper-citation-record.v1
2311.03977 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:36:01.072923Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-02T14:37:03.600347Z

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 c66dc0dd-8f9e-477f-8e4e-fd24dbbe26dd · inbound

Quantum Optimization via Gradient-Based Hamiltonian Descent cites this paper.

Quantum Optimization via Gradient-Based Hamiltonian Descent A quantum central path algorithm for linear optimization

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T15:36:01.072923Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 642124cf-93f1-4751-b970-3a4440b17d37 · inbound

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities cites this paper.

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities A quantum central path algorithm for linear optimization

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T19:57:36.875885Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df66f52e-40cf-423e-a1e6-33671d78b49e · inbound

Stochastic Quantum Hamiltonian Descent cites this paper.

Stochastic Quantum Hamiltonian Descent A quantum central path algorithm for linear optimization

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-06T15:48:50.932546Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57e687ef-4539-4f89-85a9-7d30cfad6b4f · inbound

Quantum algorithms for Young measures: applications to nonlinear partial differential equations cites this paper.

Quantum algorithms for Young measures: applications to nonlinear partial differential equations A quantum central path algorithm for linear optimization

Reference 3

Resolution: verified exact; arxiv_id, observed 2026-05-11T09:16:03.147383Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f696d508-6c6a-4f8a-b25f-6975f46693cd · inbound

Young Measure Based Quantum Linear Programming Algorithms for Nonlinear/Stochastic Multiscale Partial Differential Equations and Homogenization cites this paper.

Young Measure Based Quantum Linear Programming Algorithms for Nonlinear/Stochastic Multiscale Partial Differential Equations and Homogenization A quantum central path algorithm for linear optimization

Reference 5

Resolution: metadata mismatch; arxiv_id, observed 2026-07-02T14:37:03.602760Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.