{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AR4LMSTFTUKU4NYEJV5BHJVIOI","short_pith_number":"pith:AR4LMSTF","schema_version":"1.0","canonical_sha256":"0478b64a659d154e37044d7a13a6a87222dae07658553c16ecfe9e21729ff6f2","source":{"kind":"arxiv","id":"1901.02787","version":1},"attestation_state":"computed","paper":{"title":"On Secure Network Coding for Multiple Unicast Traffic","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":"2019-01-09T15:50:48Z","abstract_excerpt":"This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. First, an outer bound on the secure cap"},"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":"1901.02787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T15:50:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5cdd73a4ff646fd5b85c7a0cb2834be0f4374c3a5d39adda04c8520eff551242","abstract_canon_sha256":"913d5b286f1aaf60b78fc6e98c0d906f1ade1402f56d92fa33db2811eb5fd6b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:39.450632Z","signature_b64":"6nAq1zRY3fJgJbBYO35wNqbqfCU+ioP3tr5OexYqrtyJ1scIumkpZuJIzHbKZb93FvOxEEhqT9+aBjC5VkZ6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0478b64a659d154e37044d7a13a6a87222dae07658553c16ecfe9e21729ff6f2","last_reissued_at":"2026-05-17T23:56:39.450124Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:39.450124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Secure Network Coding for Multiple Unicast Traffic","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":"2019-01-09T15:50:48Z","abstract_excerpt":"This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. First, an outer bound on the secure cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02787","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":"1901.02787","created_at":"2026-05-17T23:56:39.450194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02787v1","created_at":"2026-05-17T23:56:39.450194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02787","created_at":"2026-05-17T23:56:39.450194+00:00"},{"alias_kind":"pith_short_12","alias_value":"AR4LMSTFTUKU","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AR4LMSTFTUKU4NYE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AR4LMSTF","created_at":"2026-05-18T12:33:12.712433+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/AR4LMSTFTUKU4NYEJV5BHJVIOI","json":"https://pith.science/pith/AR4LMSTFTUKU4NYEJV5BHJVIOI.json","graph_json":"https://pith.science/api/pith-number/AR4LMSTFTUKU4NYEJV5BHJVIOI/graph.json","events_json":"https://pith.science/api/pith-number/AR4LMSTFTUKU4NYEJV5BHJVIOI/events.json","paper":"https://pith.science/paper/AR4LMSTF"},"agent_actions":{"view_html":"https://pith.science/pith/AR4LMSTFTUKU4NYEJV5BHJVIOI","download_json":"https://pith.science/pith/AR4LMSTFTUKU4NYEJV5BHJVIOI.json","view_paper":"https://pith.science/paper/AR4LMSTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02787&json=true","fetch_graph":"https://pith.science/api/pith-number/AR4LMSTFTUKU4NYEJV5BHJVIOI/graph.json","fetch_events":"https://pith.science/api/pith-number/AR4LMSTFTUKU4NYEJV5BHJVIOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AR4LMSTFTUKU4NYEJV5BHJVIOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AR4LMSTFTUKU4NYEJV5BHJVIOI/action/storage_attestation","attest_author":"https://pith.science/pith/AR4LMSTFTUKU4NYEJV5BHJVIOI/action/author_attestation","sign_citation":"https://pith.science/pith/AR4LMSTFTUKU4NYEJV5BHJVIOI/action/citation_signature","submit_replication":"https://pith.science/pith/AR4LMSTFTUKU4NYEJV5BHJVIOI/action/replication_record"}},"created_at":"2026-05-17T23:56:39.450194+00:00","updated_at":"2026-05-17T23:56:39.450194+00:00"}