{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G7DUY2JYJR2YQD75ERNHLSSHC5","short_pith_number":"pith:G7DUY2JY","schema_version":"1.0","canonical_sha256":"37c74c69384c75880ffd245a75ca47174cb15466ae9ee1629f85023f5dcd9295","source":{"kind":"arxiv","id":"1707.05662","version":1},"attestation_state":"computed","paper":{"title":"Learning Powers of Poisson Binomial Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Dimitris Fotakis, Paul Spirakis, Piotr Krysta, Vasilis Kontonis","submitted_at":"2017-07-18T15:02:43Z","abstract_excerpt":"We introduce the problem of simultaneously learning all powers of a Poisson Binomial Distribution (PBD). A PBD of order $n$ is the distribution of a sum of $n$ mutually independent Bernoulli random variables $X_i$, where $\\mathbb{E}[X_i] = p_i$. The $k$'th power of this distribution, for $k$ in a range $[m]$, is the distribution of $P_k = \\sum_{i=1}^n X_i^{(k)}$, where each Bernoulli random variable $X_i^{(k)}$ has $\\mathbb{E}[X_i^{(k)}] = (p_i)^k$. The learning algorithm can query any power $P_k$ several times and succeeds in learning all powers in the range, if with probability at least $1- "},"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":"1707.05662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-18T15:02:43Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"f6a9e925b2450862ebb427a0abca70dc5ffb85fc9729b01cd5be6f9dc79f8ff8","abstract_canon_sha256":"7d78c3aa8caafdad1b2bf5dd852034e27ca094f39a42c1d877f6f384651d3eb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:01.804662Z","signature_b64":"lj7ew/8wVhjKuAifAiPWNoO5x1CXWueParQ77fMGxHnzhIgrgz9fAgpKeAyXhHMYetuIHrH0kYweCNWzChxRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c74c69384c75880ffd245a75ca47174cb15466ae9ee1629f85023f5dcd9295","last_reissued_at":"2026-05-18T00:40:01.803965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:01.803965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Powers of Poisson Binomial Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Dimitris Fotakis, Paul Spirakis, Piotr Krysta, Vasilis Kontonis","submitted_at":"2017-07-18T15:02:43Z","abstract_excerpt":"We introduce the problem of simultaneously learning all powers of a Poisson Binomial Distribution (PBD). A PBD of order $n$ is the distribution of a sum of $n$ mutually independent Bernoulli random variables $X_i$, where $\\mathbb{E}[X_i] = p_i$. The $k$'th power of this distribution, for $k$ in a range $[m]$, is the distribution of $P_k = \\sum_{i=1}^n X_i^{(k)}$, where each Bernoulli random variable $X_i^{(k)}$ has $\\mathbb{E}[X_i^{(k)}] = (p_i)^k$. The learning algorithm can query any power $P_k$ several times and succeeds in learning all powers in the range, if with probability at least $1- "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05662","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":"1707.05662","created_at":"2026-05-18T00:40:01.804076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05662v1","created_at":"2026-05-18T00:40:01.804076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05662","created_at":"2026-05-18T00:40:01.804076+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7DUY2JYJR2Y","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7DUY2JYJR2YQD75","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7DUY2JY","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5","json":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5.json","graph_json":"https://pith.science/api/pith-number/G7DUY2JYJR2YQD75ERNHLSSHC5/graph.json","events_json":"https://pith.science/api/pith-number/G7DUY2JYJR2YQD75ERNHLSSHC5/events.json","paper":"https://pith.science/paper/G7DUY2JY"},"agent_actions":{"view_html":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5","download_json":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5.json","view_paper":"https://pith.science/paper/G7DUY2JY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05662&json=true","fetch_graph":"https://pith.science/api/pith-number/G7DUY2JYJR2YQD75ERNHLSSHC5/graph.json","fetch_events":"https://pith.science/api/pith-number/G7DUY2JYJR2YQD75ERNHLSSHC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5/action/storage_attestation","attest_author":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5/action/author_attestation","sign_citation":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5/action/citation_signature","submit_replication":"https://pith.science/pith/G7DUY2JYJR2YQD75ERNHLSSHC5/action/replication_record"}},"created_at":"2026-05-18T00:40:01.804076+00:00","updated_at":"2026-05-18T00:40:01.804076+00:00"}