Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1709.07180.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-01T12:17:40.208101Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-04T13:09:51.340861Z
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 6051cb2d-570c-418b-9b8a-e278da8a760c · inbound
Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization cites this paper.
Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
Reference 13
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T07:36:45.171142Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 24cad8e1-f6f5-43cf-aab9-d325425dddb4 · inbound
Finding Stationary Points by Comparisons cites this paper.
Finding Stationary Points by Comparisons Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
Reference 7
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-07-04T13:09:51.342070Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 548a188a-c952-4e32-90e5-9a33434942e3 · inbound
On the Universality of Simple Trust-Region Algorithms cites this paper.
On the Universality of Simple Trust-Region Algorithms Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
Reference 65
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T12:17:40.208101Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.