{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G76IPTYXWWXORFJL24AIEE3PN2","short_pith_number":"pith:G76IPTYX","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"},"canonical_sha256":"37fc87cf17b5aee8952bd70082136f6e91c263a483a449307f91cb7f098a1260","source":{"kind":"arxiv","id":"1605.01834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01834","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01834v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01834","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"G76IPTYXWWXO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G76IPTYXWWXORFJL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G76IPTYX","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G76IPTYXWWXORFJL24AIEE3PN2","target":"record","payload":{"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"},"canonical_sha256":"37fc87cf17b5aee8952bd70082136f6e91c263a483a449307f91cb7f098a1260","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"},"source_kind":"arxiv","source_id":"1605.01834","source_version":1,"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-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPwrtgeaHTuSeqoIEiMyyG6P4kdc2NiDIetaZ/kq9AHaNc13tCBXdlNuzqbaYeNSkuBuHuViQaeeAvj/vkRBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:13:29.270801Z"},"content_sha256":"87ff798b6c2b51514f805e4d388d54948311ae12875674f30e8cd394f9a886ee","schema_version":"1.0","event_id":"sha256:87ff798b6c2b51514f805e4d388d54948311ae12875674f30e8cd394f9a886ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G76IPTYXWWXORFJL24AIEE3PN2","target":"graph","payload":{"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"},"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-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMk9PbYp4wYp1eG7x2S4JQ2qpdl42yncgkQoSvl/Xi3Y7CQ60zVNzJCLoTNh5gb0EWn2zRlkUQcBDPZSzbv+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:13:29.271495Z"},"content_sha256":"5b55d5da67e46fd8d0d5a15ccab31566dde726a696760457932f3a658560f3fa","schema_version":"1.0","event_id":"sha256:5b55d5da67e46fd8d0d5a15ccab31566dde726a696760457932f3a658560f3fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/bundle.json","state_url":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G76IPTYXWWXORFJL24AIEE3PN2/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-05-28T00:13:29Z","links":{"resolver":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2","bundle":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/bundle.json","state":"https://pith.science/pith/G76IPTYXWWXORFJL24AIEE3PN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G76IPTYXWWXORFJL24AIEE3PN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G76IPTYXWWXORFJL24AIEE3PN2","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":"895b567f0b702fbaad3acdad429c9fc04b0f64c9ea81aa51037002ce82600df8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T06:26:54Z","title_canon_sha256":"a75d8f045137b896d6dcca38ff19a9638d6209b6eff245cc5b7cb5264a9f9616"},"schema_version":"1.0","source":{"id":"1605.01834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01834","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01834v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01834","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"G76IPTYXWWXO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G76IPTYXWWXORFJL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G76IPTYX","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:5b55d5da67e46fd8d0d5a15ccab31566dde726a696760457932f3a658560f3fa","target":"graph","created_at":"2026-05-18T01:15:31Z","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 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 ","authors_text":"Mayank Bakshi, Oliver Kosut, Peida Tian, Sidharth Jaggi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T06:26:54Z","title":"Arbitrarily Varying Networks: Capacity-achieving Computationally Efficient Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01834","kind":"arxiv","version":1},"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:87ff798b6c2b51514f805e4d388d54948311ae12875674f30e8cd394f9a886ee","target":"record","created_at":"2026-05-18T01:15:31Z","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":"895b567f0b702fbaad3acdad429c9fc04b0f64c9ea81aa51037002ce82600df8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T06:26:54Z","title_canon_sha256":"a75d8f045137b896d6dcca38ff19a9638d6209b6eff245cc5b7cb5264a9f9616"},"schema_version":"1.0","source":{"id":"1605.01834","kind":"arxiv","version":1}},"canonical_sha256":"37fc87cf17b5aee8952bd70082136f6e91c263a483a449307f91cb7f098a1260","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37fc87cf17b5aee8952bd70082136f6e91c263a483a449307f91cb7f098a1260","first_computed_at":"2026-05-18T01:15:31.225462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:31.225462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eu7cNHsqIjxsm1p4B9fFR9k3FBUk0l6aR804nOANvoHneyMBglIrrCjO8W9km4o/hDzzSBGgUgfNwlJwPQpuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:31.226060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87ff798b6c2b51514f805e4d388d54948311ae12875674f30e8cd394f9a886ee","sha256:5b55d5da67e46fd8d0d5a15ccab31566dde726a696760457932f3a658560f3fa"],"state_sha256":"f5319f1072353b2fa910cc25aa03b04f0efc8a77b14671bb65ca478f849d9c2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8WeVyzuIKrVX72yUxYqZiHB8AAZtjvGp4DQAHpdoX3qNgO4iHOStIOkh588kkO/1bzDqClm+zD4pDtvCXNUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:13:29.275099Z","bundle_sha256":"0828fcdace318e5af2946fee9fbe6c1bd6b70c3b55dc5876751a8a18c154e7bf"}}