{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GWPZO5TAKQO4DTWMIJ2GTFD2VS","short_pith_number":"pith:GWPZO5TA","schema_version":"1.0","canonical_sha256":"359f977660541dc1cecc427469947aaca44fba992e90473d9a78fc90fa0c10b0","source":{"kind":"arxiv","id":"1209.1358","version":1},"attestation_state":"computed","paper":{"title":"On Byzantine Broadcast in Loosely Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2012-09-05T14:55:32Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asynchronous network that is subject to Byzantine failures. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the authentic message and nothing else), but they require a highly connected network. An approach giving only probabilistic guarantees (correct nodes deliver the authentic message with high probability) was recently proposed for loosely connected networks, such as grids and tori. Yet, the proposed solution requires a specific initialization (that includes global k"},"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":"1209.1358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-09-05T14:55:32Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"7780a7b321a73b7e1dfea84df5f4253ca0e9c23fea454831bed01327ef8a4090","abstract_canon_sha256":"cf1a37b3a37861a18fa4e8326a238def2b0b79c5494792b7a24dec194cc7cb16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:51.032308Z","signature_b64":"71Gl+JB/GTW09DOZikTw5tq1aCIzFWUN+NcrQXfCPcjm5veJTMHD+hgxtEvR6XdNMmjjKz+hq7c170ObOACkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"359f977660541dc1cecc427469947aaca44fba992e90473d9a78fc90fa0c10b0","last_reissued_at":"2026-05-18T03:40:51.031416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:51.031416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Byzantine Broadcast in Loosely Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2012-09-05T14:55:32Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asynchronous network that is subject to Byzantine failures. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the authentic message and nothing else), but they require a highly connected network. An approach giving only probabilistic guarantees (correct nodes deliver the authentic message with high probability) was recently proposed for loosely connected networks, such as grids and tori. Yet, the proposed solution requires a specific initialization (that includes global k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1358","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":"1209.1358","created_at":"2026-05-18T03:40:51.031568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.1358v1","created_at":"2026-05-18T03:40:51.031568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1358","created_at":"2026-05-18T03:40:51.031568+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWPZO5TAKQO4","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWPZO5TAKQO4DTWM","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWPZO5TA","created_at":"2026-05-18T12:27:06.952714+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/GWPZO5TAKQO4DTWMIJ2GTFD2VS","json":"https://pith.science/pith/GWPZO5TAKQO4DTWMIJ2GTFD2VS.json","graph_json":"https://pith.science/api/pith-number/GWPZO5TAKQO4DTWMIJ2GTFD2VS/graph.json","events_json":"https://pith.science/api/pith-number/GWPZO5TAKQO4DTWMIJ2GTFD2VS/events.json","paper":"https://pith.science/paper/GWPZO5TA"},"agent_actions":{"view_html":"https://pith.science/pith/GWPZO5TAKQO4DTWMIJ2GTFD2VS","download_json":"https://pith.science/pith/GWPZO5TAKQO4DTWMIJ2GTFD2VS.json","view_paper":"https://pith.science/paper/GWPZO5TA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.1358&json=true","fetch_graph":"https://pith.science/api/pith-number/GWPZO5TAKQO4DTWMIJ2GTFD2VS/graph.json","fetch_events":"https://pith.science/api/pith-number/GWPZO5TAKQO4DTWMIJ2GTFD2VS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWPZO5TAKQO4DTWMIJ2GTFD2VS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWPZO5TAKQO4DTWMIJ2GTFD2VS/action/storage_attestation","attest_author":"https://pith.science/pith/GWPZO5TAKQO4DTWMIJ2GTFD2VS/action/author_attestation","sign_citation":"https://pith.science/pith/GWPZO5TAKQO4DTWMIJ2GTFD2VS/action/citation_signature","submit_replication":"https://pith.science/pith/GWPZO5TAKQO4DTWMIJ2GTFD2VS/action/replication_record"}},"created_at":"2026-05-18T03:40:51.031568+00:00","updated_at":"2026-05-18T03:40:51.031568+00:00"}