{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TQZ77PBJ7CUIZ52CEHX2P3WN7U","short_pith_number":"pith:TQZ77PBJ","canonical_record":{"source":{"id":"1008.0204","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-01T20:24:02Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"bb45d9f763c311064e931cfe69d5d11ffe8558c1f46d12055239bbd0017013b8","abstract_canon_sha256":"4ce079256c8e44043b19f3390df6491a4b75239672b3f294c682c0490fbade27"},"schema_version":"1.0"},"canonical_sha256":"9c33ffbc29f8a88cf74221efa7eecdfd078f85a043f50cd634584a7173235d74","source":{"kind":"arxiv","id":"1008.0204","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0204","created_at":"2026-05-18T03:32:32Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0204v4","created_at":"2026-05-18T03:32:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0204","created_at":"2026-05-18T03:32:32Z"},{"alias_kind":"pith_short_12","alias_value":"TQZ77PBJ7CUI","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TQZ77PBJ7CUIZ52C","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TQZ77PBJ","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TQZ77PBJ7CUIZ52CEHX2P3WN7U","target":"record","payload":{"canonical_record":{"source":{"id":"1008.0204","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-01T20:24:02Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"bb45d9f763c311064e931cfe69d5d11ffe8558c1f46d12055239bbd0017013b8","abstract_canon_sha256":"4ce079256c8e44043b19f3390df6491a4b75239672b3f294c682c0490fbade27"},"schema_version":"1.0"},"canonical_sha256":"9c33ffbc29f8a88cf74221efa7eecdfd078f85a043f50cd634584a7173235d74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:32.076818Z","signature_b64":"hpjbyz0fzpIs7rcOk2GUjQ14BTQv8hsrEiW1j/JvTgriMrkCHCKj+kOf8y1Zb0xQiXk9MX5JsElJptDKGKmDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c33ffbc29f8a88cf74221efa7eecdfd078f85a043f50cd634584a7173235d74","last_reissued_at":"2026-05-18T03:32:32.076040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:32.076040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.0204","source_version":4,"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-18T03:32:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ub4yAfNQeFRN2Zwaw5TvnwGt7n13G4K7hwbPvxzNKMF0lQl8fBCBf9sccSAjI5XVAcl9QgVO6bDjtQV1KHIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:17:16.164687Z"},"content_sha256":"4405c9ae09c4e606d359a13622dda64cf3c5327b0a2f1e1e88dd996d9b15edc8","schema_version":"1.0","event_id":"sha256:4405c9ae09c4e606d359a13622dda64cf3c5327b0a2f1e1e88dd996d9b15edc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TQZ77PBJ7CUIZ52CEHX2P3WN7U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixture decompositions of exponential families using a decomposition of their sample spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Guido Montufar","submitted_at":"2010-08-01T20:24:02Z","abstract_excerpt":"We study the problem of finding the smallest $m$ such that every element of an exponential family can be written as a mixture of $m$ elements of another exponential family. We propose an approach based on coverings and packings of the face lattice of the corresponding convex support polytopes and results from coding theory. We show that $m=q^{N-1}$ is the smallest number for which any distribution of $N$ $q$-ary variables can be written as mixture of $m$ independent $q$-ary variables. Furthermore, we show that any distribution of $N$ binary variables is a mixture of $m = 2^{N-(k+1)}(1+ 1/(2^k-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0204","kind":"arxiv","version":4},"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-18T03:32:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PH6ZRLYBIMzDg7gMp6le25m2ArUMocmprm32ryaepX0M9QS38kSiOSfqLdPMKon5YqC6YWPCqJ4CsT+TTWAbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:17:16.165044Z"},"content_sha256":"ef6c26611ce9d01a7df9ffaaebdc6a030b948aed39325dfc7e641d5887ec1833","schema_version":"1.0","event_id":"sha256:ef6c26611ce9d01a7df9ffaaebdc6a030b948aed39325dfc7e641d5887ec1833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQZ77PBJ7CUIZ52CEHX2P3WN7U/bundle.json","state_url":"https://pith.science/pith/TQZ77PBJ7CUIZ52CEHX2P3WN7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQZ77PBJ7CUIZ52CEHX2P3WN7U/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-06-02T12:17:16Z","links":{"resolver":"https://pith.science/pith/TQZ77PBJ7CUIZ52CEHX2P3WN7U","bundle":"https://pith.science/pith/TQZ77PBJ7CUIZ52CEHX2P3WN7U/bundle.json","state":"https://pith.science/pith/TQZ77PBJ7CUIZ52CEHX2P3WN7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQZ77PBJ7CUIZ52CEHX2P3WN7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TQZ77PBJ7CUIZ52CEHX2P3WN7U","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":"4ce079256c8e44043b19f3390df6491a4b75239672b3f294c682c0490fbade27","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-01T20:24:02Z","title_canon_sha256":"bb45d9f763c311064e931cfe69d5d11ffe8558c1f46d12055239bbd0017013b8"},"schema_version":"1.0","source":{"id":"1008.0204","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0204","created_at":"2026-05-18T03:32:32Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0204v4","created_at":"2026-05-18T03:32:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0204","created_at":"2026-05-18T03:32:32Z"},{"alias_kind":"pith_short_12","alias_value":"TQZ77PBJ7CUI","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TQZ77PBJ7CUIZ52C","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TQZ77PBJ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:ef6c26611ce9d01a7df9ffaaebdc6a030b948aed39325dfc7e641d5887ec1833","target":"graph","created_at":"2026-05-18T03:32:32Z","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 problem of finding the smallest $m$ such that every element of an exponential family can be written as a mixture of $m$ elements of another exponential family. We propose an approach based on coverings and packings of the face lattice of the corresponding convex support polytopes and results from coding theory. We show that $m=q^{N-1}$ is the smallest number for which any distribution of $N$ $q$-ary variables can be written as mixture of $m$ independent $q$-ary variables. Furthermore, we show that any distribution of $N$ binary variables is a mixture of $m = 2^{N-(k+1)}(1+ 1/(2^k-","authors_text":"Guido Montufar","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-01T20:24:02Z","title":"Mixture decompositions of exponential families using a decomposition of their sample spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0204","kind":"arxiv","version":4},"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:4405c9ae09c4e606d359a13622dda64cf3c5327b0a2f1e1e88dd996d9b15edc8","target":"record","created_at":"2026-05-18T03:32:32Z","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":"4ce079256c8e44043b19f3390df6491a4b75239672b3f294c682c0490fbade27","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-01T20:24:02Z","title_canon_sha256":"bb45d9f763c311064e931cfe69d5d11ffe8558c1f46d12055239bbd0017013b8"},"schema_version":"1.0","source":{"id":"1008.0204","kind":"arxiv","version":4}},"canonical_sha256":"9c33ffbc29f8a88cf74221efa7eecdfd078f85a043f50cd634584a7173235d74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c33ffbc29f8a88cf74221efa7eecdfd078f85a043f50cd634584a7173235d74","first_computed_at":"2026-05-18T03:32:32.076040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:32.076040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hpjbyz0fzpIs7rcOk2GUjQ14BTQv8hsrEiW1j/JvTgriMrkCHCKj+kOf8y1Zb0xQiXk9MX5JsElJptDKGKmDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:32.076818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.0204","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4405c9ae09c4e606d359a13622dda64cf3c5327b0a2f1e1e88dd996d9b15edc8","sha256:ef6c26611ce9d01a7df9ffaaebdc6a030b948aed39325dfc7e641d5887ec1833"],"state_sha256":"65df402cdf69119c1151307bd990a63bc5d5806fa751647f79e8d6f089600db5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DZj6LppPziLH1yBZIX6odSkso97MyGmtyEM1FQw+XeHb4T6Y6/ETfv+CkCYmVPOEipb2QktevRMNvzvXrZCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:17:16.167015Z","bundle_sha256":"c9a609ad6e08e8ac3e8786ff3cf9a0e30bfc825abd7ffc345529d0953ac2ca06"}}