{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BGCADD7GSDH6B6VKLVRBHC7F3K","short_pith_number":"pith:BGCADD7G","canonical_record":{"source":{"id":"1610.02918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T13:57:00Z","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","math.IT"],"title_canon_sha256":"edc62d88ee1f33283033da9ade882ec2bde8cb38b4ad182fb8727786094b7c82","abstract_canon_sha256":"1ed3cd113900bae47bbcc954c67d93b7c18adf3aad6a71eccfaed1993566b625"},"schema_version":"1.0"},"canonical_sha256":"0984018fe690cfe0faaa5d62138be5daa862a233af0ded072d622d8cda5fa15a","source":{"kind":"arxiv","id":"1610.02918","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02918","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02918v1","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02918","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"BGCADD7GSDH6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BGCADD7GSDH6B6VK","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BGCADD7G","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BGCADD7GSDH6B6VKLVRBHC7F3K","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T13:57:00Z","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","math.IT"],"title_canon_sha256":"edc62d88ee1f33283033da9ade882ec2bde8cb38b4ad182fb8727786094b7c82","abstract_canon_sha256":"1ed3cd113900bae47bbcc954c67d93b7c18adf3aad6a71eccfaed1993566b625"},"schema_version":"1.0"},"canonical_sha256":"0984018fe690cfe0faaa5d62138be5daa862a233af0ded072d622d8cda5fa15a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:05.436405Z","signature_b64":"Ny+5NG2KKpVUXi0dD0ZB52IXncR+cgZvAQ3FXCTBgHC5WG9ooxwRb3+xzVDe+vzGSDTFLLd99B4dZ1CgEGgWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0984018fe690cfe0faaa5d62138be5daa862a233af0ded072d622d8cda5fa15a","last_reissued_at":"2026-05-18T00:48:05.435975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:05.435975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02918","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-18T00:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnYaheXVT6eza+jyKFqDb4EOKpRULj3Z4mqLjg7OkMGe4StIqWUUVZPiTsuuSNljuk9dDWwwK6mdzhzoOJvCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:49:23.276767Z"},"content_sha256":"b97a0317945c2250b470a212b2dec6a041659f510b00b913c387eb632d8f2b05","schema_version":"1.0","event_id":"sha256:b97a0317945c2250b470a212b2dec6a041659f510b00b913c387eb632d8f2b05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BGCADD7GSDH6B6VKLVRBHC7F3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Caterina De Bacco, Cris Moore, Florent Krzakala, Jess Banks, Lenka Zdeborov\\'a, Thibault Lesieur","submitted_at":"2016-10-10T13:57:00Z","abstract_excerpt":"We consider the problem of Gaussian mixture clustering in the high-dimensional limit where the data consists of $m$ points in $n$ dimensions, $n,m \\rightarrow \\infty$ and $\\alpha = m/n$ stays finite. Using exact but non-rigorous methods from statistical physics, we determine the critical value of $\\alpha$ and the distance between the clusters at which it becomes information-theoretically possible to reconstruct the membership into clusters better than chance. We also determine the accuracy achievable by the Bayes-optimal estimation algorithm. In particular, we find that when the number of clus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02918","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-18T00:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1qPfmv7cCCjhKHeSs368Kn5SPqzM7R1UOF7IOMhs0c78WvYg4xBnsmhY9xF49sqCKcSWOCB68Jdy1iY/gl4pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:49:23.277434Z"},"content_sha256":"59a3f2f006c4af6362b25be6e0cc1dbb768c14c112ddf85ad16a6dd8fa8b4a6e","schema_version":"1.0","event_id":"sha256:59a3f2f006c4af6362b25be6e0cc1dbb768c14c112ddf85ad16a6dd8fa8b4a6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGCADD7GSDH6B6VKLVRBHC7F3K/bundle.json","state_url":"https://pith.science/pith/BGCADD7GSDH6B6VKLVRBHC7F3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGCADD7GSDH6B6VKLVRBHC7F3K/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-27T06:49:23Z","links":{"resolver":"https://pith.science/pith/BGCADD7GSDH6B6VKLVRBHC7F3K","bundle":"https://pith.science/pith/BGCADD7GSDH6B6VKLVRBHC7F3K/bundle.json","state":"https://pith.science/pith/BGCADD7GSDH6B6VKLVRBHC7F3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGCADD7GSDH6B6VKLVRBHC7F3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BGCADD7GSDH6B6VKLVRBHC7F3K","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":"1ed3cd113900bae47bbcc954c67d93b7c18adf3aad6a71eccfaed1993566b625","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T13:57:00Z","title_canon_sha256":"edc62d88ee1f33283033da9ade882ec2bde8cb38b4ad182fb8727786094b7c82"},"schema_version":"1.0","source":{"id":"1610.02918","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02918","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02918v1","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02918","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"BGCADD7GSDH6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BGCADD7GSDH6B6VK","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BGCADD7G","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:59a3f2f006c4af6362b25be6e0cc1dbb768c14c112ddf85ad16a6dd8fa8b4a6e","target":"graph","created_at":"2026-05-18T00:48:05Z","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":"We consider the problem of Gaussian mixture clustering in the high-dimensional limit where the data consists of $m$ points in $n$ dimensions, $n,m \\rightarrow \\infty$ and $\\alpha = m/n$ stays finite. Using exact but non-rigorous methods from statistical physics, we determine the critical value of $\\alpha$ and the distance between the clusters at which it becomes information-theoretically possible to reconstruct the membership into clusters better than chance. We also determine the accuracy achievable by the Bayes-optimal estimation algorithm. In particular, we find that when the number of clus","authors_text":"Caterina De Bacco, Cris Moore, Florent Krzakala, Jess Banks, Lenka Zdeborov\\'a, Thibault Lesieur","cross_cats":["cond-mat.dis-nn","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T13:57:00Z","title":"Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02918","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:b97a0317945c2250b470a212b2dec6a041659f510b00b913c387eb632d8f2b05","target":"record","created_at":"2026-05-18T00:48:05Z","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":"1ed3cd113900bae47bbcc954c67d93b7c18adf3aad6a71eccfaed1993566b625","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T13:57:00Z","title_canon_sha256":"edc62d88ee1f33283033da9ade882ec2bde8cb38b4ad182fb8727786094b7c82"},"schema_version":"1.0","source":{"id":"1610.02918","kind":"arxiv","version":1}},"canonical_sha256":"0984018fe690cfe0faaa5d62138be5daa862a233af0ded072d622d8cda5fa15a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0984018fe690cfe0faaa5d62138be5daa862a233af0ded072d622d8cda5fa15a","first_computed_at":"2026-05-18T00:48:05.435975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:05.435975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ny+5NG2KKpVUXi0dD0ZB52IXncR+cgZvAQ3FXCTBgHC5WG9ooxwRb3+xzVDe+vzGSDTFLLd99B4dZ1CgEGgWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:05.436405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02918","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b97a0317945c2250b470a212b2dec6a041659f510b00b913c387eb632d8f2b05","sha256:59a3f2f006c4af6362b25be6e0cc1dbb768c14c112ddf85ad16a6dd8fa8b4a6e"],"state_sha256":"0f517b4008eb082331fe69d736e9076a5addd179d0d1d01d88c7b97ae496b1d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4WZZJcPjAmb28SRIFGVityQGQajQbY32RfEbJKde3N9Ce1yhzhYJuZEl0M3U5symLCc+ZxfIwzjFa9jXehU/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:49:23.280451Z","bundle_sha256":"b58337ac0d9b87c6335fa722a62fa3aa3b2f0474495e9fe7c675194598011d07"}}