{"as_of":"2026-08-08T21:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ed5ed590e2052a4e335bd2ce44608047c53862d0e49ae6730b616ab817c782d","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:25.529700Z","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-05-23T02:55:19.446867Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.07881","last_updated":"2024-11-06T16:30:40Z","snapshot_observed_at":"2026-07-06T17:58:56.081219Z","submitted_at":"2024-04-11T16:10:52Z","title":"Fourier Analysis of Iterative Algorithms","version":2},"cited_work":{"arxiv_id":"2404.07881","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.07881","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fourier analysis of iterative algorithms","venue":null,"work_id":"817744c4-1047-4f7d-96db-4e1015e90886","year":null},"citing_paper":{"arxiv_id":"2502.14407","last_updated":"2026-05-14T17:03:15Z","snapshot_observed_at":"2026-07-06T20:39:43.403470Z","submitted_at":"2025-02-20T09:48:26Z","title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T02:54:16.701096Z"},"links":{"cited_paper":"/paper/2404.07881","citing_paper":"/paper/2502.14407"},"observation_digest":"sha256:696d46278266bfc202c23a35b1376458a75cde35310b2747c99f17367539bf94","observation_id":"9f88eaf6-be85-4bd4-9bfc-6d67468bd78b","resolution":{"observed_at":"2026-05-23T02:55:19.449070Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07881","last_updated":"2024-11-06T16:30:40Z","snapshot_observed_at":"2026-07-06T17:58:56.081219Z","submitted_at":"2024-04-11T16:10:52Z","title":"Fourier Analysis of Iterative Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07881","snapshot_observed_at":"2026-08-07T04:24:25.529700Z","title":"Fourier analysis of iterative algorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","snapshot_observed_at":"2026-08-07T21:46:25.184559Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.529700Z"},"links":{"cited_paper":"/paper/2404.07881","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:8009203f2fd52fd9792d4819824c2d34d333a9b677680ea9e7bd300dd7d25d51","observation_id":"92f86025-bb2b-45db-83e7-1c1f679b1569","resolution":{"observed_at":"2026-08-07T04:24:25.529700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07881","last_updated":"2024-11-06T16:30:40Z","snapshot_observed_at":"2026-07-06T17:58:56.081219Z","submitted_at":"2024-04-11T16:10:52Z","title":"Fourier Analysis of Iterative Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07881","snapshot_observed_at":"2026-08-06T22:07:34.493763Z","title":"Fourier analysis of iterative algorithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23010","last_updated":"2025-06-28T20:48:56Z","snapshot_observed_at":"2026-08-08T10:49:06.781060Z","submitted_at":"2025-06-28T20:48:56Z","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:34.493763Z"},"links":{"cited_paper":"/paper/2404.07881","citing_paper":"/paper/2506.23010"},"observation_digest":"sha256:de797918647946704cf68010f3d9ea12e74864a50c123bb05c6d0b6c0abcfbeb","observation_id":"a724ea45-f3da-4294-a478-68d482ea6329","resolution":{"observed_at":"2026-08-06T22:07:34.493763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.07881/citation-record","integrity":"/paper/2404.07881/integrity","json":"/paper/2404.07881/citation-record.json","paper":"/paper/2404.07881"},"outbound":[],"paper":{"arxiv_id":"2404.07881","last_updated":"2024-11-06T16:30:40Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T17:58:56.081219Z","submitted_at":"2024-04-11T16:10:52Z","title":"Fourier Analysis of Iterative Algorithms"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2404.07881."}