{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UHUVCFACPYXZDPRFJZ3GXDUST2","short_pith_number":"pith:UHUVCFAC","canonical_record":{"source":{"id":"1601.03767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T22:08:02Z","cross_cats_sorted":[],"title_canon_sha256":"a38413eaaa1c638f7aae0bcd484c9eb7c259080342e0094500edf431e5a3883c","abstract_canon_sha256":"ad24b5d0b8f276c58fb385df2d926ebbcdb1fdb8127634c163de3c57091c35ed"},"schema_version":"1.0"},"canonical_sha256":"a1e95114027e2f91be254e766b8e929e8cb6872624a0d9acc5f43be7e9d560c3","source":{"kind":"arxiv","id":"1601.03767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03767","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03767v1","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03767","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"UHUVCFACPYXZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHUVCFACPYXZDPRF","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHUVCFAC","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UHUVCFACPYXZDPRFJZ3GXDUST2","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T22:08:02Z","cross_cats_sorted":[],"title_canon_sha256":"a38413eaaa1c638f7aae0bcd484c9eb7c259080342e0094500edf431e5a3883c","abstract_canon_sha256":"ad24b5d0b8f276c58fb385df2d926ebbcdb1fdb8127634c163de3c57091c35ed"},"schema_version":"1.0"},"canonical_sha256":"a1e95114027e2f91be254e766b8e929e8cb6872624a0d9acc5f43be7e9d560c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:50.077550Z","signature_b64":"pHMAxnW5YwYvBBi6r7naIn+wTIMUTfUvhdhCbKqHB43c70vbANF8/9FMNq+IMf8UrcKPbcuG0DV0hbp8rTfNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1e95114027e2f91be254e766b8e929e8cb6872624a0d9acc5f43be7e9d560c3","last_reissued_at":"2026-05-18T01:22:50.077065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:50.077065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03767","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-18T01:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9P8X0INY27QfwSs5APV1w8w9ubMKoxn+Dx6WoLUSYobFvAijItNC3YM0ShLGQGx/iXjzjDLj5/e6dua4zr0NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:26.312828Z"},"content_sha256":"544b863d1d3d9bf1b08d00db7d1d73cd7c7070bcf07a6f45d5cbcda837d51eb0","schema_version":"1.0","event_id":"sha256:544b863d1d3d9bf1b08d00db7d1d73cd7c7070bcf07a6f45d5cbcda837d51eb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UHUVCFACPYXZDPRFJZ3GXDUST2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Camille Coti, Charles Lakos, Laure Petrucci","submitted_at":"2016-01-14T22:08:02Z","abstract_excerpt":"This paper presents the benefits of formal modelling and verification techniques for self-stabilising distributed algorithms. An algorithm is studied, that takes a set of processes connected by a tree topology and converts it to a ring configuration. The Coloured Petri net model not only facilitates the proof that the algorithm is correct and self-stabilising but also easily shows that it enjoys new properties of termination and silentness. Further, the formal results show how the algorithm can be simplified without loss of generality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03767","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-18T01:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8n5mooMtd1hjQ95PL6WCJEepJcJHgrWWA6gn5qIdmYJMRU9ShiFxBJkeZeJuSpLU1KvCxIp2eMr2SzLJUkWWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:26.313509Z"},"content_sha256":"6bb4a1b43c1a8c5b8fd8bf06a2520f225fcbdaa1a5f133ca3dcdb63866c8e15f","schema_version":"1.0","event_id":"sha256:6bb4a1b43c1a8c5b8fd8bf06a2520f225fcbdaa1a5f133ca3dcdb63866c8e15f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/bundle.json","state_url":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/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-26T17:39:26Z","links":{"resolver":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2","bundle":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/bundle.json","state":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UHUVCFACPYXZDPRFJZ3GXDUST2","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":"ad24b5d0b8f276c58fb385df2d926ebbcdb1fdb8127634c163de3c57091c35ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T22:08:02Z","title_canon_sha256":"a38413eaaa1c638f7aae0bcd484c9eb7c259080342e0094500edf431e5a3883c"},"schema_version":"1.0","source":{"id":"1601.03767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03767","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03767v1","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03767","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"UHUVCFACPYXZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHUVCFACPYXZDPRF","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHUVCFAC","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:6bb4a1b43c1a8c5b8fd8bf06a2520f225fcbdaa1a5f133ca3dcdb63866c8e15f","target":"graph","created_at":"2026-05-18T01:22:50Z","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":"This paper presents the benefits of formal modelling and verification techniques for self-stabilising distributed algorithms. An algorithm is studied, that takes a set of processes connected by a tree topology and converts it to a ring configuration. The Coloured Petri net model not only facilitates the proof that the algorithm is correct and self-stabilising but also easily shows that it enjoys new properties of termination and silentness. Further, the formal results show how the algorithm can be simplified without loss of generality.","authors_text":"Camille Coti, Charles Lakos, Laure Petrucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T22:08:02Z","title":"Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03767","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:544b863d1d3d9bf1b08d00db7d1d73cd7c7070bcf07a6f45d5cbcda837d51eb0","target":"record","created_at":"2026-05-18T01:22:50Z","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":"ad24b5d0b8f276c58fb385df2d926ebbcdb1fdb8127634c163de3c57091c35ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-14T22:08:02Z","title_canon_sha256":"a38413eaaa1c638f7aae0bcd484c9eb7c259080342e0094500edf431e5a3883c"},"schema_version":"1.0","source":{"id":"1601.03767","kind":"arxiv","version":1}},"canonical_sha256":"a1e95114027e2f91be254e766b8e929e8cb6872624a0d9acc5f43be7e9d560c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1e95114027e2f91be254e766b8e929e8cb6872624a0d9acc5f43be7e9d560c3","first_computed_at":"2026-05-18T01:22:50.077065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:50.077065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pHMAxnW5YwYvBBi6r7naIn+wTIMUTfUvhdhCbKqHB43c70vbANF8/9FMNq+IMf8UrcKPbcuG0DV0hbp8rTfNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:50.077550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:544b863d1d3d9bf1b08d00db7d1d73cd7c7070bcf07a6f45d5cbcda837d51eb0","sha256:6bb4a1b43c1a8c5b8fd8bf06a2520f225fcbdaa1a5f133ca3dcdb63866c8e15f"],"state_sha256":"b63187ce6f807fd80d8eae4d2cefd91d63f41d3acc81e84a3392125cbbad44e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wya7xPMDcJuaVXOL9JzvJA77Z/jX0nVSOuFljIKq49Wxs45Cvv8TK+QanKzM3OgIw88uekT1A8iREIDSvghUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:39:26.317141Z","bundle_sha256":"ffb6a1f6d6f896e8e4640aa3b92ec6098f2c8937004b6e0e6159e30d6bb4f676"}}