{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:73DXSTZYAZ2XXS2KC2HZP45VEK","short_pith_number":"pith:73DXSTZY","canonical_record":{"source":{"id":"1511.04066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-12T20:47:37Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"e081e9fec5f6939087d3f83c3f08a28ecef6ee33da76abd79a77504957f4181f","abstract_canon_sha256":"3e23ff3229f2e90487363dc9e93a02cb0281d68917cffba40f48f8553833aa00"},"schema_version":"1.0"},"canonical_sha256":"fec7794f3806757bcb4a168f97f3b52296d040710704dd0cb71f84dee13b1938","source":{"kind":"arxiv","id":"1511.04066","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:73DXSTZYAZ2XXS2KC2HZP45VEK","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-12T20:47:37Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"e081e9fec5f6939087d3f83c3f08a28ecef6ee33da76abd79a77504957f4181f","abstract_canon_sha256":"3e23ff3229f2e90487363dc9e93a02cb0281d68917cffba40f48f8553833aa00"},"schema_version":"1.0"},"canonical_sha256":"fec7794f3806757bcb4a168f97f3b52296d040710704dd0cb71f84dee13b1938","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:06.025561Z","signature_b64":"+yIw4wG9nIZNCYCzWBX4TO5VmIc6rShZS3X6ORV7ORwCZDGzUeSY3Ojg3wnJ/EuCf8ilZYpO2nFEvbtTGfFQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fec7794f3806757bcb4a168f97f3b52296d040710704dd0cb71f84dee13b1938","last_reissued_at":"2026-05-18T01:27:06.024930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:06.024930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04066","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:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61G502Lzsb/YExsa47Ri4F9QyZcNBtgFMbeKQbw4QE+x0r7Z6OYTSxgBiq+yyGzclidH5lLIzLwR5RgTTT/KCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:10.044841Z"},"content_sha256":"043f38c2dd55f095e7928adcedede8bb33f04024bf915f47b9397422b6f2a0b6","schema_version":"1.0","event_id":"sha256:043f38c2dd55f095e7928adcedede8bb33f04024bf915f47b9397422b6f2a0b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:73DXSTZYAZ2XXS2KC2HZP45VEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Properly Learning Poisson Binomial Distributions in Almost Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Alistair Stewart, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2015-11-12T20:47:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04066","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:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psfZgSioIBMmsUdOBfZ2Q6kU8bdmsOY52DBWc1uOkaoBW/cdFhoX3Ut4HqoxPf1duEFs3H1mF+CD2Ht6k0RpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:10.045565Z"},"content_sha256":"a0b515216d4ad15f5ebcd0c45c7d907883fdb89d47112500c679d91f69bf533a","schema_version":"1.0","event_id":"sha256:a0b515216d4ad15f5ebcd0c45c7d907883fdb89d47112500c679d91f69bf533a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73DXSTZYAZ2XXS2KC2HZP45VEK/bundle.json","state_url":"https://pith.science/pith/73DXSTZYAZ2XXS2KC2HZP45VEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73DXSTZYAZ2XXS2KC2HZP45VEK/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-26T19:06:10Z","links":{"resolver":"https://pith.science/pith/73DXSTZYAZ2XXS2KC2HZP45VEK","bundle":"https://pith.science/pith/73DXSTZYAZ2XXS2KC2HZP45VEK/bundle.json","state":"https://pith.science/pith/73DXSTZYAZ2XXS2KC2HZP45VEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73DXSTZYAZ2XXS2KC2HZP45VEK/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZ0flg2DcnumTsPPbHP3Q4ykRye20+vd6HDfQ1ShW5SlYlMSfY8qKi/sTxT459omiAaCMeJZ224BfaFeQBdhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:06:10.049235Z","bundle_sha256":"bd5e8f8ddd45b5ac5ba9e1061256f1d02d3eafe03b55d8734375241cc14fb625"}}