{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LPAKK3SSNL6CEIH3OCALAUSUNI","short_pith_number":"pith:LPAKK3SS","schema_version":"1.0","canonical_sha256":"5bc0a56e526afc2220fb7080b052546a2509707294ab8c9479963dcf6aa7306b","source":{"kind":"arxiv","id":"1506.01105","version":1},"attestation_state":"computed","paper":{"title":"The two-unicast problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, David Tse, Sudeep Kamath, Venkat Anantharam","submitted_at":"2015-06-03T01:39:28Z","abstract_excerpt":"We consider the communication capacity of wireline networks for a two-unicast traffic pattern. The network has two sources and two destinations with each source communicating a message to its own destination, subject to the capacity constraints on the directed edges of the network. We propose a simple outer bound for the problem that we call the Generalized Network Sharing (GNS) bound. We show this bound is the tightest edge-cut bound for two-unicast networks and is tight in several bottleneck cases, though it is not tight in general. We also show that the problem of computing the GNS bound is"},"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":"1506.01105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T01:39:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dd81e6484918e410d1459b5274606d62a164644389eb55c21a11e8513c996d5f","abstract_canon_sha256":"f9124ae7e837146dccce1735ac08f3163d0517e1e218d24ab590f3a82e05134c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:25.048519Z","signature_b64":"AB3uUlhunje9dWQ4C1HNPJ9OKMkcpO8KSJp+jb1NbOBwcohca3WaGd/oivhGu3rqFbwKpjUHlJJKeXBGvbGWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bc0a56e526afc2220fb7080b052546a2509707294ab8c9479963dcf6aa7306b","last_reissued_at":"2026-05-18T01:58:25.047937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:25.047937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The two-unicast problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, David Tse, Sudeep Kamath, Venkat Anantharam","submitted_at":"2015-06-03T01:39:28Z","abstract_excerpt":"We consider the communication capacity of wireline networks for a two-unicast traffic pattern. The network has two sources and two destinations with each source communicating a message to its own destination, subject to the capacity constraints on the directed edges of the network. We propose a simple outer bound for the problem that we call the Generalized Network Sharing (GNS) bound. We show this bound is the tightest edge-cut bound for two-unicast networks and is tight in several bottleneck cases, though it is not tight in general. We also show that the problem of computing the GNS bound is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01105","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":"1506.01105","created_at":"2026-05-18T01:58:25.048017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01105v1","created_at":"2026-05-18T01:58:25.048017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01105","created_at":"2026-05-18T01:58:25.048017+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPAKK3SSNL6C","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPAKK3SSNL6CEIH3","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPAKK3SS","created_at":"2026-05-18T12:29:29.992203+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/LPAKK3SSNL6CEIH3OCALAUSUNI","json":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI.json","graph_json":"https://pith.science/api/pith-number/LPAKK3SSNL6CEIH3OCALAUSUNI/graph.json","events_json":"https://pith.science/api/pith-number/LPAKK3SSNL6CEIH3OCALAUSUNI/events.json","paper":"https://pith.science/paper/LPAKK3SS"},"agent_actions":{"view_html":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI","download_json":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI.json","view_paper":"https://pith.science/paper/LPAKK3SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01105&json=true","fetch_graph":"https://pith.science/api/pith-number/LPAKK3SSNL6CEIH3OCALAUSUNI/graph.json","fetch_events":"https://pith.science/api/pith-number/LPAKK3SSNL6CEIH3OCALAUSUNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/action/storage_attestation","attest_author":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/action/author_attestation","sign_citation":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/action/citation_signature","submit_replication":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/action/replication_record"}},"created_at":"2026-05-18T01:58:25.048017+00:00","updated_at":"2026-05-18T01:58:25.048017+00:00"}