{"as_of":"2026-08-20T20:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7be90323ec9186bc80fa210eb8ad84fa7ab7977ef991c9fea38656d7ec721357","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:53:28.643713Z","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-04T05:39:40.933683Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-08-12T18:53:28.643713Z","title":"Dauphin, R","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.11224","last_updated":"2024-12-05T17:44:09Z","snapshot_observed_at":"2026-08-16T06:47:42.353864Z","submitted_at":"2024-11-18T01:27:44Z","title":"Don't Be So Positive: Negative Step Sizes in Second-Order Methods","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T18:53:28.643713Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2411.11224"},"observation_digest":"sha256:c11c2b4db74653dd3b9741e64d4979c2f84fe3232d29334982cde23dc1db4782","observation_id":"da89cecc-aa20-4853-a341-a66eb210e258","resolution":{"observed_at":"2026-08-12T18:53:28.643713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":"1406.2572","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-07-04T05:39:40.933683Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","venue":"cs.LG","work_id":"2e7e0566-13d2-4bf5-817a-b08735476dbd","year":2014},"citing_paper":{"arxiv_id":"2502.02345","last_updated":"2026-04-10T08:19:58Z","snapshot_observed_at":"2026-08-18T01:50:25.480135Z","submitted_at":"2025-02-04T14:27:21Z","title":"Low Rank Based Subspace Inference for the Laplace Approximation of Bayesian Neural Networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T03:39:45.167149Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2502.02345"},"observation_digest":"sha256:7ae543a1c77f08ff80ea985e4cdabd0c3857d7ae0712f916b1bf35e465528463","observation_id":"6fccada1-7b2f-412a-a831-0046da041453","resolution":{"observed_at":"2026-05-23T03:42:27.785071Z","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":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-08-06T13:54:28.563026Z","title":"N., Pascanu, R., Gulcehre, C., Cho, K., Ganguli, S., & Bengio, Y","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.19968","last_updated":"2025-07-26T14:57:32Z","snapshot_observed_at":"2026-08-12T23:56:32.999272Z","submitted_at":"2025-07-26T14:57:32Z","title":"Dimer-Enhanced Optimization: A First-Order Approach to Escaping Saddle Points in Neural Network Training","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T13:54:28.563026Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2507.19968"},"observation_digest":"sha256:5e4924bb9044cf554072dd3aa288f435df99963f036a46108ffb00d4705e3e88","observation_id":"3a2ac1b2-7b62-4483-afab-de8fe8c5a599","resolution":{"observed_at":"2026-08-06T13:54:28.563026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-08-05T12:46:30.585622Z","title":"Soham De, Anirbit Mukherjee, and Enayat Ullah","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.01329","last_updated":"2025-09-01T10:12:13Z","snapshot_observed_at":"2026-08-15T02:10:46.360211Z","submitted_at":"2025-09-01T10:12:13Z","title":"Globally aware optimization with resurgence","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-05T12:46:30.585622Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2509.01329"},"observation_digest":"sha256:c9830528adcd60718b8dee3da294d6e76ad75e8fa2be9e2a5df08197395473e0","observation_id":"3005f81b-d3da-47f7-962c-7470ea997c34","resolution":{"observed_at":"2026-08-05T12:46:30.585622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-08-05T05:27:54.273487Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.05490","last_updated":"2025-09-05T20:39:43Z","snapshot_observed_at":"2026-08-13T18:08:12.704738Z","submitted_at":"2025-09-05T20:39:43Z","title":"An Analysis of Layer-Freezing Strategies for Enhanced Transfer Learning in YOLO Architectures","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T05:27:54.273487Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2509.05490"},"observation_digest":"sha256:238fba5ca43c2d45d2b0b0060cb371ad56fbbbff9edf025ae8a26d6a769bf35b","observation_id":"9a1416f7-d4e7-47b2-9b6f-db48eb364ab6","resolution":{"observed_at":"2026-08-05T05:27:54.273487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":"1406.2572","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-07-04T05:39:40.933683Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","venue":"cs.LG","work_id":"2e7e0566-13d2-4bf5-817a-b08735476dbd","year":2014},"citing_paper":{"arxiv_id":"2605.09331","last_updated":"2026-05-10T05:06:07Z","snapshot_observed_at":"2026-08-12T21:27:57.144723Z","submitted_at":"2026-05-10T05:06:07Z","title":"Dimension-Free Saddle-Point Escape in Muon","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-12T04:38:25.480020Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2605.09331"},"observation_digest":"sha256:df5fa94899d2de0e7cd8d458695adf544989ddb9160c82122640bf4b8421d88c","observation_id":"28e869b9-887e-4231-ba0a-d6ad2d30c6e2","resolution":{"observed_at":"2026-05-12T06:01:26.507724Z","resolver_source":"arxiv_id","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":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":"1406.2572","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-07-04T05:39:40.933683Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","venue":"cs.LG","work_id":"2e7e0566-13d2-4bf5-817a-b08735476dbd","year":2014},"citing_paper":{"arxiv_id":"2606.04390","last_updated":"2026-06-03T03:11:03Z","snapshot_observed_at":"2026-08-13T06:10:21.908755Z","submitted_at":"2026-06-03T03:11:03Z","title":"Shortcomings and capacities of real-constrained neural networks in complex spaces","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T06:53:56.579914Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2606.04390"},"observation_digest":"sha256:ffb75d6a13df27b0d92b5279ad3843618b046ed2b3b3f649f964783ae7b6d098","observation_id":"03abb548-8819-4c97-b686-004d12427186","resolution":{"observed_at":"2026-07-02T07:36:44.740208Z","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":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":"1406.2572","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-07-04T05:39:40.933683Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","venue":"cs.LG","work_id":"2e7e0566-13d2-4bf5-817a-b08735476dbd","year":2014},"citing_paper":{"arxiv_id":"2606.20299","last_updated":"2026-07-01T14:03:37Z","snapshot_observed_at":"2026-08-15T21:10:11.569207Z","submitted_at":"2026-06-18T14:35:53Z","title":"Statistical Properties of Training & Generalization","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-06-26T15:35:51.654392Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2606.20299"},"observation_digest":"sha256:961bf595a0bda424ac1cc839651248def490b42f8e635c1298a9aef7133189cb","observation_id":"3349e146-f2ef-460f-ac56-6c395c20c493","resolution":{"observed_at":"2026-07-04T05:39:40.935578Z","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":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":"1406.2572","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-07-04T05:39:40.933683Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","venue":"cs.LG","work_id":"2e7e0566-13d2-4bf5-817a-b08735476dbd","year":2014},"citing_paper":{"arxiv_id":"2606.20299","last_updated":"2026-07-01T14:03:37Z","snapshot_observed_at":"2026-08-15T21:10:11.569207Z","submitted_at":"2026-06-18T14:35:53Z","title":"Statistical Properties of Training & Generalization","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-02T21:51:13.457071Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2606.20299"},"observation_digest":"sha256:673d4685c8558c8e2e83d7cae0bf4a52a7e2ee25e43d320fb044608a011a0855","observation_id":"30d164f3-521e-453a-9eaa-985cf8d15ca6","resolution":{"observed_at":"2026-07-02T21:57:25.661252Z","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":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-07-14T07:06:53.439022Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.11095","last_updated":"2026-07-13T05:03:41Z","snapshot_observed_at":"2026-08-17T18:38:56.680311Z","submitted_at":"2026-07-13T05:03:41Z","title":"When cheap gradients fail: the measurement cost of attacking quantum classifiers","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-14T07:06:53.439022Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2607.11095"},"observation_digest":"sha256:5ade5d97f07059da61ca38e1d92d92934a7a525910aa7970564c4046b57cc778","observation_id":"28548ba2-ad8d-465a-80ed-b0fadbf7becd","resolution":{"observed_at":"2026-07-14T07:06:53.439022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2572","last_updated":"2014-06-10T14:52:14Z","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2572","snapshot_observed_at":"2026-08-02T00:02:19.445421Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.15173","last_updated":"2026-07-16T16:22:16Z","snapshot_observed_at":"2026-08-14T07:42:57.106488Z","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":10,"source":"arxiv_source","source_observed_at":"2026-08-02T00:02:19.445421Z"},"links":{"cited_paper":"/paper/1406.2572","citing_paper":"/paper/2607.15173"},"observation_digest":"sha256:149c5560d50e5bdde53746cef4425d13b08a2ff779c348fb4b7bd5831c49c30b","observation_id":"37a78db8-545f-431d-8ec0-affc53cba368","resolution":{"observed_at":"2026-08-02T00:02:19.445421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1406.2572/citation-record","integrity":"/paper/1406.2572/integrity","json":"/paper/1406.2572/citation-record.json","paper":"/paper/1406.2572"},"outbound":[],"paper":{"arxiv_id":"1406.2572","last_updated":"2014-06-10T14:52:14Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T23:30:53.901574Z","submitted_at":"2014-06-10T14:52:14Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization"},"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 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:1406.2572."}