{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UTE2JWFSDYMXC6VZPZO2PQQCAC","short_pith_number":"pith:UTE2JWFS","schema_version":"1.0","canonical_sha256":"a4c9a4d8b21e19717ab97e5da7c20200a0c7b4027cfee72e326eb7dda34fa934","source":{"kind":"arxiv","id":"1411.6235","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.6235","created_at":"2026-05-18T02:33:00.443160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6235v1","created_at":"2026-05-18T02:33:00.443160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6235","created_at":"2026-05-18T02:33:00.443160+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTE2JWFSDYMX","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTE2JWFSDYMXC6VZ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTE2JWFS","created_at":"2026-05-18T12:28:52.271510+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/UTE2JWFSDYMXC6VZPZO2PQQCAC","json":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC.json","graph_json":"https://pith.science/api/pith-number/UTE2JWFSDYMXC6VZPZO2PQQCAC/graph.json","events_json":"https://pith.science/api/pith-number/UTE2JWFSDYMXC6VZPZO2PQQCAC/events.json","paper":"https://pith.science/paper/UTE2JWFS"},"agent_actions":{"view_html":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC","download_json":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC.json","view_paper":"https://pith.science/paper/UTE2JWFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6235&json=true","fetch_graph":"https://pith.science/api/pith-number/UTE2JWFSDYMXC6VZPZO2PQQCAC/graph.json","fetch_events":"https://pith.science/api/pith-number/UTE2JWFSDYMXC6VZPZO2PQQCAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/action/storage_attestation","attest_author":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/action/author_attestation","sign_citation":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/action/citation_signature","submit_replication":"https://pith.science/pith/UTE2JWFSDYMXC6VZPZO2PQQCAC/action/replication_record"}},"created_at":"2026-05-18T02:33:00.443160+00:00","updated_at":"2026-05-18T02:33:00.443160+00:00"}