{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UWBEXQPNFGZXWYVH5ZJYJSUHQ5","short_pith_number":"pith:UWBEXQPN","schema_version":"1.0","canonical_sha256":"a5824bc1ed29b37b62a7ee5384ca878762c47acd851bc75273b6c0703c0ec82a","source":{"kind":"arxiv","id":"1505.06478","version":1},"attestation_state":"computed","paper":{"title":"Tight Continuous Relaxation of the Balanced $k$-Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Matthias Hein, Pramod Kaushik Mudrakarta, Syama Sundar Rangapuram","submitted_at":"2015-05-24T20:37:10Z","abstract_excerpt":"Spectral Clustering as a relaxation of the normalized/ratio cut has become one of the standard graph-based clustering methods. Existing methods for the computation of multiple clusters, corresponding to a balanced $k$-cut of the graph, are either based on greedy techniques or heuristics which have weak connection to the original motivation of minimizing the normalized cut. In this paper we propose a new tight continuous relaxation for any balanced $k$-cut problem and show that a related recently proposed relaxation is in most cases loose leading to poor performance in practice. For the optimiz"},"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":"1505.06478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T20:37:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9d727ccc82b1997af570d6457581fe4371fa72edb373dca2c3553d81c3e92f5b","abstract_canon_sha256":"e6794b50700a439e004b10a057175e8471a6dd2877b66e24e340f0ddea9f6aaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:44.889113Z","signature_b64":"o4yj011wsUfRA8TQq3/dv/FQigjGci4ljyPG0iOhEBzABoSfDA3cAljuzvPl+vgagQq+jjiv8M89KwuHlASuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5824bc1ed29b37b62a7ee5384ca878762c47acd851bc75273b6c0703c0ec82a","last_reissued_at":"2026-05-18T02:03:44.888297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:44.888297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Continuous Relaxation of the Balanced $k$-Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Matthias Hein, Pramod Kaushik Mudrakarta, Syama Sundar Rangapuram","submitted_at":"2015-05-24T20:37:10Z","abstract_excerpt":"Spectral Clustering as a relaxation of the normalized/ratio cut has become one of the standard graph-based clustering methods. Existing methods for the computation of multiple clusters, corresponding to a balanced $k$-cut of the graph, are either based on greedy techniques or heuristics which have weak connection to the original motivation of minimizing the normalized cut. In this paper we propose a new tight continuous relaxation for any balanced $k$-cut problem and show that a related recently proposed relaxation is in most cases loose leading to poor performance in practice. For the optimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06478","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":"1505.06478","created_at":"2026-05-18T02:03:44.888456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06478v1","created_at":"2026-05-18T02:03:44.888456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06478","created_at":"2026-05-18T02:03:44.888456+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWBEXQPNFGZX","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWBEXQPNFGZXWYVH","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWBEXQPN","created_at":"2026-05-18T12:29:44.643036+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/UWBEXQPNFGZXWYVH5ZJYJSUHQ5","json":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5.json","graph_json":"https://pith.science/api/pith-number/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/graph.json","events_json":"https://pith.science/api/pith-number/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/events.json","paper":"https://pith.science/paper/UWBEXQPN"},"agent_actions":{"view_html":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5","download_json":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5.json","view_paper":"https://pith.science/paper/UWBEXQPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06478&json=true","fetch_graph":"https://pith.science/api/pith-number/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/action/storage_attestation","attest_author":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/action/author_attestation","sign_citation":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/action/citation_signature","submit_replication":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/action/replication_record"}},"created_at":"2026-05-18T02:03:44.888456+00:00","updated_at":"2026-05-18T02:03:44.888456+00:00"}