{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JMZ23AELA3RCNDBUS7KLMMNBCO","short_pith_number":"pith:JMZ23AEL","canonical_record":{"source":{"id":"1211.6451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-11-27T21:11:41Z","cross_cats_sorted":["math.ST","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"3a546d4abe54a4ef5773239235911c2c93319b33e57cfb30ed56cfb632941c8a","abstract_canon_sha256":"697b6670f7443e34a746660ac5322ecf3f370174b2e0feb4e943b30a4adbdea4"},"schema_version":"1.0"},"canonical_sha256":"4b33ad808b06e2268c3497d4b631a113811686a06284ce752063eebae158f246","source":{"kind":"arxiv","id":"1211.6451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6451","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6451v1","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6451","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"pith_short_12","alias_value":"JMZ23AELA3RC","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JMZ23AELA3RCNDBU","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JMZ23AEL","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JMZ23AELA3RCNDBUS7KLMMNBCO","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-11-27T21:11:41Z","cross_cats_sorted":["math.ST","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"3a546d4abe54a4ef5773239235911c2c93319b33e57cfb30ed56cfb632941c8a","abstract_canon_sha256":"697b6670f7443e34a746660ac5322ecf3f370174b2e0feb4e943b30a4adbdea4"},"schema_version":"1.0"},"canonical_sha256":"4b33ad808b06e2268c3497d4b631a113811686a06284ce752063eebae158f246","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:34.586384Z","signature_b64":"6kKXRu5tvWJCB3ynPPq6Tsxua1De6BFQReKTanWV8Qv11uicL3G9pqCm+UF+yZkQ1pOrnamyvziomY6IepQPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b33ad808b06e2268c3497d4b631a113811686a06284ce752063eebae158f246","last_reissued_at":"2026-05-18T03:07:34.585929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:34.585929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6451","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:07:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4K8GgLchOhoHd9TeL4PSDz1eKcwW/h2nbGfHx5mQ2OQCYAh2A52ygJXGiYYcLF2RrIkQmJOFb55M3+1YnvCbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:49:23.744728Z"},"content_sha256":"120ad8b1fcbf171cb107264fd49abeabb5e628a77bc2459505f8b2f1140239fb","schema_version":"1.0","event_id":"sha256:120ad8b1fcbf171cb107264fd49abeabb5e628a77bc2459505f8b2f1140239fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JMZ23AELA3RCNDBUS7KLMMNBCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A LASSO-Penalized BIC for Mixture Model Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.CO","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Paul D. McNicholas, Sakyajit Bhattacharya","submitted_at":"2012-11-27T21:11:41Z","abstract_excerpt":"The efficacy of family-based approaches to mixture model-based clustering and classification depends on the selection of parsimonious models. Current wisdom suggests the Bayesian information criterion (BIC) for mixture model selection. However, the BIC has well-known limitations, including a tendency to overestimate the number of components as well as a proclivity for, often drastically, underestimating the number of components in higher dimensions. While the former problem might be soluble through merging components, the latter is impossible to mitigate in clustering and classification applic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6451","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:07:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6nMSd+3uf/Yb6/RE3kDjND8Kew/q+eFkLjSTwdiS+xNqfn1RybIC3sr6/MCGG8HJyObBqU4FK/QyTGqkuIWoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:49:23.745089Z"},"content_sha256":"04e6423196e628a73c628456194fc568ebbcd9ec0594901749f84cf9ddea54e6","schema_version":"1.0","event_id":"sha256:04e6423196e628a73c628456194fc568ebbcd9ec0594901749f84cf9ddea54e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMZ23AELA3RCNDBUS7KLMMNBCO/bundle.json","state_url":"https://pith.science/pith/JMZ23AELA3RCNDBUS7KLMMNBCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMZ23AELA3RCNDBUS7KLMMNBCO/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-05T18:49:23Z","links":{"resolver":"https://pith.science/pith/JMZ23AELA3RCNDBUS7KLMMNBCO","bundle":"https://pith.science/pith/JMZ23AELA3RCNDBUS7KLMMNBCO/bundle.json","state":"https://pith.science/pith/JMZ23AELA3RCNDBUS7KLMMNBCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMZ23AELA3RCNDBUS7KLMMNBCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JMZ23AELA3RCNDBUS7KLMMNBCO","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":"697b6670f7443e34a746660ac5322ecf3f370174b2e0feb4e943b30a4adbdea4","cross_cats_sorted":["math.ST","stat.CO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-11-27T21:11:41Z","title_canon_sha256":"3a546d4abe54a4ef5773239235911c2c93319b33e57cfb30ed56cfb632941c8a"},"schema_version":"1.0","source":{"id":"1211.6451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6451","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6451v1","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6451","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"pith_short_12","alias_value":"JMZ23AELA3RC","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JMZ23AELA3RCNDBU","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JMZ23AEL","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:04e6423196e628a73c628456194fc568ebbcd9ec0594901749f84cf9ddea54e6","target":"graph","created_at":"2026-05-18T03:07:34Z","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":"The efficacy of family-based approaches to mixture model-based clustering and classification depends on the selection of parsimonious models. Current wisdom suggests the Bayesian information criterion (BIC) for mixture model selection. However, the BIC has well-known limitations, including a tendency to overestimate the number of components as well as a proclivity for, often drastically, underestimating the number of components in higher dimensions. While the former problem might be soluble through merging components, the latter is impossible to mitigate in clustering and classification applic","authors_text":"Paul D. McNicholas, Sakyajit Bhattacharya","cross_cats":["math.ST","stat.CO","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-11-27T21:11:41Z","title":"A LASSO-Penalized BIC for Mixture Model Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6451","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:120ad8b1fcbf171cb107264fd49abeabb5e628a77bc2459505f8b2f1140239fb","target":"record","created_at":"2026-05-18T03:07:34Z","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":"697b6670f7443e34a746660ac5322ecf3f370174b2e0feb4e943b30a4adbdea4","cross_cats_sorted":["math.ST","stat.CO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-11-27T21:11:41Z","title_canon_sha256":"3a546d4abe54a4ef5773239235911c2c93319b33e57cfb30ed56cfb632941c8a"},"schema_version":"1.0","source":{"id":"1211.6451","kind":"arxiv","version":1}},"canonical_sha256":"4b33ad808b06e2268c3497d4b631a113811686a06284ce752063eebae158f246","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b33ad808b06e2268c3497d4b631a113811686a06284ce752063eebae158f246","first_computed_at":"2026-05-18T03:07:34.585929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:34.585929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6kKXRu5tvWJCB3ynPPq6Tsxua1De6BFQReKTanWV8Qv11uicL3G9pqCm+UF+yZkQ1pOrnamyvziomY6IepQPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:34.586384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:120ad8b1fcbf171cb107264fd49abeabb5e628a77bc2459505f8b2f1140239fb","sha256:04e6423196e628a73c628456194fc568ebbcd9ec0594901749f84cf9ddea54e6"],"state_sha256":"ed9afdedbd54a5cb50bdfcc2918bbda5feacede19b32c6b47e9dd24562ccbd3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DI3Obp7kBpKqsAktnIk+ss9pPSZ7HyBxPd3oABDwCJHUCnuBnpEFL+Xk9nXB984up3MpzzhE2hmfGtxWYAEFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:49:23.747422Z","bundle_sha256":"b5029319dac1a84a5d8855566ad12d5bb99fdef434d2b6b52647daba365714e2"}}