{"as_of":"2026-08-04T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a6af2889365c1e559d12f03abf81b6a6885c5dd99f1ff4af8084a9cf5600680","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-04T06:34:03.388597+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-05-25T15:14:28.863121Z","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.506408Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1709.01434","last_updated":"2017-09-05T14:58:15Z","snapshot_observed_at":"2026-07-06T05:58:12.969533Z","submitted_at":"2017-09-05T14:58:15Z","title":"A Generic Approach for Escaping Saddle points","version":1},"cited_work":{"arxiv_id":"1709.01434","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.01434","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Generic Approach for Escaping Saddle points","venue":"cs.LG","work_id":"42a079bc-31ac-452f-8027-eceda8b5fe9a","year":2017},"citing_paper":{"arxiv_id":"1906.11417","last_updated":"2019-06-27T03:08:21Z","snapshot_observed_at":"2026-07-06T08:03:08.422037Z","submitted_at":"2019-06-27T03:08:21Z","title":"Combining Stochastic Adaptive Cubic Regularization with Negative Curvature for Nonconvex Optimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-25T15:14:28.863121Z"},"links":{"cited_paper":"/paper/1709.01434","citing_paper":"/paper/1906.11417"},"observation_digest":"sha256:52082379728653b27c7277534153397e4f8c8cf4445f4740b9a63d8cb817c0ff","observation_id":"f25b4bee-f0c2-423e-89bd-3aa715774e3c","resolution":{"observed_at":"2026-05-25T15:15:58.509537Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01434","last_updated":"2017-09-05T14:58:15Z","snapshot_observed_at":"2026-07-06T05:58:12.969533Z","submitted_at":"2017-09-05T14:58:15Z","title":"A Generic Approach for Escaping Saddle points","version":1},"cited_work":{"arxiv_id":"1709.01434","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.01434","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Generic Approach for Escaping Saddle points","venue":"cs.LG","work_id":"42a079bc-31ac-452f-8027-eceda8b5fe9a","year":2017},"citing_paper":{"arxiv_id":"2003.00295","last_updated":"2021-09-08T23:37:17Z","snapshot_observed_at":"2026-07-06T09:01:12.515300Z","submitted_at":"2020-02-29T16:37:29Z","title":"Adaptive Federated Optimization","version":5},"reference_index":172,"source":"arxiv_source","source_observed_at":"2026-05-21T10:30:58.601351Z"},"links":{"cited_paper":"/paper/1709.01434","citing_paper":"/paper/2003.00295"},"observation_digest":"sha256:bade8eb4ad97fa6fb191d05cb686d082158152062116fcfcc47cb8c53548e613","observation_id":"4456d97f-c34a-4ec0-ba9c-ca83e74e0e60","resolution":{"observed_at":"2026-05-21T10:30:58.897513Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01434","last_updated":"2017-09-05T14:58:15Z","snapshot_observed_at":"2026-07-06T05:58:12.969533Z","submitted_at":"2017-09-05T14:58:15Z","title":"A Generic Approach for Escaping Saddle points","version":1},"cited_work":{"arxiv_id":"1709.01434","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.01434","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Generic Approach for Escaping Saddle points","venue":"cs.LG","work_id":"42a079bc-31ac-452f-8027-eceda8b5fe9a","year":2017},"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":73,"source":"pdf_text","source_observed_at":"2026-05-24T07:51:59.724176Z"},"links":{"cited_paper":"/paper/1709.01434","citing_paper":"/paper/2307.07030"},"observation_digest":"sha256:c27614cad4ebc858851df7df19fd515303b2c76295ce7043c15c0e750d506aeb","observation_id":"22b037c1-e006-4fc2-80bc-8471f607a261","resolution":{"observed_at":"2026-05-24T07:54:09.104116Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01434","last_updated":"2017-09-05T14:58:15Z","snapshot_observed_at":"2026-07-06T05:58:12.969533Z","submitted_at":"2017-09-05T14:58:15Z","title":"A Generic Approach for Escaping Saddle points","version":1},"cited_work":{"arxiv_id":"1709.01434","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.01434","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Generic Approach for Escaping Saddle points","venue":"cs.LG","work_id":"42a079bc-31ac-452f-8027-eceda8b5fe9a","year":2017},"citing_paper":{"arxiv_id":"2605.09331","last_updated":"2026-05-10T05:06:07Z","snapshot_observed_at":"2026-07-06T23:21:26.017420Z","submitted_at":"2026-05-10T05:06:07Z","title":"Dimension-Free Saddle-Point Escape in Muon","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-12T04:38:25.480020Z"},"links":{"cited_paper":"/paper/1709.01434","citing_paper":"/paper/2605.09331"},"observation_digest":"sha256:5a5c27a856f8534dde7f2fa7e3dac1bbf0f06bd5ebbe2f7db78e564589975aa6","observation_id":"56ac1282-7192-403b-873c-dbd8f6d51870","resolution":{"observed_at":"2026-05-12T06:01:26.374440Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1709.01434/citation-record","integrity":"/paper/1709.01434/integrity","json":"/paper/1709.01434/citation-record.json","paper":"/paper/1709.01434"},"outbound":[],"paper":{"arxiv_id":"1709.01434","last_updated":"2017-09-05T14:58:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T05:58:12.969533Z","submitted_at":"2017-09-05T14:58:15Z","title":"A Generic Approach for Escaping 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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1709.01434."}