{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:YVYIFOAUUSI7ODKE27T7536GLD","short_pith_number":"pith:YVYIFOAU","schema_version":"1.0","canonical_sha256":"c57082b814a491f70d44d7e7feefc658e69502e62ada7e2d9f29e7666b48c2bf","source":{"kind":"arxiv","id":"hep-lat/9710060","version":1},"attestation_state":"computed","paper":{"title":"FFT for the APE Parallel Computer","license":"","headline":"","cross_cats":[],"primary_cat":"hep-lat","authors_text":"Federico Toschi, Klaus Schilling, Raffaele Tripiccione, Sven Trentmann, Thomas Lippert","submitted_at":"1997-10-16T13:50:10Z","abstract_excerpt":"We present a parallel FFT algorithm for SIMD systems following the `Transpose Algorithm' approach. The method is based on the assignment of the data field onto a 1-dimensional ring of systolic cells. The systolic array can be universally mapped onto any parallel system. In particular for systems with next-neighbour connectivity our method has the potential to improve the efficiency of matrix transposition by use of hyper-systolic communication. We have realized a scalable parallel FFT on the APE100/Quadrics massively parallel computer, where our implementation is part of a 2-dimensional hydrod"},"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":"hep-lat/9710060","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"hep-lat","submitted_at":"1997-10-16T13:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"96faeed58aa8d541500ccd8c8dc6f0e7cb8e9c6ccbf795c2db87b90a5a97ed9e","abstract_canon_sha256":"e585380f46e17b6ec6536806db7fc108942fd43f124a5483a26d3da12033ed3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:13.163289Z","signature_b64":"PQbHg87MqjbslWE5OnkN6cCMI9mojBXrxVJcEu7yj02VnEwFN4NzNwuyih7vu/Rn5O7Gn0RQH7esWH0OoohLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c57082b814a491f70d44d7e7feefc658e69502e62ada7e2d9f29e7666b48c2bf","last_reissued_at":"2026-05-18T01:39:13.162723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:13.162723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FFT for the APE Parallel Computer","license":"","headline":"","cross_cats":[],"primary_cat":"hep-lat","authors_text":"Federico Toschi, Klaus Schilling, Raffaele Tripiccione, Sven Trentmann, Thomas Lippert","submitted_at":"1997-10-16T13:50:10Z","abstract_excerpt":"We present a parallel FFT algorithm for SIMD systems following the `Transpose Algorithm' approach. The method is based on the assignment of the data field onto a 1-dimensional ring of systolic cells. The systolic array can be universally mapped onto any parallel system. In particular for systems with next-neighbour connectivity our method has the potential to improve the efficiency of matrix transposition by use of hyper-systolic communication. We have realized a scalable parallel FFT on the APE100/Quadrics massively parallel computer, where our implementation is part of a 2-dimensional hydrod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"hep-lat/9710060","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"hep-lat/9710060","created_at":"2026-05-18T01:39:13.162814+00:00"},{"alias_kind":"arxiv_version","alias_value":"hep-lat/9710060v1","created_at":"2026-05-18T01:39:13.162814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.hep-lat/9710060","created_at":"2026-05-18T01:39:13.162814+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVYIFOAUUSI7","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVYIFOAUUSI7ODKE","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVYIFOAU","created_at":"2026-05-18T12:25:49.038998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD","json":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD.json","graph_json":"https://pith.science/api/pith-number/YVYIFOAUUSI7ODKE27T7536GLD/graph.json","events_json":"https://pith.science/api/pith-number/YVYIFOAUUSI7ODKE27T7536GLD/events.json","paper":"https://pith.science/paper/YVYIFOAU"},"agent_actions":{"view_html":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD","download_json":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD.json","view_paper":"https://pith.science/paper/YVYIFOAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=hep-lat/9710060&json=true","fetch_graph":"https://pith.science/api/pith-number/YVYIFOAUUSI7ODKE27T7536GLD/graph.json","fetch_events":"https://pith.science/api/pith-number/YVYIFOAUUSI7ODKE27T7536GLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD/action/storage_attestation","attest_author":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD/action/author_attestation","sign_citation":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD/action/citation_signature","submit_replication":"https://pith.science/pith/YVYIFOAUUSI7ODKE27T7536GLD/action/replication_record"}},"created_at":"2026-05-18T01:39:13.162814+00:00","updated_at":"2026-05-18T01:39:13.162814+00:00"}