{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5SMWNQGPFVTOSYOFL6Z5PGTB2N","short_pith_number":"pith:5SMWNQGP","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"},"canonical_sha256":"ec9966c0cf2d66e961c55fb3d79a61d36abdab324488f0c64bcd584704d739dd","source":{"kind":"arxiv","id":"1201.5824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5824","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5824v1","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5824","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"5SMWNQGPFVTO","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5SMWNQGPFVTOSYOF","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5SMWNQGP","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5SMWNQGPFVTOSYOFL6Z5PGTB2N","target":"record","payload":{"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"},"canonical_sha256":"ec9966c0cf2d66e961c55fb3d79a61d36abdab324488f0c64bcd584704d739dd","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"},"source_kind":"arxiv","source_id":"1201.5824","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUyliar0+RCg1qZiiXSKXPlygOamVESBBdtSDLfvWWm9KUmf1uOa6oZhuCTJYfUcBDn+/b9afUaQ0CezL2gEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:25:43.923519Z"},"content_sha256":"b5ed3c8d01e5b4065b96ac91b7eac4bb8bb068c0c58c2cda8a2776e00b2ea784","schema_version":"1.0","event_id":"sha256:b5ed3c8d01e5b4065b96ac91b7eac4bb8bb068c0c58c2cda8a2776e00b2ea784"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5SMWNQGPFVTOSYOFL6Z5PGTB2N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bn2KtukzxYlkheHc+11Czkg1SKPXmqfM9u8K8MAZpBEIl21l2ckHEDMNDCVjT4FWG9TTA2UwLedwldZsMvHqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:25:43.924232Z"},"content_sha256":"995db3992e1d0b16bc32f14ade7059e33c8cae9edde4045d859528f75a7b3e50","schema_version":"1.0","event_id":"sha256:995db3992e1d0b16bc32f14ade7059e33c8cae9edde4045d859528f75a7b3e50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/bundle.json","state_url":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T13:25:43Z","links":{"resolver":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N","bundle":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/bundle.json","state":"https://pith.science/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SMWNQGPFVTOSYOFL6Z5PGTB2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5SMWNQGPFVTOSYOFL6Z5PGTB2N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"50c79c502d2dd45a6f216daa0023e5b755eb27c54dcf2c41eb28b179f4a04cd5","cross_cats_sorted":["cs.DC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-27T16:36:50Z","title_canon_sha256":"181314fd2eb4afc58843ed5f38bd6a478fb4b4294b3f9ec5f1bcbb3a0105cc09"},"schema_version":"1.0","source":{"id":"1201.5824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5824","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5824v1","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5824","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"5SMWNQGPFVTO","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5SMWNQGPFVTOSYOF","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5SMWNQGP","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:995db3992e1d0b16bc32f14ade7059e33c8cae9edde4045d859528f75a7b3e50","target":"graph","created_at":"2026-05-18T04:03:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","cross_cats":["cs.DC","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-27T16:36:50Z","title":"Limiting Byzantien Influence in Multihop Asynchronous Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5824","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b5ed3c8d01e5b4065b96ac91b7eac4bb8bb068c0c58c2cda8a2776e00b2ea784","target":"record","created_at":"2026-05-18T04:03:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"50c79c502d2dd45a6f216daa0023e5b755eb27c54dcf2c41eb28b179f4a04cd5","cross_cats_sorted":["cs.DC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-27T16:36:50Z","title_canon_sha256":"181314fd2eb4afc58843ed5f38bd6a478fb4b4294b3f9ec5f1bcbb3a0105cc09"},"schema_version":"1.0","source":{"id":"1201.5824","kind":"arxiv","version":1}},"canonical_sha256":"ec9966c0cf2d66e961c55fb3d79a61d36abdab324488f0c64bcd584704d739dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec9966c0cf2d66e961c55fb3d79a61d36abdab324488f0c64bcd584704d739dd","first_computed_at":"2026-05-18T04:03:44.431593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:44.431593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ECmJLesPgK00tzj+f2UL79jW6vMAKoo9DFN4lSuxGqkgxWDtAS/DNv//cdQy2+kCWDaRp7JX6+1vi/+0mDFgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:44.432025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5ed3c8d01e5b4065b96ac91b7eac4bb8bb068c0c58c2cda8a2776e00b2ea784","sha256:995db3992e1d0b16bc32f14ade7059e33c8cae9edde4045d859528f75a7b3e50"],"state_sha256":"daa49c5272b5c61f248c2885eb8b54e5dffaae412fdfd801a242c148caf5f3b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQbxYsK7PX1G5/qTkxOp6RGZhvhKVPm9+sBsbSQoxa32IQ+gGGdyUg8OcyXV2Bu35qyHO27S+IayiWVbUbyQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T13:25:43.928061Z","bundle_sha256":"be8255c6ee5cb3d91dba538f2cecb5bf4f9a03d8cf5822234dd592fc57061fb0"}}