Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Fourier Analysis of Iterative Algorithms
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2404.07881.
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-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T04:24:25.529700Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-23T02:55:19.446867Z
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 9f88eaf6-be85-4bd4-9bfc-6d67468bd78b · inbound
Sharp Phase Transitions in Estimation with Low-Degree Polynomials cites this paper.
Sharp Phase Transitions in Estimation with Low-Degree Polynomials Fourier Analysis of Iterative Algorithms
Reference 15
- Resolution
- verified exact
- arxiv_id, observed 2026-05-23T02:55:19.449070Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 92f86025-bb2b-45db-83e7-1c1f679b1569 · inbound
Computational Complexity of Statistics: New Insights from Low-Degree Polynomials cites this paper.
Computational Complexity of Statistics: New Insights from Low-Degree Polynomials Fourier Analysis of Iterative Algorithms
Reference 2000
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T04:24:25.529700Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a724ea45-f3da-4294-a478-68d482ea6329 · inbound
On Universality of Non-Separable Approximate Message Passing Algorithms cites this paper.
On Universality of Non-Separable Approximate Message Passing Algorithms Fourier Analysis of Iterative Algorithms
Reference 41
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T22:07:34.493763Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.