{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VQJEQ5ZQ5HA4AXHCD43ZJZMZL3","short_pith_number":"pith:VQJEQ5ZQ","canonical_record":{"source":{"id":"1306.2035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-09T16:28:56Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"2389a18f7b0beb38ee23e949c51a3d560469fb18c7200636408b836fb9a027bd","abstract_canon_sha256":"530027ec479b0c8866b490192bf99c7c9a463feb9e3cec708e04f95e0c9de36c"},"schema_version":"1.0"},"canonical_sha256":"ac12487730e9c1c05ce21f3794e5995ec39aaaeedb223fce2299c0463adf1f47","source":{"kind":"arxiv","id":"1306.2035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2035","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2035v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2035","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"VQJEQ5ZQ5HA4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VQJEQ5ZQ5HA4AXHC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VQJEQ5ZQ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VQJEQ5ZQ5HA4AXHCD43ZJZMZL3","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-09T16:28:56Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"2389a18f7b0beb38ee23e949c51a3d560469fb18c7200636408b836fb9a027bd","abstract_canon_sha256":"530027ec479b0c8866b490192bf99c7c9a463feb9e3cec708e04f95e0c9de36c"},"schema_version":"1.0"},"canonical_sha256":"ac12487730e9c1c05ce21f3794e5995ec39aaaeedb223fce2299c0463adf1f47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.595774Z","signature_b64":"IXQqx2KavsOjOHAj9rCEJ5YNoJigc+KlFyUFC57rP7pqQAUGmLI5LdCOfcfH+7IE5IoLx1e8P5HWd8oJpkaVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac12487730e9c1c05ce21f3794e5995ec39aaaeedb223fce2299c0463adf1f47","last_reissued_at":"2026-05-18T03:21:22.595358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.595358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2035","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSKz5atEu5SbuCsa7kof5SmHPIO7+OlaJC/sHt8J69opduPQ3FOUYkJEJAurv3F2HVo2P2KBDcL03tHDw/YJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:57:34.974531Z"},"content_sha256":"acdfaaec493be904a71ee778652ae04cf211c8bd3d3591fa4fb423e5fb94964b","schema_version":"1.0","event_id":"sha256:acdfaaec493be904a71ee778652ae04cf211c8bd3d3591fa4fb423e5fb94964b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VQJEQ5ZQ5HA4AXHCD43ZJZMZL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Theory for High-dimensional Gaussian Mixtures with Sparse Mean Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Larry Wasserman, Martin Azizyan","submitted_at":"2013-06-09T16:28:56Z","abstract_excerpt":"While several papers have investigated computationally and statistically efficient methods for learning Gaussian mixtures, precise minimax bounds for their statistical performance as well as fundamental limits in high-dimensional settings are not well-understood. In this paper, we provide precise information theoretic bounds on the clustering accuracy and sample complexity of learning a mixture of two isotropic Gaussians in high dimensions under small mean separation. If there is a sparse subset of relevant dimensions that determine the mean separation, then the sample complexity only depends "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2035","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Di009Anwi92SwDvSkl/ETovg5JZ6XkW6JjpTqGKPbhFOZqH/VqH2Mfdd1LIbS/7A5DEphtTv/+L270gVB45JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:57:34.974883Z"},"content_sha256":"bb81f69c6238e2133de10fa13e7b02437b681d864b2c8c441e084d48572e900e","schema_version":"1.0","event_id":"sha256:bb81f69c6238e2133de10fa13e7b02437b681d864b2c8c441e084d48572e900e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQJEQ5ZQ5HA4AXHCD43ZJZMZL3/bundle.json","state_url":"https://pith.science/pith/VQJEQ5ZQ5HA4AXHCD43ZJZMZL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQJEQ5ZQ5HA4AXHCD43ZJZMZL3/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-05-29T19:57:34Z","links":{"resolver":"https://pith.science/pith/VQJEQ5ZQ5HA4AXHCD43ZJZMZL3","bundle":"https://pith.science/pith/VQJEQ5ZQ5HA4AXHCD43ZJZMZL3/bundle.json","state":"https://pith.science/pith/VQJEQ5ZQ5HA4AXHCD43ZJZMZL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQJEQ5ZQ5HA4AXHCD43ZJZMZL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VQJEQ5ZQ5HA4AXHCD43ZJZMZL3","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":"530027ec479b0c8866b490192bf99c7c9a463feb9e3cec708e04f95e0c9de36c","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-09T16:28:56Z","title_canon_sha256":"2389a18f7b0beb38ee23e949c51a3d560469fb18c7200636408b836fb9a027bd"},"schema_version":"1.0","source":{"id":"1306.2035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2035","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2035v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2035","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"VQJEQ5ZQ5HA4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VQJEQ5ZQ5HA4AXHC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VQJEQ5ZQ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:bb81f69c6238e2133de10fa13e7b02437b681d864b2c8c441e084d48572e900e","target":"graph","created_at":"2026-05-18T03:21:22Z","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":"While several papers have investigated computationally and statistically efficient methods for learning Gaussian mixtures, precise minimax bounds for their statistical performance as well as fundamental limits in high-dimensional settings are not well-understood. In this paper, we provide precise information theoretic bounds on the clustering accuracy and sample complexity of learning a mixture of two isotropic Gaussians in high dimensions under small mean separation. If there is a sparse subset of relevant dimensions that determine the mean separation, then the sample complexity only depends ","authors_text":"Aarti Singh, Larry Wasserman, Martin Azizyan","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-09T16:28:56Z","title":"Minimax Theory for High-dimensional Gaussian Mixtures with Sparse Mean Separation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2035","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:acdfaaec493be904a71ee778652ae04cf211c8bd3d3591fa4fb423e5fb94964b","target":"record","created_at":"2026-05-18T03:21:22Z","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":"530027ec479b0c8866b490192bf99c7c9a463feb9e3cec708e04f95e0c9de36c","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-09T16:28:56Z","title_canon_sha256":"2389a18f7b0beb38ee23e949c51a3d560469fb18c7200636408b836fb9a027bd"},"schema_version":"1.0","source":{"id":"1306.2035","kind":"arxiv","version":1}},"canonical_sha256":"ac12487730e9c1c05ce21f3794e5995ec39aaaeedb223fce2299c0463adf1f47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac12487730e9c1c05ce21f3794e5995ec39aaaeedb223fce2299c0463adf1f47","first_computed_at":"2026-05-18T03:21:22.595358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:22.595358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IXQqx2KavsOjOHAj9rCEJ5YNoJigc+KlFyUFC57rP7pqQAUGmLI5LdCOfcfH+7IE5IoLx1e8P5HWd8oJpkaVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:22.595774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acdfaaec493be904a71ee778652ae04cf211c8bd3d3591fa4fb423e5fb94964b","sha256:bb81f69c6238e2133de10fa13e7b02437b681d864b2c8c441e084d48572e900e"],"state_sha256":"450bcb16747afabf90325ee045357241900cc8096ee23feae59c4eb3dc6142f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1Es0+QF2veROBwMOB2TdLJwSJ32YQ5nSh3rzdgGF4sY72hZCNXiwtM9Unsxqsbf4NvFlr1REPig/PIHLOWUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:57:34.976863Z","bundle_sha256":"505c41ffd5d0f0ea312f8f561ab992c1819d6d8abbfd51d02b4c47cc3ae249f5"}}