{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:42EN3VU5P2QHBUYXLBZ44MCAFO","short_pith_number":"pith:42EN3VU5","schema_version":"1.0","canonical_sha256":"e688ddd69d7ea070d3175873ce30402bb632fb9fb6e97f06dacaaf50ecd62d28","source":{"kind":"arxiv","id":"1011.2953","version":1},"attestation_state":"computed","paper":{"title":"A Distributed Clustering Algorithm for Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alain Bui, Devan Sohier, Laurence Pilard, Thibault Bernard","submitted_at":"2010-11-12T15:35:10Z","abstract_excerpt":"We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concurrently. The algorithm uses circulating tokens that collect data and move according to a random walk traversal scheme. Their task consists in (i) creating a cluster with the nodes it discovers and (ii) managing the cluster expansion; all decisions affecting the cluster are taken only by a node that owns the token. The size of each cluster is maintained higher than $m$ nodes ($m$ is a parameter of the algorithm). The "},"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":"1011.2953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-12T15:35:10Z","cross_cats_sorted":[],"title_canon_sha256":"d744f017aa1899291b767a80cfc2004c028c2bef1b7ae4ef44afac3d3c9731af","abstract_canon_sha256":"f6497490ff875d650780338337d4f0c8e33525fc7342e3c023ad0c4d013c63a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:07.680528Z","signature_b64":"BmuTvmgmHB836GuUthKlaygm5Tc2tGCl2koz/GU8/F1rUPwJu6drJSJ/VzqipHcC2DdWyy/GTabptruzD1YgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e688ddd69d7ea070d3175873ce30402bb632fb9fb6e97f06dacaaf50ecd62d28","last_reissued_at":"2026-05-18T04:36:07.679823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:07.679823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Clustering Algorithm for Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alain Bui, Devan Sohier, Laurence Pilard, Thibault Bernard","submitted_at":"2010-11-12T15:35:10Z","abstract_excerpt":"We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concurrently. The algorithm uses circulating tokens that collect data and move according to a random walk traversal scheme. Their task consists in (i) creating a cluster with the nodes it discovers and (ii) managing the cluster expansion; all decisions affecting the cluster are taken only by a node that owns the token. The size of each cluster is maintained higher than $m$ nodes ($m$ is a parameter of the algorithm). The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2953","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.2953","created_at":"2026-05-18T04:36:07.679919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2953v1","created_at":"2026-05-18T04:36:07.679919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2953","created_at":"2026-05-18T04:36:07.679919+00:00"},{"alias_kind":"pith_short_12","alias_value":"42EN3VU5P2QH","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"42EN3VU5P2QHBUYX","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"42EN3VU5","created_at":"2026-05-18T12:26:03.138858+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/42EN3VU5P2QHBUYXLBZ44MCAFO","json":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO.json","graph_json":"https://pith.science/api/pith-number/42EN3VU5P2QHBUYXLBZ44MCAFO/graph.json","events_json":"https://pith.science/api/pith-number/42EN3VU5P2QHBUYXLBZ44MCAFO/events.json","paper":"https://pith.science/paper/42EN3VU5"},"agent_actions":{"view_html":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO","download_json":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO.json","view_paper":"https://pith.science/paper/42EN3VU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2953&json=true","fetch_graph":"https://pith.science/api/pith-number/42EN3VU5P2QHBUYXLBZ44MCAFO/graph.json","fetch_events":"https://pith.science/api/pith-number/42EN3VU5P2QHBUYXLBZ44MCAFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/action/storage_attestation","attest_author":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/action/author_attestation","sign_citation":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/action/citation_signature","submit_replication":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/action/replication_record"}},"created_at":"2026-05-18T04:36:07.679919+00:00","updated_at":"2026-05-18T04:36:07.679919+00:00"}