{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UHUVCFACPYXZDPRFJZ3GXDUST2","short_pith_number":"pith:UHUVCFAC","schema_version":"1.0","canonical_sha256":"a1e95114027e2f91be254e766b8e929e8cb6872624a0d9acc5f43be7e9d560c3","source":{"kind":"arxiv","id":"1601.03767","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.03767","created_at":"2026-05-18T01:22:50.077133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03767v1","created_at":"2026-05-18T01:22:50.077133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03767","created_at":"2026-05-18T01:22:50.077133+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHUVCFACPYXZ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHUVCFACPYXZDPRF","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHUVCFAC","created_at":"2026-05-18T12:30:46.583412+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/UHUVCFACPYXZDPRFJZ3GXDUST2","json":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2.json","graph_json":"https://pith.science/api/pith-number/UHUVCFACPYXZDPRFJZ3GXDUST2/graph.json","events_json":"https://pith.science/api/pith-number/UHUVCFACPYXZDPRFJZ3GXDUST2/events.json","paper":"https://pith.science/paper/UHUVCFAC"},"agent_actions":{"view_html":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2","download_json":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2.json","view_paper":"https://pith.science/paper/UHUVCFAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03767&json=true","fetch_graph":"https://pith.science/api/pith-number/UHUVCFACPYXZDPRFJZ3GXDUST2/graph.json","fetch_events":"https://pith.science/api/pith-number/UHUVCFACPYXZDPRFJZ3GXDUST2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/action/storage_attestation","attest_author":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/action/author_attestation","sign_citation":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/action/citation_signature","submit_replication":"https://pith.science/pith/UHUVCFACPYXZDPRFJZ3GXDUST2/action/replication_record"}},"created_at":"2026-05-18T01:22:50.077133+00:00","updated_at":"2026-05-18T01:22:50.077133+00:00"}