{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5SMWNQGPFVTOSYOFL6Z5PGTB2N","short_pith_number":"pith:5SMWNQGP","schema_version":"1.0","canonical_sha256":"ec9966c0cf2d66e961c55fb3d79a61d36abdab324488f0c64bcd584704d739dd","source":{"kind":"arxiv","id":"1201.5824","version":1},"attestation_state":"computed","paper":{"title":"Limiting Byzantien Influence in Multihop Asynchronous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2012-01-27T16:36:50Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asyn- chronous network that is subject to Byzantine failures. That is, some nodes of the network can exhibit arbitrary (and potentially malicious) behavior. Existing solutions provide de- terministic guarantees for broadcasting between all correct nodes, but require that the communication network is highly-connected (typically, 2k + 1 connectivity is required, where k is the total number of Byzantine nodes in the network). In this paper, we investigate the possibility of Byzantine tolerant reliable broadcast be- tween m"},"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":"1201.5824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-27T16:36:50Z","cross_cats_sorted":["cs.DC","cs.NI"],"title_canon_sha256":"181314fd2eb4afc58843ed5f38bd6a478fb4b4294b3f9ec5f1bcbb3a0105cc09","abstract_canon_sha256":"50c79c502d2dd45a6f216daa0023e5b755eb27c54dcf2c41eb28b179f4a04cd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:44.432025Z","signature_b64":"ECmJLesPgK00tzj+f2UL79jW6vMAKoo9DFN4lSuxGqkgxWDtAS/DNv//cdQy2+kCWDaRp7JX6+1vi/+0mDFgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec9966c0cf2d66e961c55fb3d79a61d36abdab324488f0c64bcd584704d739dd","last_reissued_at":"2026-05-18T04:03:44.431593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:44.431593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limiting Byzantien Influence in Multihop Asynchronous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2012-01-27T16:36:50Z","abstract_excerpt":"We consider the problem of reliably broadcasting information in a multihop asyn- chronous network that is subject to Byzantine failures. That is, some nodes of the network can exhibit arbitrary (and potentially malicious) behavior. Existing solutions provide de- terministic guarantees for broadcasting between all correct nodes, but require that the communication network is highly-connected (typically, 2k + 1 connectivity is required, where k is the total number of Byzantine nodes in the network). In this paper, we investigate the possibility of Byzantine tolerant reliable broadcast be- tween m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5824","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":"1201.5824","created_at":"2026-05-18T04:03:44.431655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5824v1","created_at":"2026-05-18T04:03:44.431655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5824","created_at":"2026-05-18T04:03:44.431655+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SMWNQGPFVTO","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SMWNQGPFVTOSYOF","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SMWNQGP","created_at":"2026-05-18T12:26:56.085431+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/5SMWNQGPFVTOSYOFL6Z5PGTB2N","json":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N.json","graph_json":"https://pith.science/api/pith-number/5SMWNQGPFVTOSYOFL6Z5PGTB2N/graph.json","events_json":"https://pith.science/api/pith-number/5SMWNQGPFVTOSYOFL6Z5PGTB2N/events.json","paper":"https://pith.science/paper/5SMWNQGP"},"agent_actions":{"view_html":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N","download_json":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N.json","view_paper":"https://pith.science/paper/5SMWNQGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5824&json=true","fetch_graph":"https://pith.science/api/pith-number/5SMWNQGPFVTOSYOFL6Z5PGTB2N/graph.json","fetch_events":"https://pith.science/api/pith-number/5SMWNQGPFVTOSYOFL6Z5PGTB2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/action/storage_attestation","attest_author":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/action/author_attestation","sign_citation":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/action/citation_signature","submit_replication":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/action/replication_record"}},"created_at":"2026-05-18T04:03:44.431655+00:00","updated_at":"2026-05-18T04:03:44.431655+00:00"}