{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F2ZF4WO5BSZPL5M4S7A4BZXDCL","short_pith_number":"pith:F2ZF4WO5","schema_version":"1.0","canonical_sha256":"2eb25e59dd0cb2f5f59c97c1c0e6e312e0d31cf9c0016e8d08c1db94f0c51208","source":{"kind":"arxiv","id":"1806.11429","version":3},"attestation_state":"computed","paper":{"title":"Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Shuyang Ling, Thomas Strohmer","submitted_at":"2018-06-29T14:16:19Z","abstract_excerpt":"Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about performance guarantees for spectral clustering. This issue is partly due to the fact that spectral clustering typically involves two steps which complicated its theoretical analysis: first, the eigenvectors of the associated graph Laplacian are used to embed the dataset, and second, k-means clustering algorithm is applied to the embedded dataset to get the "},"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":"1806.11429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-29T14:16:19Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"title_canon_sha256":"0ca90c67866e4a7304985ceb4cd0cb49f3176950c49c3d457444810f2d2703ed","abstract_canon_sha256":"4a5cfb0f39ccfef24c0c93e1c95c1a7fe8039a3564597520103c093a67faad3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:40.367603Z","signature_b64":"O4ICTdQB2tRiRzDCC9RpzY/AqJ6T2RIy5bUvPpRXmlqPmfPwAoo/8YWzSo5c4I0GL3PbPaupg+lkV69ycLgbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb25e59dd0cb2f5f59c97c1c0e6e312e0d31cf9c0016e8d08c1db94f0c51208","last_reissued_at":"2026-05-17T23:48:40.367100Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:40.367100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Shuyang Ling, Thomas Strohmer","submitted_at":"2018-06-29T14:16:19Z","abstract_excerpt":"Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about performance guarantees for spectral clustering. This issue is partly due to the fact that spectral clustering typically involves two steps which complicated its theoretical analysis: first, the eigenvectors of the associated graph Laplacian are used to embed the dataset, and second, k-means clustering algorithm is applied to the embedded dataset to get the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11429","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":"1806.11429","created_at":"2026-05-17T23:48:40.367175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.11429v3","created_at":"2026-05-17T23:48:40.367175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11429","created_at":"2026-05-17T23:48:40.367175+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2ZF4WO5BSZP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2ZF4WO5BSZPL5M4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2ZF4WO5","created_at":"2026-05-18T12:32:22.470017+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/F2ZF4WO5BSZPL5M4S7A4BZXDCL","json":"https://pith.science/pith/F2ZF4WO5BSZPL5M4S7A4BZXDCL.json","graph_json":"https://pith.science/api/pith-number/F2ZF4WO5BSZPL5M4S7A4BZXDCL/graph.json","events_json":"https://pith.science/api/pith-number/F2ZF4WO5BSZPL5M4S7A4BZXDCL/events.json","paper":"https://pith.science/paper/F2ZF4WO5"},"agent_actions":{"view_html":"https://pith.science/pith/F2ZF4WO5BSZPL5M4S7A4BZXDCL","download_json":"https://pith.science/pith/F2ZF4WO5BSZPL5M4S7A4BZXDCL.json","view_paper":"https://pith.science/paper/F2ZF4WO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.11429&json=true","fetch_graph":"https://pith.science/api/pith-number/F2ZF4WO5BSZPL5M4S7A4BZXDCL/graph.json","fetch_events":"https://pith.science/api/pith-number/F2ZF4WO5BSZPL5M4S7A4BZXDCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2ZF4WO5BSZPL5M4S7A4BZXDCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2ZF4WO5BSZPL5M4S7A4BZXDCL/action/storage_attestation","attest_author":"https://pith.science/pith/F2ZF4WO5BSZPL5M4S7A4BZXDCL/action/author_attestation","sign_citation":"https://pith.science/pith/F2ZF4WO5BSZPL5M4S7A4BZXDCL/action/citation_signature","submit_replication":"https://pith.science/pith/F2ZF4WO5BSZPL5M4S7A4BZXDCL/action/replication_record"}},"created_at":"2026-05-17T23:48:40.367175+00:00","updated_at":"2026-05-17T23:48:40.367175+00:00"}