{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HEMH3NXYBN5YEBYOFBM2OGC4FL","short_pith_number":"pith:HEMH3NXY","schema_version":"1.0","canonical_sha256":"39187db6f80b7b82070e2859a7185c2ae19c3fe88e0cd5ec38afe7dafa8ead31","source":{"kind":"arxiv","id":"1301.3996","version":2},"attestation_state":"computed","paper":{"title":"Parameterizable Byzantine Broadcast in Loosely Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2013-01-17T07:09:15Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly. We focus on non-cryptographic solutions. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the good information), but require a highly connected network. A probabilistic approach was recently proposed for loosely connected networks: the Byzantine failures are randomly distributed, and the correct nodes deliver the good information with high probability. A firs"},"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.3996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-17T07:09:15Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"b97de5d35a0c63eb1c2d9bd0df521182065e9654666530c08fe46fb14d28da95","abstract_canon_sha256":"bd18358f4a1ff88620216ddf74c1e5e0049b627c2bf8202e5ead9b2ceefbd2e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:18.714363Z","signature_b64":"X/CBv1ARicmjtBFoDESNaLkdHDbQyepXN0km3DRvgHsnh+2Ue1IRsirafO+98s17XSrU6pHbJdkLlJQ892UQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39187db6f80b7b82070e2859a7185c2ae19c3fe88e0cd5ec38afe7dafa8ead31","last_reissued_at":"2026-05-18T03:05:18.713926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:18.713926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterizable Byzantine Broadcast in Loosely Connected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2013-01-17T07:09:15Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly. We focus on non-cryptographic solutions. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the good information), but require a highly connected network. A probabilistic approach was recently proposed for loosely connected networks: the Byzantine failures are randomly distributed, and the correct nodes deliver the good information with high probability. A firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3996","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":"1301.3996","created_at":"2026-05-18T03:05:18.713981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3996v2","created_at":"2026-05-18T03:05:18.713981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3996","created_at":"2026-05-18T03:05:18.713981+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEMH3NXYBN5Y","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEMH3NXYBN5YEBYO","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEMH3NXY","created_at":"2026-05-18T12:27:46.883200+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/HEMH3NXYBN5YEBYOFBM2OGC4FL","json":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL.json","graph_json":"https://pith.science/api/pith-number/HEMH3NXYBN5YEBYOFBM2OGC4FL/graph.json","events_json":"https://pith.science/api/pith-number/HEMH3NXYBN5YEBYOFBM2OGC4FL/events.json","paper":"https://pith.science/paper/HEMH3NXY"},"agent_actions":{"view_html":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL","download_json":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL.json","view_paper":"https://pith.science/paper/HEMH3NXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3996&json=true","fetch_graph":"https://pith.science/api/pith-number/HEMH3NXYBN5YEBYOFBM2OGC4FL/graph.json","fetch_events":"https://pith.science/api/pith-number/HEMH3NXYBN5YEBYOFBM2OGC4FL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/action/storage_attestation","attest_author":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/action/author_attestation","sign_citation":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/action/citation_signature","submit_replication":"https://pith.science/pith/HEMH3NXYBN5YEBYOFBM2OGC4FL/action/replication_record"}},"created_at":"2026-05-18T03:05:18.713981+00:00","updated_at":"2026-05-18T03:05:18.713981+00:00"}