Paper Citation Record · LEDGER

How to Escape Saddle Points Efficiently

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

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

pith.paper-citation-record.v1
1703.00887 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 11 of 11 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 11 of 11 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T02:28:38.844152Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-04T14:49:54.831935Z

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 aa9850bc-4567-4dd4-8add-b0bff135a34c · inbound

Adaptive Federated Optimization cites this paper.

Adaptive Federated Optimization How to Escape Saddle Points Efficiently

Reference 175

Resolution: metadata mismatch; local_arxiv, observed 2026-05-21T10:30:58.910995Z

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 6ea716f9-7589-474c-a234-2b48c74d34bb · inbound

Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models cites this paper.

Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models How to Escape Saddle Points Efficiently

Reference 61

Resolution: metadata mismatch; local_arxiv, observed 2026-05-14T23:00:21.312793Z

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 036daa23-8033-43f8-96e3-988c9a57e8b5 · inbound

A Theory of Saddle Escape in Deep Nonlinear Networks cites this paper.

A Theory of Saddle Escape in Deep Nonlinear Networks How to Escape Saddle Points Efficiently

Reference 25

Resolution: verified exact; arxiv_id, observed 2026-05-11T16:51:05.647634Z

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 97eafa7e-df38-48e6-a2b0-41497f686d0c · inbound

A Theory of Saddle Escape in Deep Nonlinear Networks cites this paper.

A Theory of Saddle Escape in Deep Nonlinear Networks How to Escape Saddle Points Efficiently

Reference 25

Resolution: verified exact; arxiv_id, observed 2026-05-11T02:25:54.537896Z

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 59aa1c52-9235-4796-a26a-79c30a1481c1 · inbound

A Theory of Saddle Escape in Deep Nonlinear Networks cites this paper.

A Theory of Saddle Escape in Deep Nonlinear Networks How to Escape Saddle Points Efficiently

Reference 25

Resolution: verified exact; local_arxiv, observed 2026-07-01T00:45:12.060298Z

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 16620d68-01b8-46f6-8c52-e69ab571c383 · inbound

Dimension-Free Saddle-Point Escape in Muon cites this paper.

Dimension-Free Saddle-Point Escape in Muon How to Escape Saddle Points Efficiently

Reference 14

Resolution: verified exact; arxiv_id, observed 2026-05-12T06:01:26.483521Z

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 1bda443e-862e-4546-baed-207947231d5b · inbound

A Theory on Flow Matching with Neural Networks cites this paper.

A Theory on Flow Matching with Neural Networks How to Escape Saddle Points Efficiently

Reference 88

Resolution: metadata mismatch; local_arxiv, observed 2026-07-03T00:57:29.402750Z

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 e7c79051-c2e8-4de1-bebe-1144e28de3b6 · inbound

Statistical Properties of Training & Generalization cites this paper.

Statistical Properties of Training & Generalization How to Escape Saddle Points Efficiently

Reference 59

Resolution: metadata mismatch; local_arxiv, observed 2026-07-04T05:39:40.942565Z

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 9f65270f-0099-4246-a4e0-aca4444fc396 · inbound

Statistical Properties of Training & Generalization cites this paper.

Statistical Properties of Training & Generalization How to Escape Saddle Points Efficiently

Reference 58

Resolution: metadata mismatch; local_arxiv, observed 2026-07-02T21:57:25.621888Z

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 50e00349-e7da-48c7-a65f-b07fda0fcc05 · inbound

Estimation of High Dimensional Bounded Discrete Graphical Models via Regularized Generalized Score Matching cites this paper.

Estimation of High Dimensional Bounded Discrete Graphical Models via Regularized Generalized Score Matching How to Escape Saddle Points Efficiently

Reference 220

Resolution: metadata mismatch; local_arxiv, observed 2026-07-04T14:49:54.833435Z

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 2bb6deb3-3d9a-4e71-9590-c304a950d3b1 · inbound

NeuralChaos: Optimal Adapted Approximation of Square Integrable Predictable Processes cites this paper.

NeuralChaos: Optimal Adapted Approximation of Square Integrable Predictable Processes How to Escape Saddle Points Efficiently

Reference 182

Resolution: unresolved; no resolver link, observed 2026-08-02T02:28:38.844152Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.