{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:73DXSTZYAZ2XXS2KC2HZP45VEK","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":"3e23ff3229f2e90487363dc9e93a02cb0281d68917cffba40f48f8553833aa00","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-12T20:47:37Z","title_canon_sha256":"e081e9fec5f6939087d3f83c3f08a28ecef6ee33da76abd79a77504957f4181f"},"schema_version":"1.0","source":{"id":"1511.04066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04066","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04066v1","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04066","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"73DXSTZYAZ2X","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"73DXSTZYAZ2XXS2K","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"73DXSTZY","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:a0b515216d4ad15f5ebcd0c45c7d907883fdb89d47112500c679d91f69bf533a","target":"graph","created_at":"2026-05-18T01:27:06Z","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 give an algorithm for properly learning Poisson binomial distributions. A Poisson binomial distribution (PBD) of order $n$ is the discrete probability distribution of the sum of $n$ mutually independent Bernoulli random variables. Given $\\widetilde{O}(1/\\epsilon^2)$ samples from an unknown PBD $\\mathbf{p}$, our algorithm runs in time $(1/\\epsilon)^{O(\\log \\log (1/\\epsilon))}$, and outputs a hypothesis PBD that is $\\epsilon$-close to $\\mathbf{p}$ in total variation distance. The previously best known running time for properly learning PBDs was $(1/\\epsilon)^{O(\\log(1/\\epsilon))}$.\n  As one o","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":"2015-11-12T20:47:37Z","title":"Properly Learning Poisson Binomial Distributions in Almost Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04066","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:043f38c2dd55f095e7928adcedede8bb33f04024bf915f47b9397422b6f2a0b6","target":"record","created_at":"2026-05-18T01:27:06Z","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":"3e23ff3229f2e90487363dc9e93a02cb0281d68917cffba40f48f8553833aa00","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-12T20:47:37Z","title_canon_sha256":"e081e9fec5f6939087d3f83c3f08a28ecef6ee33da76abd79a77504957f4181f"},"schema_version":"1.0","source":{"id":"1511.04066","kind":"arxiv","version":1}},"canonical_sha256":"fec7794f3806757bcb4a168f97f3b52296d040710704dd0cb71f84dee13b1938","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fec7794f3806757bcb4a168f97f3b52296d040710704dd0cb71f84dee13b1938","first_computed_at":"2026-05-18T01:27:06.024930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:06.024930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+yIw4wG9nIZNCYCzWBX4TO5VmIc6rShZS3X6ORV7ORwCZDGzUeSY3Ojg3wnJ/EuCf8ilZYpO2nFEvbtTGfFQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:06.025561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:043f38c2dd55f095e7928adcedede8bb33f04024bf915f47b9397422b6f2a0b6","sha256:a0b515216d4ad15f5ebcd0c45c7d907883fdb89d47112500c679d91f69bf533a"],"state_sha256":"03f7d69b20c31e857355b2a4a1a4d0be9be592824d9887decac7e7041dd46f0f"}