Paper Citation Record · LEDGER

Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2406.01581.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2406.01581 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 10 of 10 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 10 of 10 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T21:30:12.146543Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-02T07:16:44.862552Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 40e645d6-3180-42c6-a629-ee3f7b11904d · inbound

Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergence cites this paper.

Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergence Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-12T21:30:12.146543Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46b1291d-4438-479e-b491-2bcb17b39e67 · inbound

Gradient dynamics for low-rank fine-tuning beyond kernels cites this paper.

Gradient dynamics for low-rank fine-tuning beyond kernels Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-12T14:29:43.130174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 638f79d4-8bae-43f4-bdec-332d173104f6 · inbound

Learning Hierarchical Polynomials of Multiple Nonlinear Features with Three-Layer Networks cites this paper.

Learning Hierarchical Polynomials of Multiple Nonlinear Features with Three-Layer Networks Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-12T12:32:48.010740Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d5f299b4-cfd9-48f4-be49-93cf771f32a7 · inbound

Improving the Convergence Rates of Forward Gradient Descent with Repeated Sampling cites this paper.

Improving the Convergence Rates of Forward Gradient Descent with Repeated Sampling Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-12T12:08:31.468606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a46ccb1-c848-4c3b-ae50-394da2df9736 · inbound

On The Concurrence of Layer-wise Preconditioning Methods and Provable Feature Learning cites this paper.

On The Concurrence of Layer-wise Preconditioning Methods and Provable Feature Learning Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-09T14:47:40.617364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 048d95b9-6d3e-4161-a529-51d4dcb91ca0 · inbound

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions cites this paper.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.709105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ac3e478-bbe8-4e5c-94d3-040fe6c75369 · inbound

Scaling Law for Stochastic Gradient Descent in Quadratically Parameterized Linear Regression cites this paper.

Scaling Law for Stochastic Gradient Descent in Quadratically Parameterized Linear Regression Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-07T22:45:01.842552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 04466d28-ac93-4a25-9643-a50a0d8111c9 · inbound

Limitations of SGD for Multi-Index Models Beyond Statistical Queries cites this paper.

Limitations of SGD for Multi-Index Models Beyond Statistical Queries Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-03T04:19:45.403757Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 81736fd2-a0ce-485c-a613-435705b9efb8 · inbound

The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently cites this paper.

The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 125

Resolution: verified exact; arxiv_id, observed 2026-05-12T05:31:24.303352Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation aba5695e-beb9-4e0d-85fa-025b9a9eb587 · inbound

When Both Layers Learn: Training Dynamics of Representing Linear Models via ReLU Networks cites this paper.

When Both Layers Learn: Training Dynamics of Representing Linear Models via ReLU Networks Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 26

Resolution: verified exact; arxiv_id, observed 2026-07-02T07:16:44.864272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.