{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZOBRO5QZ2S5K4T7BH6GU4YQZGZ","short_pith_number":"pith:ZOBRO5QZ","schema_version":"1.0","canonical_sha256":"cb83177619d4baae4fe13f8d4e62193672b1d619c8ca541885269b5e655c7e7a","source":{"kind":"arxiv","id":"1805.02401","version":1},"attestation_state":"computed","paper":{"title":"Acyclic Strategy for Silent Self-Stabilization in Spanning Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ana\\\"is Durand, Karine Altisen, St\\'ephane Devismes","submitted_at":"2018-05-07T08:40:45Z","abstract_excerpt":"In this paper, we formalize design patterns, commonly used in the self-stabilizing area, to obtain general statements regarding both correctness and time complexity guarantees. Precisely, we study a general class of algorithms designed for networks endowed with a sense of direction describing a spanning forest (e.g., a directed tree or a network where a directed spanning tree is available) whose characterization is a simple (i.e., quasi-syntactic) condition. We show that any algorithm of this class is (1) silent and self-stabilizing under the distributed unfair daemon, and (2) has a stabilizat"},"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":"1805.02401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-07T08:40:45Z","cross_cats_sorted":[],"title_canon_sha256":"5a53ab51b654864b9432ecfceb18229638ff6b7826c40a4a20fb9bbe1e225912","abstract_canon_sha256":"b0a89cb958e4b7c30e8414bd36eaf4b49a630f0ea1a096dbaeb275b18d05a1ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:40.041041Z","signature_b64":"4PiRUT/Ew5rzeGKsezuqZ5D1GAMxIC60edPLUR14Y0AH3TUzksUMDvMFOf2C69MbrinsElZFqkl9nsmXr+wDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb83177619d4baae4fe13f8d4e62193672b1d619c8ca541885269b5e655c7e7a","last_reissued_at":"2026-05-18T00:16:40.040603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:40.040603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acyclic Strategy for Silent Self-Stabilization in Spanning Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ana\\\"is Durand, Karine Altisen, St\\'ephane Devismes","submitted_at":"2018-05-07T08:40:45Z","abstract_excerpt":"In this paper, we formalize design patterns, commonly used in the self-stabilizing area, to obtain general statements regarding both correctness and time complexity guarantees. Precisely, we study a general class of algorithms designed for networks endowed with a sense of direction describing a spanning forest (e.g., a directed tree or a network where a directed spanning tree is available) whose characterization is a simple (i.e., quasi-syntactic) condition. We show that any algorithm of this class is (1) silent and self-stabilizing under the distributed unfair daemon, and (2) has a stabilizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02401","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":"1805.02401","created_at":"2026-05-18T00:16:40.040669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02401v1","created_at":"2026-05-18T00:16:40.040669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02401","created_at":"2026-05-18T00:16:40.040669+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOBRO5QZ2S5K","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOBRO5QZ2S5K4T7B","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOBRO5QZ","created_at":"2026-05-18T12:33:07.085635+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/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ","json":"https://pith.science/pith/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ.json","graph_json":"https://pith.science/api/pith-number/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/graph.json","events_json":"https://pith.science/api/pith-number/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/events.json","paper":"https://pith.science/paper/ZOBRO5QZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ","download_json":"https://pith.science/pith/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ.json","view_paper":"https://pith.science/paper/ZOBRO5QZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02401&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZOBRO5QZ2S5K4T7BH6GU4YQZGZ/action/replication_record"}},"created_at":"2026-05-18T00:16:40.040669+00:00","updated_at":"2026-05-18T00:16:40.040669+00:00"}