{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CA7DWSWHTOXE2QEBZAGFHEA7YN","short_pith_number":"pith:CA7DWSWH","canonical_record":{"source":{"id":"1302.1552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-06T15:57:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"42c4650a9ebbdd3b219c65c3bfd580bf26a8b4ac0e4d4505a9fe133ec2009570","abstract_canon_sha256":"f82d674e2b987ae13e487cec2055f7a604f10688ee4910bb1b176582340650f8"},"schema_version":"1.0"},"canonical_sha256":"103e3b4ac79bae4d4081c80c53901fc36ff6317da836e452e1af43648218825a","source":{"kind":"arxiv","id":"1302.1552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1552","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1552v1","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1552","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"CA7DWSWHTOXE","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CA7DWSWHTOXE2QEB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CA7DWSWH","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CA7DWSWHTOXE2QEBZAGFHEA7YN","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-06T15:57:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"42c4650a9ebbdd3b219c65c3bfd580bf26a8b4ac0e4d4505a9fe133ec2009570","abstract_canon_sha256":"f82d674e2b987ae13e487cec2055f7a604f10688ee4910bb1b176582340650f8"},"schema_version":"1.0"},"canonical_sha256":"103e3b4ac79bae4d4081c80c53901fc36ff6317da836e452e1af43648218825a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:15.593069Z","signature_b64":"rQ/+ALVitJVBIndxwbAsu2ZZaV195sEckz+HMih/4PfErnseMOJHfPgrngpmPB2hj3Bp4GVZ2XKBCzAyPWTfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"103e3b4ac79bae4d4081c80c53901fc36ff6317da836e452e1af43648218825a","last_reissued_at":"2026-05-18T03:34:15.592362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:15.592362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1552","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-18T03:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HwLlTfxELqDvmdqg7wXwaIQd1a6BPc6Ya/Kj1oCFycPga0FnxojcqSO8Q2XWvGQVVVCVoSKFdrjZPsWrn5o/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:40:02.072694Z"},"content_sha256":"207ed455e58c232cffe257d8fd10596f0697be9f91cfa72ac37f2d05a56075b0","schema_version":"1.0","event_id":"sha256:207ed455e58c232cffe257d8fd10596f0697be9f91cfa72ac37f2d05a56075b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CA7DWSWHTOXE2QEBZAGFHEA7YN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Y. Ng, Michael Kearns, Yishay Mansour","submitted_at":"2013-02-06T15:57:20Z","abstract_excerpt":"Assignment methods are at the heart of many algorithms for unsupervised learning and clustering - in particular, the well-known K-means and Expectation-Maximization (EM) algorithms.  In this work, we study several different methods of assignment, including the \"hard\" assignments used by K-means and the ?soft' assignments used by EM. While it is known that K-means minimizes the distortion on the data and EM maximizes the likelihood, little is known about the systematic differences of behavior between the two algorithms. Here we shed light on these differences via an information-theoretic analys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1552","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-18T03:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sp8+TkF8S1ayaUHvBKq42Cjty3ru1J1+F5631xLPmj5vi4lAWNMmcoO2NIbGfvRjFogU+lkpNMKucCmzfgPcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:40:02.073464Z"},"content_sha256":"3fbc21e1ac6979c966da8c43fc485749be76f6b3e54e825fc277bbb3c8d00c9e","schema_version":"1.0","event_id":"sha256:3fbc21e1ac6979c966da8c43fc485749be76f6b3e54e825fc277bbb3c8d00c9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CA7DWSWHTOXE2QEBZAGFHEA7YN/bundle.json","state_url":"https://pith.science/pith/CA7DWSWHTOXE2QEBZAGFHEA7YN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CA7DWSWHTOXE2QEBZAGFHEA7YN/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-31T19:40:02Z","links":{"resolver":"https://pith.science/pith/CA7DWSWHTOXE2QEBZAGFHEA7YN","bundle":"https://pith.science/pith/CA7DWSWHTOXE2QEBZAGFHEA7YN/bundle.json","state":"https://pith.science/pith/CA7DWSWHTOXE2QEBZAGFHEA7YN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CA7DWSWHTOXE2QEBZAGFHEA7YN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CA7DWSWHTOXE2QEBZAGFHEA7YN","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":"f82d674e2b987ae13e487cec2055f7a604f10688ee4910bb1b176582340650f8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-06T15:57:20Z","title_canon_sha256":"42c4650a9ebbdd3b219c65c3bfd580bf26a8b4ac0e4d4505a9fe133ec2009570"},"schema_version":"1.0","source":{"id":"1302.1552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1552","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1552v1","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1552","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"CA7DWSWHTOXE","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CA7DWSWHTOXE2QEB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CA7DWSWH","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:3fbc21e1ac6979c966da8c43fc485749be76f6b3e54e825fc277bbb3c8d00c9e","target":"graph","created_at":"2026-05-18T03:34:15Z","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":"Assignment methods are at the heart of many algorithms for unsupervised learning and clustering - in particular, the well-known K-means and Expectation-Maximization (EM) algorithms.  In this work, we study several different methods of assignment, including the \"hard\" assignments used by K-means and the ?soft' assignments used by EM. While it is known that K-means minimizes the distortion on the data and EM maximizes the likelihood, little is known about the systematic differences of behavior between the two algorithms. Here we shed light on these differences via an information-theoretic analys","authors_text":"Andrew Y. Ng, Michael Kearns, Yishay Mansour","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-06T15:57:20Z","title":"An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1552","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:207ed455e58c232cffe257d8fd10596f0697be9f91cfa72ac37f2d05a56075b0","target":"record","created_at":"2026-05-18T03:34:15Z","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":"f82d674e2b987ae13e487cec2055f7a604f10688ee4910bb1b176582340650f8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-06T15:57:20Z","title_canon_sha256":"42c4650a9ebbdd3b219c65c3bfd580bf26a8b4ac0e4d4505a9fe133ec2009570"},"schema_version":"1.0","source":{"id":"1302.1552","kind":"arxiv","version":1}},"canonical_sha256":"103e3b4ac79bae4d4081c80c53901fc36ff6317da836e452e1af43648218825a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"103e3b4ac79bae4d4081c80c53901fc36ff6317da836e452e1af43648218825a","first_computed_at":"2026-05-18T03:34:15.592362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:15.592362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rQ/+ALVitJVBIndxwbAsu2ZZaV195sEckz+HMih/4PfErnseMOJHfPgrngpmPB2hj3Bp4GVZ2XKBCzAyPWTfAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:15.593069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:207ed455e58c232cffe257d8fd10596f0697be9f91cfa72ac37f2d05a56075b0","sha256:3fbc21e1ac6979c966da8c43fc485749be76f6b3e54e825fc277bbb3c8d00c9e"],"state_sha256":"8d158c3da071b045ece4dbddffc50645a9e46afb497d7cc87337091ab06049ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6IuB8jU/G5Njo67oHowbTxcNcjOcKnuNQoLp6PfWOnuuTnLSGrub6VQONQec2dbJpjLArTdLrguMkekMpMTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:40:02.077747Z","bundle_sha256":"247848b3f4f9f2e99bafd1efa2f808682c02c3d08612a26448af91f3dbb105a1"}}