{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:42EN3VU5P2QHBUYXLBZ44MCAFO","short_pith_number":"pith:42EN3VU5","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"},"canonical_sha256":"e688ddd69d7ea070d3175873ce30402bb632fb9fb6e97f06dacaaf50ecd62d28","source":{"kind":"arxiv","id":"1011.2953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2953","created_at":"2026-05-18T04:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2953v1","created_at":"2026-05-18T04:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2953","created_at":"2026-05-18T04:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"42EN3VU5P2QH","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"42EN3VU5P2QHBUYX","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"42EN3VU5","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:42EN3VU5P2QHBUYXLBZ44MCAFO","target":"record","payload":{"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"},"canonical_sha256":"e688ddd69d7ea070d3175873ce30402bb632fb9fb6e97f06dacaaf50ecd62d28","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"},"source_kind":"arxiv","source_id":"1011.2953","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-18T04:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nxnzi7dkVAIGOGo4Ey6bNsxgexG8UlPsmYE1RU1IAfCCjOvhRMHFlnlFT/s8r2G8eMNbCwnpABloHSQxQReJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:05:53.137503Z"},"content_sha256":"68bd60f04c49b508e0d9564ee90a73c78275826150c8ce5f72212b7917dbbf03","schema_version":"1.0","event_id":"sha256:68bd60f04c49b508e0d9564ee90a73c78275826150c8ce5f72212b7917dbbf03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:42EN3VU5P2QHBUYXLBZ44MCAFO","target":"graph","payload":{"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"},"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-18T04:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFrITCvdyO8VV1/EAFg3SxosoWEMbCPbEDH1UwZsOp1u4iJSRIt6fOhhvuWvUBbFrIA8rdzxIu8zqMFlE5GHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:05:53.138014Z"},"content_sha256":"e8328efbf164e5d089bd09b9b9c06c9215c1516f90849be2ec31ed5530ba4d63","schema_version":"1.0","event_id":"sha256:e8328efbf164e5d089bd09b9b9c06c9215c1516f90849be2ec31ed5530ba4d63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/bundle.json","state_url":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/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-28T09:05:53Z","links":{"resolver":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO","bundle":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/bundle.json","state":"https://pith.science/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42EN3VU5P2QHBUYXLBZ44MCAFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:42EN3VU5P2QHBUYXLBZ44MCAFO","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":"f6497490ff875d650780338337d4f0c8e33525fc7342e3c023ad0c4d013c63a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-12T15:35:10Z","title_canon_sha256":"d744f017aa1899291b767a80cfc2004c028c2bef1b7ae4ef44afac3d3c9731af"},"schema_version":"1.0","source":{"id":"1011.2953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2953","created_at":"2026-05-18T04:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2953v1","created_at":"2026-05-18T04:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2953","created_at":"2026-05-18T04:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"42EN3VU5P2QH","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"42EN3VU5P2QHBUYX","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"42EN3VU5","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:e8328efbf164e5d089bd09b9b9c06c9215c1516f90849be2ec31ed5530ba4d63","target":"graph","created_at":"2026-05-18T04:36:07Z","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":"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 ","authors_text":"Alain Bui, Devan Sohier, Laurence Pilard, Thibault Bernard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-12T15:35:10Z","title":"A Distributed Clustering Algorithm for Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2953","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:68bd60f04c49b508e0d9564ee90a73c78275826150c8ce5f72212b7917dbbf03","target":"record","created_at":"2026-05-18T04:36:07Z","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":"f6497490ff875d650780338337d4f0c8e33525fc7342e3c023ad0c4d013c63a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-12T15:35:10Z","title_canon_sha256":"d744f017aa1899291b767a80cfc2004c028c2bef1b7ae4ef44afac3d3c9731af"},"schema_version":"1.0","source":{"id":"1011.2953","kind":"arxiv","version":1}},"canonical_sha256":"e688ddd69d7ea070d3175873ce30402bb632fb9fb6e97f06dacaaf50ecd62d28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e688ddd69d7ea070d3175873ce30402bb632fb9fb6e97f06dacaaf50ecd62d28","first_computed_at":"2026-05-18T04:36:07.679823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:07.679823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BmuTvmgmHB836GuUthKlaygm5Tc2tGCl2koz/GU8/F1rUPwJu6drJSJ/VzqipHcC2DdWyy/GTabptruzD1YgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:07.680528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68bd60f04c49b508e0d9564ee90a73c78275826150c8ce5f72212b7917dbbf03","sha256:e8328efbf164e5d089bd09b9b9c06c9215c1516f90849be2ec31ed5530ba4d63"],"state_sha256":"37537438556e03b798a46f9b1f92105fdbe699db0a3985226585a4960b0b6ead"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QloWGDXleKEft/tC0SAFbkjRPKNLjwLwtImYnpmhiKePDCvMahzDB4ywIhqAtmq+VeiFCQAZAQFO6wNjkptZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:05:53.141050Z","bundle_sha256":"8bb520c7bae7681c75a0e5e15622579a9f58d5a42d6669cbd05f6efa85ec284b"}}