{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ABEHYU6PIDUK46MB6VLXR6CE7X","short_pith_number":"pith:ABEHYU6P","canonical_record":{"source":{"id":"0811.3475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-11-21T05:59:31Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"5124d2022afc3b74ad1eb866a493d66252b28b222996c7d3ab35df26a756d480","abstract_canon_sha256":"9d00cba16527da8c760d8122d88078768ec435922abace6cb0620dba5b903d31"},"schema_version":"1.0"},"canonical_sha256":"00487c53cf40e8ae7981f55778f844fdf3eb72b08b5c43ebb551a6fdfc928332","source":{"kind":"arxiv","id":"0811.3475","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.3475","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"0811.3475v3","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.3475","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"ABEHYU6PIDUK","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"ABEHYU6PIDUK46MB","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"ABEHYU6P","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ABEHYU6PIDUK46MB6VLXR6CE7X","target":"record","payload":{"canonical_record":{"source":{"id":"0811.3475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-11-21T05:59:31Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"5124d2022afc3b74ad1eb866a493d66252b28b222996c7d3ab35df26a756d480","abstract_canon_sha256":"9d00cba16527da8c760d8122d88078768ec435922abace6cb0620dba5b903d31"},"schema_version":"1.0"},"canonical_sha256":"00487c53cf40e8ae7981f55778f844fdf3eb72b08b5c43ebb551a6fdfc928332","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.264720Z","signature_b64":"xOJ8T7qCIYA1m7ZYc/ExRE1GvCxrweFCiolumLnXt+t8fwqlAKzXFgxsFgNNhN6dUMGvvZMzhZnxP2rurfYUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00487c53cf40e8ae7981f55778f844fdf3eb72b08b5c43ebb551a6fdfc928332","last_reissued_at":"2026-05-17T23:47:06.264156Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.264156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.3475","source_version":3,"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-17T23:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUy3IMNWxNeP7LlXgxQuKacGaPBpkQ7jgGCd1L6zlsh0TzK6mGNHjBjs27bynDPNBSMLHl27l9mFVYDxbDolAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:02:43.257589Z"},"content_sha256":"c363555a9b475b3ecd08c020ef905e5842f0744724b1bce469598a783a576c58","schema_version":"1.0","event_id":"sha256:c363555a9b475b3ecd08c020ef905e5842f0744724b1bce469598a783a576c58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ABEHYU6PIDUK46MB6VLXR6CE7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Network Coding in the Presence of Untrusted Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Danilo Silva, Da Wang, Frank R. Kschischang","submitted_at":"2008-11-21T05:59:31Z","abstract_excerpt":"While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to \"pollution attacks,\" as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination. Even when suitable error-control coding is applied, an adversary can, in many interesting practical situations, overwhelm the error-correcting capability of the code. To limit the power of potential adversaries, a broadcast transformation is introduced, in which nodes are limited to just a single (broadcast) transmission per "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.3475","kind":"arxiv","version":3},"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-17T23:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/c5mc7BAKZ5U5lDbH4YE+EwPJhtD1hnmbKkLXLISA+Vej95E7A1Xpafn360ZEljPe0axKgWnhxRazUimzJLxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:02:43.258294Z"},"content_sha256":"d7f5373d20e5367eaa020b53a8e66375321a997ee09f19f6f91c79bfd39bffe2","schema_version":"1.0","event_id":"sha256:d7f5373d20e5367eaa020b53a8e66375321a997ee09f19f6f91c79bfd39bffe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/bundle.json","state_url":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/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-08T17:02:43Z","links":{"resolver":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X","bundle":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/bundle.json","state":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ABEHYU6PIDUK46MB6VLXR6CE7X","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":"9d00cba16527da8c760d8122d88078768ec435922abace6cb0620dba5b903d31","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-11-21T05:59:31Z","title_canon_sha256":"5124d2022afc3b74ad1eb866a493d66252b28b222996c7d3ab35df26a756d480"},"schema_version":"1.0","source":{"id":"0811.3475","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.3475","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"0811.3475v3","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.3475","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"ABEHYU6PIDUK","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"ABEHYU6PIDUK46MB","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"ABEHYU6P","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:d7f5373d20e5367eaa020b53a8e66375321a997ee09f19f6f91c79bfd39bffe2","target":"graph","created_at":"2026-05-17T23:47:06Z","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":"While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to \"pollution attacks,\" as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination. Even when suitable error-control coding is applied, an adversary can, in many interesting practical situations, overwhelm the error-correcting capability of the code. To limit the power of potential adversaries, a broadcast transformation is introduced, in which nodes are limited to just a single (broadcast) transmission per ","authors_text":"Danilo Silva, Da Wang, Frank R. Kschischang","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-11-21T05:59:31Z","title":"Robust Network Coding in the Presence of Untrusted Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.3475","kind":"arxiv","version":3},"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:c363555a9b475b3ecd08c020ef905e5842f0744724b1bce469598a783a576c58","target":"record","created_at":"2026-05-17T23:47:06Z","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":"9d00cba16527da8c760d8122d88078768ec435922abace6cb0620dba5b903d31","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-11-21T05:59:31Z","title_canon_sha256":"5124d2022afc3b74ad1eb866a493d66252b28b222996c7d3ab35df26a756d480"},"schema_version":"1.0","source":{"id":"0811.3475","kind":"arxiv","version":3}},"canonical_sha256":"00487c53cf40e8ae7981f55778f844fdf3eb72b08b5c43ebb551a6fdfc928332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00487c53cf40e8ae7981f55778f844fdf3eb72b08b5c43ebb551a6fdfc928332","first_computed_at":"2026-05-17T23:47:06.264156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:06.264156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xOJ8T7qCIYA1m7ZYc/ExRE1GvCxrweFCiolumLnXt+t8fwqlAKzXFgxsFgNNhN6dUMGvvZMzhZnxP2rurfYUDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:06.264720Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.3475","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c363555a9b475b3ecd08c020ef905e5842f0744724b1bce469598a783a576c58","sha256:d7f5373d20e5367eaa020b53a8e66375321a997ee09f19f6f91c79bfd39bffe2"],"state_sha256":"5622cfb9128c60294b63ed650425cb306ab875c925b3b1cda5ec5575b852a16c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHw6GYr2HmIK6Q0w7NQkfQ6czuIZFMdKWbRVOtrHwtC3Cv/b7pCnf5s1o0Q6bplk9EKR1+UD3dLfUilQSq+bCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:02:43.262327Z","bundle_sha256":"67f11b6a473164d985d4f6d6e744a7b7d2b85853e1d381f242b3c13ddf798695"}}