{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:45Z54YZG7GYLRW4XEHEBNS5RDV","short_pith_number":"pith:45Z54YZG","canonical_record":{"source":{"id":"1304.6478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-24T03:59:39Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"7d7dda999ab63a1d8ba6c6e41c842c70ca103be8ea65df3aa38786690d6d0f0d","abstract_canon_sha256":"6c0eb7fd595af85721a8d2a14c29144dac9615322cadf25e466e6c6b6dfd96e2"},"schema_version":"1.0"},"canonical_sha256":"e773de6326f9b0b8db9721c816cbb11d464b5716fa44d971d706b8130d70b5e1","source":{"kind":"arxiv","id":"1304.6478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6478","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6478v1","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6478","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"pith_short_12","alias_value":"45Z54YZG7GYL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"45Z54YZG7GYLRW4X","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"45Z54YZG","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:45Z54YZG7GYLRW4XEHEBNS5RDV","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-24T03:59:39Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"7d7dda999ab63a1d8ba6c6e41c842c70ca103be8ea65df3aa38786690d6d0f0d","abstract_canon_sha256":"6c0eb7fd595af85721a8d2a14c29144dac9615322cadf25e466e6c6b6dfd96e2"},"schema_version":"1.0"},"canonical_sha256":"e773de6326f9b0b8db9721c816cbb11d464b5716fa44d971d706b8130d70b5e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:12.992780Z","signature_b64":"GQW+Max3WC9wJqNKogvi/lA57HcWzMsnx3/dMTqI0LmNmoqY7JUXs2WXZyN7ysrflyYEcyNEgBbuaYhBSQ8CDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e773de6326f9b0b8db9721c816cbb11d464b5716fa44d971d706b8130d70b5e1","last_reissued_at":"2026-05-18T03:27:12.992053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:12.992053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6478","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-18T03:27:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jwAQFpa9gy+Dues7HFfTWeDuI86c1Y9CXdBT2vxmybm1Gtf46ZlLZg8kVu4RX4sEpVgZwvHueK0jyAam6t9jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:09:00.145431Z"},"content_sha256":"cb26169233b3ff88a7e7a7c1d37d9436f4abdc18752792bd26fabc2e96e7784c","schema_version":"1.0","event_id":"sha256:cb26169233b3ff88a7e7a7c1d37d9436f4abdc18752792bd26fabc2e96e7784c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:45Z54YZG7GYLRW4XEHEBNS5RDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The K-modes algorithm for clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Weiran Wang","submitted_at":"2013-04-24T03:59:39Z","abstract_excerpt":"Many clustering algorithms exist that estimate a cluster centroid, such as K-means, K-medoids or mean-shift, but no algorithm seems to exist that clusters data by returning exactly K meaningful modes. We propose a natural definition of a K-modes objective function by combining the notions of density and cluster assignment. The algorithm becomes K-means and K-medoids in the limit of very large and very small scales. Computationally, it is slightly slower than K-means but much faster than mean-shift or K-medoids. Unlike K-means, it is able to find centroids that are valid patterns, truly represe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6478","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-18T03:27:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vqwym5XKzEvkUt23BkZNN9JN3x5njYcpVPydjiWRhtNNULwUob1bJHCGR9yNdpAAZtMm82NhS7Gx4BuLOOi0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:09:00.146336Z"},"content_sha256":"3c45c734e7abbc3ecb7044d9260d7e5b51f3aa45a51051711e13ac06afc2f556","schema_version":"1.0","event_id":"sha256:3c45c734e7abbc3ecb7044d9260d7e5b51f3aa45a51051711e13ac06afc2f556"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45Z54YZG7GYLRW4XEHEBNS5RDV/bundle.json","state_url":"https://pith.science/pith/45Z54YZG7GYLRW4XEHEBNS5RDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45Z54YZG7GYLRW4XEHEBNS5RDV/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-07T20:09:00Z","links":{"resolver":"https://pith.science/pith/45Z54YZG7GYLRW4XEHEBNS5RDV","bundle":"https://pith.science/pith/45Z54YZG7GYLRW4XEHEBNS5RDV/bundle.json","state":"https://pith.science/pith/45Z54YZG7GYLRW4XEHEBNS5RDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45Z54YZG7GYLRW4XEHEBNS5RDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:45Z54YZG7GYLRW4XEHEBNS5RDV","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":"6c0eb7fd595af85721a8d2a14c29144dac9615322cadf25e466e6c6b6dfd96e2","cross_cats_sorted":["stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-24T03:59:39Z","title_canon_sha256":"7d7dda999ab63a1d8ba6c6e41c842c70ca103be8ea65df3aa38786690d6d0f0d"},"schema_version":"1.0","source":{"id":"1304.6478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6478","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6478v1","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6478","created_at":"2026-05-18T03:27:12Z"},{"alias_kind":"pith_short_12","alias_value":"45Z54YZG7GYL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"45Z54YZG7GYLRW4X","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"45Z54YZG","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:3c45c734e7abbc3ecb7044d9260d7e5b51f3aa45a51051711e13ac06afc2f556","target":"graph","created_at":"2026-05-18T03:27:12Z","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":"Many clustering algorithms exist that estimate a cluster centroid, such as K-means, K-medoids or mean-shift, but no algorithm seems to exist that clusters data by returning exactly K meaningful modes. We propose a natural definition of a K-modes objective function by combining the notions of density and cluster assignment. The algorithm becomes K-means and K-medoids in the limit of very large and very small scales. Computationally, it is slightly slower than K-means but much faster than mean-shift or K-medoids. Unlike K-means, it is able to find centroids that are valid patterns, truly represe","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Weiran Wang","cross_cats":["stat.ME","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-24T03:59:39Z","title":"The K-modes algorithm for clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6478","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:cb26169233b3ff88a7e7a7c1d37d9436f4abdc18752792bd26fabc2e96e7784c","target":"record","created_at":"2026-05-18T03:27:12Z","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":"6c0eb7fd595af85721a8d2a14c29144dac9615322cadf25e466e6c6b6dfd96e2","cross_cats_sorted":["stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-24T03:59:39Z","title_canon_sha256":"7d7dda999ab63a1d8ba6c6e41c842c70ca103be8ea65df3aa38786690d6d0f0d"},"schema_version":"1.0","source":{"id":"1304.6478","kind":"arxiv","version":1}},"canonical_sha256":"e773de6326f9b0b8db9721c816cbb11d464b5716fa44d971d706b8130d70b5e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e773de6326f9b0b8db9721c816cbb11d464b5716fa44d971d706b8130d70b5e1","first_computed_at":"2026-05-18T03:27:12.992053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:12.992053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GQW+Max3WC9wJqNKogvi/lA57HcWzMsnx3/dMTqI0LmNmoqY7JUXs2WXZyN7ysrflyYEcyNEgBbuaYhBSQ8CDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:12.992780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb26169233b3ff88a7e7a7c1d37d9436f4abdc18752792bd26fabc2e96e7784c","sha256:3c45c734e7abbc3ecb7044d9260d7e5b51f3aa45a51051711e13ac06afc2f556"],"state_sha256":"c8c921f88a3aa8ebeee5abd0ef1eb5e2c46e3fa56da86036a0ff4ab96ca4fb18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GS50viHQrGKU3aLPKNLxjmiGiiMkt6q5cXphgl5Qr+ISzop/Xlox4XBc59hPhuNZbMgEbix+GVo1LikSlZRKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:09:00.150211Z","bundle_sha256":"67074c80074cb21d5198b6c174ad76cef5e75df28f2c3cbbea78872eb53aaa33"}}