Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2210.12860.
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-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T05:31:40.956601Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-05T15:43:57.315372Z
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 c0019c11-5868-45ee-bd2a-41672cf5b1ea · inbound
Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/7})$ Second-Order Oracle Complexity cites this paper.
Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/7})$ Second-Order Oracle Complexity Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis
Reference 2020
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:31:40.956601Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5734c7ec-a7f8-4cb5-b7f1-43cc2befb09d · inbound
Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees cites this paper.
Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis
Reference 12
- Resolution
- verified exact
- local_arxiv, observed 2026-08-05T15:43:57.318881Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 78f22018-e2ad-481a-95b8-70318cd0e02f · inbound
Accelerating Trust-Region Methods: An Attempt to Balance Global and Local Efficiency cites this paper.
Accelerating Trust-Region Methods: An Attempt to Balance Global and Local Efficiency Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis
Reference 36
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:40:46.423674Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.