{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BTBVCIXGACALAYZHIOGAGSTBEY","short_pith_number":"pith:BTBVCIXG","canonical_record":{"source":{"id":"1205.3549","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-16T03:54:30Z","cross_cats_sorted":[],"title_canon_sha256":"e3ac49b58927031050f9d38bded9e0c8c584e3b882492b76bb397554f2665fbe","abstract_canon_sha256":"07df2292b45aff07d357688ea5f168d57ac4fc96b75ca20d06d3a03d872a5d55"},"schema_version":"1.0"},"canonical_sha256":"0cc35122e60080b06327438c034a61260bcbc78aee798d0a3dae9ba0fb1cdfb8","source":{"kind":"arxiv","id":"1205.3549","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3549","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3549v2","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3549","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"BTBVCIXGACAL","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTBVCIXGACALAYZH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTBVCIXG","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BTBVCIXGACALAYZHIOGAGSTBEY","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3549","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-16T03:54:30Z","cross_cats_sorted":[],"title_canon_sha256":"e3ac49b58927031050f9d38bded9e0c8c584e3b882492b76bb397554f2665fbe","abstract_canon_sha256":"07df2292b45aff07d357688ea5f168d57ac4fc96b75ca20d06d3a03d872a5d55"},"schema_version":"1.0"},"canonical_sha256":"0cc35122e60080b06327438c034a61260bcbc78aee798d0a3dae9ba0fb1cdfb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:24.436382Z","signature_b64":"SVYmKAgOT0VVePovAzdgzgKs3y5Iqomn499zlUCA0wtyQW5mtfsUwJbM5DGpZxcOBTHMlOIgB9hSpCRmGih8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc35122e60080b06327438c034a61260bcbc78aee798d0a3dae9ba0fb1cdfb8","last_reissued_at":"2026-05-18T03:55:24.435627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:24.435627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3549","source_version":2,"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:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qod1rb7RQAuN3UJTOQoN/IkN3OzJTUJW+hGZcy/ODFQHujuALAgSYc4o67KXkpgF3qRWaw43ncsG6G3MUiISAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:58:08.273762Z"},"content_sha256":"907ff8ccb29a45a3190b21eb2f0f4cefd0eb535018b1a72b0599b512d49fc9d5","schema_version":"1.0","event_id":"sha256:907ff8ccb29a45a3190b21eb2f0f4cefd0eb535018b1a72b0599b512d49fc9d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BTBVCIXGACALAYZHIOGAGSTBEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Normalized Maximum Likelihood Coding for Exponential Family with Its Applications to Optimal Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kenji Yamanishi, So Hirai","submitted_at":"2012-05-16T03:54:30Z","abstract_excerpt":"We are concerned with the issue of how to calculate the normalized maximum likelihood (NML) code-length. There is a problem that the normalization term of the NML code-length may diverge when it is continuous and unbounded and a straightforward computation of it is highly expensive when the data domain is finite . In previous works it has been investigated how to calculate the NML code-length for specific types of distributions. We first propose a general method for computing the NML code-length for the exponential family. Then we specifically focus on Gaussian mixture model (GMM), and propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3549","kind":"arxiv","version":2},"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:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rfb0LL29PEM3tAUwHpxDRp6l214VqY5Q/bNgmfnLagIowjGesqX1nNue8GOXp6ypULjlAqvdpqhtf6TwGaTbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:58:08.274465Z"},"content_sha256":"b8cc392b2cf8c8fe8690e14467e0489ed7ae2251524c73631640b7f5b990b4e3","schema_version":"1.0","event_id":"sha256:b8cc392b2cf8c8fe8690e14467e0489ed7ae2251524c73631640b7f5b990b4e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/bundle.json","state_url":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTBVCIXGACALAYZHIOGAGSTBEY/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-07T21:58:08Z","links":{"resolver":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY","bundle":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/bundle.json","state":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTBVCIXGACALAYZHIOGAGSTBEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BTBVCIXGACALAYZHIOGAGSTBEY","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":"07df2292b45aff07d357688ea5f168d57ac4fc96b75ca20d06d3a03d872a5d55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-16T03:54:30Z","title_canon_sha256":"e3ac49b58927031050f9d38bded9e0c8c584e3b882492b76bb397554f2665fbe"},"schema_version":"1.0","source":{"id":"1205.3549","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3549","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3549v2","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3549","created_at":"2026-05-18T03:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"BTBVCIXGACAL","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTBVCIXGACALAYZH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTBVCIXG","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:b8cc392b2cf8c8fe8690e14467e0489ed7ae2251524c73631640b7f5b990b4e3","target":"graph","created_at":"2026-05-18T03:55:24Z","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 are concerned with the issue of how to calculate the normalized maximum likelihood (NML) code-length. There is a problem that the normalization term of the NML code-length may diverge when it is continuous and unbounded and a straightforward computation of it is highly expensive when the data domain is finite . In previous works it has been investigated how to calculate the NML code-length for specific types of distributions. We first propose a general method for computing the NML code-length for the exponential family. Then we specifically focus on Gaussian mixture model (GMM), and propose","authors_text":"Kenji Yamanishi, So Hirai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-16T03:54:30Z","title":"Normalized Maximum Likelihood Coding for Exponential Family with Its Applications to Optimal Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3549","kind":"arxiv","version":2},"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:907ff8ccb29a45a3190b21eb2f0f4cefd0eb535018b1a72b0599b512d49fc9d5","target":"record","created_at":"2026-05-18T03:55:24Z","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":"07df2292b45aff07d357688ea5f168d57ac4fc96b75ca20d06d3a03d872a5d55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-16T03:54:30Z","title_canon_sha256":"e3ac49b58927031050f9d38bded9e0c8c584e3b882492b76bb397554f2665fbe"},"schema_version":"1.0","source":{"id":"1205.3549","kind":"arxiv","version":2}},"canonical_sha256":"0cc35122e60080b06327438c034a61260bcbc78aee798d0a3dae9ba0fb1cdfb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cc35122e60080b06327438c034a61260bcbc78aee798d0a3dae9ba0fb1cdfb8","first_computed_at":"2026-05-18T03:55:24.435627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:24.435627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SVYmKAgOT0VVePovAzdgzgKs3y5Iqomn499zlUCA0wtyQW5mtfsUwJbM5DGpZxcOBTHMlOIgB9hSpCRmGih8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:24.436382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3549","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:907ff8ccb29a45a3190b21eb2f0f4cefd0eb535018b1a72b0599b512d49fc9d5","sha256:b8cc392b2cf8c8fe8690e14467e0489ed7ae2251524c73631640b7f5b990b4e3"],"state_sha256":"11c7768c246fc8381945e68cbf29b9f560c9642573c268303608c9c27f7c3bcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3o4Cb0nV/sHxwi7jLsfA8jQyUjL05hKcFMBrk0ZWTuTGvtiQpAn4jZxNs08pzSZmJ+y8aKM+E2USSTdL21rBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:58:08.278347Z","bundle_sha256":"ffb8e62abb08925bbf064daa60e8f518e8d9a899d468489d916169f75d2e16df"}}