{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5F6RRTIEO4EQVPY2G3OKTUPOV5","short_pith_number":"pith:5F6RRTIE","schema_version":"1.0","canonical_sha256":"e97d18cd0477090abf1a36dca9d1eeaf7948f110c304d3a7b8026db48c133ed3","source":{"kind":"arxiv","id":"1312.4176","version":3},"attestation_state":"computed","paper":{"title":"Distributed k-means algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Christoforos N. Hadjicostis, Gabriele Oliva, Roberto Setola","submitted_at":"2013-12-15T18:08:27Z","abstract_excerpt":"In this paper we provide a fully distributed implementation of the k-means clustering algorithm, intended for wireless sensor networks where each agent is endowed with a possibly high-dimensional observation (e.g., position, humidity, temperature, etc.) The proposed algorithm, by means of one-hop communication, partitions the agents into measure-dependent groups that have small in-group and large out-group \"distances\". Since the partitions may not have a relation with the topology of the network--members of the same clusters may not be spatially close--the algorithm is provided with a mechanis"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.4176","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-15T18:08:27Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"72355eace9c38cee2682090b80b6ec2f16f1af61ac1590a429247b0893f5644f","abstract_canon_sha256":"32eca0efcd87b9c229f69b38987486c82da554d9c2edb33c3fdca0965a3cf7ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:10.481384Z","signature_b64":"AsBcJutLnmP//d0c9dSMyfU4K+43f6Q9r8DoWZXPiCJ5TDHVYZdlhEbURnoJo4RxclxYVdc2fIHWALviA52bDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e97d18cd0477090abf1a36dca9d1eeaf7948f110c304d3a7b8026db48c133ed3","last_reissued_at":"2026-05-18T02:38:10.480927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:10.480927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed k-means algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Christoforos N. Hadjicostis, Gabriele Oliva, Roberto Setola","submitted_at":"2013-12-15T18:08:27Z","abstract_excerpt":"In this paper we provide a fully distributed implementation of the k-means clustering algorithm, intended for wireless sensor networks where each agent is endowed with a possibly high-dimensional observation (e.g., position, humidity, temperature, etc.) The proposed algorithm, by means of one-hop communication, partitions the agents into measure-dependent groups that have small in-group and large out-group \"distances\". Since the partitions may not have a relation with the topology of the network--members of the same clusters may not be spatially close--the algorithm is provided with a mechanis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4176","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.4176","created_at":"2026-05-18T02:38:10.480993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4176v3","created_at":"2026-05-18T02:38:10.480993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4176","created_at":"2026-05-18T02:38:10.480993+00:00"},{"alias_kind":"pith_short_12","alias_value":"5F6RRTIEO4EQ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5F6RRTIEO4EQVPY2","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5F6RRTIE","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5","json":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5.json","graph_json":"https://pith.science/api/pith-number/5F6RRTIEO4EQVPY2G3OKTUPOV5/graph.json","events_json":"https://pith.science/api/pith-number/5F6RRTIEO4EQVPY2G3OKTUPOV5/events.json","paper":"https://pith.science/paper/5F6RRTIE"},"agent_actions":{"view_html":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5","download_json":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5.json","view_paper":"https://pith.science/paper/5F6RRTIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4176&json=true","fetch_graph":"https://pith.science/api/pith-number/5F6RRTIEO4EQVPY2G3OKTUPOV5/graph.json","fetch_events":"https://pith.science/api/pith-number/5F6RRTIEO4EQVPY2G3OKTUPOV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5/action/storage_attestation","attest_author":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5/action/author_attestation","sign_citation":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5/action/citation_signature","submit_replication":"https://pith.science/pith/5F6RRTIEO4EQVPY2G3OKTUPOV5/action/replication_record"}},"created_at":"2026-05-18T02:38:10.480993+00:00","updated_at":"2026-05-18T02:38:10.480993+00:00"}