{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4E3HZKUACZT6XIJIUW6733C3SB","short_pith_number":"pith:4E3HZKUA","canonical_record":{"source":{"id":"1304.2454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-09T04:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"fa8a38fb780d5ca71a019bd63bbbd1701e6f47b071265b35dbaf776a2873ed14","abstract_canon_sha256":"6907a8219ca680147ac4bd6579bc82d255b01da89b34dc4793ac81b9e215c816"},"schema_version":"1.0"},"canonical_sha256":"e1367caa801667eba128a5bdfdec5b9045378b3a83c0346b8a800fb6d1671bd8","source":{"kind":"arxiv","id":"1304.2454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2454","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2454v2","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2454","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"4E3HZKUACZT6","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4E3HZKUACZT6XIJI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4E3HZKUA","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4E3HZKUACZT6XIJIUW6733C3SB","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-09T04:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"fa8a38fb780d5ca71a019bd63bbbd1701e6f47b071265b35dbaf776a2873ed14","abstract_canon_sha256":"6907a8219ca680147ac4bd6579bc82d255b01da89b34dc4793ac81b9e215c816"},"schema_version":"1.0"},"canonical_sha256":"e1367caa801667eba128a5bdfdec5b9045378b3a83c0346b8a800fb6d1671bd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:47.183979Z","signature_b64":"vd6qENrqYl3OAAIK4Drx4bHVfhh332vaY8iYX2NBNreKtaDJuYgPHHUDmoWr7r5sUeuwmuhTpo331E7MhEKkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1367caa801667eba128a5bdfdec5b9045378b3a83c0346b8a800fb6d1671bd8","last_reissued_at":"2026-05-18T03:08:47.183500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:47.183500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2454","source_version":2,"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-18T03:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0DlAhI1sdJoLrjF5Qhg4t82C1Gab3v+KtnIGlYjJ7h3G2uCY74ttEfANWJl7vL7EoWSHwPi9Ac+hYmsU3ExBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:46:02.381783Z"},"content_sha256":"904dc31acf6418377dde1179ca6db4a5cb6a56258f0633d76a9ae37724ffcd66","schema_version":"1.0","event_id":"sha256:904dc31acf6418377dde1179ca6db4a5cb6a56258f0633d76a9ae37724ffcd66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4E3HZKUACZT6XIJIUW6733C3SB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure End-to-End Communication with Optimal Throughput in Unreliable Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Paul Bunn, Rafail Ostrovsky","submitted_at":"2013-04-09T04:07:31Z","abstract_excerpt":"We demonstrate the feasibility of end-to-end communication in highly unreliable networks. Modeling a network as a graph with vertices representing nodes and edges representing the links between them, we consider two forms of unreliability: unpredictable edge-failures, and deliberate deviation from protocol specifications by corrupt nodes.\n  We present a robust routing protocol for end-to-end communication that is simultaneously resilient to both forms of unreliability. In particular, we prove rigorously that our protocol is SECURE against the actions of the corrupt nodes, achieves correctness "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2454","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"},"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-18T03:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqflXsWvj8m3KCXZiqCzmobAk+9QRm0JOXtxemZSD+KM3Pfm5UPW/I1LosyPtPtNl2kqxgpIOG9L9L4VbLrCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:46:02.382173Z"},"content_sha256":"7562be36255d870887e9ec3ef427461476c79ff6e4c4a2fc721c7535040a0ddf","schema_version":"1.0","event_id":"sha256:7562be36255d870887e9ec3ef427461476c79ff6e4c4a2fc721c7535040a0ddf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4E3HZKUACZT6XIJIUW6733C3SB/bundle.json","state_url":"https://pith.science/pith/4E3HZKUACZT6XIJIUW6733C3SB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4E3HZKUACZT6XIJIUW6733C3SB/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-08T19:46:02Z","links":{"resolver":"https://pith.science/pith/4E3HZKUACZT6XIJIUW6733C3SB","bundle":"https://pith.science/pith/4E3HZKUACZT6XIJIUW6733C3SB/bundle.json","state":"https://pith.science/pith/4E3HZKUACZT6XIJIUW6733C3SB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4E3HZKUACZT6XIJIUW6733C3SB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4E3HZKUACZT6XIJIUW6733C3SB","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":"6907a8219ca680147ac4bd6579bc82d255b01da89b34dc4793ac81b9e215c816","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-09T04:07:31Z","title_canon_sha256":"fa8a38fb780d5ca71a019bd63bbbd1701e6f47b071265b35dbaf776a2873ed14"},"schema_version":"1.0","source":{"id":"1304.2454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2454","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2454v2","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2454","created_at":"2026-05-18T03:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"4E3HZKUACZT6","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4E3HZKUACZT6XIJI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4E3HZKUA","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:7562be36255d870887e9ec3ef427461476c79ff6e4c4a2fc721c7535040a0ddf","target":"graph","created_at":"2026-05-18T03:08:47Z","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 demonstrate the feasibility of end-to-end communication in highly unreliable networks. Modeling a network as a graph with vertices representing nodes and edges representing the links between them, we consider two forms of unreliability: unpredictable edge-failures, and deliberate deviation from protocol specifications by corrupt nodes.\n  We present a robust routing protocol for end-to-end communication that is simultaneously resilient to both forms of unreliability. In particular, we prove rigorously that our protocol is SECURE against the actions of the corrupt nodes, achieves correctness ","authors_text":"Paul Bunn, Rafail Ostrovsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-09T04:07:31Z","title":"Secure End-to-End Communication with Optimal Throughput in Unreliable Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2454","kind":"arxiv","version":2},"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:904dc31acf6418377dde1179ca6db4a5cb6a56258f0633d76a9ae37724ffcd66","target":"record","created_at":"2026-05-18T03:08:47Z","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":"6907a8219ca680147ac4bd6579bc82d255b01da89b34dc4793ac81b9e215c816","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-09T04:07:31Z","title_canon_sha256":"fa8a38fb780d5ca71a019bd63bbbd1701e6f47b071265b35dbaf776a2873ed14"},"schema_version":"1.0","source":{"id":"1304.2454","kind":"arxiv","version":2}},"canonical_sha256":"e1367caa801667eba128a5bdfdec5b9045378b3a83c0346b8a800fb6d1671bd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1367caa801667eba128a5bdfdec5b9045378b3a83c0346b8a800fb6d1671bd8","first_computed_at":"2026-05-18T03:08:47.183500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:47.183500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vd6qENrqYl3OAAIK4Drx4bHVfhh332vaY8iYX2NBNreKtaDJuYgPHHUDmoWr7r5sUeuwmuhTpo331E7MhEKkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:47.183979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:904dc31acf6418377dde1179ca6db4a5cb6a56258f0633d76a9ae37724ffcd66","sha256:7562be36255d870887e9ec3ef427461476c79ff6e4c4a2fc721c7535040a0ddf"],"state_sha256":"b5e7ebfcd526bf8a44b3b7c43e6e6730c9919b9fff14dda7c02bf9e83239e652"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLyTluKymMVZ6muiubM9f0/Pitlo5gWeMd4tJnv/DUem3/zegI3RDWOUnxxRmPtEKRSj3N6dbab4sVFYSX27Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:46:02.385072Z","bundle_sha256":"31ba0e1c1b8ef65b07784219f35099cd7e6a040061b92ce6d446796d5cc43282"}}