{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QTDYQ7EIR7AOB4PTZBNM4TYJOW","short_pith_number":"pith:QTDYQ7EI","schema_version":"1.0","canonical_sha256":"84c7887c888fc0e0f1f3c85ace4f0975bb5ea68c293c5135bc9166d8b4ab7306","source":{"kind":"arxiv","id":"2408.07436","version":4},"attestation_state":"computed","paper":{"title":"M2L Translation Operators for Kernel Independent Fast Multipole Methods on Modern Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Sarah El Kazdadi, Srinath Kailasa, Timo Betcke","submitted_at":"2024-08-14T10:14:07Z","abstract_excerpt":"Hardware trends favor algorithm designs that maximize data reuse per FLOP. We develop and benchmark high-performance Multipole-to-Local (M2L) translation operators for the kernel-independent Fast Multipole Method (kiFMM), a widely adopted FMM variant that supports a broad class of kernels and has been favored by recent implementations for its simple specification. Naively implemented, M2L is bandwidth-limited and therefore a key bottleneck in the FMM. State-of-the-art FFT-based M2L implementations, though elegant and with a fast setup time, suffer from low operational intensity and require arc"},"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":"2408.07436","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2024-08-14T10:14:07Z","cross_cats_sorted":[],"title_canon_sha256":"89749c5d777726cdd5790fcd22ef364047d35b57ffa72ef05ac3cbfde8995330","abstract_canon_sha256":"2d4b855c3f79cf783f2f080d5da8564df9213b7a561aac5c6df1baab583e2e8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:47.144351Z","signature_b64":"vO6uf60VbKRxpYf7nhY2Vm5BhkqSd5aax70GD/sSwdGviO+WeL7Fminm38NJuKpXhdh45BdY6KgFvlFPVxoPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84c7887c888fc0e0f1f3c85ace4f0975bb5ea68c293c5135bc9166d8b4ab7306","last_reissued_at":"2026-07-05T11:10:47.143834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:47.143834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"M2L Translation Operators for Kernel Independent Fast Multipole Methods on Modern Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Sarah El Kazdadi, Srinath Kailasa, Timo Betcke","submitted_at":"2024-08-14T10:14:07Z","abstract_excerpt":"Hardware trends favor algorithm designs that maximize data reuse per FLOP. We develop and benchmark high-performance Multipole-to-Local (M2L) translation operators for the kernel-independent Fast Multipole Method (kiFMM), a widely adopted FMM variant that supports a broad class of kernels and has been favored by recent implementations for its simple specification. Naively implemented, M2L is bandwidth-limited and therefore a key bottleneck in the FMM. State-of-the-art FFT-based M2L implementations, though elegant and with a fast setup time, suffer from low operational intensity and require arc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.07436","kind":"arxiv","version":4},"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/2408.07436/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":"2408.07436","created_at":"2026-07-05T11:10:47.143901+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.07436v4","created_at":"2026-07-05T11:10:47.143901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.07436","created_at":"2026-07-05T11:10:47.143901+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTDYQ7EIR7AO","created_at":"2026-07-05T11:10:47.143901+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTDYQ7EIR7AOB4PT","created_at":"2026-07-05T11:10:47.143901+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTDYQ7EI","created_at":"2026-07-05T11:10:47.143901+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19243","citing_title":"A Simple Communication Scheme for Distributed Fast Multipole Methods","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW","json":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW.json","graph_json":"https://pith.science/api/pith-number/QTDYQ7EIR7AOB4PTZBNM4TYJOW/graph.json","events_json":"https://pith.science/api/pith-number/QTDYQ7EIR7AOB4PTZBNM4TYJOW/events.json","paper":"https://pith.science/paper/QTDYQ7EI"},"agent_actions":{"view_html":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW","download_json":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW.json","view_paper":"https://pith.science/paper/QTDYQ7EI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.07436&json=true","fetch_graph":"https://pith.science/api/pith-number/QTDYQ7EIR7AOB4PTZBNM4TYJOW/graph.json","fetch_events":"https://pith.science/api/pith-number/QTDYQ7EIR7AOB4PTZBNM4TYJOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW/action/storage_attestation","attest_author":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW/action/author_attestation","sign_citation":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW/action/citation_signature","submit_replication":"https://pith.science/pith/QTDYQ7EIR7AOB4PTZBNM4TYJOW/action/replication_record"}},"created_at":"2026-07-05T11:10:47.143901+00:00","updated_at":"2026-07-05T11:10:47.143901+00:00"}