{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NHWGXHIK2MATL6P6IVEQVPF4IM","short_pith_number":"pith:NHWGXHIK","canonical_record":{"source":{"id":"1410.4373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-16T11:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"51df243b9663964d3030353511384e03f13cb9d7998fe8cac52038de4dc11738","abstract_canon_sha256":"17aa3e2c02bc08319aa9d98f5cbd62cafc469e40a308708917968900bc7d2ffe"},"schema_version":"1.0"},"canonical_sha256":"69ec6b9d0ad30135f9fe45490abcbc430b50c83c18b4e467a94986c3f70693a1","source":{"kind":"arxiv","id":"1410.4373","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4373","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4373v2","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4373","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"NHWGXHIK2MAT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NHWGXHIK2MATL6P6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NHWGXHIK","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NHWGXHIK2MATL6P6IVEQVPF4IM","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-16T11:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"51df243b9663964d3030353511384e03f13cb9d7998fe8cac52038de4dc11738","abstract_canon_sha256":"17aa3e2c02bc08319aa9d98f5cbd62cafc469e40a308708917968900bc7d2ffe"},"schema_version":"1.0"},"canonical_sha256":"69ec6b9d0ad30135f9fe45490abcbc430b50c83c18b4e467a94986c3f70693a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:15.510545Z","signature_b64":"TaxFNUNBKeFVLkSsYDG8NNCpN4179a2u18Cced+LX+y5FTfE8H3w1eWlWa9weVgqTaLiT7mdbDq6nKUilvpCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69ec6b9d0ad30135f9fe45490abcbc430b50c83c18b4e467a94986c3f70693a1","last_reissued_at":"2026-05-18T00:32:15.509832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:15.509832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4373","source_version":2,"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:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEQCmV47pUpbvuBryoBjhlYgAbT3pDLGiGhZM3mVO8yJQ4gsJi/Nr6uXGBqQDm2a62yxBapvQipGoj3gch7rDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:37:18.580751Z"},"content_sha256":"aef630a5dd29ab44f6078a808d84c25c231ff1006a3f3bd5a7f3420929d9093b","schema_version":"1.0","event_id":"sha256:aef630a5dd29ab44f6078a808d84c25c231ff1006a3f3bd5a7f3420929d9093b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NHWGXHIK2MATL6P6IVEQVPF4IM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maintaining a Distributed Spanning Forest in Highly Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Arnaud Casteigts, Colette Johnen, Matthieu Barjon, Serge Chaumette, Yessin M. Neggaz","submitted_at":"2014-10-16T11:17:29Z","abstract_excerpt":"Highly dynamic networks are characterized by frequent changes in the availability of communication links. These networks are often partitioned into several components, which split and merge unpredictably. We present a distributed algorithm that maintains a forest of (as few as possible) spanning trees in such a network, with no restriction on the rate of change. Our algorithm is inspired by high-level graph transformations, which we adapt here in a (synchronous) message passing model for dynamic networks. The resulting algorithm has the following properties: First, every decision is purely loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4373","kind":"arxiv","version":2},"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:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0cMMSlEi+FUUlaYA+uVQcK6l98UejcVbhSZp/etF3K+5trxpmjBWSpljQiiiToFATi3neN9giJJc0onSU4WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:37:18.581099Z"},"content_sha256":"93dc4f92bf0a9f17bf0a96c42583ca548158a4e6f2e6fb8f6b19f8d62e0e4b95","schema_version":"1.0","event_id":"sha256:93dc4f92bf0a9f17bf0a96c42583ca548158a4e6f2e6fb8f6b19f8d62e0e4b95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHWGXHIK2MATL6P6IVEQVPF4IM/bundle.json","state_url":"https://pith.science/pith/NHWGXHIK2MATL6P6IVEQVPF4IM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHWGXHIK2MATL6P6IVEQVPF4IM/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-06-25T20:37:18Z","links":{"resolver":"https://pith.science/pith/NHWGXHIK2MATL6P6IVEQVPF4IM","bundle":"https://pith.science/pith/NHWGXHIK2MATL6P6IVEQVPF4IM/bundle.json","state":"https://pith.science/pith/NHWGXHIK2MATL6P6IVEQVPF4IM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHWGXHIK2MATL6P6IVEQVPF4IM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NHWGXHIK2MATL6P6IVEQVPF4IM","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":"17aa3e2c02bc08319aa9d98f5cbd62cafc469e40a308708917968900bc7d2ffe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-16T11:17:29Z","title_canon_sha256":"51df243b9663964d3030353511384e03f13cb9d7998fe8cac52038de4dc11738"},"schema_version":"1.0","source":{"id":"1410.4373","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4373","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4373v2","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4373","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"NHWGXHIK2MAT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NHWGXHIK2MATL6P6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NHWGXHIK","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:93dc4f92bf0a9f17bf0a96c42583ca548158a4e6f2e6fb8f6b19f8d62e0e4b95","target":"graph","created_at":"2026-05-18T00:32:15Z","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":"Highly dynamic networks are characterized by frequent changes in the availability of communication links. These networks are often partitioned into several components, which split and merge unpredictably. We present a distributed algorithm that maintains a forest of (as few as possible) spanning trees in such a network, with no restriction on the rate of change. Our algorithm is inspired by high-level graph transformations, which we adapt here in a (synchronous) message passing model for dynamic networks. The resulting algorithm has the following properties: First, every decision is purely loc","authors_text":"Arnaud Casteigts, Colette Johnen, Matthieu Barjon, Serge Chaumette, Yessin M. Neggaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-16T11:17:29Z","title":"Maintaining a Distributed Spanning Forest in Highly Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4373","kind":"arxiv","version":2},"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:aef630a5dd29ab44f6078a808d84c25c231ff1006a3f3bd5a7f3420929d9093b","target":"record","created_at":"2026-05-18T00:32:15Z","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":"17aa3e2c02bc08319aa9d98f5cbd62cafc469e40a308708917968900bc7d2ffe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-16T11:17:29Z","title_canon_sha256":"51df243b9663964d3030353511384e03f13cb9d7998fe8cac52038de4dc11738"},"schema_version":"1.0","source":{"id":"1410.4373","kind":"arxiv","version":2}},"canonical_sha256":"69ec6b9d0ad30135f9fe45490abcbc430b50c83c18b4e467a94986c3f70693a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69ec6b9d0ad30135f9fe45490abcbc430b50c83c18b4e467a94986c3f70693a1","first_computed_at":"2026-05-18T00:32:15.509832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:15.509832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TaxFNUNBKeFVLkSsYDG8NNCpN4179a2u18Cced+LX+y5FTfE8H3w1eWlWa9weVgqTaLiT7mdbDq6nKUilvpCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:15.510545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4373","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aef630a5dd29ab44f6078a808d84c25c231ff1006a3f3bd5a7f3420929d9093b","sha256:93dc4f92bf0a9f17bf0a96c42583ca548158a4e6f2e6fb8f6b19f8d62e0e4b95"],"state_sha256":"9978627e5833128eb87bc2f14be387b811d75f75984ed6e6817ff6be0eb96f14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4htw+DJrc4tRQFoPiD3/0ZfQol4dRWfwkvIKs6b3KQt0QNcHIaHMJXebLNjX3Hkk30AHtadMpTX0sThRgOkNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:37:18.583077Z","bundle_sha256":"428de1d33202d23db2d87c519a5c5018c073f9bb0c3d4e5b606611b1a6bd114d"}}