{"as_of":"2026-08-23T14:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:017319b17ded23d762bb49385d47a989369209132a53285dcbf372ec165ff73d","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:35:42.849130Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":3,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.11055","last_updated":"2023-08-31T21:09:03Z","snapshot_observed_at":"2026-08-19T17:25:19.071612Z","submitted_at":"2023-02-21T23:16:23Z","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11055","snapshot_observed_at":"2026-08-06T20:35:42.849130Z","title":"Sgd learning on neural networks: leap complexity and saddle-to-saddle dynamics","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.02550","last_updated":"2025-07-03T11:49:56Z","snapshot_observed_at":"2026-08-19T17:25:30.503019Z","submitted_at":"2025-07-03T11:49:56Z","title":"Position: A Theory of Deep Learning Must Include Compositional Sparsity","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T20:35:42.849130Z"},"links":{"cited_paper":"/paper/2302.11055","citing_paper":"/paper/2507.02550"},"observation_digest":"sha256:ce5ac19643351c21375b024beb1a2768f5ac38ba8232dad7034a9d755a01ba18","observation_id":"eb208633-a54a-4dbe-b5a0-c6fa7cffcaa3","resolution":{"observed_at":"2026-08-06T20:35:42.849130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11055","last_updated":"2023-08-31T21:09:03Z","snapshot_observed_at":"2026-08-19T17:25:19.071612Z","submitted_at":"2023-02-21T23:16:23Z","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11055","snapshot_observed_at":"2026-08-02T19:04:55.583204Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.03993","last_updated":"2026-06-04T09:24:00Z","snapshot_observed_at":"2026-08-20T22:36:55.506994Z","submitted_at":"2026-03-04T12:37:08Z","title":"Specialization of softmax attention heads: insights from the high-dimensional single-location model","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T19:04:55.583204Z"},"links":{"cited_paper":"/paper/2302.11055","citing_paper":"/paper/2603.03993"},"observation_digest":"sha256:2a244077ec31a422cf2b8af6a2397d2cee4597bbd2686aba4f3191bbdcb56216","observation_id":"1251d8b0-1494-4604-9e75-5d4e6328b0b9","resolution":{"observed_at":"2026-08-02T19:04:55.583204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11055","last_updated":"2023-08-31T21:09:03Z","snapshot_observed_at":"2026-08-19T17:25:19.071612Z","submitted_at":"2023-02-21T23:16:23Z","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","version":2},"cited_work":{"arxiv_id":"2302.11055","doi":"10.48550/arxiv.2302.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Annual Conference Computational Learning Theory , year =","venue":"arXiv (Cornell University)","work_id":"484eb3e5-1222-4efb-a889-2f7bbfab9c28","year":2023},"citing_paper":{"arxiv_id":"2605.01288","last_updated":"2026-06-23T15:11:40Z","snapshot_observed_at":"2026-08-17T00:03:03.220431Z","submitted_at":"2026-05-02T06:55:15Z","title":"A Theory of Saddle Escape in Deep Nonlinear Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-09T14:54:47.763122Z"},"links":{"cited_paper":"/paper/2302.11055","citing_paper":"/paper/2605.01288"},"observation_digest":"sha256:b108fe5a7659495eaf53642c20abd722314e29455891c984943467b8ccb10008","observation_id":"8886210f-082c-4110-af98-023ae346682c","resolution":{"observed_at":"2026-05-11T16:51:05.773020Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11055","last_updated":"2023-08-31T21:09:03Z","snapshot_observed_at":"2026-08-19T17:25:19.071612Z","submitted_at":"2023-02-21T23:16:23Z","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","version":2},"cited_work":{"arxiv_id":"2302.11055","doi":"10.48550/arxiv.2302.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Annual Conference Computational Learning Theory , year =","venue":"arXiv (Cornell University)","work_id":"484eb3e5-1222-4efb-a889-2f7bbfab9c28","year":2023},"citing_paper":{"arxiv_id":"2605.01288","last_updated":"2026-06-23T15:11:40Z","snapshot_observed_at":"2026-08-17T00:03:03.220431Z","submitted_at":"2026-05-02T06:55:15Z","title":"A Theory of Saddle Escape in Deep Nonlinear Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-11T02:22:38.751375Z"},"links":{"cited_paper":"/paper/2302.11055","citing_paper":"/paper/2605.01288"},"observation_digest":"sha256:f19a1e0b5801284fe605f2eef43f6d17e2c0973e14f9bc8e47ac6f45c2bb18b1","observation_id":"152badbb-0171-4505-9261-a0419964ce1a","resolution":{"observed_at":"2026-05-11T02:25:54.658739Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11055","last_updated":"2023-08-31T21:09:03Z","snapshot_observed_at":"2026-08-19T17:25:19.071612Z","submitted_at":"2023-02-21T23:16:23Z","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","version":2},"cited_work":{"arxiv_id":"2302.11055","doi":"10.48550/arxiv.2302.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Annual Conference Computational Learning Theory , year =","venue":"arXiv (Cornell University)","work_id":"484eb3e5-1222-4efb-a889-2f7bbfab9c28","year":2023},"citing_paper":{"arxiv_id":"2605.01288","last_updated":"2026-06-23T15:11:40Z","snapshot_observed_at":"2026-08-17T00:03:03.220431Z","submitted_at":"2026-05-02T06:55:15Z","title":"A Theory of Saddle Escape in Deep Nonlinear Networks","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-01T00:37:16.364388Z"},"links":{"cited_paper":"/paper/2302.11055","citing_paper":"/paper/2605.01288"},"observation_digest":"sha256:8977bef664310f18e3177814b5a53a366e68b1319a536b3b73655dff2e4cb695","observation_id":"b4877d7b-5747-4e2c-8928-5d4241e4b2f9","resolution":{"observed_at":"2026-07-01T00:45:12.044341Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11055","last_updated":"2023-08-31T21:09:03Z","snapshot_observed_at":"2026-08-19T17:25:19.071612Z","submitted_at":"2023-02-21T23:16:23Z","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","version":2},"cited_work":{"arxiv_id":"2302.11055","doi":"10.48550/arxiv.2302.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Annual Conference Computational Learning Theory , year =","venue":"arXiv (Cornell University)","work_id":"484eb3e5-1222-4efb-a889-2f7bbfab9c28","year":2023},"citing_paper":{"arxiv_id":"2605.10019","last_updated":"2026-05-11T05:44:18Z","snapshot_observed_at":"2026-08-16T08:48:37.559402Z","submitted_at":"2026-05-11T05:44:18Z","title":"The two clocks and the innovation window: When and how generative models learn rules","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-12T03:15:45.257213Z"},"links":{"cited_paper":"/paper/2302.11055","citing_paper":"/paper/2605.10019"},"observation_digest":"sha256:4f9411c322140feadd7440d32cfc0ead8e360b1e82986655e97fee8d06787fbd","observation_id":"58fa1deb-52f8-45c1-95b3-a2c3783541e8","resolution":{"observed_at":"2026-05-12T03:16:18.051877Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11055","last_updated":"2023-08-31T21:09:03Z","snapshot_observed_at":"2026-08-19T17:25:19.071612Z","submitted_at":"2023-02-21T23:16:23Z","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","version":2},"cited_work":{"arxiv_id":"2302.11055","doi":"10.48550/arxiv.2302.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Annual Conference Computational Learning Theory , year =","venue":"arXiv (Cornell University)","work_id":"484eb3e5-1222-4efb-a889-2f7bbfab9c28","year":2023},"citing_paper":{"arxiv_id":"2605.20314","last_updated":"2026-05-19T17:28:20Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-19T17:28:20Z","title":"Less Data, Faster Training: repeating smaller datasets speeds up learning via sampling biases","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-21T07:16:15.549463Z"},"links":{"cited_paper":"/paper/2302.11055","citing_paper":"/paper/2605.20314"},"observation_digest":"sha256:5447e2485dd7f94f40736e47ccf71600097006999737032565608b389cd65e9b","observation_id":"7e5c82b8-4c5e-49e6-a49c-e9efcf25bdd4","resolution":{"observed_at":"2026-05-21T07:19:46.446291Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2302.11055/citation-record","integrity":"/paper/2302.11055/integrity","json":"/paper/2302.11055/citation-record.json","paper":"/paper/2302.11055"},"outbound":[],"paper":{"arxiv_id":"2302.11055","last_updated":"2023-08-31T21:09:03Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T17:25:19.071612Z","submitted_at":"2023-02-21T23:16:23Z","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2302.11055."}