{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:ABEHYU6PIDUK46MB6VLXR6CE7X","short_pith_number":"pith:ABEHYU6P","schema_version":"1.0","canonical_sha256":"00487c53cf40e8ae7981f55778f844fdf3eb72b08b5c43ebb551a6fdfc928332","source":{"kind":"arxiv","id":"0811.3475","version":3},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0811.3475","created_at":"2026-05-17T23:47:06.264251+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.3475v3","created_at":"2026-05-17T23:47:06.264251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.3475","created_at":"2026-05-17T23:47:06.264251+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABEHYU6PIDUK","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABEHYU6PIDUK46MB","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABEHYU6P","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.09651","citing_title":"A minimization theorem for the Koide ratio and its Standard Model calibration","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09651","citing_title":"A minimization theorem for the Koide ratio and its Standard Model calibration","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X","json":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X.json","graph_json":"https://pith.science/api/pith-number/ABEHYU6PIDUK46MB6VLXR6CE7X/graph.json","events_json":"https://pith.science/api/pith-number/ABEHYU6PIDUK46MB6VLXR6CE7X/events.json","paper":"https://pith.science/paper/ABEHYU6P"},"agent_actions":{"view_html":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X","download_json":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X.json","view_paper":"https://pith.science/paper/ABEHYU6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.3475&json=true","fetch_graph":"https://pith.science/api/pith-number/ABEHYU6PIDUK46MB6VLXR6CE7X/graph.json","fetch_events":"https://pith.science/api/pith-number/ABEHYU6PIDUK46MB6VLXR6CE7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/action/storage_attestation","attest_author":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/action/author_attestation","sign_citation":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/action/citation_signature","submit_replication":"https://pith.science/pith/ABEHYU6PIDUK46MB6VLXR6CE7X/action/replication_record"}},"created_at":"2026-05-17T23:47:06.264251+00:00","updated_at":"2026-05-17T23:47:06.264251+00:00"}