{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UWBEXQPNFGZXWYVH5ZJYJSUHQ5","short_pith_number":"pith:UWBEXQPN","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"},"canonical_sha256":"a5824bc1ed29b37b62a7ee5384ca878762c47acd851bc75273b6c0703c0ec82a","source":{"kind":"arxiv","id":"1505.06478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06478","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06478v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06478","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"UWBEXQPNFGZX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UWBEXQPNFGZXWYVH","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UWBEXQPN","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UWBEXQPNFGZXWYVH5ZJYJSUHQ5","target":"record","payload":{"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"},"canonical_sha256":"a5824bc1ed29b37b62a7ee5384ca878762c47acd851bc75273b6c0703c0ec82a","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"},"source_kind":"arxiv","source_id":"1505.06478","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cz6C1AyUuF8PpZZ5t1qhp7ZSYU5gXNuC7s5JmZuEPw/lk4a3hTKzM5fqrgfm61CNkqTqwiwi36lwuA28Zg3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:48:52.260704Z"},"content_sha256":"5761d8325a9ff9a3a0b6be20a4e270535b93ad0dc311158f4f27e8155ff7588d","schema_version":"1.0","event_id":"sha256:5761d8325a9ff9a3a0b6be20a4e270535b93ad0dc311158f4f27e8155ff7588d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UWBEXQPNFGZXWYVH5ZJYJSUHQ5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1JB+IFpxC/cg76gj5U2kt+tWp9HL6lygR4LGXiAXyKiL+vpA4LTvqjEOZMuSnNl1QA71Xb6n6TFcW9Ek+FuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:48:52.261059Z"},"content_sha256":"a9c6a84c61537ac6c8ba225c77cd4a278fdd0c6bddd268bc7eea5db61568bed2","schema_version":"1.0","event_id":"sha256:a9c6a84c61537ac6c8ba225c77cd4a278fdd0c6bddd268bc7eea5db61568bed2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/bundle.json","state_url":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T09:48:52Z","links":{"resolver":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5","bundle":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/bundle.json","state":"https://pith.science/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWBEXQPNFGZXWYVH5ZJYJSUHQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UWBEXQPNFGZXWYVH5ZJYJSUHQ5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e6794b50700a439e004b10a057175e8471a6dd2877b66e24e340f0ddea9f6aaa","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T20:37:10Z","title_canon_sha256":"9d727ccc82b1997af570d6457581fe4371fa72edb373dca2c3553d81c3e92f5b"},"schema_version":"1.0","source":{"id":"1505.06478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06478","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06478v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06478","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"UWBEXQPNFGZX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UWBEXQPNFGZXWYVH","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UWBEXQPN","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:a9c6a84c61537ac6c8ba225c77cd4a278fdd0c6bddd268bc7eea5db61568bed2","target":"graph","created_at":"2026-05-18T02:03:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Matthias Hein, Pramod Kaushik Mudrakarta, Syama Sundar Rangapuram","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T20:37:10Z","title":"Tight Continuous Relaxation of the Balanced $k$-Cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06478","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5761d8325a9ff9a3a0b6be20a4e270535b93ad0dc311158f4f27e8155ff7588d","target":"record","created_at":"2026-05-18T02:03:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e6794b50700a439e004b10a057175e8471a6dd2877b66e24e340f0ddea9f6aaa","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T20:37:10Z","title_canon_sha256":"9d727ccc82b1997af570d6457581fe4371fa72edb373dca2c3553d81c3e92f5b"},"schema_version":"1.0","source":{"id":"1505.06478","kind":"arxiv","version":1}},"canonical_sha256":"a5824bc1ed29b37b62a7ee5384ca878762c47acd851bc75273b6c0703c0ec82a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5824bc1ed29b37b62a7ee5384ca878762c47acd851bc75273b6c0703c0ec82a","first_computed_at":"2026-05-18T02:03:44.888297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:44.888297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o4yj011wsUfRA8TQq3/dv/FQigjGci4ljyPG0iOhEBzABoSfDA3cAljuzvPl+vgagQq+jjiv8M89KwuHlASuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:44.889113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5761d8325a9ff9a3a0b6be20a4e270535b93ad0dc311158f4f27e8155ff7588d","sha256:a9c6a84c61537ac6c8ba225c77cd4a278fdd0c6bddd268bc7eea5db61568bed2"],"state_sha256":"b31afb454a7014ef4da61c6abe3b073f672a39868f8b3e269e199eb9694788cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OM8tG68nLNKKpbx3Af6fEqg2UXXVCE8r2UDPRHfrJ6yuClVmCd4RKrT6hIIEBkN7CvUNNE5vP+WO0urnMdgfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:48:52.263282Z","bundle_sha256":"7f64cfab1eac0809263ca2228b9558989297c8c91cd41bf349d60b4e362f9b99"}}