{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q3C3IGMEOHL7P3SQI26MF4IS4L","short_pith_number":"pith:Q3C3IGME","schema_version":"1.0","canonical_sha256":"86c5b4198471d7f7ee5046bcc2f112e2eb3ebdd45caec29178aacead3f3163eb","source":{"kind":"arxiv","id":"2404.07881","version":2},"attestation_state":"computed","paper":{"title":"Fourier Analysis of Iterative Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Chris Jones, Lucas Pesenti","submitted_at":"2024-04-11T16:10:52Z","abstract_excerpt":"We study a general class of nonlinear iterative algorithms which includes power iteration, belief propagation and approximate message passing, and many forms of gradient descent. When the input is a random matrix with i.i.d. entries, we use Boolean Fourier analysis to analyze these algorithms as low-degree polynomials in the entries of the input matrix. Each symmetrized Fourier character represents all monomials with a certain shape as specified by a small graph, which we call a Fourier diagram.\n  We prove fundamental asymptotic properties of the Fourier diagrams: over the randomness of the in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2404.07881","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-04-11T16:10:52Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"f0cbede066ef8dad8f858d93c82e7de8569c1c327db3553a6e899a83ebfefe4b","abstract_canon_sha256":"5c4db0e139411cd41595441ed60449a039a8dd82b65d6ae8b0e9862ba2a9da3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:45.080902Z","signature_b64":"uRSvK12wrB6LNMjbLYP5pLenKUA2DA/wSB9MtJZlG/HE1ZoQPpWeD3a/kNQEr/guJ0OEPMczYq4GpM+2ETQtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86c5b4198471d7f7ee5046bcc2f112e2eb3ebdd45caec29178aacead3f3163eb","last_reissued_at":"2026-07-05T09:31:45.080406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:45.080406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fourier Analysis of Iterative Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Chris Jones, Lucas Pesenti","submitted_at":"2024-04-11T16:10:52Z","abstract_excerpt":"We study a general class of nonlinear iterative algorithms which includes power iteration, belief propagation and approximate message passing, and many forms of gradient descent. When the input is a random matrix with i.i.d. entries, we use Boolean Fourier analysis to analyze these algorithms as low-degree polynomials in the entries of the input matrix. Each symmetrized Fourier character represents all monomials with a certain shape as specified by a small graph, which we call a Fourier diagram.\n  We prove fundamental asymptotic properties of the Fourier diagrams: over the randomness of the in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07881","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.07881/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.07881","created_at":"2026-07-05T09:31:45.080463+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.07881v2","created_at":"2026-07-05T09:31:45.080463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07881","created_at":"2026-07-05T09:31:45.080463+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3C3IGMEOHL7","created_at":"2026-07-05T09:31:45.080463+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3C3IGMEOHL7P3SQ","created_at":"2026-07-05T09:31:45.080463+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3C3IGME","created_at":"2026-07-05T09:31:45.080463+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.14407","citing_title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L","json":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L.json","graph_json":"https://pith.science/api/pith-number/Q3C3IGMEOHL7P3SQI26MF4IS4L/graph.json","events_json":"https://pith.science/api/pith-number/Q3C3IGMEOHL7P3SQI26MF4IS4L/events.json","paper":"https://pith.science/paper/Q3C3IGME"},"agent_actions":{"view_html":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L","download_json":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L.json","view_paper":"https://pith.science/paper/Q3C3IGME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.07881&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3C3IGMEOHL7P3SQI26MF4IS4L/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3C3IGMEOHL7P3SQI26MF4IS4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/action/storage_attestation","attest_author":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/action/author_attestation","sign_citation":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/action/citation_signature","submit_replication":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/action/replication_record"}},"created_at":"2026-07-05T09:31:45.080463+00:00","updated_at":"2026-07-05T09:31:45.080463+00:00"}