{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:76PMB7WCBCXR55OOSKQ73VT7SI","short_pith_number":"pith:76PMB7WC","schema_version":"1.0","canonical_sha256":"ff9ec0fec208af1ef5ce92a1fdd67f92313d6913b480b458bbf448f6ab7773b0","source":{"kind":"arxiv","id":"1706.06028","version":4},"attestation_state":"computed","paper":{"title":"Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anirvan M. Sengupta, Dmitri Chklovskii, Mariano Tepper","submitted_at":"2017-06-19T15:57:12Z","abstract_excerpt":"In solving hard computational problems, semidefinite program (SDP) relaxations often play an important role because they come with a guarantee of optimality. Here, we focus on a popular semidefinite relaxation of K-means clustering which yields the same solution as the non-convex original formulation for well segregated datasets. We report an unexpected finding: when data contains (greater than zero-dimensional) manifolds, the SDP solution captures such geometrical structures. Unlike traditional manifold embedding techniques, our approach does not rely on manually defining a kernel but rather "},"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":"1706.06028","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-19T15:57:12Z","cross_cats_sorted":[],"title_canon_sha256":"70a87680fbd3b852e7092adb75340d72b1b045a0c7eaad42403b04e0ae29f4f7","abstract_canon_sha256":"a15c360554fbb064a06644e40efe21ad16b152d10b4c1807bc35e1e22dfac531"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:26.531638Z","signature_b64":"f8KHv9xnQLOLtVKaKzY7quKuO8RIdIWHF0pVesrvg+IsUVk04t3cRkg/8+MF0sEMbVPIMsHMxDikBPo0Uh9mBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9ec0fec208af1ef5ce92a1fdd67f92313d6913b480b458bbf448f6ab7773b0","last_reissued_at":"2026-05-18T00:06:26.530949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:26.530949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anirvan M. Sengupta, Dmitri Chklovskii, Mariano Tepper","submitted_at":"2017-06-19T15:57:12Z","abstract_excerpt":"In solving hard computational problems, semidefinite program (SDP) relaxations often play an important role because they come with a guarantee of optimality. Here, we focus on a popular semidefinite relaxation of K-means clustering which yields the same solution as the non-convex original formulation for well segregated datasets. We report an unexpected finding: when data contains (greater than zero-dimensional) manifolds, the SDP solution captures such geometrical structures. Unlike traditional manifold embedding techniques, our approach does not rely on manually defining a kernel but rather "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06028","kind":"arxiv","version":4},"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":"1706.06028","created_at":"2026-05-18T00:06:26.531050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06028v4","created_at":"2026-05-18T00:06:26.531050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06028","created_at":"2026-05-18T00:06:26.531050+00:00"},{"alias_kind":"pith_short_12","alias_value":"76PMB7WCBCXR","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"76PMB7WCBCXR55OO","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"76PMB7WC","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI","json":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI.json","graph_json":"https://pith.science/api/pith-number/76PMB7WCBCXR55OOSKQ73VT7SI/graph.json","events_json":"https://pith.science/api/pith-number/76PMB7WCBCXR55OOSKQ73VT7SI/events.json","paper":"https://pith.science/paper/76PMB7WC"},"agent_actions":{"view_html":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI","download_json":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI.json","view_paper":"https://pith.science/paper/76PMB7WC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06028&json=true","fetch_graph":"https://pith.science/api/pith-number/76PMB7WCBCXR55OOSKQ73VT7SI/graph.json","fetch_events":"https://pith.science/api/pith-number/76PMB7WCBCXR55OOSKQ73VT7SI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI/action/storage_attestation","attest_author":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI/action/author_attestation","sign_citation":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI/action/citation_signature","submit_replication":"https://pith.science/pith/76PMB7WCBCXR55OOSKQ73VT7SI/action/replication_record"}},"created_at":"2026-05-18T00:06:26.531050+00:00","updated_at":"2026-05-18T00:06:26.531050+00:00"}