{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:O7VKPV4P7WHWDS6HK5PFBBQEPI","short_pith_number":"pith:O7VKPV4P","schema_version":"1.0","canonical_sha256":"77eaa7d78ffd8f61cbc7575e5086047a39f74edd4a7f64f73712aa159509eb28","source":{"kind":"arxiv","id":"2605.29970","version":1},"attestation_state":"computed","paper":{"title":"Effective MPI: User-defined Datatypes and Cartesian Communicators for Zero-copy All-to-all Communication in Multidimensional Tori","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff","submitted_at":"2026-05-28T14:07:55Z","abstract_excerpt":"We present and show how to implement a non-trivial all-to-all communication algorithm for arbitrary $d$-dimensional tori effectively in MPI. Given a factorization of the number of processes $p$ into $d$ factors that can be mapped onto a $d$-dimensional torus, we first utilize a Cartesian communicator to split a given $p$-process MPI communicator into, for each MPI process, $d$ smaller communicators spanning each of the dimensions of the torus to which the process belongs, and cache these communicators in order to avoid expensive splitting at each all-to-all operation. The all-to-all operation "},"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":"2605.29970","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-28T14:07:55Z","cross_cats_sorted":[],"title_canon_sha256":"79e5d9450b2f708c65739c3b98f223176a117444d4204db8cc495f0c2817a900","abstract_canon_sha256":"42437d7ec06276978d7aabd18fe2a424edd756ae661125f076ef900d7ed7aa9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:06:04.538434Z","signature_b64":"rkjSCddNBdGIeseHRe5ZeN95azbhv+MgZyu0xFVEvwCb/82TR2mZczHWfNSGtQeLpZW6ldrXRjVQE+7cimzqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77eaa7d78ffd8f61cbc7575e5086047a39f74edd4a7f64f73712aa159509eb28","last_reissued_at":"2026-05-29T02:06:04.537596Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:06:04.537596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective MPI: User-defined Datatypes and Cartesian Communicators for Zero-copy All-to-all Communication in Multidimensional Tori","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff","submitted_at":"2026-05-28T14:07:55Z","abstract_excerpt":"We present and show how to implement a non-trivial all-to-all communication algorithm for arbitrary $d$-dimensional tori effectively in MPI. Given a factorization of the number of processes $p$ into $d$ factors that can be mapped onto a $d$-dimensional torus, we first utilize a Cartesian communicator to split a given $p$-process MPI communicator into, for each MPI process, $d$ smaller communicators spanning each of the dimensions of the torus to which the process belongs, and cache these communicators in order to avoid expensive splitting at each all-to-all operation. The all-to-all operation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29970","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/2605.29970/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":"2605.29970","created_at":"2026-05-29T02:06:04.537733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29970v1","created_at":"2026-05-29T02:06:04.537733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29970","created_at":"2026-05-29T02:06:04.537733+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7VKPV4P7WHW","created_at":"2026-05-29T02:06:04.537733+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7VKPV4P7WHWDS6H","created_at":"2026-05-29T02:06:04.537733+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7VKPV4P","created_at":"2026-05-29T02:06:04.537733+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/O7VKPV4P7WHWDS6HK5PFBBQEPI","json":"https://pith.science/pith/O7VKPV4P7WHWDS6HK5PFBBQEPI.json","graph_json":"https://pith.science/api/pith-number/O7VKPV4P7WHWDS6HK5PFBBQEPI/graph.json","events_json":"https://pith.science/api/pith-number/O7VKPV4P7WHWDS6HK5PFBBQEPI/events.json","paper":"https://pith.science/paper/O7VKPV4P"},"agent_actions":{"view_html":"https://pith.science/pith/O7VKPV4P7WHWDS6HK5PFBBQEPI","download_json":"https://pith.science/pith/O7VKPV4P7WHWDS6HK5PFBBQEPI.json","view_paper":"https://pith.science/paper/O7VKPV4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29970&json=true","fetch_graph":"https://pith.science/api/pith-number/O7VKPV4P7WHWDS6HK5PFBBQEPI/graph.json","fetch_events":"https://pith.science/api/pith-number/O7VKPV4P7WHWDS6HK5PFBBQEPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7VKPV4P7WHWDS6HK5PFBBQEPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7VKPV4P7WHWDS6HK5PFBBQEPI/action/storage_attestation","attest_author":"https://pith.science/pith/O7VKPV4P7WHWDS6HK5PFBBQEPI/action/author_attestation","sign_citation":"https://pith.science/pith/O7VKPV4P7WHWDS6HK5PFBBQEPI/action/citation_signature","submit_replication":"https://pith.science/pith/O7VKPV4P7WHWDS6HK5PFBBQEPI/action/replication_record"}},"created_at":"2026-05-29T02:06:04.537733+00:00","updated_at":"2026-05-29T02:06:04.537733+00:00"}