{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3P2WKZPX3S3CS5UCUYINABZ7CP","short_pith_number":"pith:3P2WKZPX","schema_version":"1.0","canonical_sha256":"dbf56565f7dcb6297682a610d0073f13dd0ac72942e494b278610e8b8bdf845c","source":{"kind":"arxiv","id":"1102.2878","version":1},"attestation_state":"computed","paper":{"title":"Dual-Tree Fast Gauss Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"stat.CO","authors_text":"Alexander G. Gray, Andrew W. Moore, Dongryeol Lee","submitted_at":"2011-02-14T20:24:01Z","abstract_excerpt":"Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation dominated by kernel summations. In this paper we present an improvement to the dual-tree algorithm, the first practical kernel summation algorithm for general dimension. Our extension is based on the series-expansion for the Gaussian kernel used by fast Gauss transform. First, we d"},"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":"1102.2878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-02-14T20:24:01Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"dc6ec9caab465ba2570bb4df9db246d8c3634130535b4ffad3552d7f54217f8f","abstract_canon_sha256":"9e2b0cc6e849a2a9c0bfcf3434b189bc34af0c76756d1604136463917e46de1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:46.223582Z","signature_b64":"+yVgzGNZNfOBc1ZaqZgKYL/5DsJuCErpmhLgvqBzno8dQoDMAoGOUmDf7C4hwQcrbKlzIGxOCS6lR1OG2xMLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbf56565f7dcb6297682a610d0073f13dd0ac72942e494b278610e8b8bdf845c","last_reissued_at":"2026-05-18T04:28:46.223011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:46.223011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual-Tree Fast Gauss Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"stat.CO","authors_text":"Alexander G. Gray, Andrew W. Moore, Dongryeol Lee","submitted_at":"2011-02-14T20:24:01Z","abstract_excerpt":"Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation dominated by kernel summations. In this paper we present an improvement to the dual-tree algorithm, the first practical kernel summation algorithm for general dimension. Our extension is based on the series-expansion for the Gaussian kernel used by fast Gauss transform. First, we d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2878","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":"1102.2878","created_at":"2026-05-18T04:28:46.223111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2878v1","created_at":"2026-05-18T04:28:46.223111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2878","created_at":"2026-05-18T04:28:46.223111+00:00"},{"alias_kind":"pith_short_12","alias_value":"3P2WKZPX3S3C","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3P2WKZPX3S3CS5UC","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3P2WKZPX","created_at":"2026-05-18T12:26:18.847500+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/3P2WKZPX3S3CS5UCUYINABZ7CP","json":"https://pith.science/pith/3P2WKZPX3S3CS5UCUYINABZ7CP.json","graph_json":"https://pith.science/api/pith-number/3P2WKZPX3S3CS5UCUYINABZ7CP/graph.json","events_json":"https://pith.science/api/pith-number/3P2WKZPX3S3CS5UCUYINABZ7CP/events.json","paper":"https://pith.science/paper/3P2WKZPX"},"agent_actions":{"view_html":"https://pith.science/pith/3P2WKZPX3S3CS5UCUYINABZ7CP","download_json":"https://pith.science/pith/3P2WKZPX3S3CS5UCUYINABZ7CP.json","view_paper":"https://pith.science/paper/3P2WKZPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2878&json=true","fetch_graph":"https://pith.science/api/pith-number/3P2WKZPX3S3CS5UCUYINABZ7CP/graph.json","fetch_events":"https://pith.science/api/pith-number/3P2WKZPX3S3CS5UCUYINABZ7CP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3P2WKZPX3S3CS5UCUYINABZ7CP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3P2WKZPX3S3CS5UCUYINABZ7CP/action/storage_attestation","attest_author":"https://pith.science/pith/3P2WKZPX3S3CS5UCUYINABZ7CP/action/author_attestation","sign_citation":"https://pith.science/pith/3P2WKZPX3S3CS5UCUYINABZ7CP/action/citation_signature","submit_replication":"https://pith.science/pith/3P2WKZPX3S3CS5UCUYINABZ7CP/action/replication_record"}},"created_at":"2026-05-18T04:28:46.223111+00:00","updated_at":"2026-05-18T04:28:46.223111+00:00"}