{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OTZ3PB4HXW4M3DTAFIU3ZLFR25","short_pith_number":"pith:OTZ3PB4H","schema_version":"1.0","canonical_sha256":"74f3b78787bdb8cd8e602a29bcacb1d75c37f1460f1e5a2a8020b2284511d095","source":{"kind":"arxiv","id":"1301.2875","version":4},"attestation_state":"computed","paper":{"title":"On Byzantine Broadcast in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2013-01-14T07:44:22Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asynchronous network in the presence of Byzantine failures: some nodes may exhibit unpredictable malicious behavior. We focus on completely decentralized solutions. Few Byzantine-robust algorithms exist for loosely connected networks. A recent solution guarantees reliable broadcast on a torus when D > 4, D being the minimal distance between two Byzantine nodes. In this paper, we generalize this result to 4-connected planar graphs. We show that reliable broadcast can be guaranteed when D > Z, Z being the maximal number o"},"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":"1301.2875","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-14T07:44:22Z","cross_cats_sorted":["cs.CR","cs.DC","cs.NI"],"title_canon_sha256":"eb517e5a59e4695a8babda69ebee900ebbb757b960077bc49c1ea3bd594bb2c0","abstract_canon_sha256":"8c956ad361646b84bdd0368550aea10fc68d1d64aea2ffdcea8c9be287d59135"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:18.732440Z","signature_b64":"1hvUhu2D/mPUf+G0q3Dpk01bAfVuz5I1RAtHtHt+C+ZhM60H3ALIr+HEZJn9ZC851rR3jAPQ49k/vK4W20NOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74f3b78787bdb8cd8e602a29bcacb1d75c37f1460f1e5a2a8020b2284511d095","last_reissued_at":"2026-05-18T03:05:18.732000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:18.732000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Byzantine Broadcast in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2013-01-14T07:44:22Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asynchronous network in the presence of Byzantine failures: some nodes may exhibit unpredictable malicious behavior. We focus on completely decentralized solutions. Few Byzantine-robust algorithms exist for loosely connected networks. A recent solution guarantees reliable broadcast on a torus when D > 4, D being the minimal distance between two Byzantine nodes. In this paper, we generalize this result to 4-connected planar graphs. We show that reliable broadcast can be guaranteed when D > Z, Z being the maximal number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2875","kind":"arxiv","version":4},"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":"1301.2875","created_at":"2026-05-18T03:05:18.732061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2875v4","created_at":"2026-05-18T03:05:18.732061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2875","created_at":"2026-05-18T03:05:18.732061+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTZ3PB4HXW4M","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTZ3PB4HXW4M3DTA","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTZ3PB4H","created_at":"2026-05-18T12:27:54.935989+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/OTZ3PB4HXW4M3DTAFIU3ZLFR25","json":"https://pith.science/pith/OTZ3PB4HXW4M3DTAFIU3ZLFR25.json","graph_json":"https://pith.science/api/pith-number/OTZ3PB4HXW4M3DTAFIU3ZLFR25/graph.json","events_json":"https://pith.science/api/pith-number/OTZ3PB4HXW4M3DTAFIU3ZLFR25/events.json","paper":"https://pith.science/paper/OTZ3PB4H"},"agent_actions":{"view_html":"https://pith.science/pith/OTZ3PB4HXW4M3DTAFIU3ZLFR25","download_json":"https://pith.science/pith/OTZ3PB4HXW4M3DTAFIU3ZLFR25.json","view_paper":"https://pith.science/paper/OTZ3PB4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2875&json=true","fetch_graph":"https://pith.science/api/pith-number/OTZ3PB4HXW4M3DTAFIU3ZLFR25/graph.json","fetch_events":"https://pith.science/api/pith-number/OTZ3PB4HXW4M3DTAFIU3ZLFR25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTZ3PB4HXW4M3DTAFIU3ZLFR25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTZ3PB4HXW4M3DTAFIU3ZLFR25/action/storage_attestation","attest_author":"https://pith.science/pith/OTZ3PB4HXW4M3DTAFIU3ZLFR25/action/author_attestation","sign_citation":"https://pith.science/pith/OTZ3PB4HXW4M3DTAFIU3ZLFR25/action/citation_signature","submit_replication":"https://pith.science/pith/OTZ3PB4HXW4M3DTAFIU3ZLFR25/action/replication_record"}},"created_at":"2026-05-18T03:05:18.732061+00:00","updated_at":"2026-05-18T03:05:18.732061+00:00"}