{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B4XDJ7GNBZREYJZ4L334IYQJFP","short_pith_number":"pith:B4XDJ7GN","schema_version":"1.0","canonical_sha256":"0f2e34fccd0e624c273c5ef7c462092bc97a8738536f49d55435b732d421fc04","source":{"kind":"arxiv","id":"1802.01751","version":5},"attestation_state":"computed","paper":{"title":"Near-Optimal Coresets of Kernel Density Estimates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jeff M. Phillips, Wai Ming Tai","submitted_at":"2018-02-06T01:06:47Z","abstract_excerpt":"We construct near-optimal coresets for kernel density estimates for points in $\\mathbb{R}^d$ when the kernel is positive definite. Specifically we show a polynomial time construction for a coreset of size $O(\\sqrt{d}/\\varepsilon\\cdot \\sqrt{\\log 1/\\varepsilon} )$, and we show a near-matching lower bound of size $\\Omega(\\min\\{\\sqrt{d}/\\varepsilon, 1/\\varepsilon^2\\})$. When $d\\geq 1/\\varepsilon^2$, it is known that the size of coreset can be $O(1/\\varepsilon^2)$. The upper bound is a polynomial-in-$(1/\\varepsilon)$ improvement when $d \\in [3,1/\\varepsilon^2)$ and the lower bound is the first know"},"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":"1802.01751","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-06T01:06:47Z","cross_cats_sorted":["cs.CG","stat.ML"],"title_canon_sha256":"81f72021e9b15bea634996a9693a73e44d6f562e51d32525550a1978639e445a","abstract_canon_sha256":"66ea463f4118f179b11fffdec610cec3d2478f372be359a0c31b89519a14baf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:45.934043Z","signature_b64":"z2uJSvV1OWBJKLc9ZHaS3IJrLw5IQ9ay4iuXb/cXQA9Esuv4r1WUuBDKlvjPzqA6LAodgZq4W6JlVyMv6vaoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f2e34fccd0e624c273c5ef7c462092bc97a8738536f49d55435b732d421fc04","last_reissued_at":"2026-05-17T23:48:45.933644Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:45.933644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Coresets of Kernel Density Estimates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jeff M. Phillips, Wai Ming Tai","submitted_at":"2018-02-06T01:06:47Z","abstract_excerpt":"We construct near-optimal coresets for kernel density estimates for points in $\\mathbb{R}^d$ when the kernel is positive definite. Specifically we show a polynomial time construction for a coreset of size $O(\\sqrt{d}/\\varepsilon\\cdot \\sqrt{\\log 1/\\varepsilon} )$, and we show a near-matching lower bound of size $\\Omega(\\min\\{\\sqrt{d}/\\varepsilon, 1/\\varepsilon^2\\})$. When $d\\geq 1/\\varepsilon^2$, it is known that the size of coreset can be $O(1/\\varepsilon^2)$. The upper bound is a polynomial-in-$(1/\\varepsilon)$ improvement when $d \\in [3,1/\\varepsilon^2)$ and the lower bound is the first know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01751","kind":"arxiv","version":5},"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":"1802.01751","created_at":"2026-05-17T23:48:45.933706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01751v5","created_at":"2026-05-17T23:48:45.933706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01751","created_at":"2026-05-17T23:48:45.933706+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4XDJ7GNBZRE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4XDJ7GNBZREYJZ4","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4XDJ7GN","created_at":"2026-05-18T12:32:13.499390+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/B4XDJ7GNBZREYJZ4L334IYQJFP","json":"https://pith.science/pith/B4XDJ7GNBZREYJZ4L334IYQJFP.json","graph_json":"https://pith.science/api/pith-number/B4XDJ7GNBZREYJZ4L334IYQJFP/graph.json","events_json":"https://pith.science/api/pith-number/B4XDJ7GNBZREYJZ4L334IYQJFP/events.json","paper":"https://pith.science/paper/B4XDJ7GN"},"agent_actions":{"view_html":"https://pith.science/pith/B4XDJ7GNBZREYJZ4L334IYQJFP","download_json":"https://pith.science/pith/B4XDJ7GNBZREYJZ4L334IYQJFP.json","view_paper":"https://pith.science/paper/B4XDJ7GN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01751&json=true","fetch_graph":"https://pith.science/api/pith-number/B4XDJ7GNBZREYJZ4L334IYQJFP/graph.json","fetch_events":"https://pith.science/api/pith-number/B4XDJ7GNBZREYJZ4L334IYQJFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4XDJ7GNBZREYJZ4L334IYQJFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4XDJ7GNBZREYJZ4L334IYQJFP/action/storage_attestation","attest_author":"https://pith.science/pith/B4XDJ7GNBZREYJZ4L334IYQJFP/action/author_attestation","sign_citation":"https://pith.science/pith/B4XDJ7GNBZREYJZ4L334IYQJFP/action/citation_signature","submit_replication":"https://pith.science/pith/B4XDJ7GNBZREYJZ4L334IYQJFP/action/replication_record"}},"created_at":"2026-05-17T23:48:45.933706+00:00","updated_at":"2026-05-17T23:48:45.933706+00:00"}