{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:H72CFSUQL4QVV7TBNZVSWLRD2Q","short_pith_number":"pith:H72CFSUQ","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"},"canonical_sha256":"3ff422ca905f215afe616e6b2b2e23d4135fd75c6212803f806cdd9cb8d39cc1","source":{"kind":"arxiv","id":"1104.4022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4022","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4022v1","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4022","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"H72CFSUQL4QV","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H72CFSUQL4QVV7TB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H72CFSUQ","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:H72CFSUQL4QVV7TBNZVSWLRD2Q","target":"record","payload":{"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"},"canonical_sha256":"3ff422ca905f215afe616e6b2b2e23d4135fd75c6212803f806cdd9cb8d39cc1","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"},"source_kind":"arxiv","source_id":"1104.4022","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-18T04:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oN9ZmKotzo7xCBAUFw92pihILQx2jQQ2xgzOw7cjb4NCUOYru89bq4dk2dlx+xKO98AUGa8WsaxnXgc7t8OxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:03:46.731654Z"},"content_sha256":"a6b2da86581e09d578dc160a36f4ca5a370f38e4233389ad3390d37675dfac92","schema_version":"1.0","event_id":"sha256:a6b2da86581e09d578dc160a36f4ca5a370f38e4233389ad3390d37675dfac92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:H72CFSUQL4QVV7TBNZVSWLRD2Q","target":"graph","payload":{"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"},"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-18T04:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fRThWgeh+IKa6VA53ypnIfTmN8yNSOvvIOjb6CnEcHYfSs8QvTHSH/Rn4T0u6M6IPUmpo9seZYdRtkzaH3L0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:03:46.732238Z"},"content_sha256":"d2adb497a180c2bf3c593e6f467a662c9f0bdb9a701e6913e21b4c0032b43deb","schema_version":"1.0","event_id":"sha256:d2adb497a180c2bf3c593e6f467a662c9f0bdb9a701e6913e21b4c0032b43deb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/bundle.json","state_url":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/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-24T06:03:46Z","links":{"resolver":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q","bundle":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/bundle.json","state":"https://pith.science/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H72CFSUQL4QVV7TBNZVSWLRD2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:H72CFSUQL4QVV7TBNZVSWLRD2Q","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":"5e6373ed5596e7fc4f80bcf7e98c1cae4647c10de940e545827bf3e892061906","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-20T13:45:26Z","title_canon_sha256":"05f6ec38e430225fe5e52d4be9acc373a6978299e89339e28f35c76bf4dbb5b5"},"schema_version":"1.0","source":{"id":"1104.4022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4022","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4022v1","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4022","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"H72CFSUQL4QV","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H72CFSUQL4QVV7TB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H72CFSUQ","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:d2adb497a180c2bf3c593e6f467a662c9f0bdb9a701e6913e21b4c0032b43deb","target":"graph","created_at":"2026-05-18T04:23:47Z","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":"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","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","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-20T13:45:26Z","title":"Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalit\\'e du Protocole min+1"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4022","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:a6b2da86581e09d578dc160a36f4ca5a370f38e4233389ad3390d37675dfac92","target":"record","created_at":"2026-05-18T04:23:47Z","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":"5e6373ed5596e7fc4f80bcf7e98c1cae4647c10de940e545827bf3e892061906","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-20T13:45:26Z","title_canon_sha256":"05f6ec38e430225fe5e52d4be9acc373a6978299e89339e28f35c76bf4dbb5b5"},"schema_version":"1.0","source":{"id":"1104.4022","kind":"arxiv","version":1}},"canonical_sha256":"3ff422ca905f215afe616e6b2b2e23d4135fd75c6212803f806cdd9cb8d39cc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ff422ca905f215afe616e6b2b2e23d4135fd75c6212803f806cdd9cb8d39cc1","first_computed_at":"2026-05-18T04:23:47.235470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:47.235470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NELgxUyXmW951fUQCz/Agiq3CDhZ5mFkRV5BCDGtcyHfvo3ZuOuq0zhO1qSPUBlrqHgmo+Q0dmj/Xhlt/tJZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:47.236178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6b2da86581e09d578dc160a36f4ca5a370f38e4233389ad3390d37675dfac92","sha256:d2adb497a180c2bf3c593e6f467a662c9f0bdb9a701e6913e21b4c0032b43deb"],"state_sha256":"393004d8e614ac9ab47a8e712152f7a33f7e8ecda433d6b6efd8f10634745eed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hy5BshzmwGCAYOzO0wP5Upl9OmNKo74zQBVMFYaj1Yp4LQgSdj1A/+crIMKw65ICFFkSmCI1drO7oX8z2hr3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T06:03:46.734885Z","bundle_sha256":"66395da8864ade7f61546f3bb231571968580a4c8d4cc8756862a1a93750a29d"}}