{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GKQHRGYI3LFQ53OSG2A2D6MR53","short_pith_number":"pith:GKQHRGYI","schema_version":"1.0","canonical_sha256":"32a0789b08dacb0eedd23681a1f991eed2dbcb3fc02bf3778f84e14fd7e13e2d","source":{"kind":"arxiv","id":"1410.6669","version":1},"attestation_state":"computed","paper":{"title":"Analyzing the Fault-Containment Time of Self-Stabilizing Algorithms - A Case Study for Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Volker Turau","submitted_at":"2014-10-24T12:58:39Z","abstract_excerpt":"The paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms in the message passing model. For a new Delta+1-coloring algorithm we analytically derive a bound for the mean time to recover and show that the variance is bounded by a small constant independent of the network's size. For the class of bounded-independence graphs (e.g. unit disc graphs) all containment metrics are in O(1)."},"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":"1410.6669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-24T12:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"9edc4d2b3c04b2df6a95364502458462eedc6863a3390f4924791e72c7a49a71","abstract_canon_sha256":"80d2ddaff9e05bae088337f4dc42cef6ce4a30a6a394a023bb5f31159227248d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:24.801360Z","signature_b64":"dDa1Arbg3OQ1A1phxhIS3wMPZGnj1rSW+0/2veDp/6d+S9xk4LW3Pevi3ULCxBAJ3rXh3FZrqEmqEAD70pRSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32a0789b08dacb0eedd23681a1f991eed2dbcb3fc02bf3778f84e14fd7e13e2d","last_reissued_at":"2026-05-18T02:39:24.800870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:24.800870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing the Fault-Containment Time of Self-Stabilizing Algorithms - A Case Study for Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Volker Turau","submitted_at":"2014-10-24T12:58:39Z","abstract_excerpt":"The paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms in the message passing model. For a new Delta+1-coloring algorithm we analytically derive a bound for the mean time to recover and show that the variance is bounded by a small constant independent of the network's size. For the class of bounded-independence graphs (e.g. unit disc graphs) all containment metrics are in O(1)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6669","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":"1410.6669","created_at":"2026-05-18T02:39:24.800947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6669v1","created_at":"2026-05-18T02:39:24.800947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6669","created_at":"2026-05-18T02:39:24.800947+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKQHRGYI3LFQ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKQHRGYI3LFQ53OS","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKQHRGYI","created_at":"2026-05-18T12:28:30.664211+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/GKQHRGYI3LFQ53OSG2A2D6MR53","json":"https://pith.science/pith/GKQHRGYI3LFQ53OSG2A2D6MR53.json","graph_json":"https://pith.science/api/pith-number/GKQHRGYI3LFQ53OSG2A2D6MR53/graph.json","events_json":"https://pith.science/api/pith-number/GKQHRGYI3LFQ53OSG2A2D6MR53/events.json","paper":"https://pith.science/paper/GKQHRGYI"},"agent_actions":{"view_html":"https://pith.science/pith/GKQHRGYI3LFQ53OSG2A2D6MR53","download_json":"https://pith.science/pith/GKQHRGYI3LFQ53OSG2A2D6MR53.json","view_paper":"https://pith.science/paper/GKQHRGYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6669&json=true","fetch_graph":"https://pith.science/api/pith-number/GKQHRGYI3LFQ53OSG2A2D6MR53/graph.json","fetch_events":"https://pith.science/api/pith-number/GKQHRGYI3LFQ53OSG2A2D6MR53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKQHRGYI3LFQ53OSG2A2D6MR53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKQHRGYI3LFQ53OSG2A2D6MR53/action/storage_attestation","attest_author":"https://pith.science/pith/GKQHRGYI3LFQ53OSG2A2D6MR53/action/author_attestation","sign_citation":"https://pith.science/pith/GKQHRGYI3LFQ53OSG2A2D6MR53/action/citation_signature","submit_replication":"https://pith.science/pith/GKQHRGYI3LFQ53OSG2A2D6MR53/action/replication_record"}},"created_at":"2026-05-18T02:39:24.800947+00:00","updated_at":"2026-05-18T02:39:24.800947+00:00"}