{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OJL3EOUZQLLN36H3A6W2PVTEGG","short_pith_number":"pith:OJL3EOUZ","schema_version":"1.0","canonical_sha256":"7257b23a9982d6ddf8fb07ada7d66431bf66ab7635d50a2bd3d24d9c59d2ba6e","source":{"kind":"arxiv","id":"1409.2802","version":2},"attestation_state":"computed","paper":{"title":"Far-Field Compression for Fast Kernel Summation Methods in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George Biros, William B. March","submitted_at":"2014-09-09T16:28:40Z","abstract_excerpt":"We consider fast kernel summations in high dimensions: given a large set of points in $d$ dimensions (with $d \\gg 3$) and a pair-potential function (the {\\em kernel} function), we compute a weighted sum of all pairwise kernel interactions for each point in the set. Direct summation is equivalent to a (dense) matrix-vector multiplication and scales quadratically with the number of points. Fast kernel summation algorithms reduce this cost to log-linear or linear complexity.\n  Treecodes and Fast Multipole Methods (FMMs) deliver tremendous speedups by constructing approximate representations of in"},"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":"1409.2802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-09T16:28:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"15842456ac75f03f5efb41ce355d5af4650ccc9168dd235bc2f9e70a78ecffb4","abstract_canon_sha256":"f402b79e6da5ecbdd028878d84e6e6b03c7f42e73fb226e1898cbfaae5aba97b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:07.711672Z","signature_b64":"iEcybFmS03pfMyn99J3mKyffnUDnBJPETJY72J/dHVYI4IURs3jDPtTBelTc+IM0vBOHJ06n62ISGLmm8LcZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7257b23a9982d6ddf8fb07ada7d66431bf66ab7635d50a2bd3d24d9c59d2ba6e","last_reissued_at":"2026-05-18T02:27:07.709983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:07.709983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Far-Field Compression for Fast Kernel Summation Methods in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George Biros, William B. March","submitted_at":"2014-09-09T16:28:40Z","abstract_excerpt":"We consider fast kernel summations in high dimensions: given a large set of points in $d$ dimensions (with $d \\gg 3$) and a pair-potential function (the {\\em kernel} function), we compute a weighted sum of all pairwise kernel interactions for each point in the set. Direct summation is equivalent to a (dense) matrix-vector multiplication and scales quadratically with the number of points. Fast kernel summation algorithms reduce this cost to log-linear or linear complexity.\n  Treecodes and Fast Multipole Methods (FMMs) deliver tremendous speedups by constructing approximate representations of in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2802","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":"1409.2802","created_at":"2026-05-18T02:27:07.710134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2802v2","created_at":"2026-05-18T02:27:07.710134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2802","created_at":"2026-05-18T02:27:07.710134+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJL3EOUZQLLN","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJL3EOUZQLLN36H3","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJL3EOUZ","created_at":"2026-05-18T12:28:41.024544+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/OJL3EOUZQLLN36H3A6W2PVTEGG","json":"https://pith.science/pith/OJL3EOUZQLLN36H3A6W2PVTEGG.json","graph_json":"https://pith.science/api/pith-number/OJL3EOUZQLLN36H3A6W2PVTEGG/graph.json","events_json":"https://pith.science/api/pith-number/OJL3EOUZQLLN36H3A6W2PVTEGG/events.json","paper":"https://pith.science/paper/OJL3EOUZ"},"agent_actions":{"view_html":"https://pith.science/pith/OJL3EOUZQLLN36H3A6W2PVTEGG","download_json":"https://pith.science/pith/OJL3EOUZQLLN36H3A6W2PVTEGG.json","view_paper":"https://pith.science/paper/OJL3EOUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2802&json=true","fetch_graph":"https://pith.science/api/pith-number/OJL3EOUZQLLN36H3A6W2PVTEGG/graph.json","fetch_events":"https://pith.science/api/pith-number/OJL3EOUZQLLN36H3A6W2PVTEGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJL3EOUZQLLN36H3A6W2PVTEGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJL3EOUZQLLN36H3A6W2PVTEGG/action/storage_attestation","attest_author":"https://pith.science/pith/OJL3EOUZQLLN36H3A6W2PVTEGG/action/author_attestation","sign_citation":"https://pith.science/pith/OJL3EOUZQLLN36H3A6W2PVTEGG/action/citation_signature","submit_replication":"https://pith.science/pith/OJL3EOUZQLLN36H3A6W2PVTEGG/action/replication_record"}},"created_at":"2026-05-18T02:27:07.710134+00:00","updated_at":"2026-05-18T02:27:07.710134+00:00"}