{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SJRDPDBMY4TM2Q7M2EMKS22YBZ","short_pith_number":"pith:SJRDPDBM","canonical_record":{"source":{"id":"1706.02949","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T10:06:25Z","cross_cats_sorted":[],"title_canon_sha256":"8b890cc9c4db00b8b5788a78f1615bb0f3baa45b3e3fc15fffbbe12a952a318f","abstract_canon_sha256":"5b213452c8cbcca274f10e868a3da723958aa3a9a28a5e4929b1db79aa2312b8"},"schema_version":"1.0"},"canonical_sha256":"9262378c2cc726cd43ecd118a96b580e778d25ac3272854631896a04f645ee80","source":{"kind":"arxiv","id":"1706.02949","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02949","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02949v2","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02949","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"SJRDPDBMY4TM","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SJRDPDBMY4TM2Q7M","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SJRDPDBM","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SJRDPDBMY4TM2Q7M2EMKS22YBZ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02949","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T10:06:25Z","cross_cats_sorted":[],"title_canon_sha256":"8b890cc9c4db00b8b5788a78f1615bb0f3baa45b3e3fc15fffbbe12a952a318f","abstract_canon_sha256":"5b213452c8cbcca274f10e868a3da723958aa3a9a28a5e4929b1db79aa2312b8"},"schema_version":"1.0"},"canonical_sha256":"9262378c2cc726cd43ecd118a96b580e778d25ac3272854631896a04f645ee80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:52.812884Z","signature_b64":"HtlbRqNpLYv8JQfZ/qlOawuk5Rn8nKDpR9j195xw0/3pPk0Gr1YZ+wN9pBKK/r6Lg3EoXFQDGDgjtTjnEPmfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9262378c2cc726cd43ecd118a96b580e778d25ac3272854631896a04f645ee80","last_reissued_at":"2026-05-18T00:41:52.812448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:52.812448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02949","source_version":2,"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-18T00:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GzVBwDz5dNZ9KUJl+8rC/kqsE/RERH5oFCqND+G/MCs4is/cFoDry5mBDMSPu9mOsaGFp2TknnhX8LPDkNMFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:01:30.168760Z"},"content_sha256":"d586d4e0d04e71903b5a6f833ef3b3cbdc801a0d314d62d78b4e765b9546ebaa","schema_version":"1.0","event_id":"sha256:d586d4e0d04e71903b5a6f833ef3b3cbdc801a0d314d62d78b4e765b9546ebaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SJRDPDBMY4TM2Q7M2EMKS22YBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"K+ Means : An Enhancement Over K-Means Clustering Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abhoy Chand Mondal, Kumar Sankar Ray, Srikanta Kolay","submitted_at":"2017-06-08T10:06:25Z","abstract_excerpt":"K-means (MacQueen, 1967) [1] is one of the simplest unsupervised learning algorithms that solve the well-known clustering problem. The procedure follows a simple and easy way to classify a given data set to a predefined, say K number of clusters. Determination of K is a difficult job and it is not known that which value of K can partition the objects as per our intuition. To overcome this problem we proposed K+ Means algorithm. This algorithm is an enhancement over K-Means algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02949","kind":"arxiv","version":2},"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-18T00:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sevB4qyJ67DrbABnNNa6WYpqACjgvOCJwXiennirnTX/cSZ3C6w6SSecPDOZ7jXcanlbRBr2RLUnnT91lol8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:01:30.169388Z"},"content_sha256":"6ddfeb48110bc502022a2befb474c23b63cb2f33de8ca501a25738fb904651a0","schema_version":"1.0","event_id":"sha256:6ddfeb48110bc502022a2befb474c23b63cb2f33de8ca501a25738fb904651a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJRDPDBMY4TM2Q7M2EMKS22YBZ/bundle.json","state_url":"https://pith.science/pith/SJRDPDBMY4TM2Q7M2EMKS22YBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJRDPDBMY4TM2Q7M2EMKS22YBZ/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-06T16:01:30Z","links":{"resolver":"https://pith.science/pith/SJRDPDBMY4TM2Q7M2EMKS22YBZ","bundle":"https://pith.science/pith/SJRDPDBMY4TM2Q7M2EMKS22YBZ/bundle.json","state":"https://pith.science/pith/SJRDPDBMY4TM2Q7M2EMKS22YBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJRDPDBMY4TM2Q7M2EMKS22YBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SJRDPDBMY4TM2Q7M2EMKS22YBZ","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":"5b213452c8cbcca274f10e868a3da723958aa3a9a28a5e4929b1db79aa2312b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T10:06:25Z","title_canon_sha256":"8b890cc9c4db00b8b5788a78f1615bb0f3baa45b3e3fc15fffbbe12a952a318f"},"schema_version":"1.0","source":{"id":"1706.02949","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02949","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02949v2","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02949","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"SJRDPDBMY4TM","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SJRDPDBMY4TM2Q7M","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SJRDPDBM","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:6ddfeb48110bc502022a2befb474c23b63cb2f33de8ca501a25738fb904651a0","target":"graph","created_at":"2026-05-18T00:41:52Z","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":"K-means (MacQueen, 1967) [1] is one of the simplest unsupervised learning algorithms that solve the well-known clustering problem. The procedure follows a simple and easy way to classify a given data set to a predefined, say K number of clusters. Determination of K is a difficult job and it is not known that which value of K can partition the objects as per our intuition. To overcome this problem we proposed K+ Means algorithm. This algorithm is an enhancement over K-Means algorithm.","authors_text":"Abhoy Chand Mondal, Kumar Sankar Ray, Srikanta Kolay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T10:06:25Z","title":"K+ Means : An Enhancement Over K-Means Clustering Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02949","kind":"arxiv","version":2},"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:d586d4e0d04e71903b5a6f833ef3b3cbdc801a0d314d62d78b4e765b9546ebaa","target":"record","created_at":"2026-05-18T00:41:52Z","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":"5b213452c8cbcca274f10e868a3da723958aa3a9a28a5e4929b1db79aa2312b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T10:06:25Z","title_canon_sha256":"8b890cc9c4db00b8b5788a78f1615bb0f3baa45b3e3fc15fffbbe12a952a318f"},"schema_version":"1.0","source":{"id":"1706.02949","kind":"arxiv","version":2}},"canonical_sha256":"9262378c2cc726cd43ecd118a96b580e778d25ac3272854631896a04f645ee80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9262378c2cc726cd43ecd118a96b580e778d25ac3272854631896a04f645ee80","first_computed_at":"2026-05-18T00:41:52.812448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:52.812448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HtlbRqNpLYv8JQfZ/qlOawuk5Rn8nKDpR9j195xw0/3pPk0Gr1YZ+wN9pBKK/r6Lg3EoXFQDGDgjtTjnEPmfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:52.812884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02949","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d586d4e0d04e71903b5a6f833ef3b3cbdc801a0d314d62d78b4e765b9546ebaa","sha256:6ddfeb48110bc502022a2befb474c23b63cb2f33de8ca501a25738fb904651a0"],"state_sha256":"1433a12f7d7d696beb7eb6bcc613302720a57f6d128e8e949f28b208679e99ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2iAiNlHO/SS9m35XcJj+jf4dg6HtlQU0cjSXixIU301SKSTBGpwzpL+15M7pb+MHISeIW8xLuQ0fEUULMKGUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:01:30.172502Z","bundle_sha256":"90e48724a321084d101a7e09bf803f0c2db2fd9854f972d8d9b72489ea7e7d3a"}}