{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NA3FKEKUC77OJSIWSYOYKYLYMF","short_pith_number":"pith:NA3FKEKU","schema_version":"1.0","canonical_sha256":"683655115417fee4c916961d856178614f85fb9cde1d8df89696e172e46d9a09","source":{"kind":"arxiv","id":"1807.07547","version":3},"attestation_state":"computed","paper":{"title":"Partial recovery bounds for clustering with the relaxed $K$means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.TH"],"primary_cat":"math.ST","authors_text":"Christophe Giraud, Nicolas Verzelen","submitted_at":"2018-07-19T17:33:30Z","abstract_excerpt":"We investigate the clustering performances of the relaxed $K$means in the setting of sub-Gaussian Mixture Model (sGMM) and Stochastic Block Model (SBM). After identifying the appropriate signal-to-noise ratio (SNR), we prove that the misclassification error decay exponentially fast with respect to this SNR. These partial recovery bounds for the relaxed $K$means improve upon results currently known in the sGMM setting. In the SBM setting, applying the relaxed $K$means SDP allows to handle general connection probabilities whereas other SDPs investigated in the literature are restricted to the as"},"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":"1807.07547","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-07-19T17:33:30Z","cross_cats_sorted":["cs.LG","stat.TH"],"title_canon_sha256":"445bc4cdddc79dc01209d9518e265fc540a677aec0a5f8f2ca159b30e6c8eb6f","abstract_canon_sha256":"8619f219bca8db5e181371a10f97c0f219da3aa0ae99098ca5ee723ddd2c4f67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:11.565936Z","signature_b64":"YsjyIVEESbgdh9yYf4SzJjoxTB/CkeEeXJfAJwxumu/VDr7+1hK1Bya2rse2Sl8adzvVpYDr7iYaWzutqbhFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"683655115417fee4c916961d856178614f85fb9cde1d8df89696e172e46d9a09","last_reissued_at":"2026-05-17T23:48:11.565246Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:11.565246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial recovery bounds for clustering with the relaxed $K$means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.TH"],"primary_cat":"math.ST","authors_text":"Christophe Giraud, Nicolas Verzelen","submitted_at":"2018-07-19T17:33:30Z","abstract_excerpt":"We investigate the clustering performances of the relaxed $K$means in the setting of sub-Gaussian Mixture Model (sGMM) and Stochastic Block Model (SBM). After identifying the appropriate signal-to-noise ratio (SNR), we prove that the misclassification error decay exponentially fast with respect to this SNR. These partial recovery bounds for the relaxed $K$means improve upon results currently known in the sGMM setting. In the SBM setting, applying the relaxed $K$means SDP allows to handle general connection probabilities whereas other SDPs investigated in the literature are restricted to the as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07547","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":""},"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":"1807.07547","created_at":"2026-05-17T23:48:11.565357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07547v3","created_at":"2026-05-17T23:48:11.565357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07547","created_at":"2026-05-17T23:48:11.565357+00:00"},{"alias_kind":"pith_short_12","alias_value":"NA3FKEKUC77O","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NA3FKEKUC77OJSIW","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NA3FKEKU","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11728","citing_title":"Davis-Kahan Theorem in the two-to-infinity norm and its application to perfect clustering","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF","json":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF.json","graph_json":"https://pith.science/api/pith-number/NA3FKEKUC77OJSIWSYOYKYLYMF/graph.json","events_json":"https://pith.science/api/pith-number/NA3FKEKUC77OJSIWSYOYKYLYMF/events.json","paper":"https://pith.science/paper/NA3FKEKU"},"agent_actions":{"view_html":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF","download_json":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF.json","view_paper":"https://pith.science/paper/NA3FKEKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07547&json=true","fetch_graph":"https://pith.science/api/pith-number/NA3FKEKUC77OJSIWSYOYKYLYMF/graph.json","fetch_events":"https://pith.science/api/pith-number/NA3FKEKUC77OJSIWSYOYKYLYMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF/action/storage_attestation","attest_author":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF/action/author_attestation","sign_citation":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF/action/citation_signature","submit_replication":"https://pith.science/pith/NA3FKEKUC77OJSIWSYOYKYLYMF/action/replication_record"}},"created_at":"2026-05-17T23:48:11.565357+00:00","updated_at":"2026-05-17T23:48:11.565357+00:00"}