{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UTE2JWFSDYMXC6VZPZO2PQQCAC","short_pith_number":"pith:UTE2JWFS","canonical_record":{"source":{"id":"1411.6235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T13:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"c0e4a971469d44287f34d97de71e4c6ff2d969c64ad997130831ad62a8e740ec","abstract_canon_sha256":"4f93f01a9944da20a80b61c60734bdff0facc2e75f6f7d32298b6b7f3b1990d7"},"schema_version":"1.0"},"canonical_sha256":"a4c9a4d8b21e19717ab97e5da7c20200a0c7b4027cfee72e326eb7dda34fa934","source":{"kind":"arxiv","id":"1411.6235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6235","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6235v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6235","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"UTE2JWFSDYMX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UTE2JWFSDYMXC6VZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UTE2JWFS","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UTE2JWFSDYMXC6VZPZO2PQQCAC","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T13:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"c0e4a971469d44287f34d97de71e4c6ff2d969c64ad997130831ad62a8e740ec","abstract_canon_sha256":"4f93f01a9944da20a80b61c60734bdff0facc2e75f6f7d32298b6b7f3b1990d7"},"schema_version":"1.0"},"canonical_sha256":"a4c9a4d8b21e19717ab97e5da7c20200a0c7b4027cfee72e326eb7dda34fa934","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.443450Z","signature_b64":"fGK6B1PWfRN5mc2NrPo95LZzGYMuEBfMJiSitg7O73JFbbHpr+vSs9Ikpj4ov/7A2Rd5EAJNM0CClgNYTvngAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4c9a4d8b21e19717ab97e5da7c20200a0c7b4027cfee72e326eb7dda34fa934","last_reissued_at":"2026-05-18T02:33:00.443105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.443105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6235","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2A3po7JkhEgP5xq0tZyERim3XBii53f8CrDLrYnjyx1UEvojNULOd0ffkjcFptXwM5AwnKbOxy2by6h+7wa6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:32:42.339663Z"},"content_sha256":"7674daac2ca35edff4be48256f7cecbb4262e274fa91a164d204741339196362","schema_version":"1.0","event_id":"sha256:7674daac2ca35edff4be48256f7cecbb4262e274fa91a164d204741339196362"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UTE2JWFSDYMXC6VZPZO2PQQCAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced k-Means and Min-Cut Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Xiaojun Chang, Yi Yang, Zhigang Ma","submitted_at":"2014-11-23T13:16:25Z","abstract_excerpt":"Clustering is an effective technique in data mining to generate groups that are the matter of interest. Among various clustering approaches, the family of k-means algorithms and min-cut algorithms gain most popularity due to their simplicity and efficacy. The classical k-means algorithm partitions a number of data points into several subsets by iteratively updating the clustering centers and the associated data points. By contrast, a weighted undirected graph is constructed in min-cut algorithms which partition the vertices of the graph into two sets. However, existing clustering algorithms te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6235","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKxQdJ96OHin+Yd75SZcsP13MQdfR3DO579jjLBqDrYQYAEU7bNJ3G44OXKrs+YF8ciLqRVS7ypq6fPLJEUdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:32:42.340154Z"},"content_sha256":"4856e431799d53283eb881ac0143313792c78ff411a09a51f7baefb5c6364b98","schema_version":"1.0","event_id":"sha256:4856e431799d53283eb881ac0143313792c78ff411a09a51f7baefb5c6364b98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/bundle.json","state_url":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/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-05-26T20:32:42Z","links":{"resolver":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC","bundle":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/bundle.json","state":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UTE2JWFSDYMXC6VZPZO2PQQCAC","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":"4f93f01a9944da20a80b61c60734bdff0facc2e75f6f7d32298b6b7f3b1990d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T13:16:25Z","title_canon_sha256":"c0e4a971469d44287f34d97de71e4c6ff2d969c64ad997130831ad62a8e740ec"},"schema_version":"1.0","source":{"id":"1411.6235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6235","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6235v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6235","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"UTE2JWFSDYMX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UTE2JWFSDYMXC6VZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UTE2JWFS","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:4856e431799d53283eb881ac0143313792c78ff411a09a51f7baefb5c6364b98","target":"graph","created_at":"2026-05-18T02:33:00Z","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":"Clustering is an effective technique in data mining to generate groups that are the matter of interest. Among various clustering approaches, the family of k-means algorithms and min-cut algorithms gain most popularity due to their simplicity and efficacy. The classical k-means algorithm partitions a number of data points into several subsets by iteratively updating the clustering centers and the associated data points. By contrast, a weighted undirected graph is constructed in min-cut algorithms which partition the vertices of the graph into two sets. However, existing clustering algorithms te","authors_text":"Feiping Nie, Xiaojun Chang, Yi Yang, Zhigang Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T13:16:25Z","title":"Balanced k-Means and Min-Cut Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6235","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:7674daac2ca35edff4be48256f7cecbb4262e274fa91a164d204741339196362","target":"record","created_at":"2026-05-18T02:33:00Z","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":"4f93f01a9944da20a80b61c60734bdff0facc2e75f6f7d32298b6b7f3b1990d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-23T13:16:25Z","title_canon_sha256":"c0e4a971469d44287f34d97de71e4c6ff2d969c64ad997130831ad62a8e740ec"},"schema_version":"1.0","source":{"id":"1411.6235","kind":"arxiv","version":1}},"canonical_sha256":"a4c9a4d8b21e19717ab97e5da7c20200a0c7b4027cfee72e326eb7dda34fa934","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4c9a4d8b21e19717ab97e5da7c20200a0c7b4027cfee72e326eb7dda34fa934","first_computed_at":"2026-05-18T02:33:00.443105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:00.443105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fGK6B1PWfRN5mc2NrPo95LZzGYMuEBfMJiSitg7O73JFbbHpr+vSs9Ikpj4ov/7A2Rd5EAJNM0CClgNYTvngAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:00.443450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7674daac2ca35edff4be48256f7cecbb4262e274fa91a164d204741339196362","sha256:4856e431799d53283eb881ac0143313792c78ff411a09a51f7baefb5c6364b98"],"state_sha256":"b9ec5c069e75c3d8af9e86befd2589853ad72c9d652006d20818e977c05993e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XeI8GzvcoeKYZFXNYobOzwHUeyrzO/znfjiMWPIxT8t7mHkk6/+ZPaZl4TlWXKLIbOzmvDmBRbaDyHIj67EMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:32:42.344260Z","bundle_sha256":"911a92851f52863215f3626c66edf4d33f39b27e6a897f7fa75c722a472e9e4c"}}