Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.12376.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-08T15:34:16.689515Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation a906c605-35c1-4f03-b88f-f8e075149755 · inbound
Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions cites this paper.
Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T15:34:16.689515Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4f7ed50d-293e-4833-8ed8-8895f3eb1468 · inbound
Transformers Provably Learn Sparse XOR with Polylogarithmic Parameters cites this paper.
Transformers Provably Learn Sparse XOR with Polylogarithmic Parameters Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
Reference 11
- Resolution
- verified exact
- arxiv_id, observed 2026-05-23T03:25:20.148362Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.