{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2TZRDBM5UAT5NE7GJGO65RJDGH","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":"4b894464a5beaa3937878649e54173d78e13ceb5fc068c32bfed86271592ef0b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T15:27:01Z","title_canon_sha256":"f0fd8ecdd5f72cd8ef8e23819cfd2d242bc14ef29e34cf1d52f60b68ecac9e23"},"schema_version":"1.0","source":{"id":"1901.03216","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03216","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03216v2","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03216","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"2TZRDBM5UAT5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2TZRDBM5UAT5NE7G","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2TZRDBM5","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:bc85af8b1981f0d2542e856df4f86643b56604bdd1ee5ec487ee524952132c1a","target":"graph","created_at":"2026-05-17T23:48:50Z","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":"This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to $m$ destinations, in the presence of a passive adversary who eavesdrops an unknown set of $k$ edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when $k=1$ and $m$ is arbitrary, or $m=3$ and $k$ is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-l","authors_text":"Christina Fragouli, Gaurav Kumar Agarwal, Martina Cardone","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T15:27:01Z","title":"On Secure Capacity of Multiple Unicast Traffic over Separable Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03216","kind":"arxiv","version":2},"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:3fd98ed9ddf90e8b1271cac03a415b512bd622a0e655c3e0aa17fea0a9a53b85","target":"record","created_at":"2026-05-17T23:48:50Z","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":"4b894464a5beaa3937878649e54173d78e13ceb5fc068c32bfed86271592ef0b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T15:27:01Z","title_canon_sha256":"f0fd8ecdd5f72cd8ef8e23819cfd2d242bc14ef29e34cf1d52f60b68ecac9e23"},"schema_version":"1.0","source":{"id":"1901.03216","kind":"arxiv","version":2}},"canonical_sha256":"d4f311859da027d693e6499deec52331e7e9843c51c567b4625c2269409c3110","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4f311859da027d693e6499deec52331e7e9843c51c567b4625c2269409c3110","first_computed_at":"2026-05-17T23:48:50.257544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:50.257544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VDNpg8+L2Nu8rNTg+jfmRexggP75ekump0HV5LQoYmtfuh/qNI8yab9HcQFt9ZEBnCU4ZzB0Y07OjhFHpF2rCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:50.258172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03216","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fd98ed9ddf90e8b1271cac03a415b512bd622a0e655c3e0aa17fea0a9a53b85","sha256:bc85af8b1981f0d2542e856df4f86643b56604bdd1ee5ec487ee524952132c1a"],"state_sha256":"ae498fbcaca6ce3657f4e638204897ddf38214c2fb911feb988774c460e75afe"}