{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WTXM3UOO6RDCN7OQ46TBFFNXQY","short_pith_number":"pith:WTXM3UOO","canonical_record":{"source":{"id":"1402.0121","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-01T20:01:57Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"ba5b0c003c25bb4c53811fc2ea2d071740f4c9eec9c7499d3c210f2cdfe4febf","abstract_canon_sha256":"e2ba486b604a4970a1e18de40fc150c5ca33d60357823b2b24b47e66b825a595"},"schema_version":"1.0"},"canonical_sha256":"b4eecdd1cef44626fdd0e7a61295b7862907415ffabc4d070587460189c01321","source":{"kind":"arxiv","id":"1402.0121","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0121","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0121v4","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0121","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"WTXM3UOO6RDC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WTXM3UOO6RDCN7OQ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WTXM3UOO","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WTXM3UOO6RDCN7OQ46TBFFNXQY","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0121","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-01T20:01:57Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"ba5b0c003c25bb4c53811fc2ea2d071740f4c9eec9c7499d3c210f2cdfe4febf","abstract_canon_sha256":"e2ba486b604a4970a1e18de40fc150c5ca33d60357823b2b24b47e66b825a595"},"schema_version":"1.0"},"canonical_sha256":"b4eecdd1cef44626fdd0e7a61295b7862907415ffabc4d070587460189c01321","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:05.621331Z","signature_b64":"b4liGHCqvgkKlfqv2+iqbBi+USYZNr+kKGbWfRvTEE+drQfaRuZ+xlP+8Vu9nf2iCCwwcYbcGwXIPPFQUx2+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4eecdd1cef44626fdd0e7a61295b7862907415ffabc4d070587460189c01321","last_reissued_at":"2026-05-18T02:27:05.620967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:05.620967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0121","source_version":4,"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYGe4mFMs8gZ1yFjtM9S5Ag1f5gGeiB+3HRT1ANyWDgt2MTKXTnaPRh6KV5+NpgX4hnJeXGJO7DxNlqbBaELCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:04:29.996514Z"},"content_sha256":"36bda2b5e069d130b151b5fb288b16240416d3f561c6d207fb1aa7f70d2bd3d4","schema_version":"1.0","event_id":"sha256:36bda2b5e069d130b151b5fb288b16240416d3f561c6d207fb1aa7f70d2bd3d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WTXM3UOO6RDCN7OQ46TBFFNXQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer (EPFL), NPA), S\\'ebastien Tixeuil (LINCS, Xavier D\\'efago (JAIST)","submitted_at":"2014-02-01T20:01:57Z","abstract_excerpt":"We consider the following problem: two nodes want to reliably communicate in a dynamic multihop network where some nodes have been compromised, and may have a totally arbitrary and unpredictable behavior. These nodes are called Byzantine. We consider the two cases where cryptography is available and not available.\nWe prove the necessary and sufficient condition (that is, the weakest possible condition) to ensure reliable communication in this context. Our proof is constructive, as we provide Byzantine-resilient algorithms for reliable communication that are optimal with respect to our impossib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0121","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"},"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGqtqzZTzAz9lANsAybVB/hT6sf3cZ39BELSf/rYTuvOD6lj7+NqxPaQudR7vJfZJz0lHUyXJ7k9LVJqRd4BCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:04:29.997270Z"},"content_sha256":"fadd038e970026f239f7e25069a224446d86799e31c745c6d6b5854a83828526","schema_version":"1.0","event_id":"sha256:fadd038e970026f239f7e25069a224446d86799e31c745c6d6b5854a83828526"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTXM3UOO6RDCN7OQ46TBFFNXQY/bundle.json","state_url":"https://pith.science/pith/WTXM3UOO6RDCN7OQ46TBFFNXQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTXM3UOO6RDCN7OQ46TBFFNXQY/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-06-09T16:04:29Z","links":{"resolver":"https://pith.science/pith/WTXM3UOO6RDCN7OQ46TBFFNXQY","bundle":"https://pith.science/pith/WTXM3UOO6RDCN7OQ46TBFFNXQY/bundle.json","state":"https://pith.science/pith/WTXM3UOO6RDCN7OQ46TBFFNXQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTXM3UOO6RDCN7OQ46TBFFNXQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WTXM3UOO6RDCN7OQ46TBFFNXQY","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":"e2ba486b604a4970a1e18de40fc150c5ca33d60357823b2b24b47e66b825a595","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-01T20:01:57Z","title_canon_sha256":"ba5b0c003c25bb4c53811fc2ea2d071740f4c9eec9c7499d3c210f2cdfe4febf"},"schema_version":"1.0","source":{"id":"1402.0121","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0121","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0121v4","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0121","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"WTXM3UOO6RDC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WTXM3UOO6RDCN7OQ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WTXM3UOO","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:fadd038e970026f239f7e25069a224446d86799e31c745c6d6b5854a83828526","target":"graph","created_at":"2026-05-18T02:27:05Z","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 following problem: two nodes want to reliably communicate in a dynamic multihop network where some nodes have been compromised, and may have a totally arbitrary and unpredictable behavior. These nodes are called Byzantine. We consider the two cases where cryptography is available and not available.\nWe prove the necessary and sufficient condition (that is, the weakest possible condition) to ensure reliable communication in this context. Our proof is constructive, as we provide Byzantine-resilient algorithms for reliable communication that are optimal with respect to our impossib","authors_text":"Alexandre Maurer (EPFL), NPA), S\\'ebastien Tixeuil (LINCS, Xavier D\\'efago (JAIST)","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-01T20:01:57Z","title":"Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0121","kind":"arxiv","version":4},"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:36bda2b5e069d130b151b5fb288b16240416d3f561c6d207fb1aa7f70d2bd3d4","target":"record","created_at":"2026-05-18T02:27:05Z","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":"e2ba486b604a4970a1e18de40fc150c5ca33d60357823b2b24b47e66b825a595","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-01T20:01:57Z","title_canon_sha256":"ba5b0c003c25bb4c53811fc2ea2d071740f4c9eec9c7499d3c210f2cdfe4febf"},"schema_version":"1.0","source":{"id":"1402.0121","kind":"arxiv","version":4}},"canonical_sha256":"b4eecdd1cef44626fdd0e7a61295b7862907415ffabc4d070587460189c01321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4eecdd1cef44626fdd0e7a61295b7862907415ffabc4d070587460189c01321","first_computed_at":"2026-05-18T02:27:05.620967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:05.620967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b4liGHCqvgkKlfqv2+iqbBi+USYZNr+kKGbWfRvTEE+drQfaRuZ+xlP+8Vu9nf2iCCwwcYbcGwXIPPFQUx2+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:05.621331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0121","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36bda2b5e069d130b151b5fb288b16240416d3f561c6d207fb1aa7f70d2bd3d4","sha256:fadd038e970026f239f7e25069a224446d86799e31c745c6d6b5854a83828526"],"state_sha256":"95eb3a43b8e087794862f48fe39aa7a16b7f57da6ad2f3a37c32f852134cd30d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwfrVz2aLTJ1or8Ln0rN7TIsC98V+P0g7Rki53BO1nPj/cu8tTLw1YJOkgzjx/a+MAG9WdjWGWCM9SBbtaL0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:04:30.001615Z","bundle_sha256":"70ad5ae1878924fde77a100225fb3ed6edc66e762e5a4f178d0b51373120dcde"}}