{"as_of":"2026-08-09T13:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88c8acb580561d396f83b21ebd7a5c2d90f73ec8791602af7635610d3ebbfe73","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:34:16.709105Z","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-02T07:16:44.862552Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.01581","last_updated":"2024-12-22T09:59:09Z","snapshot_observed_at":"2026-08-04T02:53:19.400873Z","submitted_at":"2024-06-03T17:56:58Z","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01581","snapshot_observed_at":"2026-08-08T15:34:16.709105Z","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit","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":37,"source":"arxiv_source","source_observed_at":"2026-08-08T15:34:16.709105Z"},"links":{"cited_paper":"/paper/2406.01581","citing_paper":"/paper/2502.06443"},"observation_digest":"sha256:c4c3915e84234500a544c421106fa4aa8d69d43959855bb5e2124195631f83f4","observation_id":"048d95b9-6d3e-4161-a529-51d4dcb91ca0","resolution":{"observed_at":"2026-08-08T15:34:16.709105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01581","last_updated":"2024-12-22T09:59:09Z","snapshot_observed_at":"2026-08-04T02:53:19.400873Z","submitted_at":"2024-06-03T17:56:58Z","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01581","snapshot_observed_at":"2026-08-07T22:45:01.842552Z","title":"D., Oko, K., Suzuki, T., & Wu, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09106","last_updated":"2025-02-13T09:29:04Z","snapshot_observed_at":"2026-08-08T12:32:21.474635Z","submitted_at":"2025-02-13T09:29:04Z","title":"Scaling Law for Stochastic Gradient Descent in Quadratically Parameterized Linear Regression","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T22:45:01.842552Z"},"links":{"cited_paper":"/paper/2406.01581","citing_paper":"/paper/2502.09106"},"observation_digest":"sha256:47db5914d4675a79adfb06f7ee34fe8e3caa398a7d977f5bc4ebe11d1e900a96","observation_id":"8ac3e478-bbe8-4e5c-94d3-040fe6c75369","resolution":{"observed_at":"2026-08-07T22:45:01.842552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01581","last_updated":"2024-12-22T09:59:09Z","snapshot_observed_at":"2026-08-04T02:53:19.400873Z","submitted_at":"2024-06-03T17:56:58Z","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01581","snapshot_observed_at":"2026-08-03T04:19:45.403757Z","title":"Neural network learns low-dimensional polynomials with sgd near the information-theoretic limit","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05704","last_updated":"2026-06-24T14:40:41Z","snapshot_observed_at":"2026-08-08T21:49:05.717192Z","submitted_at":"2026-02-05T14:29:10Z","title":"Limitations of SGD for Multi-Index Models Beyond Statistical Queries","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T04:19:45.403757Z"},"links":{"cited_paper":"/paper/2406.01581","citing_paper":"/paper/2602.05704"},"observation_digest":"sha256:4918f4a6c1a252009b5cee33db40f434d104966b8ee7f68e603aa25ab639f137","observation_id":"04466d28-ac93-4a25-9643-a50a0d8111c9","resolution":{"observed_at":"2026-08-03T04:19:45.403757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01581","last_updated":"2024-12-22T09:59:09Z","snapshot_observed_at":"2026-08-04T02:53:19.400873Z","submitted_at":"2024-06-03T17:56:58Z","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit","version":2},"cited_work":{"arxiv_id":"2406.01581","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01581","snapshot_observed_at":"2026-07-02T07:16:44.862552Z","title":"arXiv preprint arXiv:2406.01581 , year=","venue":null,"work_id":"5e2e7201-43e5-4599-8ed3-6237db94f737","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":125,"source":"arxiv_source","source_observed_at":"2026-05-12T05:27:11.761971Z"},"links":{"cited_paper":"/paper/2406.01581","citing_paper":"/paper/2605.10237"},"observation_digest":"sha256:7cb1b343b6c298f4bfa2d2bd8b767fb6da99e6f08b3f96e2e1eee9fb956d89b4","observation_id":"81736fd2-a0ce-485c-a613-435705b9efb8","resolution":{"observed_at":"2026-05-12T05:31:24.303352Z","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":"2406.01581","last_updated":"2024-12-22T09:59:09Z","snapshot_observed_at":"2026-08-04T02:53:19.400873Z","submitted_at":"2024-06-03T17:56:58Z","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit","version":2},"cited_work":{"arxiv_id":"2406.01581","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01581","snapshot_observed_at":"2026-07-02T07:16:44.862552Z","title":"arXiv preprint arXiv:2406.01581 , year=","venue":null,"work_id":"5e2e7201-43e5-4599-8ed3-6237db94f737","year":2024},"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":26,"source":"pdf_text","source_observed_at":"2026-06-28T07:02:26.496063Z"},"links":{"cited_paper":"/paper/2406.01581","citing_paper":"/paper/2606.04476"},"observation_digest":"sha256:0fa8d382c81870274f34ff65b0ada60a1572d26e7f1ddb5e7cf165c20f1f0e4f","observation_id":"aba5695e-beb9-4e0d-85fa-025b9a9eb587","resolution":{"observed_at":"2026-07-02T07:16:44.864272Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2406.01581/citation-record","integrity":"/paper/2406.01581/integrity","json":"/paper/2406.01581/citation-record.json","paper":"/paper/2406.01581"},"outbound":[],"paper":{"arxiv_id":"2406.01581","last_updated":"2024-12-22T09:59:09Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T02:53:19.400873Z","submitted_at":"2024-06-03T17:56:58Z","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit"},"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 5 inbound Pith citation observations for arXiv:2406.01581."}