{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EMSZGRH62CU3WTZPETS7PF6THN","short_pith_number":"pith:EMSZGRH6","canonical_record":{"source":{"id":"1304.0725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T05:28:06Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"2e3813ac193469628994024fc4cb938c6ccbbad902c27c813e9492fc2237af4f","abstract_canon_sha256":"76be9b3f794eb0c5b9ed5df4c0c77833c31d6223090f38f4843d985e3c459379"},"schema_version":"1.0"},"canonical_sha256":"23259344fed0a9bb4f2f24e5f797d33b4a77200c2919e4f169c5cc05a003b336","source":{"kind":"arxiv","id":"1304.0725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0725","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0725v1","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0725","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"EMSZGRH62CU3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EMSZGRH62CU3WTZP","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EMSZGRH6","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EMSZGRH62CU3WTZPETS7PF6THN","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T05:28:06Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"2e3813ac193469628994024fc4cb938c6ccbbad902c27c813e9492fc2237af4f","abstract_canon_sha256":"76be9b3f794eb0c5b9ed5df4c0c77833c31d6223090f38f4843d985e3c459379"},"schema_version":"1.0"},"canonical_sha256":"23259344fed0a9bb4f2f24e5f797d33b4a77200c2919e4f169c5cc05a003b336","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:14.489831Z","signature_b64":"h9xrUBDIWWEm6nC+O4uoYOyDQjEUuZnGlnfO300fomQJyPOzGCelBthDBvhmwc3/F5D4oKUTX20q/QdW5nD/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23259344fed0a9bb4f2f24e5f797d33b4a77200c2919e4f169c5cc05a003b336","last_reissued_at":"2026-05-18T03:29:14.489191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:14.489191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0725","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:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jq2IFY/YR7neB+MmvUgfoi80IfKpWphyaBhY6DDPMC9w8WSduIY6u3shHFkfFHH0wy/A/Wk+yCz6oiV0JlimCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:31:22.818015Z"},"content_sha256":"8587b203bda8b06fa55fe7718824be271c4b0531a7c8b378bdcbcaae438bc691","schema_version":"1.0","event_id":"sha256:8587b203bda8b06fa55fe7718824be271c4b0531a7c8b378bdcbcaae438bc691"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EMSZGRH62CU3WTZPETS7PF6THN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Performance of Unsupervised Method by Renovated K-Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"E. Elayaraja, G.M Kadhar Nawaz, P. Ashok, V. Vadivel","submitted_at":"2013-03-11T05:28:06Z","abstract_excerpt":"Clustering is a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for clustering methods. The proposed K-Means algorithm is compared with K-Means, Static Weighted K-Means (SWK-Means) and Dynamic Weighted K-Means (DWK-Means) algorithm by using Davis Bouldin index, Execution Time and Iteration count methods. Experimental results show that the proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0725","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:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSL38F3QVxpR0QR/OpgzyRJasI/4qbHhb8zyX/Ul7s6FkuwQtEcqhIS+0TNuzzd0wj80gA01gQswIuCYfsRaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:31:22.818703Z"},"content_sha256":"237ce8791027c6ec20ec04d54c348183716281371daaed1e22583098dab2f9ab","schema_version":"1.0","event_id":"sha256:237ce8791027c6ec20ec04d54c348183716281371daaed1e22583098dab2f9ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMSZGRH62CU3WTZPETS7PF6THN/bundle.json","state_url":"https://pith.science/pith/EMSZGRH62CU3WTZPETS7PF6THN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMSZGRH62CU3WTZPETS7PF6THN/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-09T02:31:22Z","links":{"resolver":"https://pith.science/pith/EMSZGRH62CU3WTZPETS7PF6THN","bundle":"https://pith.science/pith/EMSZGRH62CU3WTZPETS7PF6THN/bundle.json","state":"https://pith.science/pith/EMSZGRH62CU3WTZPETS7PF6THN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMSZGRH62CU3WTZPETS7PF6THN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EMSZGRH62CU3WTZPETS7PF6THN","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":"76be9b3f794eb0c5b9ed5df4c0c77833c31d6223090f38f4843d985e3c459379","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T05:28:06Z","title_canon_sha256":"2e3813ac193469628994024fc4cb938c6ccbbad902c27c813e9492fc2237af4f"},"schema_version":"1.0","source":{"id":"1304.0725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0725","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0725v1","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0725","created_at":"2026-05-18T03:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"EMSZGRH62CU3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EMSZGRH62CU3WTZP","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EMSZGRH6","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:237ce8791027c6ec20ec04d54c348183716281371daaed1e22583098dab2f9ab","target":"graph","created_at":"2026-05-18T03:29:14Z","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 a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for clustering methods. The proposed K-Means algorithm is compared with K-Means, Static Weighted K-Means (SWK-Means) and Dynamic Weighted K-Means (DWK-Means) algorithm by using Davis Bouldin index, Execution Time and Iteration count methods. Experimental results show that the proposed","authors_text":"E. Elayaraja, G.M Kadhar Nawaz, P. Ashok, V. Vadivel","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T05:28:06Z","title":"Improved Performance of Unsupervised Method by Renovated K-Means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0725","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:8587b203bda8b06fa55fe7718824be271c4b0531a7c8b378bdcbcaae438bc691","target":"record","created_at":"2026-05-18T03:29:14Z","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":"76be9b3f794eb0c5b9ed5df4c0c77833c31d6223090f38f4843d985e3c459379","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T05:28:06Z","title_canon_sha256":"2e3813ac193469628994024fc4cb938c6ccbbad902c27c813e9492fc2237af4f"},"schema_version":"1.0","source":{"id":"1304.0725","kind":"arxiv","version":1}},"canonical_sha256":"23259344fed0a9bb4f2f24e5f797d33b4a77200c2919e4f169c5cc05a003b336","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23259344fed0a9bb4f2f24e5f797d33b4a77200c2919e4f169c5cc05a003b336","first_computed_at":"2026-05-18T03:29:14.489191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:14.489191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h9xrUBDIWWEm6nC+O4uoYOyDQjEUuZnGlnfO300fomQJyPOzGCelBthDBvhmwc3/F5D4oKUTX20q/QdW5nD/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:14.489831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8587b203bda8b06fa55fe7718824be271c4b0531a7c8b378bdcbcaae438bc691","sha256:237ce8791027c6ec20ec04d54c348183716281371daaed1e22583098dab2f9ab"],"state_sha256":"b76e9731614c7e28ca98134d176d321628f91edb71a3778530804d5b187f725d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Si/Z7f8RUxGsIzsJdXfAh3wRimLoifwp2F1NqQJEnME6mnE9Rmn92UtvP+Jl3e5tJuDu+focsUOMRWwsshziBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:31:22.822804Z","bundle_sha256":"7a97a8659746b0981e50c8f42c7f6a92bd0c0edc01463d955572b169911ce49d"}}