{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6YF7TB3SNHJLT2DD2ZWVHPYHPS","short_pith_number":"pith:6YF7TB3S","canonical_record":{"source":{"id":"1609.07521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T21:18:31Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c2b53fb070c52e4b5ca788d815a3e5f0f0fb63f5a705b92a082c0056b8291eec","abstract_canon_sha256":"a61dd0bbbef529a350ae2926eb2cc8de6cc7daa029997625d7739d610da9b641"},"schema_version":"1.0"},"canonical_sha256":"f60bf9877269d2b9e863d66d53bf077cb20e166aa89a8e9aab0992bb46412484","source":{"kind":"arxiv","id":"1609.07521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07521","created_at":"2026-05-18T00:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07521v1","created_at":"2026-05-18T00:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07521","created_at":"2026-05-18T00:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"6YF7TB3SNHJL","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6YF7TB3SNHJLT2DD","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6YF7TB3S","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6YF7TB3SNHJLT2DD2ZWVHPYHPS","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T21:18:31Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c2b53fb070c52e4b5ca788d815a3e5f0f0fb63f5a705b92a082c0056b8291eec","abstract_canon_sha256":"a61dd0bbbef529a350ae2926eb2cc8de6cc7daa029997625d7739d610da9b641"},"schema_version":"1.0"},"canonical_sha256":"f60bf9877269d2b9e863d66d53bf077cb20e166aa89a8e9aab0992bb46412484","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:46.807762Z","signature_b64":"GYyg8K1U6JgKyedHZ+Q5SRAUvjA0gET8+HZRoCoJjtSlotG+isVuNFmNikFNIPPoKiht6yRvhZZvEwSM3k1yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60bf9877269d2b9e863d66d53bf077cb20e166aa89a8e9aab0992bb46412484","last_reissued_at":"2026-05-18T00:30:46.807309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:46.807309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07521","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-18T00:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DM4sumWJCArD5zProXcY1r2vFdsxlsrW68qFXAK6XXupDSIfQy0Ys8r/pASUgNRbOljSDPjsfTp16RNUWZ6kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:59:39.343818Z"},"content_sha256":"6532311eb21e904a13df5dc230a719cb50aedf7859ac7bbe4ebc3358222cc1bd","schema_version":"1.0","event_id":"sha256:6532311eb21e904a13df5dc230a719cb50aedf7859ac7bbe4ebc3358222cc1bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6YF7TB3SNHJLT2DD2ZWVHPYHPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Learning of Clusters and Topics via Sparse Posteriors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Erik B. Sudderth, Michael C. Hughes","submitted_at":"2016-09-23T21:18:31Z","abstract_excerpt":"Mixture models and topic models generate each observation from a single cluster, but standard variational posteriors for each observation assign positive probability to all possible clusters. This requires dense storage and runtime costs that scale with the total number of clusters, even though typically only a few clusters have significant posterior mass for any data point. We propose a constrained family of sparse variational distributions that allow at most $L$ non-zero entries, where the tunable threshold $L$ trades off speed for accuracy. Previous sparse approximations have used hard assi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07521","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-18T00:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9XGWYds8wQHFD5ceBIuQ+a1q+3fkrpcatk0m4KFYkyh18E0mc53RDecdrTdIKEJ+TLq68pbaSVAaYZg2g+jsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:59:39.344435Z"},"content_sha256":"2d1661b28ec49fa0e68fce6508a8d74cbfd2c8e3ad64fcb7a05e971085b95992","schema_version":"1.0","event_id":"sha256:2d1661b28ec49fa0e68fce6508a8d74cbfd2c8e3ad64fcb7a05e971085b95992"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/bundle.json","state_url":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/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-26T21:59:39Z","links":{"resolver":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS","bundle":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/bundle.json","state":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6YF7TB3SNHJLT2DD2ZWVHPYHPS","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":"a61dd0bbbef529a350ae2926eb2cc8de6cc7daa029997625d7739d610da9b641","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T21:18:31Z","title_canon_sha256":"c2b53fb070c52e4b5ca788d815a3e5f0f0fb63f5a705b92a082c0056b8291eec"},"schema_version":"1.0","source":{"id":"1609.07521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07521","created_at":"2026-05-18T00:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07521v1","created_at":"2026-05-18T00:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07521","created_at":"2026-05-18T00:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"6YF7TB3SNHJL","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6YF7TB3SNHJLT2DD","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6YF7TB3S","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:2d1661b28ec49fa0e68fce6508a8d74cbfd2c8e3ad64fcb7a05e971085b95992","target":"graph","created_at":"2026-05-18T00:30:46Z","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":"Mixture models and topic models generate each observation from a single cluster, but standard variational posteriors for each observation assign positive probability to all possible clusters. This requires dense storage and runtime costs that scale with the total number of clusters, even though typically only a few clusters have significant posterior mass for any data point. We propose a constrained family of sparse variational distributions that allow at most $L$ non-zero entries, where the tunable threshold $L$ trades off speed for accuracy. Previous sparse approximations have used hard assi","authors_text":"Erik B. Sudderth, Michael C. Hughes","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T21:18:31Z","title":"Fast Learning of Clusters and Topics via Sparse Posteriors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07521","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:6532311eb21e904a13df5dc230a719cb50aedf7859ac7bbe4ebc3358222cc1bd","target":"record","created_at":"2026-05-18T00:30:46Z","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":"a61dd0bbbef529a350ae2926eb2cc8de6cc7daa029997625d7739d610da9b641","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-23T21:18:31Z","title_canon_sha256":"c2b53fb070c52e4b5ca788d815a3e5f0f0fb63f5a705b92a082c0056b8291eec"},"schema_version":"1.0","source":{"id":"1609.07521","kind":"arxiv","version":1}},"canonical_sha256":"f60bf9877269d2b9e863d66d53bf077cb20e166aa89a8e9aab0992bb46412484","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f60bf9877269d2b9e863d66d53bf077cb20e166aa89a8e9aab0992bb46412484","first_computed_at":"2026-05-18T00:30:46.807309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:46.807309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GYyg8K1U6JgKyedHZ+Q5SRAUvjA0gET8+HZRoCoJjtSlotG+isVuNFmNikFNIPPoKiht6yRvhZZvEwSM3k1yBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:46.807762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6532311eb21e904a13df5dc230a719cb50aedf7859ac7bbe4ebc3358222cc1bd","sha256:2d1661b28ec49fa0e68fce6508a8d74cbfd2c8e3ad64fcb7a05e971085b95992"],"state_sha256":"3c9c5046e3c48ccf23e0c389d11708d81de507572d499a11601f0122f959f719"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eb5FKvBA5kbeSGddbcTrdhf9Jt44beFmE4YQMY1ZG6sB4NagoEatDGFaSMMLpsngHVjNiMRozdrrekPz2YhFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:59:39.347537Z","bundle_sha256":"c33234fb58f051c6acf6cb55f4ef0c2587eac30de37f609a02490654307dde0d"}}