{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6YF7TB3SNHJLT2DD2ZWVHPYHPS","short_pith_number":"pith:6YF7TB3S","schema_version":"1.0","canonical_sha256":"f60bf9877269d2b9e863d66d53bf077cb20e166aa89a8e9aab0992bb46412484","source":{"kind":"arxiv","id":"1609.07521","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.07521","created_at":"2026-05-18T00:30:46.807386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07521v1","created_at":"2026-05-18T00:30:46.807386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07521","created_at":"2026-05-18T00:30:46.807386+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YF7TB3SNHJL","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YF7TB3SNHJLT2DD","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YF7TB3S","created_at":"2026-05-18T12:30:04.600751+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/6YF7TB3SNHJLT2DD2ZWVHPYHPS","json":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS.json","graph_json":"https://pith.science/api/pith-number/6YF7TB3SNHJLT2DD2ZWVHPYHPS/graph.json","events_json":"https://pith.science/api/pith-number/6YF7TB3SNHJLT2DD2ZWVHPYHPS/events.json","paper":"https://pith.science/paper/6YF7TB3S"},"agent_actions":{"view_html":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS","download_json":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS.json","view_paper":"https://pith.science/paper/6YF7TB3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07521&json=true","fetch_graph":"https://pith.science/api/pith-number/6YF7TB3SNHJLT2DD2ZWVHPYHPS/graph.json","fetch_events":"https://pith.science/api/pith-number/6YF7TB3SNHJLT2DD2ZWVHPYHPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/action/storage_attestation","attest_author":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/action/author_attestation","sign_citation":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/action/citation_signature","submit_replication":"https://pith.science/pith/6YF7TB3SNHJLT2DD2ZWVHPYHPS/action/replication_record"}},"created_at":"2026-05-18T00:30:46.807386+00:00","updated_at":"2026-05-18T00:30:46.807386+00:00"}