{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IB37Z3XN6MKLXTZS6ELYF4IBXJ","short_pith_number":"pith:IB37Z3XN","schema_version":"1.0","canonical_sha256":"4077fceeedf314bbcf32f11782f101ba66e9c516406cc8d175e3a2d554556fa2","source":{"kind":"arxiv","id":"1702.05459","version":1},"attestation_state":"computed","paper":{"title":"Communication Reducing Algorithms for Distributed Hierarchical N-Body Problems with Boundary Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"David Keyes, George Markomanolis, Huda Ibeid, Mustafa AbdulJabbar, Rio Yokota","submitted_at":"2017-02-17T17:57:20Z","abstract_excerpt":"Reduction of communication and efficient partitioning are key issues for achieving scalability in hierarchical $N$-Body algorithms like FMM. In the present work, we propose four independent strategies to improve partitioning and reduce communication. First of all, we show that the conventional wisdom of using space-filling curve partitioning may not work well for boundary integral problems, which constitute about 50% of FMM's application user base. We propose an alternative method which modifies orthogonal recursive bisection to solve the cell-partition misalignment that has kept it from scali"},"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":"1702.05459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-17T17:57:20Z","cross_cats_sorted":[],"title_canon_sha256":"791c095c9c3b843fb7ee0a6ebfb179a1324f18316aa6221ea6fc6d5b1000717a","abstract_canon_sha256":"8a9708d0a812ec669f585aeaeaca96f9df7c3d7af6079a3ae52247183387797f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:31.667726Z","signature_b64":"da9e7xAZYeR8OUD7Umy78caTQRPnGJ4Kir6vYtR+xst4V3coo6QpOUkdoCaqfenFbq0KvXkmgbAkR8lTJar4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4077fceeedf314bbcf32f11782f101ba66e9c516406cc8d175e3a2d554556fa2","last_reissued_at":"2026-05-18T00:50:31.666963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:31.666963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Reducing Algorithms for Distributed Hierarchical N-Body Problems with Boundary Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"David Keyes, George Markomanolis, Huda Ibeid, Mustafa AbdulJabbar, Rio Yokota","submitted_at":"2017-02-17T17:57:20Z","abstract_excerpt":"Reduction of communication and efficient partitioning are key issues for achieving scalability in hierarchical $N$-Body algorithms like FMM. In the present work, we propose four independent strategies to improve partitioning and reduce communication. First of all, we show that the conventional wisdom of using space-filling curve partitioning may not work well for boundary integral problems, which constitute about 50% of FMM's application user base. We propose an alternative method which modifies orthogonal recursive bisection to solve the cell-partition misalignment that has kept it from scali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05459","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":"1702.05459","created_at":"2026-05-18T00:50:31.667059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05459v1","created_at":"2026-05-18T00:50:31.667059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05459","created_at":"2026-05-18T00:50:31.667059+00:00"},{"alias_kind":"pith_short_12","alias_value":"IB37Z3XN6MKL","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IB37Z3XN6MKLXTZS","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IB37Z3XN","created_at":"2026-05-18T12:31:21.493067+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/IB37Z3XN6MKLXTZS6ELYF4IBXJ","json":"https://pith.science/pith/IB37Z3XN6MKLXTZS6ELYF4IBXJ.json","graph_json":"https://pith.science/api/pith-number/IB37Z3XN6MKLXTZS6ELYF4IBXJ/graph.json","events_json":"https://pith.science/api/pith-number/IB37Z3XN6MKLXTZS6ELYF4IBXJ/events.json","paper":"https://pith.science/paper/IB37Z3XN"},"agent_actions":{"view_html":"https://pith.science/pith/IB37Z3XN6MKLXTZS6ELYF4IBXJ","download_json":"https://pith.science/pith/IB37Z3XN6MKLXTZS6ELYF4IBXJ.json","view_paper":"https://pith.science/paper/IB37Z3XN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05459&json=true","fetch_graph":"https://pith.science/api/pith-number/IB37Z3XN6MKLXTZS6ELYF4IBXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IB37Z3XN6MKLXTZS6ELYF4IBXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IB37Z3XN6MKLXTZS6ELYF4IBXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IB37Z3XN6MKLXTZS6ELYF4IBXJ/action/storage_attestation","attest_author":"https://pith.science/pith/IB37Z3XN6MKLXTZS6ELYF4IBXJ/action/author_attestation","sign_citation":"https://pith.science/pith/IB37Z3XN6MKLXTZS6ELYF4IBXJ/action/citation_signature","submit_replication":"https://pith.science/pith/IB37Z3XN6MKLXTZS6ELYF4IBXJ/action/replication_record"}},"created_at":"2026-05-18T00:50:31.667059+00:00","updated_at":"2026-05-18T00:50:31.667059+00:00"}