{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NDWKUSKRCQGFUIWO7WWTJBLVWL","short_pith_number":"pith:NDWKUSKR","schema_version":"1.0","canonical_sha256":"68ecaa4951140c5a22cefdad348575b2c1a2d6db4594294f6c4008a42a598559","source":{"kind":"arxiv","id":"1308.3381","version":3},"attestation_state":"computed","paper":{"title":"High dimensional Sparse Gaussian Graphical Mixture Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Anani Lotsi, Ernst Wit","submitted_at":"2013-08-15T13:17:47Z","abstract_excerpt":"This paper considers the problem of networks reconstruction from heterogeneous data using a Gaussian Graphical Mixture Model (GGMM). It is well known that parameter estimation in this context is challenging due to large numbers of variables coupled with the degeneracy of the likelihood. We propose as a solution a penalized maximum likelihood technique by imposing an $l_{1}$ penalty on the precision matrix. Our approach shrinks the parameters thereby resulting in better identifiability and variable selection. We use the Expectation Maximization (EM) algorithm which involves the graphical LASSO "},"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":"1308.3381","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-08-15T13:17:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7d44ed279e2a65207c7b1748d673e0cea36cccb1c66f20eb596958cf47ea8aec","abstract_canon_sha256":"5f3b1575ac812a4d68972ef34c9d9380806d55dd9aabcb0818bcaf5cbb00ef06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:12.631932Z","signature_b64":"nA9aG92eFA4sRgAhYF3ljZcubfEI+7HqVuho+jbwBwJhMF6T59KgEUZTuNMPFnSnKvxT0tpH9EgmcVbuav0QCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68ecaa4951140c5a22cefdad348575b2c1a2d6db4594294f6c4008a42a598559","last_reissued_at":"2026-05-18T03:11:12.631331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:12.631331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High dimensional Sparse Gaussian Graphical Mixture Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Anani Lotsi, Ernst Wit","submitted_at":"2013-08-15T13:17:47Z","abstract_excerpt":"This paper considers the problem of networks reconstruction from heterogeneous data using a Gaussian Graphical Mixture Model (GGMM). It is well known that parameter estimation in this context is challenging due to large numbers of variables coupled with the degeneracy of the likelihood. We propose as a solution a penalized maximum likelihood technique by imposing an $l_{1}$ penalty on the precision matrix. Our approach shrinks the parameters thereby resulting in better identifiability and variable selection. We use the Expectation Maximization (EM) algorithm which involves the graphical LASSO "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3381","kind":"arxiv","version":3},"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":"1308.3381","created_at":"2026-05-18T03:11:12.631445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3381v3","created_at":"2026-05-18T03:11:12.631445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3381","created_at":"2026-05-18T03:11:12.631445+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDWKUSKRCQGF","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDWKUSKRCQGFUIWO","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDWKUSKR","created_at":"2026-05-18T12:27:52.871228+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/NDWKUSKRCQGFUIWO7WWTJBLVWL","json":"https://pith.science/pith/NDWKUSKRCQGFUIWO7WWTJBLVWL.json","graph_json":"https://pith.science/api/pith-number/NDWKUSKRCQGFUIWO7WWTJBLVWL/graph.json","events_json":"https://pith.science/api/pith-number/NDWKUSKRCQGFUIWO7WWTJBLVWL/events.json","paper":"https://pith.science/paper/NDWKUSKR"},"agent_actions":{"view_html":"https://pith.science/pith/NDWKUSKRCQGFUIWO7WWTJBLVWL","download_json":"https://pith.science/pith/NDWKUSKRCQGFUIWO7WWTJBLVWL.json","view_paper":"https://pith.science/paper/NDWKUSKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3381&json=true","fetch_graph":"https://pith.science/api/pith-number/NDWKUSKRCQGFUIWO7WWTJBLVWL/graph.json","fetch_events":"https://pith.science/api/pith-number/NDWKUSKRCQGFUIWO7WWTJBLVWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDWKUSKRCQGFUIWO7WWTJBLVWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDWKUSKRCQGFUIWO7WWTJBLVWL/action/storage_attestation","attest_author":"https://pith.science/pith/NDWKUSKRCQGFUIWO7WWTJBLVWL/action/author_attestation","sign_citation":"https://pith.science/pith/NDWKUSKRCQGFUIWO7WWTJBLVWL/action/citation_signature","submit_replication":"https://pith.science/pith/NDWKUSKRCQGFUIWO7WWTJBLVWL/action/replication_record"}},"created_at":"2026-05-18T03:11:12.631445+00:00","updated_at":"2026-05-18T03:11:12.631445+00:00"}