{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6VGYXJMHD4O5HNFQGFVN2XJHC2","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":"7b9d832f4ed54d7996fc7470c307c0fa9109c208421e076999cc81aef5e8b600","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-09T19:32:20Z","title_canon_sha256":"6c58bc692c6fe4d9e5ee6661179510672b775ec87846b3e26c2204577012dbf8"},"schema_version":"1.0","source":{"id":"1606.03077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03077","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03077v1","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03077","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"6VGYXJMHD4O5","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6VGYXJMHD4O5HNFQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6VGYXJMH","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:db7e62ad717d6a539d019aa7bdbe6eaf447c284a6b9c39e63e9fc50287ef6845","target":"graph","created_at":"2026-05-18T01:12:38Z","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 study the {\\em robust proper learning} of univariate log-concave distributions (over continuous and discrete domains). Given a set of samples drawn from an unknown target distribution, we want to compute a log-concave hypothesis distribution that is as close as possible to the target, in total variation distance. In this work, we give the first computationally efficient algorithm for this learning problem. Our algorithm achieves the information-theoretically optimal sample size (up to a constant factor), runs in polynomial time, and is robust to model misspecification with nearly-optimal er","authors_text":"Alistair Stewart, Daniel M. Kane, Ilias Diakonikolas","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-09T19:32:20Z","title":"Efficient Robust Proper Learning of Log-concave Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03077","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:a224625c2432f21b93a9196d2642c1fa673ca6515eb6fe73cd2dc62274298324","target":"record","created_at":"2026-05-18T01:12:38Z","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":"7b9d832f4ed54d7996fc7470c307c0fa9109c208421e076999cc81aef5e8b600","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-09T19:32:20Z","title_canon_sha256":"6c58bc692c6fe4d9e5ee6661179510672b775ec87846b3e26c2204577012dbf8"},"schema_version":"1.0","source":{"id":"1606.03077","kind":"arxiv","version":1}},"canonical_sha256":"f54d8ba5871f1dd3b4b0316add5d271690edf6241190b99ae8d1a707f8cea4f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f54d8ba5871f1dd3b4b0316add5d271690edf6241190b99ae8d1a707f8cea4f0","first_computed_at":"2026-05-18T01:12:38.367928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:38.367928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BaxkrZqJQtVYv3FXLq2giOdbSw4l7Vcz+0+ObTNSlXwiktnu5Kex29grYFGX0//WysKr5DoiUr7eoHGurbYxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:38.368274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a224625c2432f21b93a9196d2642c1fa673ca6515eb6fe73cd2dc62274298324","sha256:db7e62ad717d6a539d019aa7bdbe6eaf447c284a6b9c39e63e9fc50287ef6845"],"state_sha256":"fce5e5d1ac882f7ce2929e316f51cc6c9b7a39267a4b3ee0daf882502476bd44"}