{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FVXH4P4CYHCGFEJ7HKWAJPHKBJ","short_pith_number":"pith:FVXH4P4C","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"},"canonical_sha256":"2d6e7e3f82c1c462913f3aac04bcea0a6b34eacd82056854161c6ac2ad1ebb1f","source":{"kind":"arxiv","id":"1506.00671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00671","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00671v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00671","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"FVXH4P4CYHCG","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FVXH4P4CYHCGFEJ7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FVXH4P4C","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FVXH4P4CYHCGFEJ7HKWAJPHKBJ","target":"record","payload":{"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"},"canonical_sha256":"2d6e7e3f82c1c462913f3aac04bcea0a6b34eacd82056854161c6ac2ad1ebb1f","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"},"source_kind":"arxiv","source_id":"1506.00671","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QDpluK34mrqAia39z9o8wTVUvhb5+TUetXuECFK6trtInRD7EiW/8ppMlLKCig1x34fKeXsUvTL0hKm/zwcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:47:25.974960Z"},"content_sha256":"6083ee761c72fc9aa008c9c414d2050dd19cbbfcad8ef10ae8dbe636635b6a5d","schema_version":"1.0","event_id":"sha256:6083ee761c72fc9aa008c9c414d2050dd19cbbfcad8ef10ae8dbe636635b6a5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FVXH4P4CYHCGFEJ7HKWAJPHKBJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUaJQ9iwQNdpqtn3qlSoyHu7REQhz8yRFCZUSPrUpjLeVkPKsmC2TeBSTBH9GPbNjkOgqG21yPf2cV8L3mThAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:47:25.975702Z"},"content_sha256":"90cd149ac887f482319d48d914a3b82c3cd597999a00a30392425d69af756d47","schema_version":"1.0","event_id":"sha256:90cd149ac887f482319d48d914a3b82c3cd597999a00a30392425d69af756d47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/bundle.json","state_url":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T09:47:25Z","links":{"resolver":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ","bundle":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/bundle.json","state":"https://pith.science/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVXH4P4CYHCGFEJ7HKWAJPHKBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FVXH4P4CYHCGFEJ7HKWAJPHKBJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"34abf6394b62d9c6800e758a452ae06b6d27f96f68fabf908940e76093a7b16c","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T20:44:22Z","title_canon_sha256":"2ae86df8ee94a57b31b43696db04ed869acac2e2fcea3b2f4ef1ca7143c74e3b"},"schema_version":"1.0","source":{"id":"1506.00671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00671","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00671v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00671","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"FVXH4P4CYHCG","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FVXH4P4CYHCGFEJ7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FVXH4P4C","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:90cd149ac887f482319d48d914a3b82c3cd597999a00a30392425d69af756d47","target":"graph","created_at":"2026-05-18T01:59:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ilias Diakonikolas, Jayadev Acharya, Jerry Li, Ludwig Schmidt","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T20:44:22Z","title":"Sample-Optimal Density Estimation in Nearly-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00671","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6083ee761c72fc9aa008c9c414d2050dd19cbbfcad8ef10ae8dbe636635b6a5d","target":"record","created_at":"2026-05-18T01:59:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"34abf6394b62d9c6800e758a452ae06b6d27f96f68fabf908940e76093a7b16c","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T20:44:22Z","title_canon_sha256":"2ae86df8ee94a57b31b43696db04ed869acac2e2fcea3b2f4ef1ca7143c74e3b"},"schema_version":"1.0","source":{"id":"1506.00671","kind":"arxiv","version":1}},"canonical_sha256":"2d6e7e3f82c1c462913f3aac04bcea0a6b34eacd82056854161c6ac2ad1ebb1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d6e7e3f82c1c462913f3aac04bcea0a6b34eacd82056854161c6ac2ad1ebb1f","first_computed_at":"2026-05-18T01:59:53.033521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.033521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zHj6QLfLeK4CnRrRNBt/ElSN+9C4FEnQ6+vjBZbc7jiHW+g1EQxe5rfMubTOIHIoXxCxcD/XcUBmyy+jcPdDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.034012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6083ee761c72fc9aa008c9c414d2050dd19cbbfcad8ef10ae8dbe636635b6a5d","sha256:90cd149ac887f482319d48d914a3b82c3cd597999a00a30392425d69af756d47"],"state_sha256":"8c28069c0d710ab089cbfbb214c2d7eab572e21d17e1b41920ea87b9676e77df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuamvnAuuzwCi7ZTlkaz2dINDjMdB+lzrnaUTjFKE95KTjyCp70uarbZK4DdXLqgP4J2d4tICi9sdNDbUqaYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:47:25.979810Z","bundle_sha256":"83379db6306a6ff2af020aa2553dc3769691ee234922177112c21cd78c637092"}}