{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CCYGRMDOUE54LD4XA5ABOWVUWZ","short_pith_number":"pith:CCYGRMDO","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"},"canonical_sha256":"10b068b06ea13bc58f970740175ab4b6535d922ff0f5b1cd70a8d3415fa52a70","source":{"kind":"arxiv","id":"1602.01910","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01910","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01910v1","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01910","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"CCYGRMDOUE54","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CCYGRMDOUE54LD4X","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CCYGRMDO","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CCYGRMDOUE54LD4XA5ABOWVUWZ","target":"record","payload":{"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"},"canonical_sha256":"10b068b06ea13bc58f970740175ab4b6535d922ff0f5b1cd70a8d3415fa52a70","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"},"source_kind":"arxiv","source_id":"1602.01910","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-18T01:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kOH3xpla8kyPdTLperq+Ywp/Fvnlo/wrIftkc3e0faAfvp0ETm0/mS5Xafm8TqBNodeBurcaxv7YQ7a1JloXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:13:50.400600Z"},"content_sha256":"328fd0ddefa40ffe15c0a9a3ae125321e29bb5de142118f1fdddcba1cd38ecc4","schema_version":"1.0","event_id":"sha256:328fd0ddefa40ffe15c0a9a3ae125321e29bb5de142118f1fdddcba1cd38ecc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CCYGRMDOUE54LD4XA5ABOWVUWZ","target":"graph","payload":{"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"},"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-18T01:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eu35GPSePEPeXlQjiBLrJPLMm5jFOU0qV/HVnsh3HES2nZChzceXrydLJMkQcPJ/bWTyvqInO5d9ndR8UzSbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:13:50.401232Z"},"content_sha256":"5e31f55655e464c651f0a24358fac2af057dc22baad52672bdd95e30650c24e4","schema_version":"1.0","event_id":"sha256:5e31f55655e464c651f0a24358fac2af057dc22baad52672bdd95e30650c24e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/bundle.json","state_url":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/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-31T07:13:50Z","links":{"resolver":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ","bundle":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/bundle.json","state":"https://pith.science/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCYGRMDOUE54LD4XA5ABOWVUWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CCYGRMDOUE54LD4XA5ABOWVUWZ","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":"88d27ccaec25eccd527d146c2092433371a17155365150712fa6e5e2c299bf60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-05T02:08:57Z","title_canon_sha256":"081d9b6c53160baa39de292ec1c7bcf3445b36392b300b96b7c25601ea146fdf"},"schema_version":"1.0","source":{"id":"1602.01910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01910","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01910v1","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01910","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"CCYGRMDOUE54","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CCYGRMDOUE54LD4X","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CCYGRMDO","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:5e31f55655e464c651f0a24358fac2af057dc22baad52672bdd95e30650c24e4","target":"graph","created_at":"2026-05-18T01:21:15Z","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 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 ","authors_text":"David F. Gleich, Inderjit S. Dhillon, Joyce Jiyoung Whang, Yangyang Hou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-05T02:08:57Z","title":"Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01910","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:328fd0ddefa40ffe15c0a9a3ae125321e29bb5de142118f1fdddcba1cd38ecc4","target":"record","created_at":"2026-05-18T01:21:15Z","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":"88d27ccaec25eccd527d146c2092433371a17155365150712fa6e5e2c299bf60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-05T02:08:57Z","title_canon_sha256":"081d9b6c53160baa39de292ec1c7bcf3445b36392b300b96b7c25601ea146fdf"},"schema_version":"1.0","source":{"id":"1602.01910","kind":"arxiv","version":1}},"canonical_sha256":"10b068b06ea13bc58f970740175ab4b6535d922ff0f5b1cd70a8d3415fa52a70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10b068b06ea13bc58f970740175ab4b6535d922ff0f5b1cd70a8d3415fa52a70","first_computed_at":"2026-05-18T01:21:15.074780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:15.074780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cSx5tDrmoRJQbOKOPIEb2KhjCS1xCDlYiUxNWhCh09GqJ5awLv5QQBT85WWtc8UL612r2DOVm8VDgmlM941uBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:15.075461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:328fd0ddefa40ffe15c0a9a3ae125321e29bb5de142118f1fdddcba1cd38ecc4","sha256:5e31f55655e464c651f0a24358fac2af057dc22baad52672bdd95e30650c24e4"],"state_sha256":"ba66aaa05ba795b616cf0b08b492612a8128ef8d2b9ed073c30c729fea2b846e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrwJUi81f0Y7ZZhdF2cAkMJjgVwbUsN7oaFqtDy4Wp4a9X83kH8d10D14DwDEQFs3fnb9Y5AWcnrss868LpRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:13:50.404495Z","bundle_sha256":"e6fd8549a7b3f80f6c0940bb04b06e7cd76c23bed3e3ee2bebae917919a4372d"}}