{"as_of":"2026-08-09T09:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b10f7b9096ca98a2a7810c3d6f25cb7741e59c5323e8a62a975f261e706eb16d","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-09T06:31:02.800959+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-08T15:34:16.663507Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T17:37:13.926051Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.03220","last_updated":"2024-06-30T17:01:45Z","snapshot_observed_at":"2026-08-08T07:14:14.108661Z","submitted_at":"2024-02-05T17:30:42Z","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03220","snapshot_observed_at":"2026-08-08T15:34:16.663507Z","title":"The benefits of reusing batches for gradient descent in two-layer networks: Breaking the curse of information and leap exponents","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06443","last_updated":"2025-07-21T10:48:50Z","snapshot_observed_at":"2026-08-08T15:22:58.731880Z","submitted_at":"2025-02-10T13:19:30Z","title":"Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T15:34:16.663507Z"},"links":{"cited_paper":"/paper/2402.03220","citing_paper":"/paper/2502.06443"},"observation_digest":"sha256:0cac3b91beff103f911b6fccabc1b4c03911f3621e73077c28a37e370ef7b035","observation_id":"ee8bc199-455b-4a47-835c-df4c2a974aed","resolution":{"observed_at":"2026-08-08T15:34:16.663507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03220","last_updated":"2024-06-30T17:01:45Z","snapshot_observed_at":"2026-08-08T07:14:14.108661Z","submitted_at":"2024-02-05T17:30:42Z","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","version":3},"cited_work":{"arxiv_id":"2402.03220","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03220","snapshot_observed_at":"2026-07-02T17:37:13.926051Z","title":"arXiv preprint arXiv:2402.03220 , year=","venue":null,"work_id":"1a291a28-5999-42d9-9586-214afe16933d","year":2024},"citing_paper":{"arxiv_id":"2604.21691","last_updated":"2026-04-23T13:58:12Z","snapshot_observed_at":"2026-08-02T12:48:50.592713Z","submitted_at":"2026-04-23T13:58:12Z","title":"There Will Be a Scientific Theory of Deep Learning","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-09T20:11:17.616190Z"},"links":{"cited_paper":"/paper/2402.03220","citing_paper":"/paper/2604.21691"},"observation_digest":"sha256:6d7662e1dd5605d2b56575a67e9f8f95d34151d44b69dc5270f8eb1b8162d072","observation_id":"c6528430-18f8-46cb-a05c-c2d52ca77cd2","resolution":{"observed_at":"2026-05-11T15:21:09.292502Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03220","last_updated":"2024-06-30T17:01:45Z","snapshot_observed_at":"2026-08-08T07:14:14.108661Z","submitted_at":"2024-02-05T17:30:42Z","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","version":3},"cited_work":{"arxiv_id":"2402.03220","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03220","snapshot_observed_at":"2026-07-02T17:37:13.926051Z","title":"arXiv preprint arXiv:2402.03220 , year=","venue":null,"work_id":"1a291a28-5999-42d9-9586-214afe16933d","year":2024},"citing_paper":{"arxiv_id":"2605.10237","last_updated":"2026-05-11T09:11:20Z","snapshot_observed_at":"2026-07-06T23:22:13.774652Z","submitted_at":"2026-05-11T09:11:20Z","title":"The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently","version":1},"reference_index":126,"source":"arxiv_source","source_observed_at":"2026-05-12T05:27:11.761971Z"},"links":{"cited_paper":"/paper/2402.03220","citing_paper":"/paper/2605.10237"},"observation_digest":"sha256:9e98acebefc27f9d08983e9b4e369719ca0a89a21e544927c265cbf17a7f4a38","observation_id":"12c77c28-e901-4be4-ab1c-8fc7d139f9a7","resolution":{"observed_at":"2026-05-12T05:31:24.313452Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03220","last_updated":"2024-06-30T17:01:45Z","snapshot_observed_at":"2026-08-08T07:14:14.108661Z","submitted_at":"2024-02-05T17:30:42Z","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","version":3},"cited_work":{"arxiv_id":"2402.03220","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03220","snapshot_observed_at":"2026-07-02T17:37:13.926051Z","title":"arXiv preprint arXiv:2402.03220 , year=","venue":null,"work_id":"1a291a28-5999-42d9-9586-214afe16933d","year":2024},"citing_paper":{"arxiv_id":"2605.14567","last_updated":"2026-05-14T08:37:28Z","snapshot_observed_at":"2026-08-03T00:46:36.800591Z","submitted_at":"2026-05-14T08:37:28Z","title":"Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model","version":1},"reference_index":168,"source":"arxiv_source","source_observed_at":"2026-05-15T01:39:21.733359Z"},"links":{"cited_paper":"/paper/2402.03220","citing_paper":"/paper/2605.14567"},"observation_digest":"sha256:6ec93318f19618f7af44b660e4519be4a4f35ca157a400d86e900306fdb8028f","observation_id":"6dded3bc-1a6e-4a16-a286-4d1a550d8787","resolution":{"observed_at":"2026-05-15T01:39:38.364520Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03220","last_updated":"2024-06-30T17:01:45Z","snapshot_observed_at":"2026-08-08T07:14:14.108661Z","submitted_at":"2024-02-05T17:30:42Z","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","version":3},"cited_work":{"arxiv_id":"2402.03220","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03220","snapshot_observed_at":"2026-07-02T17:37:13.926051Z","title":"arXiv preprint arXiv:2402.03220 , year=","venue":null,"work_id":"1a291a28-5999-42d9-9586-214afe16933d","year":2024},"citing_paper":{"arxiv_id":"2607.00207","last_updated":"2026-06-30T21:38:10Z","snapshot_observed_at":"2026-08-07T07:17:58.817162Z","submitted_at":"2026-06-30T21:38:10Z","title":"Homogenization of $\\ell_2$-Adversarial Training in High-Dimensions: Exact Dynamics under Stochastic Gradient Descent","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-02T17:31:02.850791Z"},"links":{"cited_paper":"/paper/2402.03220","citing_paper":"/paper/2607.00207"},"observation_digest":"sha256:7e0839f6ab4aaabc1d5cc2a5cfbe34190e1c3c4ea8847a3653974ea7386b77f4","observation_id":"40d09592-5a45-439d-b35d-8828100860a1","resolution":{"observed_at":"2026-07-02T17:37:13.927921Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03220","last_updated":"2024-06-30T17:01:45Z","snapshot_observed_at":"2026-08-08T07:14:14.108661Z","submitted_at":"2024-02-05T17:30:42Z","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03220","snapshot_observed_at":"2026-08-01T20:07:09.528204Z","title":"arXiv preprint arXiv:2402.03220 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16761","last_updated":"2026-07-18T10:57:27Z","snapshot_observed_at":"2026-08-08T21:46:27.170281Z","submitted_at":"2026-07-18T10:57:27Z","title":"Dropout and Random Gradient Masking Are Asymptotically Equivalent in Large ResNets","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T20:07:09.528204Z"},"links":{"cited_paper":"/paper/2402.03220","citing_paper":"/paper/2607.16761"},"observation_digest":"sha256:da85de7673331cac94c3fd6a26383f8a75a2f3025467f2930a4b9026eaeaea5e","observation_id":"6e911876-1422-407c-9f65-5361d10257ef","resolution":{"observed_at":"2026-08-01T20:07:09.528204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03220","last_updated":"2024-06-30T17:01:45Z","snapshot_observed_at":"2026-08-08T07:14:14.108661Z","submitted_at":"2024-02-05T17:30:42Z","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03220","snapshot_observed_at":"2026-08-04T23:35:23.506017Z","title":"arXiv preprint arXiv:2402.03220 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01654","last_updated":"2026-08-03T03:44:13Z","snapshot_observed_at":"2026-08-07T16:35:33.631222Z","submitted_at":"2026-08-03T03:44:13Z","title":"Approximate Message Passing with Random Initialization for Phase Retrieval","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T23:35:23.506017Z"},"links":{"cited_paper":"/paper/2402.03220","citing_paper":"/paper/2608.01654"},"observation_digest":"sha256:7f65cddbe5f8d3b12c9cb4809ec3b5d06ed3a90251bb48f6e4d5a6fceadd88f9","observation_id":"98fecdb2-25f1-4f92-9eff-bad4329db4df","resolution":{"observed_at":"2026-08-04T23:35:23.506017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.03220/citation-record","integrity":"/paper/2402.03220/integrity","json":"/paper/2402.03220/citation-record.json","paper":"/paper/2402.03220"},"outbound":[],"paper":{"arxiv_id":"2402.03220","last_updated":"2024-06-30T17:01:45Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-08T07:14:14.108661Z","submitted_at":"2024-02-05T17:30:42Z","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2402.03220."}