{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I2RUPS5RMITU57XRTQCVAOS6JX","short_pith_number":"pith:I2RUPS5R","schema_version":"1.0","canonical_sha256":"46a347cbb162274efef19c05503a5e4ddd85147cc6c4dcc6612f876e7a396b4c","source":{"kind":"arxiv","id":"1711.07465","version":1},"attestation_state":"computed","paper":{"title":"Better Agnostic Clustering Via Relaxed Tensor Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jacob Steinhardt, Pravesh K. Kothari","submitted_at":"2017-11-20T18:56:40Z","abstract_excerpt":"We develop a new family of convex relaxations for $k$-means clustering based on sum-of-squares norms, a relaxation of the injective tensor norm that is efficiently computable using the Sum-of-Squares algorithm. We give an algorithm based on this relaxation that recovers a faithful approximation to the true means in the given data whenever the low-degree moments of the points in each cluster have bounded sum-of-squares norms.\n  We then prove a sharp upper bound on the sum-of-squares norms for moment tensors of any distribution that satisfies the \\emph{Poincare inequality}. The Poincare inequali"},"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":"1711.07465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-20T18:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"8fa64a663102d43010d07f11a9e494e8746f4a2072c7c9782b95883e8518c7d4","abstract_canon_sha256":"303c3741634b3ba6cd2f751f6bc85feb736880fe553ab5a2ae0ec5aef0d8472a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:10.097050Z","signature_b64":"6jtKDvCx+kmnKdtV2wxWKczaHtD8TKtEeplkiwdx/Ix+WeDJKVTElECpofa6Tu8/kMZiczKAzjAe88xP1YweCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46a347cbb162274efef19c05503a5e4ddd85147cc6c4dcc6612f876e7a396b4c","last_reissued_at":"2026-05-18T00:30:10.096381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:10.096381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Agnostic Clustering Via Relaxed Tensor Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jacob Steinhardt, Pravesh K. Kothari","submitted_at":"2017-11-20T18:56:40Z","abstract_excerpt":"We develop a new family of convex relaxations for $k$-means clustering based on sum-of-squares norms, a relaxation of the injective tensor norm that is efficiently computable using the Sum-of-Squares algorithm. We give an algorithm based on this relaxation that recovers a faithful approximation to the true means in the given data whenever the low-degree moments of the points in each cluster have bounded sum-of-squares norms.\n  We then prove a sharp upper bound on the sum-of-squares norms for moment tensors of any distribution that satisfies the \\emph{Poincare inequality}. The Poincare inequali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07465","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.07465","created_at":"2026-05-18T00:30:10.096482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07465v1","created_at":"2026-05-18T00:30:10.096482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07465","created_at":"2026-05-18T00:30:10.096482+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2RUPS5RMITU","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2RUPS5RMITU57XR","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2RUPS5R","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.18042","citing_title":"On efficient robust regression with subquadratic samples","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX","json":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX.json","graph_json":"https://pith.science/api/pith-number/I2RUPS5RMITU57XRTQCVAOS6JX/graph.json","events_json":"https://pith.science/api/pith-number/I2RUPS5RMITU57XRTQCVAOS6JX/events.json","paper":"https://pith.science/paper/I2RUPS5R"},"agent_actions":{"view_html":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX","download_json":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX.json","view_paper":"https://pith.science/paper/I2RUPS5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07465&json=true","fetch_graph":"https://pith.science/api/pith-number/I2RUPS5RMITU57XRTQCVAOS6JX/graph.json","fetch_events":"https://pith.science/api/pith-number/I2RUPS5RMITU57XRTQCVAOS6JX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX/action/storage_attestation","attest_author":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX/action/author_attestation","sign_citation":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX/action/citation_signature","submit_replication":"https://pith.science/pith/I2RUPS5RMITU57XRTQCVAOS6JX/action/replication_record"}},"created_at":"2026-05-18T00:30:10.096482+00:00","updated_at":"2026-05-18T00:30:10.096482+00:00"}