{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LPAKK3SSNL6CEIH3OCALAUSUNI","short_pith_number":"pith:LPAKK3SS","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"},"canonical_sha256":"5bc0a56e526afc2220fb7080b052546a2509707294ab8c9479963dcf6aa7306b","source":{"kind":"arxiv","id":"1506.01105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01105","created_at":"2026-05-18T01:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01105v1","created_at":"2026-05-18T01:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01105","created_at":"2026-05-18T01:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"LPAKK3SSNL6C","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPAKK3SSNL6CEIH3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPAKK3SS","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LPAKK3SSNL6CEIH3OCALAUSUNI","target":"record","payload":{"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"},"canonical_sha256":"5bc0a56e526afc2220fb7080b052546a2509707294ab8c9479963dcf6aa7306b","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"},"source_kind":"arxiv","source_id":"1506.01105","source_version":1,"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-18T01:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkn/nVFHcMpVbg75nbVNAXXEaHw8AeCB+s8vsecsT6SbrLqJiSTMtwnIwqYpT131bADHWTAMphfJb/6YYILICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:45:12.672995Z"},"content_sha256":"d58547bf8c84b5e6478fe8cdff95096a590b17585142af2eb6238bd89c8793d7","schema_version":"1.0","event_id":"sha256:d58547bf8c84b5e6478fe8cdff95096a590b17585142af2eb6238bd89c8793d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LPAKK3SSNL6CEIH3OCALAUSUNI","target":"graph","payload":{"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"},"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-18T01:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnmiXhs74Wx9Tgg6RcNHrQ0fdhvO93ZsiDYKl5l8pw4VycSTurNgFRPRI+nf6DheUtj9SiYWnD0PQkyrIbsMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:45:12.673505Z"},"content_sha256":"7bae958493bc4a5dfccf1ae14396a8df828290eafc9b2201009b623408c5a3b4","schema_version":"1.0","event_id":"sha256:7bae958493bc4a5dfccf1ae14396a8df828290eafc9b2201009b623408c5a3b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/bundle.json","state_url":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/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-22T01:45:12Z","links":{"resolver":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI","bundle":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/bundle.json","state":"https://pith.science/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPAKK3SSNL6CEIH3OCALAUSUNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LPAKK3SSNL6CEIH3OCALAUSUNI","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":"f9124ae7e837146dccce1735ac08f3163d0517e1e218d24ab590f3a82e05134c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T01:39:28Z","title_canon_sha256":"dd81e6484918e410d1459b5274606d62a164644389eb55c21a11e8513c996d5f"},"schema_version":"1.0","source":{"id":"1506.01105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01105","created_at":"2026-05-18T01:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01105v1","created_at":"2026-05-18T01:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01105","created_at":"2026-05-18T01:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"LPAKK3SSNL6C","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPAKK3SSNL6CEIH3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPAKK3SS","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:7bae958493bc4a5dfccf1ae14396a8df828290eafc9b2201009b623408c5a3b4","target":"graph","created_at":"2026-05-18T01:58: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":"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","authors_text":"Chih-Chun Wang, David Tse, Sudeep Kamath, Venkat Anantharam","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T01:39:28Z","title":"The two-unicast problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01105","kind":"arxiv","version":1},"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:d58547bf8c84b5e6478fe8cdff95096a590b17585142af2eb6238bd89c8793d7","target":"record","created_at":"2026-05-18T01:58: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":"f9124ae7e837146dccce1735ac08f3163d0517e1e218d24ab590f3a82e05134c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T01:39:28Z","title_canon_sha256":"dd81e6484918e410d1459b5274606d62a164644389eb55c21a11e8513c996d5f"},"schema_version":"1.0","source":{"id":"1506.01105","kind":"arxiv","version":1}},"canonical_sha256":"5bc0a56e526afc2220fb7080b052546a2509707294ab8c9479963dcf6aa7306b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bc0a56e526afc2220fb7080b052546a2509707294ab8c9479963dcf6aa7306b","first_computed_at":"2026-05-18T01:58:25.047937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:25.047937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AB3uUlhunje9dWQ4C1HNPJ9OKMkcpO8KSJp+jb1NbOBwcohca3WaGd/oivhGu3rqFbwKpjUHlJJKeXBGvbGWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:25.048519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d58547bf8c84b5e6478fe8cdff95096a590b17585142af2eb6238bd89c8793d7","sha256:7bae958493bc4a5dfccf1ae14396a8df828290eafc9b2201009b623408c5a3b4"],"state_sha256":"b0a16a5f8100996e383c691d2017aeb421dea813c09376620a972e4e838d03b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pl81o9vGEdffrbXsK4a993sJJhGN7vFAqpepOsJtu4Kz364etmmulwVC+YNU26DXyJPEY/cgtBpxzCMWhSBfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T01:45:12.676891Z","bundle_sha256":"f882a6bbbee15b7f7405527260d081dab62262c0b6fe94efbe813196a8a2337c"}}