{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UIPBQJAGRH5AR5PSDNYTSRO26H","short_pith_number":"pith:UIPBQJAG","schema_version":"1.0","canonical_sha256":"a21e18240689fa08f5f21b713945daf1eff394af98cb7dad744a5f4e54f492ae","source":{"kind":"arxiv","id":"1306.5824","version":1},"attestation_state":"computed","paper":{"title":"Constrained Optimization for a Subset of the Gaussian Parsimonious Clustering Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.CO","authors_text":"Paul McNicholas, Ryan P. Browne, Sanjeena Subedi","submitted_at":"2013-06-25T01:27:09Z","abstract_excerpt":"The expectation-maximization (EM) algorithm is an iterative method for finding maximum likelihood estimates when data are incomplete or are treated as being incomplete. The EM algorithm and its variants are commonly used for parameter estimation in applications of mixture models for clustering and classification. This despite the fact that even the Gaussian mixture model likelihood surface contains many local maxima and is singularity riddled. Previous work has focused on circumventing this problem by constraining the smallest eigenvalue of the component covariance matrices. In this paper, we "},"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":"1306.5824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-06-25T01:27:09Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"2e1a749c9e2b020b3cba967e5b0a770b115ba0c4dbf87bf659e6e14ea9761ec5","abstract_canon_sha256":"757e82846cab577c9277174a3aad90d46781aa1406bd04abd4a92c5731e9e866"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:58.450799Z","signature_b64":"TBLFsUMAp8rbJLO4b7rld3ZST1gteWdAEOYx5JInSRMxUdUFacwaMTrxJmlyrw2dlTzrFgUitTle9iN9n6ZrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a21e18240689fa08f5f21b713945daf1eff394af98cb7dad744a5f4e54f492ae","last_reissued_at":"2026-05-18T03:19:58.450067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:58.450067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Optimization for a Subset of the Gaussian Parsimonious Clustering Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.CO","authors_text":"Paul McNicholas, Ryan P. Browne, Sanjeena Subedi","submitted_at":"2013-06-25T01:27:09Z","abstract_excerpt":"The expectation-maximization (EM) algorithm is an iterative method for finding maximum likelihood estimates when data are incomplete or are treated as being incomplete. The EM algorithm and its variants are commonly used for parameter estimation in applications of mixture models for clustering and classification. This despite the fact that even the Gaussian mixture model likelihood surface contains many local maxima and is singularity riddled. Previous work has focused on circumventing this problem by constraining the smallest eigenvalue of the component covariance matrices. In this paper, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5824","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.5824","created_at":"2026-05-18T03:19:58.450193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5824v1","created_at":"2026-05-18T03:19:58.450193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5824","created_at":"2026-05-18T03:19:58.450193+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIPBQJAGRH5A","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIPBQJAGRH5AR5PS","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIPBQJAG","created_at":"2026-05-18T12:28:02.375192+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/UIPBQJAGRH5AR5PSDNYTSRO26H","json":"https://pith.science/pith/UIPBQJAGRH5AR5PSDNYTSRO26H.json","graph_json":"https://pith.science/api/pith-number/UIPBQJAGRH5AR5PSDNYTSRO26H/graph.json","events_json":"https://pith.science/api/pith-number/UIPBQJAGRH5AR5PSDNYTSRO26H/events.json","paper":"https://pith.science/paper/UIPBQJAG"},"agent_actions":{"view_html":"https://pith.science/pith/UIPBQJAGRH5AR5PSDNYTSRO26H","download_json":"https://pith.science/pith/UIPBQJAGRH5AR5PSDNYTSRO26H.json","view_paper":"https://pith.science/paper/UIPBQJAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5824&json=true","fetch_graph":"https://pith.science/api/pith-number/UIPBQJAGRH5AR5PSDNYTSRO26H/graph.json","fetch_events":"https://pith.science/api/pith-number/UIPBQJAGRH5AR5PSDNYTSRO26H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIPBQJAGRH5AR5PSDNYTSRO26H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIPBQJAGRH5AR5PSDNYTSRO26H/action/storage_attestation","attest_author":"https://pith.science/pith/UIPBQJAGRH5AR5PSDNYTSRO26H/action/author_attestation","sign_citation":"https://pith.science/pith/UIPBQJAGRH5AR5PSDNYTSRO26H/action/citation_signature","submit_replication":"https://pith.science/pith/UIPBQJAGRH5AR5PSDNYTSRO26H/action/replication_record"}},"created_at":"2026-05-18T03:19:58.450193+00:00","updated_at":"2026-05-18T03:19:58.450193+00:00"}