{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:24ROYWBDK6PNRPZTC65EO2LVXX","short_pith_number":"pith:24ROYWBD","schema_version":"1.0","canonical_sha256":"d722ec5823579ed8bf3317ba476975bdd53df168ae13bc1f779b7fc3c4954c54","source":{"kind":"arxiv","id":"2208.03915","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Danyang Zhuo, Jiehao Liang, Junze Yin, Zhao Song, Zhaozhuo Xu","submitted_at":"2022-08-08T04:40:20Z","abstract_excerpt":"Kernel density estimation (KDE) stands out as a challenging task in machine learning. The problem is defined in the following way: given a kernel function $f(x,y)$ and a set of points $\\{x_1, x_2, \\cdots, x_n \\} \\subset \\mathbb{R}^d$, we would like to compute $\\frac{1}{n}\\sum_{i=1}^{n} f(x_i,y)$ for any query point $y \\in \\mathbb{R}^d$. Recently, there has been a growing trend of using data structures for efficient KDE. However, the proposed KDE data structures focus on static settings. The robustness of KDE data structures over dynamic changing data distributions is not addressed. In this wor"},"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":"2208.03915","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-08-08T04:40:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ffdda030a5af5702606e58e29226f84d1785e67e2b3bbf35ffa27a94fe195490","abstract_canon_sha256":"8437b83b0a3a95d647192abf6654836bcfbbac8a1d051989e84f0b9f1c65ac3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:51.486944Z","signature_b64":"1/stLoprciXSNOkUXPKwwnZC/XM96fA1rIq8RhAuNFYcga2L0ZofPTlFRQ3204Nc8B+86suQpdg3VsVr8E+3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d722ec5823579ed8bf3317ba476975bdd53df168ae13bc1f779b7fc3c4954c54","last_reissued_at":"2026-07-05T07:44:51.486483Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:51.486483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Danyang Zhuo, Jiehao Liang, Junze Yin, Zhao Song, Zhaozhuo Xu","submitted_at":"2022-08-08T04:40:20Z","abstract_excerpt":"Kernel density estimation (KDE) stands out as a challenging task in machine learning. The problem is defined in the following way: given a kernel function $f(x,y)$ and a set of points $\\{x_1, x_2, \\cdots, x_n \\} \\subset \\mathbb{R}^d$, we would like to compute $\\frac{1}{n}\\sum_{i=1}^{n} f(x_i,y)$ for any query point $y \\in \\mathbb{R}^d$. Recently, there has been a growing trend of using data structures for efficient KDE. However, the proposed KDE data structures focus on static settings. The robustness of KDE data structures over dynamic changing data distributions is not addressed. In this wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.03915","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.03915/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":"2208.03915","created_at":"2026-07-05T07:44:51.486564+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.03915v2","created_at":"2026-07-05T07:44:51.486564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.03915","created_at":"2026-07-05T07:44:51.486564+00:00"},{"alias_kind":"pith_short_12","alias_value":"24ROYWBDK6PN","created_at":"2026-07-05T07:44:51.486564+00:00"},{"alias_kind":"pith_short_16","alias_value":"24ROYWBDK6PNRPZT","created_at":"2026-07-05T07:44:51.486564+00:00"},{"alias_kind":"pith_short_8","alias_value":"24ROYWBD","created_at":"2026-07-05T07:44:51.486564+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.01696","citing_title":"Dynamic Similarity Graph Construction with Kernel Density Estimation","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX","json":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX.json","graph_json":"https://pith.science/api/pith-number/24ROYWBDK6PNRPZTC65EO2LVXX/graph.json","events_json":"https://pith.science/api/pith-number/24ROYWBDK6PNRPZTC65EO2LVXX/events.json","paper":"https://pith.science/paper/24ROYWBD"},"agent_actions":{"view_html":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX","download_json":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX.json","view_paper":"https://pith.science/paper/24ROYWBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.03915&json=true","fetch_graph":"https://pith.science/api/pith-number/24ROYWBDK6PNRPZTC65EO2LVXX/graph.json","fetch_events":"https://pith.science/api/pith-number/24ROYWBDK6PNRPZTC65EO2LVXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX/action/storage_attestation","attest_author":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX/action/author_attestation","sign_citation":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX/action/citation_signature","submit_replication":"https://pith.science/pith/24ROYWBDK6PNRPZTC65EO2LVXX/action/replication_record"}},"created_at":"2026-07-05T07:44:51.486564+00:00","updated_at":"2026-07-05T07:44:51.486564+00:00"}