Pith. sign in

Paper Citation Record · LEDGER

Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory

As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.13688.

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

pith.paper-citation-record.v1
2403.13688 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T22:58:12.974060Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-05T22:58:13.084948Z

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 ad0936b3-5879-4337-aec8-8b44cf26f926 · inbound

The Optimal Smoothings of Sublinear Functions and Convex Cones cites this paper.

The Optimal Smoothings of Sublinear Functions and Convex Cones Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory

Reference 21

Resolution
verified exact
local_arxiv, observed 2026-08-05T22:58:13.090401Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-05T22:58:12.974060Z digest=sha256:b42d3d6479ea6c06d5aed49c288c270f9fb2b2decd6e81e8664ece8cfdf87a86

Observation 719b0960-98e8-4494-9996-eb6172484432 · inbound

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets cites this paper.

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-02T20:54:16.401959Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T20:54:16.401959Z digest=sha256:d86c5e6fb4350346af3f8f769b354ed7b4d119fc242aad282807cee73a9c35a7