{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WRACZZEPEUD57AQ6YLQTJ4LQ3G","short_pith_number":"pith:WRACZZEP","schema_version":"1.0","canonical_sha256":"b4402ce48f2507df821ec2e134f170d9adfb6f03ea05e7d1c044d64545c1191d","source":{"kind":"arxiv","id":"2203.11795","version":2},"attestation_state":"computed","paper":{"title":"Minimizing communication in the multidimensional FFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Rob H. Bisseling, Thomas Koopman","submitted_at":"2022-03-22T15:01:35Z","abstract_excerpt":"We present a parallel algorithm for the fast Fourier transform (FFT) in higher dimensions. This algorithm generalizes the cyclic-to-cyclic one-dimensional parallel algorithm to a cyclic-to-cyclic multidimensional parallel algorithm while retaining the property of needing only a single all-to-all communication step. This is under the constraint that we use at most $\\sqrt{N}$ processors for an FFT on an array with a total of $N$ elements, irrespective of the dimension $d$ or the shape of the array. The only assumption we make is that $N$ is sufficiently composite. Our algorithm starts and ends i"},"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":"2203.11795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-03-22T15:01:35Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"ba6147f332095054e46727990922e9cee083b5544415978b121cbdb89a29548a","abstract_canon_sha256":"ae30d557e422fb38c17c7b608d116ef5176f28e23ff65148c9a8356d1dbc9270"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:12.381174Z","signature_b64":"Vy2TN0swraI0b0S1hpHMIANTdD1lvGYbuxtxwkv/Xpp4IqwnNbjQw0F0WRgt2fdeL6fPdXykgv3tUc8WvVeIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4402ce48f2507df821ec2e134f170d9adfb6f03ea05e7d1c044d64545c1191d","last_reissued_at":"2026-07-05T07:22:12.380681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:12.380681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing communication in the multidimensional FFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Rob H. Bisseling, Thomas Koopman","submitted_at":"2022-03-22T15:01:35Z","abstract_excerpt":"We present a parallel algorithm for the fast Fourier transform (FFT) in higher dimensions. This algorithm generalizes the cyclic-to-cyclic one-dimensional parallel algorithm to a cyclic-to-cyclic multidimensional parallel algorithm while retaining the property of needing only a single all-to-all communication step. This is under the constraint that we use at most $\\sqrt{N}$ processors for an FFT on an array with a total of $N$ elements, irrespective of the dimension $d$ or the shape of the array. The only assumption we make is that $N$ is sufficiently composite. Our algorithm starts and ends i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.11795","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/2203.11795/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":"2203.11795","created_at":"2026-07-05T07:22:12.380741+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.11795v2","created_at":"2026-07-05T07:22:12.380741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.11795","created_at":"2026-07-05T07:22:12.380741+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRACZZEPEUD5","created_at":"2026-07-05T07:22:12.380741+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRACZZEPEUD57AQ6","created_at":"2026-07-05T07:22:12.380741+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRACZZEP","created_at":"2026-07-05T07:22:12.380741+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.10809","citing_title":"A Quantum Algorithm for Solving the Poisson Equation for Free Field Conditions via the Hockney Method","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G","json":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G.json","graph_json":"https://pith.science/api/pith-number/WRACZZEPEUD57AQ6YLQTJ4LQ3G/graph.json","events_json":"https://pith.science/api/pith-number/WRACZZEPEUD57AQ6YLQTJ4LQ3G/events.json","paper":"https://pith.science/paper/WRACZZEP"},"agent_actions":{"view_html":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G","download_json":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G.json","view_paper":"https://pith.science/paper/WRACZZEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.11795&json=true","fetch_graph":"https://pith.science/api/pith-number/WRACZZEPEUD57AQ6YLQTJ4LQ3G/graph.json","fetch_events":"https://pith.science/api/pith-number/WRACZZEPEUD57AQ6YLQTJ4LQ3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G/action/storage_attestation","attest_author":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G/action/author_attestation","sign_citation":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G/action/citation_signature","submit_replication":"https://pith.science/pith/WRACZZEPEUD57AQ6YLQTJ4LQ3G/action/replication_record"}},"created_at":"2026-07-05T07:22:12.380741+00:00","updated_at":"2026-07-05T07:22:12.380741+00:00"}