{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U527UKWCSXFMZDKQMUX2TIMHUR","short_pith_number":"pith:U527UKWC","schema_version":"1.0","canonical_sha256":"a775fa2ac295cacc8d50652fa9a187a44b0f98b16bdc45fa2a46f78a8728d996","source":{"kind":"arxiv","id":"1205.4681","version":2},"attestation_state":"computed","paper":{"title":"Self-Healing Algorithms of Byzantine Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"George Saad, Jared Saia, Jeffrey Knockel","submitted_at":"2012-05-21T18:42:47Z","abstract_excerpt":"Recent years have seen significant interest in designing networks that are self-healing in the sense that they can automatically recover from adversarial attacks. Previous work shows that it is possible for a network to automatically recover, even when an adversary repeatedly deletes nodes in the network. However, there have not yet been any algorithms that self-heal in the case where an adversary takes over nodes in the network. In this paper, we address this gap. In particular, we describe a communication network over n nodes that ensures the following properties, even when an adversary cont"},"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":"1205.4681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-05-21T18:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"2ed0c97f31c1155f862d055fc7a3c4e0a730b28068dd83a0ea8fda28a94c5bd4","abstract_canon_sha256":"77f8c1aed7b73925b3deea4e426b3fd7846127a1e84705aef4cbe4903ade49d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:10.154691Z","signature_b64":"a8Od3kx8mLnA0QLrwcA+jnYT28zdyBCpwQnIJn4xZyTnvO6oF6ny+pjg8PA+rguMgzJraU2O8e5VYi8oXlbFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a775fa2ac295cacc8d50652fa9a187a44b0f98b16bdc45fa2a46f78a8728d996","last_reissued_at":"2026-05-18T02:21:10.154224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:10.154224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Healing Algorithms of Byzantine Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"George Saad, Jared Saia, Jeffrey Knockel","submitted_at":"2012-05-21T18:42:47Z","abstract_excerpt":"Recent years have seen significant interest in designing networks that are self-healing in the sense that they can automatically recover from adversarial attacks. Previous work shows that it is possible for a network to automatically recover, even when an adversary repeatedly deletes nodes in the network. However, there have not yet been any algorithms that self-heal in the case where an adversary takes over nodes in the network. In this paper, we address this gap. In particular, we describe a communication network over n nodes that ensures the following properties, even when an adversary cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4681","kind":"arxiv","version":2},"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":"1205.4681","created_at":"2026-05-18T02:21:10.154299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4681v2","created_at":"2026-05-18T02:21:10.154299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4681","created_at":"2026-05-18T02:21:10.154299+00:00"},{"alias_kind":"pith_short_12","alias_value":"U527UKWCSXFM","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U527UKWCSXFMZDKQ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U527UKWC","created_at":"2026-05-18T12:27:23.164592+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/U527UKWCSXFMZDKQMUX2TIMHUR","json":"https://pith.science/pith/U527UKWCSXFMZDKQMUX2TIMHUR.json","graph_json":"https://pith.science/api/pith-number/U527UKWCSXFMZDKQMUX2TIMHUR/graph.json","events_json":"https://pith.science/api/pith-number/U527UKWCSXFMZDKQMUX2TIMHUR/events.json","paper":"https://pith.science/paper/U527UKWC"},"agent_actions":{"view_html":"https://pith.science/pith/U527UKWCSXFMZDKQMUX2TIMHUR","download_json":"https://pith.science/pith/U527UKWCSXFMZDKQMUX2TIMHUR.json","view_paper":"https://pith.science/paper/U527UKWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4681&json=true","fetch_graph":"https://pith.science/api/pith-number/U527UKWCSXFMZDKQMUX2TIMHUR/graph.json","fetch_events":"https://pith.science/api/pith-number/U527UKWCSXFMZDKQMUX2TIMHUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U527UKWCSXFMZDKQMUX2TIMHUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U527UKWCSXFMZDKQMUX2TIMHUR/action/storage_attestation","attest_author":"https://pith.science/pith/U527UKWCSXFMZDKQMUX2TIMHUR/action/author_attestation","sign_citation":"https://pith.science/pith/U527UKWCSXFMZDKQMUX2TIMHUR/action/citation_signature","submit_replication":"https://pith.science/pith/U527UKWCSXFMZDKQMUX2TIMHUR/action/replication_record"}},"created_at":"2026-05-18T02:21:10.154299+00:00","updated_at":"2026-05-18T02:21:10.154299+00:00"}