{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PNKUPQVWX5YMH4A4HDPJTTZEJY","short_pith_number":"pith:PNKUPQVW","canonical_record":{"source":{"id":"1601.03483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-22T08:46:39Z","cross_cats_sorted":[],"title_canon_sha256":"f8c612a226ece0ceeeeca15869eb4b5ebc646f8fc87975a6ca32199e79acf102","abstract_canon_sha256":"746305eb2215a4e48eab4f1bb634d017b5a0dbe9bd233cd7d3772f4b3a0c3e2d"},"schema_version":"1.0"},"canonical_sha256":"7b5547c2b6bf70c3f01c38de99cf244e2161841d41ebcb7e4ce7bd5e686e334b","source":{"kind":"arxiv","id":"1601.03483","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03483","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03483v1","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03483","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"PNKUPQVWX5YM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNKUPQVWX5YMH4A4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNKUPQVW","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PNKUPQVWX5YMH4A4HDPJTTZEJY","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-22T08:46:39Z","cross_cats_sorted":[],"title_canon_sha256":"f8c612a226ece0ceeeeca15869eb4b5ebc646f8fc87975a6ca32199e79acf102","abstract_canon_sha256":"746305eb2215a4e48eab4f1bb634d017b5a0dbe9bd233cd7d3772f4b3a0c3e2d"},"schema_version":"1.0"},"canonical_sha256":"7b5547c2b6bf70c3f01c38de99cf244e2161841d41ebcb7e4ce7bd5e686e334b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:53.339892Z","signature_b64":"VqWiwBKcSoEm51r2Dks6IcrGMG7UyJg1SF5cpAsQpYL4g1t7mnE8s4GIzN3pwkTcCkQtM+E8uGl1CuBcROCfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b5547c2b6bf70c3f01c38de99cf244e2161841d41ebcb7e4ce7bd5e686e334b","last_reissued_at":"2026-05-18T01:22:53.339243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:53.339243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03483","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:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFOukzn1K1a5xZtIkAUaqwGqnw+W8lW3CD3NHT1BV00xqByfDxQUSKCavBpRIM/fpu2ANgltK6azXKNmeVVAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:23:41.188702Z"},"content_sha256":"eafceef51911a95861fcdbf56bad37e3d4fe7ff752e1f8cbd4e0c5a9a847d915","schema_version":"1.0","event_id":"sha256:eafceef51911a95861fcdbf56bad37e3d4fe7ff752e1f8cbd4e0c5a9a847d915"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PNKUPQVWX5YMH4A4HDPJTTZEJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A survey on feature weighting based K-Means algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Renato Cordeiro de Amorim","submitted_at":"2015-09-22T08:46:39Z","abstract_excerpt":"In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting features in the data preprocessing phase. However, we maintain that even among relevant features there may be different degrees of relevance, and this should be taken into account during the clustering process. With over 50 years of history, K-Means is arguably the most popular partitional clustering algorithm there is. The first K-Means based clustering algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03483","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:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obrceqBjExK7P0k3tEdOFox/k106DqCw6DQyJCNTzAK7/ZxO7bJBJNcwUa5r3FASpUHxsb6pHxFFusDNnN/FDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:23:41.189132Z"},"content_sha256":"0b7bcb465f1950a775273b815d544e78d5920b7b4817509ff16b39effb942447","schema_version":"1.0","event_id":"sha256:0b7bcb465f1950a775273b815d544e78d5920b7b4817509ff16b39effb942447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNKUPQVWX5YMH4A4HDPJTTZEJY/bundle.json","state_url":"https://pith.science/pith/PNKUPQVWX5YMH4A4HDPJTTZEJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNKUPQVWX5YMH4A4HDPJTTZEJY/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-08T13:23:41Z","links":{"resolver":"https://pith.science/pith/PNKUPQVWX5YMH4A4HDPJTTZEJY","bundle":"https://pith.science/pith/PNKUPQVWX5YMH4A4HDPJTTZEJY/bundle.json","state":"https://pith.science/pith/PNKUPQVWX5YMH4A4HDPJTTZEJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNKUPQVWX5YMH4A4HDPJTTZEJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PNKUPQVWX5YMH4A4HDPJTTZEJY","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":"746305eb2215a4e48eab4f1bb634d017b5a0dbe9bd233cd7d3772f4b3a0c3e2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-22T08:46:39Z","title_canon_sha256":"f8c612a226ece0ceeeeca15869eb4b5ebc646f8fc87975a6ca32199e79acf102"},"schema_version":"1.0","source":{"id":"1601.03483","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03483","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03483v1","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03483","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"PNKUPQVWX5YM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNKUPQVWX5YMH4A4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNKUPQVW","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:0b7bcb465f1950a775273b815d544e78d5920b7b4817509ff16b39effb942447","target":"graph","created_at":"2026-05-18T01:22:53Z","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":"In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting features in the data preprocessing phase. However, we maintain that even among relevant features there may be different degrees of relevance, and this should be taken into account during the clustering process. With over 50 years of history, K-Means is arguably the most popular partitional clustering algorithm there is. The first K-Means based clustering algo","authors_text":"Renato Cordeiro de Amorim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-22T08:46:39Z","title":"A survey on feature weighting based K-Means algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03483","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:eafceef51911a95861fcdbf56bad37e3d4fe7ff752e1f8cbd4e0c5a9a847d915","target":"record","created_at":"2026-05-18T01:22:53Z","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":"746305eb2215a4e48eab4f1bb634d017b5a0dbe9bd233cd7d3772f4b3a0c3e2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-22T08:46:39Z","title_canon_sha256":"f8c612a226ece0ceeeeca15869eb4b5ebc646f8fc87975a6ca32199e79acf102"},"schema_version":"1.0","source":{"id":"1601.03483","kind":"arxiv","version":1}},"canonical_sha256":"7b5547c2b6bf70c3f01c38de99cf244e2161841d41ebcb7e4ce7bd5e686e334b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b5547c2b6bf70c3f01c38de99cf244e2161841d41ebcb7e4ce7bd5e686e334b","first_computed_at":"2026-05-18T01:22:53.339243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:53.339243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VqWiwBKcSoEm51r2Dks6IcrGMG7UyJg1SF5cpAsQpYL4g1t7mnE8s4GIzN3pwkTcCkQtM+E8uGl1CuBcROCfCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:53.339892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03483","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eafceef51911a95861fcdbf56bad37e3d4fe7ff752e1f8cbd4e0c5a9a847d915","sha256:0b7bcb465f1950a775273b815d544e78d5920b7b4817509ff16b39effb942447"],"state_sha256":"71d584012484af32d9284016fbc5e7f09de495f32951d7543caebe1f5d56c821"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnR7g4XKEUpn9dK8TPZeFVBpU2A5YUlDvxg00eso3xm7Jt+aKIeRxEA77hH2AksQyc7Lpv3RiE+QOfhCNDxbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:23:41.191357Z","bundle_sha256":"56908ed81cb93548aed78c33867043e7a5780bf65e18e4822dbb44fbf7bdf343"}}