{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DRUVR26JKKSLT2HZNPUIA232XS","short_pith_number":"pith:DRUVR26J","canonical_record":{"source":{"id":"0904.3087","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-04-20T18:50:09Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8502d4d8fb197852f0df43aa949810db80dd27fd3944ffa4e84c9b49308a9ac6","abstract_canon_sha256":"9d8324b9361b45785e33e33dd0e774bad98c45a43e89cd4f8fe129613b7830ee"},"schema_version":"1.0"},"canonical_sha256":"1c6958ebc952a4b9e8f96be8806b7abcbc30bf20ec367972b4f5aedd5f5cb5ad","source":{"kind":"arxiv","id":"0904.3087","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.3087","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"0904.3087v4","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3087","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"DRUVR26JKKSL","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DRUVR26JKKSLT2HZ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DRUVR26J","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DRUVR26JKKSLT2HZNPUIA232XS","target":"record","payload":{"canonical_record":{"source":{"id":"0904.3087","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-04-20T18:50:09Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8502d4d8fb197852f0df43aa949810db80dd27fd3944ffa4e84c9b49308a9ac6","abstract_canon_sha256":"9d8324b9361b45785e33e33dd0e774bad98c45a43e89cd4f8fe129613b7830ee"},"schema_version":"1.0"},"canonical_sha256":"1c6958ebc952a4b9e8f96be8806b7abcbc30bf20ec367972b4f5aedd5f5cb5ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:57.808989Z","signature_b64":"VfDOM+3QeybZJrZchwYHyy8/vyDb1EzrF9DqJ/Qv2MlzT5CtBnqH8cUSslqWePOqgM1oHYg8EgmPn1tMLj8qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6958ebc952a4b9e8f96be8806b7abcbc30bf20ec367972b4f5aedd5f5cb5ad","last_reissued_at":"2026-05-18T03:17:57.808189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:57.808189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.3087","source_version":4,"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:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vpp7gWwkM+ID85wExylNjUBIdUaS4LIEeUZOs8BBiSKddRCx0OB/mw2JBG13EuDsr/l19v2E+gxmFwy7Ome2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T09:34:19.245805Z"},"content_sha256":"e2cba920bc926908e0f80212685cc55f18b9ed21f9304746814d3b316bd8e249","schema_version":"1.0","event_id":"sha256:e2cba920bc926908e0f80212685cc55f18b9ed21f9304746814d3b316bd8e249"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DRUVR26JKKSLT2HZNPUIA232XS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Arnaud Casteigts (LaBRI), Fr\\'ed\\'eric Guinand (LITIS), Serge Chaumette (LaBRI), Yoann Pign\\'e (LITIS)","submitted_at":"2009-04-20T18:50:09Z","abstract_excerpt":"We address the problem of building and maintaining distributed spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no stable periods can be assumed. In these harsh environments, we strive to preserve some properties such as cycle-freeness or the existence of a root in each tree, in order to make it possible to keep using the trees uninterruptedly (to a possible extent). Our algorithm operates at a coarse-grain level, using atomic pairwise interactions in a way akin to recent population protocol models. The algorithm relies on a perpetu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3087","kind":"arxiv","version":4},"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:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1kxUr7Ae01xMGfOGySNCCDJZbET428qFG6+Qe5Z17RkxqqR1pRzik0yZ/BrO+l7TRLzeX/NwR6qtb4OpOBN9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T09:34:19.246152Z"},"content_sha256":"63d44a99341f59739d4e1e920bd66c91d15fca7c9e227f17b794d35c9f1df90b","schema_version":"1.0","event_id":"sha256:63d44a99341f59739d4e1e920bd66c91d15fca7c9e227f17b794d35c9f1df90b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRUVR26JKKSLT2HZNPUIA232XS/bundle.json","state_url":"https://pith.science/pith/DRUVR26JKKSLT2HZNPUIA232XS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRUVR26JKKSLT2HZNPUIA232XS/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-07-04T09:34:19Z","links":{"resolver":"https://pith.science/pith/DRUVR26JKKSLT2HZNPUIA232XS","bundle":"https://pith.science/pith/DRUVR26JKKSLT2HZNPUIA232XS/bundle.json","state":"https://pith.science/pith/DRUVR26JKKSLT2HZNPUIA232XS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRUVR26JKKSLT2HZNPUIA232XS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DRUVR26JKKSLT2HZNPUIA232XS","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":"9d8324b9361b45785e33e33dd0e774bad98c45a43e89cd4f8fe129613b7830ee","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-04-20T18:50:09Z","title_canon_sha256":"8502d4d8fb197852f0df43aa949810db80dd27fd3944ffa4e84c9b49308a9ac6"},"schema_version":"1.0","source":{"id":"0904.3087","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.3087","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"0904.3087v4","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3087","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"DRUVR26JKKSL","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DRUVR26JKKSLT2HZ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DRUVR26J","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:63d44a99341f59739d4e1e920bd66c91d15fca7c9e227f17b794d35c9f1df90b","target":"graph","created_at":"2026-05-18T03:17:57Z","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 address the problem of building and maintaining distributed spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no stable periods can be assumed. In these harsh environments, we strive to preserve some properties such as cycle-freeness or the existence of a root in each tree, in order to make it possible to keep using the trees uninterruptedly (to a possible extent). Our algorithm operates at a coarse-grain level, using atomic pairwise interactions in a way akin to recent population protocol models. The algorithm relies on a perpetu","authors_text":"Arnaud Casteigts (LaBRI), Fr\\'ed\\'eric Guinand (LITIS), Serge Chaumette (LaBRI), Yoann Pign\\'e (LITIS)","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-04-20T18:50:09Z","title":"Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3087","kind":"arxiv","version":4},"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:e2cba920bc926908e0f80212685cc55f18b9ed21f9304746814d3b316bd8e249","target":"record","created_at":"2026-05-18T03:17:57Z","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":"9d8324b9361b45785e33e33dd0e774bad98c45a43e89cd4f8fe129613b7830ee","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-04-20T18:50:09Z","title_canon_sha256":"8502d4d8fb197852f0df43aa949810db80dd27fd3944ffa4e84c9b49308a9ac6"},"schema_version":"1.0","source":{"id":"0904.3087","kind":"arxiv","version":4}},"canonical_sha256":"1c6958ebc952a4b9e8f96be8806b7abcbc30bf20ec367972b4f5aedd5f5cb5ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c6958ebc952a4b9e8f96be8806b7abcbc30bf20ec367972b4f5aedd5f5cb5ad","first_computed_at":"2026-05-18T03:17:57.808189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:57.808189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfDOM+3QeybZJrZchwYHyy8/vyDb1EzrF9DqJ/Qv2MlzT5CtBnqH8cUSslqWePOqgM1oHYg8EgmPn1tMLj8qCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:57.808989Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.3087","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2cba920bc926908e0f80212685cc55f18b9ed21f9304746814d3b316bd8e249","sha256:63d44a99341f59739d4e1e920bd66c91d15fca7c9e227f17b794d35c9f1df90b"],"state_sha256":"18f088c1e84c5f0677679c2911927f6eccc88bea2552162f1d26ec0ee4941e8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MdfqB/uc+ADffcEQC4U4BYNW8IdV/ApJ3YhSN0UZ8RfMuhR46pk+B+c7DZh+AvRpP+mqmDK5964MWpp7iei5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T09:34:19.248272Z","bundle_sha256":"cc9911aa592303102976ed710447bee9073fffddbed17630297aabff424bbc7f"}}