{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:M7H655S4O2563EUIU4CHOVGMIJ","short_pith_number":"pith:M7H655S4","canonical_record":{"source":{"id":"1606.05100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-06-16T08:58:34Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"3532ba53c1c7a48c5bde9953577d5a27482f7802e45b84783e792f096caa5909","abstract_canon_sha256":"00c2e06a3a4191251552eabd3b0e56f553a0c57c2ee20ef58036eb84350dddd4"},"schema_version":"1.0"},"canonical_sha256":"67cfeef65c76bbed9288a7047754cc4274707b64eb23581858e51bf74f9d7428","source":{"kind":"arxiv","id":"1606.05100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05100","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05100v1","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05100","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"M7H655S4O256","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M7H655S4O2563EUI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M7H655S4","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:M7H655S4O2563EUIU4CHOVGMIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-06-16T08:58:34Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"3532ba53c1c7a48c5bde9953577d5a27482f7802e45b84783e792f096caa5909","abstract_canon_sha256":"00c2e06a3a4191251552eabd3b0e56f553a0c57c2ee20ef58036eb84350dddd4"},"schema_version":"1.0"},"canonical_sha256":"67cfeef65c76bbed9288a7047754cc4274707b64eb23581858e51bf74f9d7428","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:22.018973Z","signature_b64":"HWVGS9qzQoBJpVVLC8rXk1T97EY4G8Nf1Wf9x1/6RN5LdEDedAfFsSmOH2Z+3lNgjI7Vyy5atnlPKxHLGp2rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67cfeef65c76bbed9288a7047754cc4274707b64eb23581858e51bf74f9d7428","last_reissued_at":"2026-05-18T01:12:22.018628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:22.018628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05100","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-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fs0T2x92jWS1ENiptK8BKa1rFzk9Y87EZZl37H+vwcvGhJxkd9nSJHH16z3HiPfnmrrdPYeRiiCuqkJcisrWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:46:18.483209Z"},"content_sha256":"1f3e6188526c8103c48e07b06bcc79a488949fff5630cccc441b79112a091ebf","schema_version":"1.0","event_id":"sha256:1f3e6188526c8103c48e07b06bcc79a488949fff5630cccc441b79112a091ebf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:M7H655S4O2563EUIU4CHOVGMIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PECOK: a convex optimization approach to variable clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Christophe Giraud, Florentina Bunea, Martin Royer, Nicolas Verzelen","submitted_at":"2016-06-16T08:58:34Z","abstract_excerpt":"The problem of variable clustering is that of grouping similar components of a $p$-dimensional vector $X=(X_{1},\\ldots,X_{p})$, and estimating these groups from $n$ independent copies of $X$. When cluster similarity is defined via $G$-latent models, in which groups of $X$-variables have a common latent generator, and groups are relative to a partition $G$ of the index set $\\{1, \\ldots, p\\}$, the most natural clustering strategy is $K$-means. We explain why this strategy cannot lead to perfect cluster recovery and offer a correction, based on semi-definite programing, that can be viewed as a pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05100","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-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAd6/+AvXhdMxbkUzpqlewq7KIq5WtEOV3olNpBi8G5osKWRaXYBDZHyec8G6MXQ3r5sp9a3yBFtIDAC+67ZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:46:18.483589Z"},"content_sha256":"2041392ea4e8b3c275d2063052e75fd701ca9652111f661abe242343cfbd70da","schema_version":"1.0","event_id":"sha256:2041392ea4e8b3c275d2063052e75fd701ca9652111f661abe242343cfbd70da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7H655S4O2563EUIU4CHOVGMIJ/bundle.json","state_url":"https://pith.science/pith/M7H655S4O2563EUIU4CHOVGMIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7H655S4O2563EUIU4CHOVGMIJ/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-05T10:46:18Z","links":{"resolver":"https://pith.science/pith/M7H655S4O2563EUIU4CHOVGMIJ","bundle":"https://pith.science/pith/M7H655S4O2563EUIU4CHOVGMIJ/bundle.json","state":"https://pith.science/pith/M7H655S4O2563EUIU4CHOVGMIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7H655S4O2563EUIU4CHOVGMIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M7H655S4O2563EUIU4CHOVGMIJ","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":"00c2e06a3a4191251552eabd3b0e56f553a0c57c2ee20ef58036eb84350dddd4","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-06-16T08:58:34Z","title_canon_sha256":"3532ba53c1c7a48c5bde9953577d5a27482f7802e45b84783e792f096caa5909"},"schema_version":"1.0","source":{"id":"1606.05100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05100","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05100v1","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05100","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"M7H655S4O256","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M7H655S4O2563EUI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M7H655S4","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:2041392ea4e8b3c275d2063052e75fd701ca9652111f661abe242343cfbd70da","target":"graph","created_at":"2026-05-18T01:12: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":"The problem of variable clustering is that of grouping similar components of a $p$-dimensional vector $X=(X_{1},\\ldots,X_{p})$, and estimating these groups from $n$ independent copies of $X$. When cluster similarity is defined via $G$-latent models, in which groups of $X$-variables have a common latent generator, and groups are relative to a partition $G$ of the index set $\\{1, \\ldots, p\\}$, the most natural clustering strategy is $K$-means. We explain why this strategy cannot lead to perfect cluster recovery and offer a correction, based on semi-definite programing, that can be viewed as a pe","authors_text":"Christophe Giraud, Florentina Bunea, Martin Royer, Nicolas Verzelen","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-06-16T08:58:34Z","title":"PECOK: a convex optimization approach to variable clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05100","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:1f3e6188526c8103c48e07b06bcc79a488949fff5630cccc441b79112a091ebf","target":"record","created_at":"2026-05-18T01:12: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":"00c2e06a3a4191251552eabd3b0e56f553a0c57c2ee20ef58036eb84350dddd4","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-06-16T08:58:34Z","title_canon_sha256":"3532ba53c1c7a48c5bde9953577d5a27482f7802e45b84783e792f096caa5909"},"schema_version":"1.0","source":{"id":"1606.05100","kind":"arxiv","version":1}},"canonical_sha256":"67cfeef65c76bbed9288a7047754cc4274707b64eb23581858e51bf74f9d7428","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67cfeef65c76bbed9288a7047754cc4274707b64eb23581858e51bf74f9d7428","first_computed_at":"2026-05-18T01:12:22.018628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:22.018628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HWVGS9qzQoBJpVVLC8rXk1T97EY4G8Nf1Wf9x1/6RN5LdEDedAfFsSmOH2Z+3lNgjI7Vyy5atnlPKxHLGp2rAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:22.018973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f3e6188526c8103c48e07b06bcc79a488949fff5630cccc441b79112a091ebf","sha256:2041392ea4e8b3c275d2063052e75fd701ca9652111f661abe242343cfbd70da"],"state_sha256":"19764a039a2f8db9b02cd1219a3ccbb39467594c46d3c6089b7f606d9d06899e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yvMclONOUlXe6HMiGiN6HnZ7UDgWQsINZbIsTB+jN9o0ALwaYdgYYCz8IancYdK+Op6H3LY+4pEEHxAi1A+kAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:46:18.485670Z","bundle_sha256":"d8e89dcefd3e75e810121788036fe04c41ab13bc977f7f632fb60f2e1395b99a"}}