{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AMF2EFNLLXGH2JUNREZQPTC6CR","short_pith_number":"pith:AMF2EFNL","schema_version":"1.0","canonical_sha256":"030ba215ab5dcc7d268d893307cc5e1464cdf1d9044eb5114a17e202c49ca5a5","source":{"kind":"arxiv","id":"1411.0169","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Rocco A. Servedio, Siu-on Chan, Xiaorui Sun","submitted_at":"2014-11-01T21:03:59Z","abstract_excerpt":"Let $p$ be an unknown and arbitrary probability distribution over $[0,1)$. We consider the problem of {\\em density estimation}, in which a learning algorithm is given i.i.d. draws from $p$ and must (with high probability) output a hypothesis distribution that is close to $p$. The main contribution of this paper is a highly efficient density estimation algorithm for learning using a variable-width histogram, i.e., a hypothesis distribution with a piecewise constant probability density function.\n  In more detail, for any $k$ and $\\epsilon$, we give an algorithm that makes $\\tilde{O}(k/\\epsilon^2"},"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":"1411.0169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-01T21:03:59Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"f26f276e80a6a6bd8d13b9a67d268eb9626bcdfa96b64af8502a9144763b5475","abstract_canon_sha256":"b2b1e8b210a91c553c210c2f89b614bf1e3dce1d05aaa3a955f38b29afe93185"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:52.387770Z","signature_b64":"yliPZijgI5IN/zPd5Xu+y/w9aaqp55FosHdBux+crw4WrirJXwOJirEcStCcP5wCvCpC8RQpbKBHRDhdE+OuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"030ba215ab5dcc7d268d893307cc5e1464cdf1d9044eb5114a17e202c49ca5a5","last_reissued_at":"2026-05-18T02:38:52.385276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:52.385276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Rocco A. Servedio, Siu-on Chan, Xiaorui Sun","submitted_at":"2014-11-01T21:03:59Z","abstract_excerpt":"Let $p$ be an unknown and arbitrary probability distribution over $[0,1)$. We consider the problem of {\\em density estimation}, in which a learning algorithm is given i.i.d. draws from $p$ and must (with high probability) output a hypothesis distribution that is close to $p$. The main contribution of this paper is a highly efficient density estimation algorithm for learning using a variable-width histogram, i.e., a hypothesis distribution with a piecewise constant probability density function.\n  In more detail, for any $k$ and $\\epsilon$, we give an algorithm that makes $\\tilde{O}(k/\\epsilon^2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0169","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":"1411.0169","created_at":"2026-05-18T02:38:52.387267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0169v1","created_at":"2026-05-18T02:38:52.387267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0169","created_at":"2026-05-18T02:38:52.387267+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMF2EFNLLXGH","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMF2EFNLLXGH2JUN","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMF2EFNL","created_at":"2026-05-18T12:28:19.803747+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/AMF2EFNLLXGH2JUNREZQPTC6CR","json":"https://pith.science/pith/AMF2EFNLLXGH2JUNREZQPTC6CR.json","graph_json":"https://pith.science/api/pith-number/AMF2EFNLLXGH2JUNREZQPTC6CR/graph.json","events_json":"https://pith.science/api/pith-number/AMF2EFNLLXGH2JUNREZQPTC6CR/events.json","paper":"https://pith.science/paper/AMF2EFNL"},"agent_actions":{"view_html":"https://pith.science/pith/AMF2EFNLLXGH2JUNREZQPTC6CR","download_json":"https://pith.science/pith/AMF2EFNLLXGH2JUNREZQPTC6CR.json","view_paper":"https://pith.science/paper/AMF2EFNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0169&json=true","fetch_graph":"https://pith.science/api/pith-number/AMF2EFNLLXGH2JUNREZQPTC6CR/graph.json","fetch_events":"https://pith.science/api/pith-number/AMF2EFNLLXGH2JUNREZQPTC6CR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMF2EFNLLXGH2JUNREZQPTC6CR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMF2EFNLLXGH2JUNREZQPTC6CR/action/storage_attestation","attest_author":"https://pith.science/pith/AMF2EFNLLXGH2JUNREZQPTC6CR/action/author_attestation","sign_citation":"https://pith.science/pith/AMF2EFNLLXGH2JUNREZQPTC6CR/action/citation_signature","submit_replication":"https://pith.science/pith/AMF2EFNLLXGH2JUNREZQPTC6CR/action/replication_record"}},"created_at":"2026-05-18T02:38:52.387267+00:00","updated_at":"2026-05-18T02:38:52.387267+00:00"}