{"as_of":"2026-08-11T11:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73f8b5cb27902bc8c3e7f228a243d849fc5eab4a9494e74e1d6329368a7eefa8","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-11T06:34:44.6726+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-02T02:28:38.844152Z","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-04T14:49:54.831935Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","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":175,"source":"arxiv_source","source_observed_at":"2026-05-21T10:30:58.601351Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2003.00295"},"observation_digest":"sha256:58b368e5a6c9d0ea589fc8eb9ddb2e8216a8c794e9ddf60798197111f092f385","observation_id":"aa9850bc-4567-4dd4-8add-b0bff135a34c","resolution":{"observed_at":"2026-05-21T10:30:58.910995Z","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","year":2017},"citing_paper":{"arxiv_id":"2401.01335","last_updated":"2024-06-14T21:17:17Z","snapshot_observed_at":"2026-08-10T05:25:44.328250Z","submitted_at":"2024-01-02T18:53:13Z","title":"Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models","version":3},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-14T23:00:20.720030Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2401.01335"},"observation_digest":"sha256:e5f7628b25d9b478e7a26b4de8d42d6de3d3aff85e69dd8229c223c270a44604","observation_id":"6ea716f9-7589-474c-a234-2b48c74d34bb","resolution":{"observed_at":"2026-05-14T23:00:21.312793Z","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","year":2017},"citing_paper":{"arxiv_id":"2605.01288","last_updated":"2026-06-23T15:11:40Z","snapshot_observed_at":"2026-07-06T23:14:33.653260Z","submitted_at":"2026-05-02T06:55:15Z","title":"A Theory of Saddle Escape in Deep Nonlinear Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-09T14:54:47.763122Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2605.01288"},"observation_digest":"sha256:b5840a323e1420dcfe5bdf8e67629e7239e1084816bffba18f731dad5941ce57","observation_id":"036daa23-8033-43f8-96e3-988c9a57e8b5","resolution":{"observed_at":"2026-05-11T16:51:05.647634Z","resolver_source":"arxiv_id","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","year":2017},"citing_paper":{"arxiv_id":"2605.01288","last_updated":"2026-06-23T15:11:40Z","snapshot_observed_at":"2026-07-06T23:14:33.653260Z","submitted_at":"2026-05-02T06:55:15Z","title":"A Theory of Saddle Escape in Deep Nonlinear Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-11T02:22:38.751375Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2605.01288"},"observation_digest":"sha256:f577e061feaf1c6ec62254146c4e85f607d1f744b2343323d287f36510805cfe","observation_id":"97eafa7e-df38-48e6-a2b0-41497f686d0c","resolution":{"observed_at":"2026-05-11T02:25:54.537896Z","resolver_source":"arxiv_id","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","year":2017},"citing_paper":{"arxiv_id":"2605.01288","last_updated":"2026-06-23T15:11:40Z","snapshot_observed_at":"2026-07-06T23:14:33.653260Z","submitted_at":"2026-05-02T06:55:15Z","title":"A Theory of Saddle Escape in Deep Nonlinear Networks","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-01T00:37:16.364388Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2605.01288"},"observation_digest":"sha256:76ea73dbd54dae716db34edf97ca3902e676173f0bd8263661cee31460fe9bb0","observation_id":"59aa1c52-9235-4796-a26a-79c30a1481c1","resolution":{"observed_at":"2026-07-01T00:45:12.060298Z","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","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":14,"source":"pdf_text","source_observed_at":"2026-05-12T04:38:25.480020Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2605.09331"},"observation_digest":"sha256:a1407ef5e468e78873f1733dde1692cfabe3be26aca2ae7e542c586a0ae19fca","observation_id":"16620d68-01b8-46f6-8c52-e69ab571c383","resolution":{"observed_at":"2026-05-12T06:01:26.483521Z","resolver_source":"arxiv_id","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","year":2017},"citing_paper":{"arxiv_id":"2606.10089","last_updated":"2026-06-08T19:16:32Z","snapshot_observed_at":"2026-08-02T05:36:24.589418Z","submitted_at":"2026-06-08T19:16:32Z","title":"A Theory on Flow Matching with Neural Networks","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-06-27T16:59:34.084575Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2606.10089"},"observation_digest":"sha256:422accbcf95cadc3a7edfaf67890a1446251c7c82eaff45b3c485014c3525b6b","observation_id":"1bda443e-862e-4546-baed-207947231d5b","resolution":{"observed_at":"2026-07-03T00:57:29.402750Z","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","year":2017},"citing_paper":{"arxiv_id":"2606.20299","last_updated":"2026-07-01T14:03:37Z","snapshot_observed_at":"2026-08-09T16:51:41.612467Z","submitted_at":"2026-06-18T14:35:53Z","title":"Statistical Properties of Training & Generalization","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-06-26T15:35:51.654392Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2606.20299"},"observation_digest":"sha256:ba9d7516c7880ade11bfefec5e3ab4fb476adb66cd2974b44045c7d2e7b7ad0c","observation_id":"e7c79051-c2e8-4de1-bebe-1144e28de3b6","resolution":{"observed_at":"2026-07-04T05:39:40.942565Z","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","year":2017},"citing_paper":{"arxiv_id":"2606.20299","last_updated":"2026-07-01T14:03:37Z","snapshot_observed_at":"2026-08-09T16:51:41.612467Z","submitted_at":"2026-06-18T14:35:53Z","title":"Statistical Properties of Training & Generalization","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-02T21:51:13.457071Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2606.20299"},"observation_digest":"sha256:71e8a345d3442e8a9cfd9fe6866920c9b2b0f64311ff1bb4dd2981033a97494b","observation_id":"9f65270f-0099-4246-a4e0-aca4444fc396","resolution":{"observed_at":"2026-07-02T21:57:25.621888Z","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":"1703.00887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-07-04T14:49:54.831935Z","title":"How to Escape Saddle Points Efficiently","venue":"cs.LG","work_id":"ae5d890b-373d-496d-83d3-15c57e63af9c","year":2017},"citing_paper":{"arxiv_id":"2606.27142","last_updated":"2026-06-25T15:15:59Z","snapshot_observed_at":"2026-08-04T00:00:21.065840Z","submitted_at":"2026-06-25T15:15:59Z","title":"Estimation of High Dimensional Bounded Discrete Graphical Models via Regularized Generalized Score Matching","version":1},"reference_index":220,"source":"arxiv_source","source_observed_at":"2026-06-26T02:36:28.490582Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2606.27142"},"observation_digest":"sha256:a597a2d139d2193f15e3a8532eb3b8097beec5a424cdea32e97321448c35e9a6","observation_id":"50e00349-e7da-48c7-a65f-b07fda0fcc05","resolution":{"observed_at":"2026-07-04T14:49:54.833435Z","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":"1703.00887","last_updated":"2017-03-02T18:35:24Z","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.00887","snapshot_observed_at":"2026-08-02T02:28:38.844152Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14361","last_updated":"2026-07-15T20:53:51Z","snapshot_observed_at":"2026-08-09T14:16:45.538971Z","submitted_at":"2026-07-15T20:53:51Z","title":"NeuralChaos: Optimal Adapted Approximation of Square Integrable Predictable Processes","version":1},"reference_index":182,"source":"arxiv_source","source_observed_at":"2026-08-02T02:28:38.844152Z"},"links":{"cited_paper":"/paper/1703.00887","citing_paper":"/paper/2607.14361"},"observation_digest":"sha256:18180f1eeea2236e2c023f02d02f04a55ea4d7dc3f56134bab32c12a64b51a1e","observation_id":"2bb6deb3-3d9a-4e71-9590-c304a950d3b1","resolution":{"observed_at":"2026-08-02T02:28:38.844152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1703.00887/citation-record","integrity":"/paper/1703.00887/integrity","json":"/paper/1703.00887/citation-record.json","paper":"/paper/1703.00887"},"outbound":[],"paper":{"arxiv_id":"1703.00887","last_updated":"2017-03-02T18:35:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T05:32:08.391642Z","submitted_at":"2017-03-02T18:35:24Z","title":"How to Escape Saddle Points Efficiently"},"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 11 inbound Pith citation observations for arXiv:1703.00887."}