{"as_of":"2026-08-21T01:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38ead65f7ba365f7faf5d1a645cef58be397b550bffbed88ea66f14c69aa5fea","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T00:02:21.159893Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-25T15:15:58.513087Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1602.04915","last_updated":"2016-03-04T08:04:58Z","snapshot_observed_at":"2026-08-14T22:10:11.978109Z","submitted_at":"2016-02-16T05:43:31Z","title":"Gradient Descent Converges to Minimizers","version":2},"cited_work":{"arxiv_id":"1602.04915","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.04915","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient Descent Converges to Minimizers","venue":"stat.ML","work_id":"cfeca86e-801b-46b9-aed1-97e457901c8f","year":2016},"citing_paper":{"arxiv_id":"1906.11417","last_updated":"2019-06-27T03:08:21Z","snapshot_observed_at":"2026-08-19T02:19:59.005810Z","submitted_at":"2019-06-27T03:08:21Z","title":"Combining Stochastic Adaptive Cubic Regularization with Negative Curvature for Nonconvex Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-25T15:14:28.863121Z"},"links":{"cited_paper":"/paper/1602.04915","citing_paper":"/paper/1906.11417"},"observation_digest":"sha256:8ac72cf325b9e1882e23f58ef848f6838a1bc95e29f76d00313643f91843aa95","observation_id":"29159f45-5a9e-4b4a-96df-ea590914c33b","resolution":{"observed_at":"2026-05-25T15:15:58.518278Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.04915","last_updated":"2016-03-04T08:04:58Z","snapshot_observed_at":"2026-08-14T22:10:11.978109Z","submitted_at":"2016-02-16T05:43:31Z","title":"Gradient Descent Converges to Minimizers","version":2},"cited_work":{"arxiv_id":"1602.04915","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.04915","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient Descent Converges to Minimizers","venue":"stat.ML","work_id":"cfeca86e-801b-46b9-aed1-97e457901c8f","year":2016},"citing_paper":{"arxiv_id":"1907.02911","last_updated":"2019-07-05T16:17:01Z","snapshot_observed_at":"2026-07-06T08:05:24.076802Z","submitted_at":"2019-07-05T16:17:01Z","title":"Weight-space symmetry in deep networks gives rise to permutation saddles, connected by equal-loss valleys across the loss landscape","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-25T02:12:23.098398Z"},"links":{"cited_paper":"/paper/1602.04915","citing_paper":"/paper/1907.02911"},"observation_digest":"sha256:1b2479ccce606bc4fb79f11eab4a70028dc3779c8b4b813be75bb559b84da81d","observation_id":"9df7479d-8e4a-491f-abc6-2fe3cfd7fddb","resolution":{"observed_at":"2026-05-25T02:15:14.271571Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.04915","last_updated":"2016-03-04T08:04:58Z","snapshot_observed_at":"2026-08-14T22:10:11.978109Z","submitted_at":"2016-02-16T05:43:31Z","title":"Gradient Descent Converges to Minimizers","version":2},"cited_work":{"arxiv_id":"1602.04915","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.04915","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient Descent Converges to Minimizers","venue":"stat.ML","work_id":"cfeca86e-801b-46b9-aed1-97e457901c8f","year":2016},"citing_paper":{"arxiv_id":"2307.07030","last_updated":"2026-04-06T00:57:42Z","snapshot_observed_at":"2026-07-06T15:53:50.159586Z","submitted_at":"2023-07-13T19:11:07Z","title":"Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-24T07:51:59.724176Z"},"links":{"cited_paper":"/paper/1602.04915","citing_paper":"/paper/2307.07030"},"observation_digest":"sha256:4e1aa916fb604cb1d34687b42701ab34d60ae2ac14a0d22da1258469c8889957","observation_id":"fa442d7b-3a21-4f11-aabf-ac5009e102ce","resolution":{"observed_at":"2026-05-24T07:54:09.110612Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.04915","last_updated":"2016-03-04T08:04:58Z","snapshot_observed_at":"2026-08-14T22:10:11.978109Z","submitted_at":"2016-02-16T05:43:31Z","title":"Gradient Descent Converges to Minimizers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.04915","snapshot_observed_at":"2026-08-02T00:02:21.159893Z","title":"D., Simchowitz, M., Jordan, M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.15173","last_updated":"2026-07-16T16:22:16Z","snapshot_observed_at":"2026-08-20T21:35:15.679712Z","submitted_at":"2026-07-16T16:22:16Z","title":"Landscape analysis for shallow neural networks: Complete classification of critical points for cubic activation and affine target functions","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-02T00:02:21.159893Z"},"links":{"cited_paper":"/paper/1602.04915","citing_paper":"/paper/2607.15173"},"observation_digest":"sha256:157b6e2bff4b1d6366f5a4f52b2c94410c93c2818d77d702d41c6fa5a57898b7","observation_id":"e5160cc1-301c-4771-a115-9aac20e4a3af","resolution":{"observed_at":"2026-08-02T00:02:21.159893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1602.04915/citation-record","integrity":"/paper/1602.04915/integrity","json":"/paper/1602.04915/citation-record.json","paper":"/paper/1602.04915"},"outbound":[],"paper":{"arxiv_id":"1602.04915","last_updated":"2016-03-04T08:04:58Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T22:10:11.978109Z","submitted_at":"2016-02-16T05:43:31Z","title":"Gradient Descent Converges to Minimizers"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1602.04915."}