{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CCYGRMDOUE54LD4XA5ABOWVUWZ","short_pith_number":"pith:CCYGRMDO","schema_version":"1.0","canonical_sha256":"10b068b06ea13bc58f970740175ab4b6535d922ff0f5b1cd70a8d3415fa52a70","source":{"kind":"arxiv","id":"1602.01910","version":1},"attestation_state":"computed","paper":{"title":"Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David F. Gleich, Inderjit S. Dhillon, Joyce Jiyoung Whang, Yangyang Hou","submitted_at":"2016-02-05T02:08:57Z","abstract_excerpt":"Clustering is one of the most fundamental and important tasks in data mining. Traditional clustering algorithms, such as K-means, assign every data point to exactly one cluster. However, in real-world datasets, the clusters may overlap with each other. Furthermore, often, there are outliers that should not belong to any cluster. We recently proposed the NEO-K-Means (Non-Exhaustive, Overlapping K-Means) objective as a way to address both issues in an integrated fashion. Optimizing this discrete objective is NP-hard, and even though there is a convex relaxation of the objective, straightforward "},"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":"1602.01910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-05T02:08:57Z","cross_cats_sorted":[],"title_canon_sha256":"081d9b6c53160baa39de292ec1c7bcf3445b36392b300b96b7c25601ea146fdf","abstract_canon_sha256":"88d27ccaec25eccd527d146c2092433371a17155365150712fa6e5e2c299bf60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:15.075461Z","signature_b64":"cSx5tDrmoRJQbOKOPIEb2KhjCS1xCDlYiUxNWhCh09GqJ5awLv5QQBT85WWtc8UL612r2DOVm8VDgmlM941uBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10b068b06ea13bc58f970740175ab4b6535d922ff0f5b1cd70a8d3415fa52a70","last_reissued_at":"2026-05-18T01:21:15.074780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:15.074780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David F. Gleich, Inderjit S. Dhillon, Joyce Jiyoung Whang, Yangyang Hou","submitted_at":"2016-02-05T02:08:57Z","abstract_excerpt":"Clustering is one of the most fundamental and important tasks in data mining. Traditional clustering algorithms, such as K-means, assign every data point to exactly one cluster. However, in real-world datasets, the clusters may overlap with each other. Furthermore, often, there are outliers that should not belong to any cluster. We recently proposed the NEO-K-Means (Non-Exhaustive, Overlapping K-Means) objective as a way to address both issues in an integrated fashion. Optimizing this discrete objective is NP-hard, and even though there is a convex relaxation of the objective, straightforward "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01910","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":"1602.01910","created_at":"2026-05-18T01:21:15.074866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01910v1","created_at":"2026-05-18T01:21:15.074866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01910","created_at":"2026-05-18T01:21:15.074866+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCYGRMDOUE54","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCYGRMDOUE54LD4X","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCYGRMDO","created_at":"2026-05-18T12:30:09.641336+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/CCYGRMDOUE54LD4XA5ABOWVUWZ","json":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ.json","graph_json":"https://pith.science/api/pith-number/CCYGRMDOUE54LD4XA5ABOWVUWZ/graph.json","events_json":"https://pith.science/api/pith-number/CCYGRMDOUE54LD4XA5ABOWVUWZ/events.json","paper":"https://pith.science/paper/CCYGRMDO"},"agent_actions":{"view_html":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ","download_json":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ.json","view_paper":"https://pith.science/paper/CCYGRMDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01910&json=true","fetch_graph":"https://pith.science/api/pith-number/CCYGRMDOUE54LD4XA5ABOWVUWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CCYGRMDOUE54LD4XA5ABOWVUWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/action/storage_attestation","attest_author":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/action/author_attestation","sign_citation":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/action/citation_signature","submit_replication":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/action/replication_record"}},"created_at":"2026-05-18T01:21:15.074866+00:00","updated_at":"2026-05-18T01:21:15.074866+00:00"}