{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BTBVCIXGACALAYZHIOGAGSTBEY","short_pith_number":"pith:BTBVCIXG","schema_version":"1.0","canonical_sha256":"0cc35122e60080b06327438c034a61260bcbc78aee798d0a3dae9ba0fb1cdfb8","source":{"kind":"arxiv","id":"1205.3549","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.3549","created_at":"2026-05-18T03:55:24.435750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.3549v2","created_at":"2026-05-18T03:55:24.435750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3549","created_at":"2026-05-18T03:55:24.435750+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTBVCIXGACAL","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTBVCIXGACALAYZH","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTBVCIXG","created_at":"2026-05-18T12:27:01.376967+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/BTBVCIXGACALAYZHIOGAGSTBEY","json":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY.json","graph_json":"https://pith.science/api/pith-number/BTBVCIXGACALAYZHIOGAGSTBEY/graph.json","events_json":"https://pith.science/api/pith-number/BTBVCIXGACALAYZHIOGAGSTBEY/events.json","paper":"https://pith.science/paper/BTBVCIXG"},"agent_actions":{"view_html":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY","download_json":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY.json","view_paper":"https://pith.science/paper/BTBVCIXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.3549&json=true","fetch_graph":"https://pith.science/api/pith-number/BTBVCIXGACALAYZHIOGAGSTBEY/graph.json","fetch_events":"https://pith.science/api/pith-number/BTBVCIXGACALAYZHIOGAGSTBEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/action/storage_attestation","attest_author":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/action/author_attestation","sign_citation":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/action/citation_signature","submit_replication":"https://pith.science/pith/BTBVCIXGACALAYZHIOGAGSTBEY/action/replication_record"}},"created_at":"2026-05-18T03:55:24.435750+00:00","updated_at":"2026-05-18T03:55:24.435750+00:00"}