Paper Citation Record · LEDGER

A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2311.07710.

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

pith.paper-citation-record.v1
2311.07710 v4

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 10 of 10 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 10 of 10 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-09T16:50:21.023623Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-23T20:33:25.911916Z

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 24fd44d2-e174-40fb-9644-172ea9b02681 · inbound

Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer cites this paper.

Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 39

Resolution: verified exact; arxiv_id, observed 2026-05-23T20:33:25.914900Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 43900e58-0b4c-433b-aba8-13bd93965f98 · inbound

On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning cites this paper.

On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-09T16:50:21.023623Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7a23477-f1d7-453f-b751-86af8d0fc6d0 · inbound

Scalable First-order Method for Certifying Optimal k-Sparse GLMs cites this paper.

Scalable First-order Method for Certifying Optimal k-Sparse GLMs A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T21:22:14.187714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48f80138-9102-4729-aad0-b47861d8d3ba · inbound

New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming cites this paper.

New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-07T15:21:19.661823Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0de896e9-52df-4393-ad92-20e232c87b2f · inbound

An Overview of GPU-based First-Order Methods for Linear Programming and Extensions cites this paper.

An Overview of GPU-based First-Order Methods for Linear Programming and Extensions A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 98

Resolution: unresolved; no resolver link, observed 2026-08-07T11:33:18.245907Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c83b99fc-b613-429f-aade-e9f36baa6a4a · inbound

Enhanced Trust Region Sequential Convex Optimization for Multi-Drone Thermal Screening Trajectory Planning in Urban Environments cites this paper.

Enhanced Trust Region Sequential Convex Optimization for Multi-Drone Thermal Screening Trajectory Planning in Urban Environments A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T06:06:00.833369Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a13e69cb-d13c-49f5-84c0-aa66d1554661 · inbound

PDHCG: A Scalable First-Order Method for Large-Scale Competitive Market Equilibrium Computation cites this paper.

PDHCG: A Scalable First-Order Method for Large-Scale Competitive Market Equilibrium Computation A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-07T06:11:02.140189Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84f98005-3d53-46a3-b949-0ac8b4c65ad9 · inbound

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming cites this paper.

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-06T20:37:46.062128Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5dfe0599-cfd1-4755-9ed4-4adc3fa2f5fa · inbound

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Penalty Approach cites this paper.

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Penalty Approach A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-06T14:48:14.975901Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de2fdf11-866c-4fd0-8e2e-de57105d1f98 · inbound

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs cites this paper.

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming

Reference 41

Resolution: metadata mismatch; arxiv_id, observed 2026-05-22T07:41:14.774335Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.