{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6VO2GL234JIKBXQ7LTV53NE5SV","short_pith_number":"pith:6VO2GL23","canonical_record":{"source":{"id":"1807.04566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-12T12:20:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"daf653e02ce29221512152dccfbc1246b9334f6feaffc6cce3ff5db8e2eee6c0","abstract_canon_sha256":"9761051e3a54f499142dca6b31a399421f2716aff673faf27035fc2d688ab47f"},"schema_version":"1.0"},"canonical_sha256":"f55da32f5be250a0de1f5cebddb49d9546c4142d4d662b6c14a5c479efebbd0e","source":{"kind":"arxiv","id":"1807.04566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04566","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04566v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04566","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"6VO2GL234JIK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6VO2GL234JIKBXQ7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6VO2GL23","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6VO2GL234JIKBXQ7LTV53NE5SV","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-12T12:20:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"daf653e02ce29221512152dccfbc1246b9334f6feaffc6cce3ff5db8e2eee6c0","abstract_canon_sha256":"9761051e3a54f499142dca6b31a399421f2716aff673faf27035fc2d688ab47f"},"schema_version":"1.0"},"canonical_sha256":"f55da32f5be250a0de1f5cebddb49d9546c4142d4d662b6c14a5c479efebbd0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:53.092409Z","signature_b64":"jOVXRZzJvnJJsbktNqWd41Uj0Z5UFaAKVSmBAm20OwmYSVtepwarLIycLsuZXA54BLlQPjDnCQ9L/cJ5avYPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f55da32f5be250a0de1f5cebddb49d9546c4142d4d662b6c14a5c479efebbd0e","last_reissued_at":"2026-05-18T00:10:53.091855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:53.091855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04566","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-18T00:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHM9uuaYVcSZOYdmkSgHTEIWsk8DDbhw/eaO1pzORmKW3r97w26bDC0RgzVG/MYNizSXJHRikckZAau0NjS3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:54:00.857608Z"},"content_sha256":"8e28dae9a7d325b2d59eebe5f0791bd0edd13f3f13512301d25d15ac0beddacd","schema_version":"1.0","event_id":"sha256:8e28dae9a7d325b2d59eebe5f0791bd0edd13f3f13512301d25d15ac0beddacd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6VO2GL234JIKBXQ7LTV53NE5SV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Clustering on Compressed Data without Prior Knowledge of the Number of Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Dominique Pastor, Elsa Dupraz, Fran\\c{c}ois-Xavier Socheleau","submitted_at":"2018-07-12T12:20:05Z","abstract_excerpt":"In sensor networks, it is not always practical to set up a fusion center. Therefore, there is need for fully decentralized clustering algorithms. Decentralized clustering algorithms should minimize the amount of data exchanged between sensors in order to reduce sensor energy consumption. In this respect, we propose one centralized and one decentralized clustering algorithm that work on compressed data without prior knowledge of the number of clusters. In the standard K-means clustering algorithm, the number of clusters is estimated by repeating the algorithm several times, which dramatically i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04566","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-18T00:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ScDx3b/wMS7MimV1PYFi2labbmUlVISrfwnnrGIk2pGPq35VZ+h87XU8mcEX1N0St36JQzsxEKyPjQHcUQktAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:54:00.858022Z"},"content_sha256":"5c85ceb23e7920ba0f2d8fe334e8425b7d4e1dd0aa920f1552e6c08d015c55ce","schema_version":"1.0","event_id":"sha256:5c85ceb23e7920ba0f2d8fe334e8425b7d4e1dd0aa920f1552e6c08d015c55ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VO2GL234JIKBXQ7LTV53NE5SV/bundle.json","state_url":"https://pith.science/pith/6VO2GL234JIKBXQ7LTV53NE5SV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VO2GL234JIKBXQ7LTV53NE5SV/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-05-24T03:54:00Z","links":{"resolver":"https://pith.science/pith/6VO2GL234JIKBXQ7LTV53NE5SV","bundle":"https://pith.science/pith/6VO2GL234JIKBXQ7LTV53NE5SV/bundle.json","state":"https://pith.science/pith/6VO2GL234JIKBXQ7LTV53NE5SV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VO2GL234JIKBXQ7LTV53NE5SV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6VO2GL234JIKBXQ7LTV53NE5SV","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":"9761051e3a54f499142dca6b31a399421f2716aff673faf27035fc2d688ab47f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-12T12:20:05Z","title_canon_sha256":"daf653e02ce29221512152dccfbc1246b9334f6feaffc6cce3ff5db8e2eee6c0"},"schema_version":"1.0","source":{"id":"1807.04566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04566","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04566v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04566","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"6VO2GL234JIK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6VO2GL234JIKBXQ7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6VO2GL23","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:5c85ceb23e7920ba0f2d8fe334e8425b7d4e1dd0aa920f1552e6c08d015c55ce","target":"graph","created_at":"2026-05-18T00:10: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 sensor networks, it is not always practical to set up a fusion center. Therefore, there is need for fully decentralized clustering algorithms. Decentralized clustering algorithms should minimize the amount of data exchanged between sensors in order to reduce sensor energy consumption. In this respect, we propose one centralized and one decentralized clustering algorithm that work on compressed data without prior knowledge of the number of clusters. In the standard K-means clustering algorithm, the number of clusters is estimated by repeating the algorithm several times, which dramatically i","authors_text":"Dominique Pastor, Elsa Dupraz, Fran\\c{c}ois-Xavier Socheleau","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-12T12:20:05Z","title":"Decentralized Clustering on Compressed Data without Prior Knowledge of the Number of Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04566","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:8e28dae9a7d325b2d59eebe5f0791bd0edd13f3f13512301d25d15ac0beddacd","target":"record","created_at":"2026-05-18T00:10: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":"9761051e3a54f499142dca6b31a399421f2716aff673faf27035fc2d688ab47f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-12T12:20:05Z","title_canon_sha256":"daf653e02ce29221512152dccfbc1246b9334f6feaffc6cce3ff5db8e2eee6c0"},"schema_version":"1.0","source":{"id":"1807.04566","kind":"arxiv","version":1}},"canonical_sha256":"f55da32f5be250a0de1f5cebddb49d9546c4142d4d662b6c14a5c479efebbd0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f55da32f5be250a0de1f5cebddb49d9546c4142d4d662b6c14a5c479efebbd0e","first_computed_at":"2026-05-18T00:10:53.091855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:53.091855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jOVXRZzJvnJJsbktNqWd41Uj0Z5UFaAKVSmBAm20OwmYSVtepwarLIycLsuZXA54BLlQPjDnCQ9L/cJ5avYPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:53.092409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e28dae9a7d325b2d59eebe5f0791bd0edd13f3f13512301d25d15ac0beddacd","sha256:5c85ceb23e7920ba0f2d8fe334e8425b7d4e1dd0aa920f1552e6c08d015c55ce"],"state_sha256":"4583a76922443c520f1a6ecf0c96963cda40e7ef534d4ead188e3653da786109"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsLWN3Mw2gsa7RYfXlcQ8KeO9fO+kr1xe10ugXdtMNAAVP1Qq3cp2+NicWDbaPN2RL0+rab8aYM09FhyHdFYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T03:54:00.860579Z","bundle_sha256":"8c73b46b8c0e1645cb2b4dea98847ee1078bcecca54810ef8aad0440b777fa8e"}}