{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7E2DXFLLWZ7KLIAZNQBK2SEF4T","short_pith_number":"pith:7E2DXFLL","schema_version":"1.0","canonical_sha256":"f9343b956bb67ea5a0196c02ad4885e4e735b63f8d5e0b8c4a3103b886db27ab","source":{"kind":"arxiv","id":"1305.4650","version":2},"attestation_state":"computed","paper":{"title":"A parallel butterfly algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jack Poulson, Laurent Demanet, Lexing Ying, Nicholas Maxwell","submitted_at":"2013-05-20T20:33:40Z","abstract_excerpt":"The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform \\int K(x,y) g(y) dy at large numbers of target points when the kernel, K(x,y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(N^d) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r^2 N^d log N). A parallelization of the butterfly algorithm is introduced which, assuming a message late"},"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":"1305.4650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-05-20T20:33:40Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a78460ec1954359881165ae0dac2899575e8c295b16c8811a2cc04358d5ccd83","abstract_canon_sha256":"7ed020f93e8150fd63c770c596b86e7d9bc8a17337eeac198f65d51791bc52c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:22.034933Z","signature_b64":"MrQ4hpwNLqVtwODUSLVdWWe26kixHHE365nmWsISsP43VwxAThscQbU9NS9HsJO7VwUkk00Px0oM5WyTDy49Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9343b956bb67ea5a0196c02ad4885e4e735b63f8d5e0b8c4a3103b886db27ab","last_reissued_at":"2026-05-18T03:06:22.034465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:22.034465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A parallel butterfly algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jack Poulson, Laurent Demanet, Lexing Ying, Nicholas Maxwell","submitted_at":"2013-05-20T20:33:40Z","abstract_excerpt":"The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform \\int K(x,y) g(y) dy at large numbers of target points when the kernel, K(x,y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(N^d) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r^2 N^d log N). A parallelization of the butterfly algorithm is introduced which, assuming a message late"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4650","kind":"arxiv","version":2},"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":"1305.4650","created_at":"2026-05-18T03:06:22.034538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4650v2","created_at":"2026-05-18T03:06:22.034538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4650","created_at":"2026-05-18T03:06:22.034538+00:00"},{"alias_kind":"pith_short_12","alias_value":"7E2DXFLLWZ7K","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7E2DXFLLWZ7KLIAZ","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7E2DXFLL","created_at":"2026-05-18T12:27:36.564083+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/7E2DXFLLWZ7KLIAZNQBK2SEF4T","json":"https://pith.science/pith/7E2DXFLLWZ7KLIAZNQBK2SEF4T.json","graph_json":"https://pith.science/api/pith-number/7E2DXFLLWZ7KLIAZNQBK2SEF4T/graph.json","events_json":"https://pith.science/api/pith-number/7E2DXFLLWZ7KLIAZNQBK2SEF4T/events.json","paper":"https://pith.science/paper/7E2DXFLL"},"agent_actions":{"view_html":"https://pith.science/pith/7E2DXFLLWZ7KLIAZNQBK2SEF4T","download_json":"https://pith.science/pith/7E2DXFLLWZ7KLIAZNQBK2SEF4T.json","view_paper":"https://pith.science/paper/7E2DXFLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4650&json=true","fetch_graph":"https://pith.science/api/pith-number/7E2DXFLLWZ7KLIAZNQBK2SEF4T/graph.json","fetch_events":"https://pith.science/api/pith-number/7E2DXFLLWZ7KLIAZNQBK2SEF4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7E2DXFLLWZ7KLIAZNQBK2SEF4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7E2DXFLLWZ7KLIAZNQBK2SEF4T/action/storage_attestation","attest_author":"https://pith.science/pith/7E2DXFLLWZ7KLIAZNQBK2SEF4T/action/author_attestation","sign_citation":"https://pith.science/pith/7E2DXFLLWZ7KLIAZNQBK2SEF4T/action/citation_signature","submit_replication":"https://pith.science/pith/7E2DXFLLWZ7KLIAZNQBK2SEF4T/action/replication_record"}},"created_at":"2026-05-18T03:06:22.034538+00:00","updated_at":"2026-05-18T03:06:22.034538+00:00"}