{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FVXH4P4CYHCGFEJ7HKWAJPHKBJ","short_pith_number":"pith:FVXH4P4C","schema_version":"1.0","canonical_sha256":"2d6e7e3f82c1c462913f3aac04bcea0a6b34eacd82056854161c6ac2ad1ebb1f","source":{"kind":"arxiv","id":"1506.00671","version":1},"attestation_state":"computed","paper":{"title":"Sample-Optimal Density Estimation in Nearly-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Ilias Diakonikolas, Jayadev Acharya, Jerry Li, Ludwig Schmidt","submitted_at":"2015-06-01T20:44:22Z","abstract_excerpt":"We design a new, fast algorithm for agnostically learning univariate probability distributions whose densities are well approximated by piecewise polynomial functions. Let $f$ be the density function of an arbitrary univariate distribution, and suppose that $f$ is $\\mathrm{OPT}$-close in $L_1$-distance to an unknown piecewise polynomial function with $t$ interval pieces and degree $d$. Our algorithm draws $n = O(t(d+1)/\\epsilon^2)$ samples from $f$, runs in time $\\tilde{O}(n \\cdot \\mathrm{poly}(d))$, and with probability at least $9/10$ outputs an $O(t)$-piecewise degree-$d$ hypothesis $h$ tha"},"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":"1506.00671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T20:44:22Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"2ae86df8ee94a57b31b43696db04ed869acac2e2fcea3b2f4ef1ca7143c74e3b","abstract_canon_sha256":"34abf6394b62d9c6800e758a452ae06b6d27f96f68fabf908940e76093a7b16c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.034012Z","signature_b64":"zHj6QLfLeK4CnRrRNBt/ElSN+9C4FEnQ6+vjBZbc7jiHW+g1EQxe5rfMubTOIHIoXxCxcD/XcUBmyy+jcPdDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6e7e3f82c1c462913f3aac04bcea0a6b34eacd82056854161c6ac2ad1ebb1f","last_reissued_at":"2026-05-18T01:59:53.033521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.033521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample-Optimal Density Estimation in Nearly-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Ilias Diakonikolas, Jayadev Acharya, Jerry Li, Ludwig Schmidt","submitted_at":"2015-06-01T20:44:22Z","abstract_excerpt":"We design a new, fast algorithm for agnostically learning univariate probability distributions whose densities are well approximated by piecewise polynomial functions. Let $f$ be the density function of an arbitrary univariate distribution, and suppose that $f$ is $\\mathrm{OPT}$-close in $L_1$-distance to an unknown piecewise polynomial function with $t$ interval pieces and degree $d$. Our algorithm draws $n = O(t(d+1)/\\epsilon^2)$ samples from $f$, runs in time $\\tilde{O}(n \\cdot \\mathrm{poly}(d))$, and with probability at least $9/10$ outputs an $O(t)$-piecewise degree-$d$ hypothesis $h$ tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00671","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":"1506.00671","created_at":"2026-05-18T01:59:53.033599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00671v1","created_at":"2026-05-18T01:59:53.033599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00671","created_at":"2026-05-18T01:59:53.033599+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVXH4P4CYHCG","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVXH4P4CYHCGFEJ7","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVXH4P4C","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08306","citing_title":"A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ","json":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ.json","graph_json":"https://pith.science/api/pith-number/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/graph.json","events_json":"https://pith.science/api/pith-number/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/events.json","paper":"https://pith.science/paper/FVXH4P4C"},"agent_actions":{"view_html":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ","download_json":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ.json","view_paper":"https://pith.science/paper/FVXH4P4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00671&json=true","fetch_graph":"https://pith.science/api/pith-number/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/action/storage_attestation","attest_author":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/action/author_attestation","sign_citation":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/action/citation_signature","submit_replication":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/action/replication_record"}},"created_at":"2026-05-18T01:59:53.033599+00:00","updated_at":"2026-05-18T01:59:53.033599+00:00"}