{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XY7MTBNNXTXRHT6ADVVKZHK3KG","short_pith_number":"pith:XY7MTBNN","canonical_record":{"source":{"id":"1301.0578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b765707de86b07d29fea99f05fd35d494949b7f0afb3bfddcf49df00c6192de4","abstract_canon_sha256":"61f083d0604b43d89d9fcc16ca799e2c184c91bfd8538e4779e148cbe30f2249"},"schema_version":"1.0"},"canonical_sha256":"be3ec985adbcef13cfc01d6aac9d5b51a0c0211853c012e18531f4a6341381ca","source":{"kind":"arxiv","id":"1301.0578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0578","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0578v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0578","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"XY7MTBNNXTXR","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XY7MTBNNXTXRHT6A","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XY7MTBNN","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XY7MTBNNXTXRHT6ADVVKZHK3KG","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b765707de86b07d29fea99f05fd35d494949b7f0afb3bfddcf49df00c6192de4","abstract_canon_sha256":"61f083d0604b43d89d9fcc16ca799e2c184c91bfd8538e4779e148cbe30f2249"},"schema_version":"1.0"},"canonical_sha256":"be3ec985adbcef13cfc01d6aac9d5b51a0c0211853c012e18531f4a6341381ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.406653Z","signature_b64":"8GqPR35KiJpLn5uc7F4e86X06IhP954XV2OGrUuC69ZPENKOrdTM6HwUWnYGAvsTjsGVAHsK+BtAmhzIBbwXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3ec985adbcef13cfc01d6aac9d5b51a0c0211853c012e18531f4a6341381ca","last_reissued_at":"2026-05-18T03:37:18.406193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.406193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0578","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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nc6MaZbaAhdsxgsvbssuS11NHZZmQXqlvnYcr8yVFoDofay2Uj4rYc18Y21axpwDZ6fI+yoNXEgGf899V3vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:32:36.745222Z"},"content_sha256":"84c582cf2ac18fbd4a5c8818eae8c3a8d077dcc93f217668d42e038564869074","schema_version":"1.0","event_id":"sha256:84c582cf2ac18fbd4a5c8818eae8c3a8d077dcc93f217668d42e038564869074"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XY7MTBNNXTXRHT6ADVVKZHK3KG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dimension Correction for Hierarchical Latent Class Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nevin Lianwen Zhang, Tomas Kocka","submitted_at":"2012-12-12T15:56:54Z","abstract_excerpt":"Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e. the  number of independent parameters.  When hidden variables are present, however, standard dimension might no longer be appropriate. One should instead use effective dimension (Geiger et al. 1996). This paper is concerned with the computation of effective dimension. First we present an upper bound on the effective dimension of a latent class (LC) model. This bound is tight and its computation is e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0578","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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ZOeQ843YdnMY/drgeFlmn/5uPnjEED18NOLyakjRfAN6BzRNZGowMpN4Ljgh7aAgmZR4NlkP5MydZ2Is22WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:32:36.745630Z"},"content_sha256":"e95892d8a37fd4676811b842f9682ba47b7464ea55da32d622adc5e57bc95660","schema_version":"1.0","event_id":"sha256:e95892d8a37fd4676811b842f9682ba47b7464ea55da32d622adc5e57bc95660"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XY7MTBNNXTXRHT6ADVVKZHK3KG/bundle.json","state_url":"https://pith.science/pith/XY7MTBNNXTXRHT6ADVVKZHK3KG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XY7MTBNNXTXRHT6ADVVKZHK3KG/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-27T03:32:36Z","links":{"resolver":"https://pith.science/pith/XY7MTBNNXTXRHT6ADVVKZHK3KG","bundle":"https://pith.science/pith/XY7MTBNNXTXRHT6ADVVKZHK3KG/bundle.json","state":"https://pith.science/pith/XY7MTBNNXTXRHT6ADVVKZHK3KG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XY7MTBNNXTXRHT6ADVVKZHK3KG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XY7MTBNNXTXRHT6ADVVKZHK3KG","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":"61f083d0604b43d89d9fcc16ca799e2c184c91bfd8538e4779e148cbe30f2249","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:54Z","title_canon_sha256":"b765707de86b07d29fea99f05fd35d494949b7f0afb3bfddcf49df00c6192de4"},"schema_version":"1.0","source":{"id":"1301.0578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0578","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0578v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0578","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"XY7MTBNNXTXR","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XY7MTBNNXTXRHT6A","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XY7MTBNN","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:e95892d8a37fd4676811b842f9682ba47b7464ea55da32d622adc5e57bc95660","target":"graph","created_at":"2026-05-18T03:37:18Z","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":"Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e. the  number of independent parameters.  When hidden variables are present, however, standard dimension might no longer be appropriate. One should instead use effective dimension (Geiger et al. 1996). This paper is concerned with the computation of effective dimension. First we present an upper bound on the effective dimension of a latent class (LC) model. This bound is tight and its computation is e","authors_text":"Nevin Lianwen Zhang, Tomas Kocka","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:54Z","title":"Dimension Correction for Hierarchical Latent Class Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0578","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:84c582cf2ac18fbd4a5c8818eae8c3a8d077dcc93f217668d42e038564869074","target":"record","created_at":"2026-05-18T03:37:18Z","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":"61f083d0604b43d89d9fcc16ca799e2c184c91bfd8538e4779e148cbe30f2249","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:54Z","title_canon_sha256":"b765707de86b07d29fea99f05fd35d494949b7f0afb3bfddcf49df00c6192de4"},"schema_version":"1.0","source":{"id":"1301.0578","kind":"arxiv","version":1}},"canonical_sha256":"be3ec985adbcef13cfc01d6aac9d5b51a0c0211853c012e18531f4a6341381ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be3ec985adbcef13cfc01d6aac9d5b51a0c0211853c012e18531f4a6341381ca","first_computed_at":"2026-05-18T03:37:18.406193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.406193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8GqPR35KiJpLn5uc7F4e86X06IhP954XV2OGrUuC69ZPENKOrdTM6HwUWnYGAvsTjsGVAHsK+BtAmhzIBbwXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.406653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84c582cf2ac18fbd4a5c8818eae8c3a8d077dcc93f217668d42e038564869074","sha256:e95892d8a37fd4676811b842f9682ba47b7464ea55da32d622adc5e57bc95660"],"state_sha256":"14caab732bba3e2b6d36d688693ccc081101f8f23d6c112e95d33a15624e914f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3qer+K6x3GYgLCMIXKoPrOleiR4/a1ItqQYWLpyL2kQKpHSn7zLE6lHM7oajz6HiDFKJGx8yKGiEa7Pd5bdCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:32:36.747462Z","bundle_sha256":"f1eaecf5b5de74d34b912f13df16ac1d0e8542fc18a8b98599259d05472189fa"}}