{"as_of":"2026-08-07T07:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4fcc2fce04d5df17973ba941c9c340cf39833ec9ec214bed5ccbf310aac94956","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T13:09:59.968238Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T07:36:45.174590Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1902.04811","last_updated":"2019-09-04T03:26:59Z","snapshot_observed_at":"2026-07-06T07:32:49.581638Z","submitted_at":"2019-02-13T09:44:02Z","title":"On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points","version":2},"cited_work":{"arxiv_id":"1902.04811","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1902.04811","snapshot_observed_at":"2026-07-02T07:36:45.174590Z","title":"Stochas- tic gradient descent escapes saddle points efficiently","venue":null,"work_id":"7d604b92-f948-4aa5-b5c4-d99955d9da7f","year":2019},"citing_paper":{"arxiv_id":"1907.01848","last_updated":"2019-07-03T11:06:11Z","snapshot_observed_at":"2026-07-06T08:04:50.941443Z","submitted_at":"2019-07-03T11:06:11Z","title":"Distributed Learning in Non-Convex Environments -- Part I: Agreement at a Linear Rate","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-25T10:24:33.527480Z"},"links":{"cited_paper":"/paper/1902.04811","citing_paper":"/paper/1907.01848"},"observation_digest":"sha256:15a94882429426985cbf0ddb8198f1c9640917b3f03147ba798210657838ea35","observation_id":"1dd7419e-d602-486b-91bf-1021caae4a54","resolution":{"observed_at":"2026-05-25T10:25:38.607286Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.04811","last_updated":"2019-09-04T03:26:59Z","snapshot_observed_at":"2026-07-06T07:32:49.581638Z","submitted_at":"2019-02-13T09:44:02Z","title":"On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points","version":2},"cited_work":{"arxiv_id":"1902.04811","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1902.04811","snapshot_observed_at":"2026-07-02T07:36:45.174590Z","title":"Stochas- tic gradient descent escapes saddle points efficiently","venue":null,"work_id":"7d604b92-f948-4aa5-b5c4-d99955d9da7f","year":2019},"citing_paper":{"arxiv_id":"1907.01849","last_updated":"2019-07-03T11:06:43Z","snapshot_observed_at":"2026-07-06T08:04:50.941443Z","submitted_at":"2019-07-03T11:06:43Z","title":"Distributed Learning in Non-Convex Environments -- Part II: Polynomial Escape from Saddle-Points","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-25T09:52:34.427619Z"},"links":{"cited_paper":"/paper/1902.04811","citing_paper":"/paper/1907.01849"},"observation_digest":"sha256:d4fc973fd44cd5db52a74be7d6ec8fe543a33f1564b4fcc0a6eb1f61ca8a0f5d","observation_id":"2f123d49-9a9a-4cf4-9cc6-d8625eafd6d8","resolution":{"observed_at":"2026-05-25T09:55:36.558456Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.04811","last_updated":"2019-09-04T03:26:59Z","snapshot_observed_at":"2026-07-06T07:32:49.581638Z","submitted_at":"2019-02-13T09:44:02Z","title":"On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.04811","snapshot_observed_at":"2026-08-06T13:09:59.968238Z","title":"Kakade, and Michael I","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2507.21205","last_updated":"2025-07-28T17:54:15Z","snapshot_observed_at":"2026-08-06T13:09:35.984834Z","submitted_at":"2025-07-28T17:54:15Z","title":"Learning from Limited and Imperfect Data","version":1},"reference_index":123,"source":"pdf_text","source_observed_at":"2026-08-06T13:09:59.968238Z"},"links":{"cited_paper":"/paper/1902.04811","citing_paper":"/paper/2507.21205"},"observation_digest":"sha256:825b4f12d6ac131eb0390354c74ff394254cf8382c7a0be90c011b7143cb7be8","observation_id":"28ebbe59-f608-4d49-b083-eabef028782a","resolution":{"observed_at":"2026-08-06T13:09:59.968238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.04811","last_updated":"2019-09-04T03:26:59Z","snapshot_observed_at":"2026-07-06T07:32:49.581638Z","submitted_at":"2019-02-13T09:44:02Z","title":"On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.04811","snapshot_observed_at":"2026-08-05T12:46:30.602557Z","title":"Keller Jordan, Yuchen Jin, Vlado Boza, Jiacheng You, Franz Cesista, Laker Newhouse, and Jeremy Bernstein","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2509.01329","last_updated":"2025-09-01T10:12:13Z","snapshot_observed_at":"2026-08-06T03:06:00.334476Z","submitted_at":"2025-09-01T10:12:13Z","title":"Globally aware optimization with resurgence","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T12:46:30.602557Z"},"links":{"cited_paper":"/paper/1902.04811","citing_paper":"/paper/2509.01329"},"observation_digest":"sha256:8029aaf83fac25071e963bce3af3b81d7967834c27643b90c580d1fe7b6fc28b","observation_id":"251df33f-3283-40a0-903c-faf888aaccea","resolution":{"observed_at":"2026-08-05T12:46:30.602557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.04811","last_updated":"2019-09-04T03:26:59Z","snapshot_observed_at":"2026-07-06T07:32:49.581638Z","submitted_at":"2019-02-13T09:44:02Z","title":"On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points","version":2},"cited_work":{"arxiv_id":"1902.04811","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1902.04811","snapshot_observed_at":"2026-07-02T07:36:45.174590Z","title":"Stochas- tic gradient descent escapes saddle points efficiently","venue":null,"work_id":"7d604b92-f948-4aa5-b5c4-d99955d9da7f","year":2019},"citing_paper":{"arxiv_id":"2605.14345","last_updated":"2026-05-14T04:09:51Z","snapshot_observed_at":"2026-07-06T23:25:49.545418Z","submitted_at":"2026-05-14T04:09:51Z","title":"Convergence of difference inclusions via a diameter criterion","version":1},"reference_index":291,"source":"arxiv_source","source_observed_at":"2026-05-15T02:21:30.228735Z"},"links":{"cited_paper":"/paper/1902.04811","citing_paper":"/paper/2605.14345"},"observation_digest":"sha256:e641a55b61aaddae7447fc5ecce3b43187f891012752dba5d858fc8a3458e71f","observation_id":"824e1e3a-0fd3-407f-acec-4679c98c48a6","resolution":{"observed_at":"2026-05-15T02:23:31.781196Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.04811","last_updated":"2019-09-04T03:26:59Z","snapshot_observed_at":"2026-07-06T07:32:49.581638Z","submitted_at":"2019-02-13T09:44:02Z","title":"On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points","version":2},"cited_work":{"arxiv_id":"1902.04811","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1902.04811","snapshot_observed_at":"2026-07-02T07:36:45.174590Z","title":"Stochas- tic gradient descent escapes saddle points efficiently","venue":null,"work_id":"7d604b92-f948-4aa5-b5c4-d99955d9da7f","year":2019},"citing_paper":{"arxiv_id":"2606.05438","last_updated":"2026-06-03T21:01:21Z","snapshot_observed_at":"2026-07-06T23:45:28.379468Z","submitted_at":"2026-06-03T21:01:21Z","title":"Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T06:50:05.151386Z"},"links":{"cited_paper":"/paper/1902.04811","citing_paper":"/paper/2606.05438"},"observation_digest":"sha256:fa491d72e859c002a7cc64fe97e400ec7ea96126db9763149dde906d0640bf68","observation_id":"c25847ea-ec12-4c43-ab3d-d04b28236c62","resolution":{"observed_at":"2026-07-02T07:36:45.176067Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1902.04811/citation-record","integrity":"/paper/1902.04811/integrity","json":"/paper/1902.04811/citation-record.json","paper":"/paper/1902.04811"},"outbound":[],"paper":{"arxiv_id":"1902.04811","last_updated":"2019-09-04T03:26:59Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:32:49.581638Z","submitted_at":"2019-02-13T09:44:02Z","title":"On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1902.04811."}