{"as_of":"2026-08-11T19:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6224c97b11bc43fb103fdd027d0a60d6917d141141291afe0fc6c3280acccc2","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-11T06:34:44.6726+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-08T04:30:37.176306Z","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-07-02T11:46:55.219319Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1510.06096","last_updated":"2016-04-23T00:18:06Z","snapshot_observed_at":"2026-07-06T04:33:47.074419Z","submitted_at":"2015-10-21T00:59:23Z","title":"When Are Nonconvex Problems Not Scary?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.06096","snapshot_observed_at":"2026-08-06T22:17:58.531907Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.531907Z"},"links":{"cited_paper":"/paper/1510.06096","citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:dad12335b337174a2645d2b015a226ca0fcd4c488acb58a7d9c2503a0ec01427","observation_id":"0de661c6-0579-48f0-8cd9-7551f59e1222","resolution":{"observed_at":"2026-08-06T22:17:58.531907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.06096","last_updated":"2016-04-23T00:18:06Z","snapshot_observed_at":"2026-07-06T04:33:47.074419Z","submitted_at":"2015-10-21T00:59:23Z","title":"When Are Nonconvex Problems Not Scary?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.06096","snapshot_observed_at":"2026-08-04T00:25:16.469676Z","title":"When are nonconvex problems not scary?","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.01605","last_updated":"2026-06-21T04:15:05Z","snapshot_observed_at":"2026-08-07T23:55:40.658558Z","submitted_at":"2025-11-03T14:07:53Z","title":"The Optimization Landscape of Carath\\'eodory Decomposition of Toeplitz Covariances","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T00:25:16.469676Z"},"links":{"cited_paper":"/paper/1510.06096","citing_paper":"/paper/2511.01605"},"observation_digest":"sha256:31d153f58c1725678716341c55036a4a7e7b03115d3dfd4820f4d1dd24a13d42","observation_id":"2eabfebd-5973-445d-86ee-edd73777cffb","resolution":{"observed_at":"2026-08-04T00:25:16.469676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.06096","last_updated":"2016-04-23T00:18:06Z","snapshot_observed_at":"2026-07-06T04:33:47.074419Z","submitted_at":"2015-10-21T00:59:23Z","title":"When Are Nonconvex Problems Not Scary?","version":2},"cited_work":{"arxiv_id":"1510.06096","doi":null,"metadata_source":"pith","pith_arxiv_id":"1510.06096","snapshot_observed_at":"2026-07-02T11:46:55.219319Z","title":"When Are Nonconvex Problems Not Scary?","venue":"math.OC","work_id":"cc848323-59bd-4de0-ac58-8d7113f9facf","year":2015},"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":245,"source":"arxiv_source","source_observed_at":"2026-05-15T02:21:30.228735Z"},"links":{"cited_paper":"/paper/1510.06096","citing_paper":"/paper/2605.14345"},"observation_digest":"sha256:1f1b99d6b9d5d59dc0530c324bd77e4a357525bbcdaba3645f603e29241653c4","observation_id":"7a259426-77ac-4960-88f5-fe224b2ecc7c","resolution":{"observed_at":"2026-05-15T02:23:31.795336Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.06096","last_updated":"2016-04-23T00:18:06Z","snapshot_observed_at":"2026-07-06T04:33:47.074419Z","submitted_at":"2015-10-21T00:59:23Z","title":"When Are Nonconvex Problems Not Scary?","version":2},"cited_work":{"arxiv_id":"1510.06096","doi":null,"metadata_source":"pith","pith_arxiv_id":"1510.06096","snapshot_observed_at":"2026-07-02T11:46:55.219319Z","title":"When Are Nonconvex Problems Not Scary?","venue":"math.OC","work_id":"cc848323-59bd-4de0-ac58-8d7113f9facf","year":2015},"citing_paper":{"arxiv_id":"2606.04476","last_updated":"2026-06-03T05:44:30Z","snapshot_observed_at":"2026-08-08T11:18:56.709201Z","submitted_at":"2026-06-03T05:44:30Z","title":"When Both Layers Learn: Training Dynamics of Representing Linear Models via ReLU Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T07:02:26.496063Z"},"links":{"cited_paper":"/paper/1510.06096","citing_paper":"/paper/2606.04476"},"observation_digest":"sha256:29c0ded581fdbb5d6c498206892503533773b261627622f675c97f8e1e77fc68","observation_id":"62a2fc1b-a708-4ff5-9826-387102365028","resolution":{"observed_at":"2026-07-02T07:16:44.871423Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.06096","last_updated":"2016-04-23T00:18:06Z","snapshot_observed_at":"2026-07-06T04:33:47.074419Z","submitted_at":"2015-10-21T00:59:23Z","title":"When Are Nonconvex Problems Not Scary?","version":2},"cited_work":{"arxiv_id":"1510.06096","doi":null,"metadata_source":"pith","pith_arxiv_id":"1510.06096","snapshot_observed_at":"2026-07-02T11:46:55.219319Z","title":"When Are Nonconvex Problems Not Scary?","venue":"math.OC","work_id":"cc848323-59bd-4de0-ac58-8d7113f9facf","year":2015},"citing_paper":{"arxiv_id":"2606.06624","last_updated":"2026-06-08T15:12:03Z","snapshot_observed_at":"2026-08-02T09:46:22.331867Z","submitted_at":"2026-06-04T18:21:03Z","title":"Principles and Practice of Deep Representation Learning: or a Mathematical Theory of Memory","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-06-28T03:07:52.730713Z"},"links":{"cited_paper":"/paper/1510.06096","citing_paper":"/paper/2606.06624"},"observation_digest":"sha256:4457f68f905193fa4aadd8f6d959d6d9c7ba4c1bf3a5acf23f31b796b89c229d","observation_id":"08051c89-d778-4193-8524-4a9ea061987b","resolution":{"observed_at":"2026-07-02T11:46:55.220778Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.06096","last_updated":"2016-04-23T00:18:06Z","snapshot_observed_at":"2026-07-06T04:33:47.074419Z","submitted_at":"2015-10-21T00:59:23Z","title":"When Are Nonconvex Problems Not Scary?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.06096","snapshot_observed_at":"2026-08-08T04:30:37.176306Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.03001","last_updated":"2026-08-06T04:18:49Z","snapshot_observed_at":"2026-08-09T23:10:05.703609Z","submitted_at":"2026-08-04T01:34:36Z","title":"Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-08T04:30:37.176306Z"},"links":{"cited_paper":"/paper/1510.06096","citing_paper":"/paper/2608.03001"},"observation_digest":"sha256:87dd34f51420a61ae62a87a520cab040fefb99e6c570ba004b8ae3daf1a52dfd","observation_id":"4bd345a8-b0dd-4ec8-a96f-eeca0633f5a5","resolution":{"observed_at":"2026-08-08T04:30:37.176306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1510.06096/citation-record","integrity":"/paper/1510.06096/integrity","json":"/paper/1510.06096/citation-record.json","paper":"/paper/1510.06096"},"outbound":[],"paper":{"arxiv_id":"1510.06096","last_updated":"2016-04-23T00:18:06Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T04:33:47.074419Z","submitted_at":"2015-10-21T00:59:23Z","title":"When Are Nonconvex Problems Not Scary?"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1510.06096."}