{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KAVVOTNDN4524TEBFE64HW2ZAK","short_pith_number":"pith:KAVVOTND","canonical_record":{"source":{"id":"1601.05137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T23:56:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98a72a738b09825afb3934fc7c13d2284880a464db0544ef62c00006385ed215","abstract_canon_sha256":"c9fb349c8ae8b4a5e68bc674d2fc4004078a1859b69086c35a84b6745ffd5d40"},"schema_version":"1.0"},"canonical_sha256":"502b574da36f3bae4c81293dc3db5902ab434ca9b911f17352f0d92ee747c5f2","source":{"kind":"arxiv","id":"1601.05137","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05137","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05137v3","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05137","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"KAVVOTNDN452","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KAVVOTNDN4524TEB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KAVVOTND","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KAVVOTNDN4524TEBFE64HW2ZAK","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T23:56:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98a72a738b09825afb3934fc7c13d2284880a464db0544ef62c00006385ed215","abstract_canon_sha256":"c9fb349c8ae8b4a5e68bc674d2fc4004078a1859b69086c35a84b6745ffd5d40"},"schema_version":"1.0"},"canonical_sha256":"502b574da36f3bae4c81293dc3db5902ab434ca9b911f17352f0d92ee747c5f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:25.453023Z","signature_b64":"8mVDTURMKVAq6MrAoDOjFC1nPCaaWB8NjoAlnHyuztNFh3LIKD5LIct0vO5s2i+L7iDuRiDcb+zjJfVDMAOFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"502b574da36f3bae4c81293dc3db5902ab434ca9b911f17352f0d92ee747c5f2","last_reissued_at":"2026-05-18T00:03:25.452311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:25.452311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05137","source_version":3,"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-18T00:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X30xMrhVmk/4KCcF7LyzGpHcKG0wivJmwS5JyBDwKAvAzevVpAn9aXk9XICK88hFSTd2Xes9fjj7WVpyjtnjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:37.330023Z"},"content_sha256":"5cf88d56dd744d576bed4a89bf9aaa5136b0b3696ccda2b137e55c80cb9bc9f3","schema_version":"1.0","event_id":"sha256:5cf88d56dd744d576bed4a89bf9aaa5136b0b3696ccda2b137e55c80cb9bc9f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KAVVOTNDN4524TEBFE64HW2ZAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Secure Network Coding for Two Unicast Sessions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Gaurav Kumar Agarwal, Martina Cardone","submitted_at":"2016-01-19T23:56:53Z","abstract_excerpt":"This paper characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to wiretap any one of the links. The capacity achieving schemes as well as the outer bounds are formulated as linear programs. The proposed strategies are then numerically evaluated and shown to achieve higher rate performances (up to a double single- or sum-rate) with respect to alternative strategies, where the network resources are time-shared among the two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05137","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"},"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-18T00:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnsM/69STFb8bEJeQuJrRfwMP4ouDCZJ3wptobIwUWk6AuJuSjMpUwJdkKGCvLFKcPb1kt/gqmdzL/Ygq7b7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:37.330677Z"},"content_sha256":"381fb4080f2572a87c49af1fb79cfa323f9e1591a57a8e2acb24ec8da6ffd088","schema_version":"1.0","event_id":"sha256:381fb4080f2572a87c49af1fb79cfa323f9e1591a57a8e2acb24ec8da6ffd088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAVVOTNDN4524TEBFE64HW2ZAK/bundle.json","state_url":"https://pith.science/pith/KAVVOTNDN4524TEBFE64HW2ZAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAVVOTNDN4524TEBFE64HW2ZAK/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-30T17:48:37Z","links":{"resolver":"https://pith.science/pith/KAVVOTNDN4524TEBFE64HW2ZAK","bundle":"https://pith.science/pith/KAVVOTNDN4524TEBFE64HW2ZAK/bundle.json","state":"https://pith.science/pith/KAVVOTNDN4524TEBFE64HW2ZAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAVVOTNDN4524TEBFE64HW2ZAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KAVVOTNDN4524TEBFE64HW2ZAK","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":"c9fb349c8ae8b4a5e68bc674d2fc4004078a1859b69086c35a84b6745ffd5d40","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T23:56:53Z","title_canon_sha256":"98a72a738b09825afb3934fc7c13d2284880a464db0544ef62c00006385ed215"},"schema_version":"1.0","source":{"id":"1601.05137","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05137","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05137v3","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05137","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"KAVVOTNDN452","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KAVVOTNDN4524TEB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KAVVOTND","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:381fb4080f2572a87c49af1fb79cfa323f9e1591a57a8e2acb24ec8da6ffd088","target":"graph","created_at":"2026-05-18T00:03:25Z","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 characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to wiretap any one of the links. The capacity achieving schemes as well as the outer bounds are formulated as linear programs. The proposed strategies are then numerically evaluated and shown to achieve higher rate performances (up to a double single- or sum-rate) with respect to alternative strategies, where the network resources are time-shared among the two","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":"2016-01-19T23:56:53Z","title":"On Secure Network Coding for Two Unicast Sessions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05137","kind":"arxiv","version":3},"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:5cf88d56dd744d576bed4a89bf9aaa5136b0b3696ccda2b137e55c80cb9bc9f3","target":"record","created_at":"2026-05-18T00:03:25Z","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":"c9fb349c8ae8b4a5e68bc674d2fc4004078a1859b69086c35a84b6745ffd5d40","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T23:56:53Z","title_canon_sha256":"98a72a738b09825afb3934fc7c13d2284880a464db0544ef62c00006385ed215"},"schema_version":"1.0","source":{"id":"1601.05137","kind":"arxiv","version":3}},"canonical_sha256":"502b574da36f3bae4c81293dc3db5902ab434ca9b911f17352f0d92ee747c5f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"502b574da36f3bae4c81293dc3db5902ab434ca9b911f17352f0d92ee747c5f2","first_computed_at":"2026-05-18T00:03:25.452311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:25.452311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8mVDTURMKVAq6MrAoDOjFC1nPCaaWB8NjoAlnHyuztNFh3LIKD5LIct0vO5s2i+L7iDuRiDcb+zjJfVDMAOFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:25.453023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05137","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cf88d56dd744d576bed4a89bf9aaa5136b0b3696ccda2b137e55c80cb9bc9f3","sha256:381fb4080f2572a87c49af1fb79cfa323f9e1591a57a8e2acb24ec8da6ffd088"],"state_sha256":"44498384d02ec301e3b2d59458fdb86c642e52087a09f094ad8d35a496a0779a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5bGBrFVD9ttNVPi8zIu1cA9lORGuhYigORph0sHI5o80BCNBzYBEqT2HoStVEYyOdMCU2d2pNjIQzP4f/wEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:48:37.333801Z","bundle_sha256":"043f8c5023823c8f52edd6ad85fb909864c296b1af6fcd0bd646d81dd78a4a15"}}