{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TAQ7IUDS5YTXSTBE6BWR3EIDBX","short_pith_number":"pith:TAQ7IUDS","canonical_record":{"source":{"id":"2005.10817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2020-05-21T17:51:30Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"f294e4208e87914ad390265686a37303694803e02c89d158ba29a568c7c47cf5","abstract_canon_sha256":"88b4c0fa71b19456bd583b5dace07d07bebeeaea7d545d05489800fa2d88cb26"},"schema_version":"1.0"},"canonical_sha256":"9821f45072ee27794c24f06d1d91030ddd9ac3c24232369601129702b726d0f6","source":{"kind":"arxiv","id":"2005.10817","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.10817","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"2005.10817v3","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.10817","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"TAQ7IUDS5YTX","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"pith_short_16","alias_value":"TAQ7IUDS5YTXSTBE","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"pith_short_8","alias_value":"TAQ7IUDS","created_at":"2026-07-05T02:25:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TAQ7IUDS5YTXSTBE6BWR3EIDBX","target":"record","payload":{"canonical_record":{"source":{"id":"2005.10817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2020-05-21T17:51:30Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"f294e4208e87914ad390265686a37303694803e02c89d158ba29a568c7c47cf5","abstract_canon_sha256":"88b4c0fa71b19456bd583b5dace07d07bebeeaea7d545d05489800fa2d88cb26"},"schema_version":"1.0"},"canonical_sha256":"9821f45072ee27794c24f06d1d91030ddd9ac3c24232369601129702b726d0f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:10.224934Z","signature_b64":"0LcArO+RJvi7Huygu64Wgox63H7uHbmuDCr0Mk+d8CGzX+czuVM+150YEvLwzYPiVg9nrI1O+Q4kspbGgqgKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9821f45072ee27794c24f06d1d91030ddd9ac3c24232369601129702b726d0f6","last_reissued_at":"2026-07-05T02:25:10.224530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:10.224530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.10817","source_version":3,"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-07-05T02:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"monRZnuPfgYo+EGpTaNn9Lbu0FJWKZ8eCa+RhN7CX3D5a9COmJ+H/gInSLGXYISso7ekri6g+Sy/dKXD2Ar4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:12:20.210810Z"},"content_sha256":"c9f0b9b81c2cc8233917a6de2c4fc8dc27f908f3b811569c33529ec05230c9bb","schema_version":"1.0","event_id":"sha256:c9f0b9b81c2cc8233917a6de2c4fc8dc27f908f3b811569c33529ec05230c9bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TAQ7IUDS5YTXSTBE6BWR3EIDBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally efficient sparse clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Matthias L\\\"offler","submitted_at":"2020-05-21T17:51:30Z","abstract_excerpt":"We study statistical and computational limits of clustering when the means of the centres are sparse and their dimension is possibly much larger than the sample size. Our theoretical analysis focuses on the model $X_i = z_i \\theta + \\varepsilon_i, ~z_i \\in \\{-1,1\\}, ~\\varepsilon_i \\thicksim \\mathcal{N}(0,I)$, which has two clusters with centres $\\theta$ and $-\\theta$. We provide a finite sample analysis of a new sparse clustering algorithm based on sparse PCA and show that it achieves the minimax optimal misclustering rate in the regime $\\|\\theta\\| \\rightarrow \\infty$.\n  Our results require th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.10817","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.10817/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZ382R7x9yy0Ogdyqg1z8dAPY748+GazHdYCKwNsFUJ2QYPzlmeU5zmNW0bdBpj00FvdmgR/pa/EKuR1ZFH8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:12:20.211366Z"},"content_sha256":"aedb42ac653e85191586811798b7d423c98136aca52da366171aa25e2b3a2fd8","schema_version":"1.0","event_id":"sha256:aedb42ac653e85191586811798b7d423c98136aca52da366171aa25e2b3a2fd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAQ7IUDS5YTXSTBE6BWR3EIDBX/bundle.json","state_url":"https://pith.science/pith/TAQ7IUDS5YTXSTBE6BWR3EIDBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAQ7IUDS5YTXSTBE6BWR3EIDBX/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-08-08T20:12:20Z","links":{"resolver":"https://pith.science/pith/TAQ7IUDS5YTXSTBE6BWR3EIDBX","bundle":"https://pith.science/pith/TAQ7IUDS5YTXSTBE6BWR3EIDBX/bundle.json","state":"https://pith.science/pith/TAQ7IUDS5YTXSTBE6BWR3EIDBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAQ7IUDS5YTXSTBE6BWR3EIDBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TAQ7IUDS5YTXSTBE6BWR3EIDBX","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":"88b4c0fa71b19456bd583b5dace07d07bebeeaea7d545d05489800fa2d88cb26","cross_cats_sorted":["cs.CC","cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2020-05-21T17:51:30Z","title_canon_sha256":"f294e4208e87914ad390265686a37303694803e02c89d158ba29a568c7c47cf5"},"schema_version":"1.0","source":{"id":"2005.10817","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.10817","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"2005.10817v3","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.10817","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"TAQ7IUDS5YTX","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"pith_short_16","alias_value":"TAQ7IUDS5YTXSTBE","created_at":"2026-07-05T02:25:10Z"},{"alias_kind":"pith_short_8","alias_value":"TAQ7IUDS","created_at":"2026-07-05T02:25:10Z"}],"graph_snapshots":[{"event_id":"sha256:aedb42ac653e85191586811798b7d423c98136aca52da366171aa25e2b3a2fd8","target":"graph","created_at":"2026-07-05T02:25:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.10817/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study statistical and computational limits of clustering when the means of the centres are sparse and their dimension is possibly much larger than the sample size. Our theoretical analysis focuses on the model $X_i = z_i \\theta + \\varepsilon_i, ~z_i \\in \\{-1,1\\}, ~\\varepsilon_i \\thicksim \\mathcal{N}(0,I)$, which has two clusters with centres $\\theta$ and $-\\theta$. We provide a finite sample analysis of a new sparse clustering algorithm based on sparse PCA and show that it achieves the minimax optimal misclustering rate in the regime $\\|\\theta\\| \\rightarrow \\infty$.\n  Our results require th","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Matthias L\\\"offler","cross_cats":["cs.CC","cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2020-05-21T17:51:30Z","title":"Computationally efficient sparse clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.10817","kind":"arxiv","version":3},"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:c9f0b9b81c2cc8233917a6de2c4fc8dc27f908f3b811569c33529ec05230c9bb","target":"record","created_at":"2026-07-05T02:25:10Z","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":"88b4c0fa71b19456bd583b5dace07d07bebeeaea7d545d05489800fa2d88cb26","cross_cats_sorted":["cs.CC","cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2020-05-21T17:51:30Z","title_canon_sha256":"f294e4208e87914ad390265686a37303694803e02c89d158ba29a568c7c47cf5"},"schema_version":"1.0","source":{"id":"2005.10817","kind":"arxiv","version":3}},"canonical_sha256":"9821f45072ee27794c24f06d1d91030ddd9ac3c24232369601129702b726d0f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9821f45072ee27794c24f06d1d91030ddd9ac3c24232369601129702b726d0f6","first_computed_at":"2026-07-05T02:25:10.224530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:10.224530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0LcArO+RJvi7Huygu64Wgox63H7uHbmuDCr0Mk+d8CGzX+czuVM+150YEvLwzYPiVg9nrI1O+Q4kspbGgqgKCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:10.224934Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.10817","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9f0b9b81c2cc8233917a6de2c4fc8dc27f908f3b811569c33529ec05230c9bb","sha256:aedb42ac653e85191586811798b7d423c98136aca52da366171aa25e2b3a2fd8"],"state_sha256":"683958454fdd2efe5aa22d76fbfe044005739580d6ba6491ec3fd90956d60610"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97MRrEYznoNnvN5tdMEB6Uh3btjEFmDILZnccbZMv+N4MHf4RxZAyV1cBz1KTy7b6Yhl65zVvul/o8JsSd7MDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:12:20.214787Z","bundle_sha256":"af829d62c7ed587d36f499942edddfd4ce7e93f693b1621c2b6d90ec7aa8ee86"}}