{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LSGHSP6IFR4FOSO5X463A3IEDX","short_pith_number":"pith:LSGHSP6I","schema_version":"1.0","canonical_sha256":"5c8c793fc82c785749ddbf3db06d041dd3c2a63f3ea61a24dfd50822d6f6fa0c","source":{"kind":"arxiv","id":"1212.3859","version":2},"attestation_state":"computed","paper":{"title":"On Capacity Region of Wiretap Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shirin Jalali, Tracey Ho","submitted_at":"2012-12-17T01:53:06Z","abstract_excerpt":"In this paper we consider the problem of secure network coding where an adversary has access to an unknown subset of links chosen from a known collection of links subsets. We study the capacity region of such networks, commonly called \"wiretap networks\", subject to weak and strong secrecy constraints, and consider both zero-error and asymptotically zero-error communication. We prove that in general discrete memoryless networks modeled by discrete memoryless channels, the capacity region subject to strong secrecy requirement and the capacity region subject to weak secrecy requirement are equal."},"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":"1212.3859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-17T01:53:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"349d62b0f3822caa9f61ee2a321ff1f3f62442697ba57eda6bd8e7459b6b827d","abstract_canon_sha256":"b5d69e647866f1b89fd9fb2bec592326accbf302064d4e22e3cdd47fed822087"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:22.358443Z","signature_b64":"Vw9gXhNCwWamkquULywsBIdV2Mv8rrH98ZXDWQ3wcRtsACKoaZnYLzQORyGDLfL/i75PSa6Er4PH8wh44G6nAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c8c793fc82c785749ddbf3db06d041dd3c2a63f3ea61a24dfd50822d6f6fa0c","last_reissued_at":"2026-05-18T03:06:22.357420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:22.357420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Capacity Region of Wiretap Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shirin Jalali, Tracey Ho","submitted_at":"2012-12-17T01:53:06Z","abstract_excerpt":"In this paper we consider the problem of secure network coding where an adversary has access to an unknown subset of links chosen from a known collection of links subsets. We study the capacity region of such networks, commonly called \"wiretap networks\", subject to weak and strong secrecy constraints, and consider both zero-error and asymptotically zero-error communication. We prove that in general discrete memoryless networks modeled by discrete memoryless channels, the capacity region subject to strong secrecy requirement and the capacity region subject to weak secrecy requirement are equal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3859","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.3859","created_at":"2026-05-18T03:06:22.357586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3859v2","created_at":"2026-05-18T03:06:22.357586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3859","created_at":"2026-05-18T03:06:22.357586+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSGHSP6IFR4F","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSGHSP6IFR4FOSO5","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSGHSP6I","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03522","citing_title":"Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX","json":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX.json","graph_json":"https://pith.science/api/pith-number/LSGHSP6IFR4FOSO5X463A3IEDX/graph.json","events_json":"https://pith.science/api/pith-number/LSGHSP6IFR4FOSO5X463A3IEDX/events.json","paper":"https://pith.science/paper/LSGHSP6I"},"agent_actions":{"view_html":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX","download_json":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX.json","view_paper":"https://pith.science/paper/LSGHSP6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3859&json=true","fetch_graph":"https://pith.science/api/pith-number/LSGHSP6IFR4FOSO5X463A3IEDX/graph.json","fetch_events":"https://pith.science/api/pith-number/LSGHSP6IFR4FOSO5X463A3IEDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX/action/storage_attestation","attest_author":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX/action/author_attestation","sign_citation":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX/action/citation_signature","submit_replication":"https://pith.science/pith/LSGHSP6IFR4FOSO5X463A3IEDX/action/replication_record"}},"created_at":"2026-05-18T03:06:22.357586+00:00","updated_at":"2026-05-18T03:06:22.357586+00:00"}