{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G76IPTYXWWXORFJL24AIEE3PN2","short_pith_number":"pith:G76IPTYX","schema_version":"1.0","canonical_sha256":"37fc87cf17b5aee8952bd70082136f6e91c263a483a449307f91cb7f098a1260","source":{"kind":"arxiv","id":"1605.01834","version":1},"attestation_state":"computed","paper":{"title":"Arbitrarily Varying Networks: Capacity-achieving Computationally Efficient Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Oliver Kosut, Peida Tian, Sidharth Jaggi","submitted_at":"2016-05-06T06:26:54Z","abstract_excerpt":"We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the adversaries can control a subset of nodes, and know the message, network code and packets on all links. Characterizing information-theoretically optimal communication rates as a function of network parameters and bounds on the adversarially controlled network is in general open, even for unicast (single source, single destination) problems. In this work we "},"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":"1605.01834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T06:26:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a75d8f045137b896d6dcca38ff19a9638d6209b6eff245cc5b7cb5264a9f9616","abstract_canon_sha256":"895b567f0b702fbaad3acdad429c9fc04b0f64c9ea81aa51037002ce82600df8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:31.226060Z","signature_b64":"Eu7cNHsqIjxsm1p4B9fFR9k3FBUk0l6aR804nOANvoHneyMBglIrrCjO8W9km4o/hDzzSBGgUgfNwlJwPQpuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37fc87cf17b5aee8952bd70082136f6e91c263a483a449307f91cb7f098a1260","last_reissued_at":"2026-05-18T01:15:31.225462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:31.225462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arbitrarily Varying Networks: Capacity-achieving Computationally Efficient Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Oliver Kosut, Peida Tian, Sidharth Jaggi","submitted_at":"2016-05-06T06:26:54Z","abstract_excerpt":"We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the adversaries can control a subset of nodes, and know the message, network code and packets on all links. Characterizing information-theoretically optimal communication rates as a function of network parameters and bounds on the adversarially controlled network is in general open, even for unicast (single source, single destination) problems. In this work we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01834","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.01834","created_at":"2026-05-18T01:15:31.225535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01834v1","created_at":"2026-05-18T01:15:31.225535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01834","created_at":"2026-05-18T01:15:31.225535+00:00"},{"alias_kind":"pith_short_12","alias_value":"G76IPTYXWWXO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G76IPTYXWWXORFJL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G76IPTYX","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2","json":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2.json","graph_json":"https://pith.science/api/pith-number/G76IPTYXWWXORFJL24AIEE3PN2/graph.json","events_json":"https://pith.science/api/pith-number/G76IPTYXWWXORFJL24AIEE3PN2/events.json","paper":"https://pith.science/paper/G76IPTYX"},"agent_actions":{"view_html":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2","download_json":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2.json","view_paper":"https://pith.science/paper/G76IPTYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01834&json=true","fetch_graph":"https://pith.science/api/pith-number/G76IPTYXWWXORFJL24AIEE3PN2/graph.json","fetch_events":"https://pith.science/api/pith-number/G76IPTYXWWXORFJL24AIEE3PN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/action/storage_attestation","attest_author":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/action/author_attestation","sign_citation":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/action/citation_signature","submit_replication":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/action/replication_record"}},"created_at":"2026-05-18T01:15:31.225535+00:00","updated_at":"2026-05-18T01:15:31.225535+00:00"}