{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DTAYGJLZAGANKYYFEEEXBG3EWH","short_pith_number":"pith:DTAYGJLZ","schema_version":"1.0","canonical_sha256":"1cc18325790180d563052109709b64b1e010a7ece737e2aaf2d0585cffaaf540","source":{"kind":"arxiv","id":"2303.13337","version":1},"attestation_state":"computed","paper":{"title":"Scalability of 3D-DFT by block tensor-matrix multiplication on the JUWELS Cluster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"physics.comp-ph","authors_text":"Davide Mandelli, Estela Suarez, Nitin Malapally, Paolo Carloni, Thomas Lippert, Viacheslav Bolnykh","submitted_at":"2023-03-23T15:17:57Z","abstract_excerpt":"The 3D Discrete Fourier Transform (DFT) is a technique used to solve problems in disparate fields. Nowadays, the commonly adopted implementation of the 3D-DFT is derived from the Fast Fourier Transform (FFT) algorithm. However, evidence indicates that the distributed memory 3D-FFT algorithm does not scale well due to its use of all-to-all communication. Here, building on the work of Sedukhin \\textit{et al}. [Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015 pp. 193-200 (01 2015)], we revisit the possibility of improving the scaling of the 3D-DFT by"},"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":"2303.13337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2023-03-23T15:17:57Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"078d89252d44b15bddba689b284055deef1ee075a241da3261bbf7eafe124d32","abstract_canon_sha256":"e5938f4d04a4367de6c97ce029e2ecbf0c25e9dc3a4544fac5a1a09e9d679623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:37.064299Z","signature_b64":"omW2bjM8HERCDtRfwZP0tk/HLGN4C/2sPYMZIs0xVDKmNXCcnpCRFNdKVvxoQoQ1AoDZHWID6PDyh5sLRwlIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cc18325790180d563052109709b64b1e010a7ece737e2aaf2d0585cffaaf540","last_reissued_at":"2026-07-05T08:41:37.063829Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:37.063829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalability of 3D-DFT by block tensor-matrix multiplication on the JUWELS Cluster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"physics.comp-ph","authors_text":"Davide Mandelli, Estela Suarez, Nitin Malapally, Paolo Carloni, Thomas Lippert, Viacheslav Bolnykh","submitted_at":"2023-03-23T15:17:57Z","abstract_excerpt":"The 3D Discrete Fourier Transform (DFT) is a technique used to solve problems in disparate fields. Nowadays, the commonly adopted implementation of the 3D-DFT is derived from the Fast Fourier Transform (FFT) algorithm. However, evidence indicates that the distributed memory 3D-FFT algorithm does not scale well due to its use of all-to-all communication. Here, building on the work of Sedukhin \\textit{et al}. [Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015 pp. 193-200 (01 2015)], we revisit the possibility of improving the scaling of the 3D-DFT by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.13337","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.13337/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":"2303.13337","created_at":"2026-07-05T08:41:37.063896+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.13337v1","created_at":"2026-07-05T08:41:37.063896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.13337","created_at":"2026-07-05T08:41:37.063896+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTAYGJLZAGAN","created_at":"2026-07-05T08:41:37.063896+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTAYGJLZAGANKYYF","created_at":"2026-07-05T08:41:37.063896+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTAYGJLZ","created_at":"2026-07-05T08:41:37.063896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22818","citing_title":"TriADA: Massively Parallel Trilinear Matrix-by-Tensor Multiply-Add Algorithm and Device Architecture for the Acceleration of 3D Discrete Transformations","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH","json":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH.json","graph_json":"https://pith.science/api/pith-number/DTAYGJLZAGANKYYFEEEXBG3EWH/graph.json","events_json":"https://pith.science/api/pith-number/DTAYGJLZAGANKYYFEEEXBG3EWH/events.json","paper":"https://pith.science/paper/DTAYGJLZ"},"agent_actions":{"view_html":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH","download_json":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH.json","view_paper":"https://pith.science/paper/DTAYGJLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.13337&json=true","fetch_graph":"https://pith.science/api/pith-number/DTAYGJLZAGANKYYFEEEXBG3EWH/graph.json","fetch_events":"https://pith.science/api/pith-number/DTAYGJLZAGANKYYFEEEXBG3EWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH/action/storage_attestation","attest_author":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH/action/author_attestation","sign_citation":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH/action/citation_signature","submit_replication":"https://pith.science/pith/DTAYGJLZAGANKYYFEEEXBG3EWH/action/replication_record"}},"created_at":"2026-07-05T08:41:37.063896+00:00","updated_at":"2026-07-05T08:41:37.063896+00:00"}