{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:H72CFSUQL4QVV7TBNZVSWLRD2Q","short_pith_number":"pith:H72CFSUQ","schema_version":"1.0","canonical_sha256":"3ff422ca905f215afe616e6b2b2e23d4135fd75c6212803f806cdd9cb8d39cc1","source":{"kind":"arxiv","id":"1104.4022","version":1},"attestation_state":"computed","paper":{"title":"Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalit\\'e du Protocole min+1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Computer sciences Osaka University), INRIA Rocquencourt), INRIA Saclay - Ile de France), S\\'ebastien Tixeuil (LIP6, Swan Dubois (LIP6, Toshimitsu Masuzawa (Department of Information","submitted_at":"2011-04-20T13:45:26Z","abstract_excerpt":"A self-stabilizing is naturally resilient to transients faults (that is, faults of finite duration). Recently, a new class of protocol appears. These protocols are self-stabilizing and are moreover resilient to a limited number of permanent faults. In this article, we interest in self-stabilizing protocols that tolerate very hard permanent faults: Byzantine faults. We introduce two new scheme of Byzantine containment in self-stabilizing systems. We show that, for the problem of BFS spanning tree construction, the well known self-stabilizing protocol min+1 provides without significant modificat"},"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":"1104.4022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-20T13:45:26Z","cross_cats_sorted":[],"title_canon_sha256":"05f6ec38e430225fe5e52d4be9acc373a6978299e89339e28f35c76bf4dbb5b5","abstract_canon_sha256":"5e6373ed5596e7fc4f80bcf7e98c1cae4647c10de940e545827bf3e892061906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:47.236178Z","signature_b64":"NELgxUyXmW951fUQCz/Agiq3CDhZ5mFkRV5BCDGtcyHfvo3ZuOuq0zhO1qSPUBlrqHgmo+Q0dmj/Xhlt/tJZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ff422ca905f215afe616e6b2b2e23d4135fd75c6212803f806cdd9cb8d39cc1","last_reissued_at":"2026-05-18T04:23:47.235470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:47.235470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalit\\'e du Protocole min+1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Computer sciences Osaka University), INRIA Rocquencourt), INRIA Saclay - Ile de France), S\\'ebastien Tixeuil (LIP6, Swan Dubois (LIP6, Toshimitsu Masuzawa (Department of Information","submitted_at":"2011-04-20T13:45:26Z","abstract_excerpt":"A self-stabilizing is naturally resilient to transients faults (that is, faults of finite duration). Recently, a new class of protocol appears. These protocols are self-stabilizing and are moreover resilient to a limited number of permanent faults. In this article, we interest in self-stabilizing protocols that tolerate very hard permanent faults: Byzantine faults. We introduce two new scheme of Byzantine containment in self-stabilizing systems. We show that, for the problem of BFS spanning tree construction, the well known self-stabilizing protocol min+1 provides without significant modificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4022","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":"1104.4022","created_at":"2026-05-18T04:23:47.235576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4022v1","created_at":"2026-05-18T04:23:47.235576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4022","created_at":"2026-05-18T04:23:47.235576+00:00"},{"alias_kind":"pith_short_12","alias_value":"H72CFSUQL4QV","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"H72CFSUQL4QVV7TB","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"H72CFSUQ","created_at":"2026-05-18T12:26:30.835961+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/H72CFSUQL4QVV7TBNZVSWLRD2Q","json":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q.json","graph_json":"https://pith.science/api/pith-number/H72CFSUQL4QVV7TBNZVSWLRD2Q/graph.json","events_json":"https://pith.science/api/pith-number/H72CFSUQL4QVV7TBNZVSWLRD2Q/events.json","paper":"https://pith.science/paper/H72CFSUQ"},"agent_actions":{"view_html":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q","download_json":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q.json","view_paper":"https://pith.science/paper/H72CFSUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4022&json=true","fetch_graph":"https://pith.science/api/pith-number/H72CFSUQL4QVV7TBNZVSWLRD2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/H72CFSUQL4QVV7TBNZVSWLRD2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/action/storage_attestation","attest_author":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/action/author_attestation","sign_citation":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/action/citation_signature","submit_replication":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/action/replication_record"}},"created_at":"2026-05-18T04:23:47.235576+00:00","updated_at":"2026-05-18T04:23:47.235576+00:00"}