{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Q3C3IGMEOHL7P3SQI26MF4IS4L","short_pith_number":"pith:Q3C3IGME","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"},"canonical_sha256":"86c5b4198471d7f7ee5046bcc2f112e2eb3ebdd45caec29178aacead3f3163eb","source":{"kind":"arxiv","id":"2404.07881","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.07881","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"2404.07881v2","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07881","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"Q3C3IGMEOHL7","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"pith_short_16","alias_value":"Q3C3IGMEOHL7P3SQ","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"pith_short_8","alias_value":"Q3C3IGME","created_at":"2026-07-05T09:31:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Q3C3IGMEOHL7P3SQI26MF4IS4L","target":"record","payload":{"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"},"canonical_sha256":"86c5b4198471d7f7ee5046bcc2f112e2eb3ebdd45caec29178aacead3f3163eb","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"},"source_kind":"arxiv","source_id":"2404.07881","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CH+YaUR7U1eH8hvoGFhZbfwYJOSEFAD1/NlFckWRB9LxodftK5j//QmtBUiCFN72zyJh1nNeiUPwNreyRQ17DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:53:05.890520Z"},"content_sha256":"982c715be0dc9c63b293c20d5ab406ad53874458017262cd56ee36f4ab13b9fe","schema_version":"1.0","event_id":"sha256:982c715be0dc9c63b293c20d5ab406ad53874458017262cd56ee36f4ab13b9fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Q3C3IGMEOHL7P3SQI26MF4IS4L","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMilj6Rkf7c8BiyU31XMCRfc/hByPfITH6nTB7ih5SnpEYoNvDGLHKdxwvf5jBgggdnkoo5XdxCN+oHnBMsUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:53:05.891082Z"},"content_sha256":"ee6b0a47e5a115c117b29b857296d5f5d078867d6b62116f0cdfcba50f1cfa3a","schema_version":"1.0","event_id":"sha256:ee6b0a47e5a115c117b29b857296d5f5d078867d6b62116f0cdfcba50f1cfa3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/bundle.json","state_url":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T05:53:05Z","links":{"resolver":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L","bundle":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/bundle.json","state":"https://pith.science/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3C3IGMEOHL7P3SQI26MF4IS4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Q3C3IGMEOHL7P3SQI26MF4IS4L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5c4db0e139411cd41595441ed60449a039a8dd82b65d6ae8b0e9862ba2a9da3a","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-04-11T16:10:52Z","title_canon_sha256":"f0cbede066ef8dad8f858d93c82e7de8569c1c327db3553a6e899a83ebfefe4b"},"schema_version":"1.0","source":{"id":"2404.07881","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.07881","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"2404.07881v2","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07881","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"Q3C3IGMEOHL7","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"pith_short_16","alias_value":"Q3C3IGMEOHL7P3SQ","created_at":"2026-07-05T09:31:45Z"},{"alias_kind":"pith_short_8","alias_value":"Q3C3IGME","created_at":"2026-07-05T09:31:45Z"}],"graph_snapshots":[{"event_id":"sha256:ee6b0a47e5a115c117b29b857296d5f5d078867d6b62116f0cdfcba50f1cfa3a","target":"graph","created_at":"2026-07-05T09:31:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.07881/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chris Jones, Lucas Pesenti","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-04-11T16:10:52Z","title":"Fourier Analysis of Iterative Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07881","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:982c715be0dc9c63b293c20d5ab406ad53874458017262cd56ee36f4ab13b9fe","target":"record","created_at":"2026-07-05T09:31:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5c4db0e139411cd41595441ed60449a039a8dd82b65d6ae8b0e9862ba2a9da3a","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-04-11T16:10:52Z","title_canon_sha256":"f0cbede066ef8dad8f858d93c82e7de8569c1c327db3553a6e899a83ebfefe4b"},"schema_version":"1.0","source":{"id":"2404.07881","kind":"arxiv","version":2}},"canonical_sha256":"86c5b4198471d7f7ee5046bcc2f112e2eb3ebdd45caec29178aacead3f3163eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86c5b4198471d7f7ee5046bcc2f112e2eb3ebdd45caec29178aacead3f3163eb","first_computed_at":"2026-07-05T09:31:45.080406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:31:45.080406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uRSvK12wrB6LNMjbLYP5pLenKUA2DA/wSB9MtJZlG/HE1ZoQPpWeD3a/kNQEr/guJ0OEPMczYq4GpM+2ETQtDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:31:45.080902Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.07881","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:982c715be0dc9c63b293c20d5ab406ad53874458017262cd56ee36f4ab13b9fe","sha256:ee6b0a47e5a115c117b29b857296d5f5d078867d6b62116f0cdfcba50f1cfa3a"],"state_sha256":"2e9ea6163b807e34afbe1af9ef739fc727cbd122bd890a5203d4d4cf109414d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xiZQbyVYc4FY85wPxx9pAjsi0oZPRLZIsmFqed8rlmS5rPnI4DbGwWD66Ac4OH6FIDA7j/C7gnnBiUx/6xfcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T05:53:05.894752Z","bundle_sha256":"c1d4a5bb048632a5bd57a5d76c81db41bfb09cc4e74ca7f3bb37115fa2a094b4"}}