{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RFJ744GOCXVHMEAYXFNMJTDCUW","short_pith_number":"pith:RFJ744GO","canonical_record":{"source":{"id":"1004.1236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-08T03:43:15Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"f8e920d51bbd70d2445db6195a3c6ce2403a1e60e3e8b1eacbcd33be4227912a","abstract_canon_sha256":"904e61616df6a4284c7fdf6328f1ed232062a9029c5105b29cbd3753b4821a88"},"schema_version":"1.0"},"canonical_sha256":"8953fe70ce15ea761018b95ac4cc62a5adff16e8cf224f43a1599b7d42a5a48c","source":{"kind":"arxiv","id":"1004.1236","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1236","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1236v2","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1236","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"RFJ744GOCXVH","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RFJ744GOCXVHMEAY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RFJ744GO","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RFJ744GOCXVHMEAYXFNMJTDCUW","target":"record","payload":{"canonical_record":{"source":{"id":"1004.1236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-08T03:43:15Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"f8e920d51bbd70d2445db6195a3c6ce2403a1e60e3e8b1eacbcd33be4227912a","abstract_canon_sha256":"904e61616df6a4284c7fdf6328f1ed232062a9029c5105b29cbd3753b4821a88"},"schema_version":"1.0"},"canonical_sha256":"8953fe70ce15ea761018b95ac4cc62a5adff16e8cf224f43a1599b7d42a5a48c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:37.873201Z","signature_b64":"f7tAickbk1cRKExcy7nRFZDviRSMbMhrIJo28THE6JvMf3EHpPpVe3djQ9lwpAuWShA2k7dNYrvhWHYYPNiQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8953fe70ce15ea761018b95ac4cc62a5adff16e8cf224f43a1599b7d42a5a48c","last_reissued_at":"2026-05-18T04:02:37.872388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:37.872388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.1236","source_version":2,"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-18T04:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ky9JpG77HEOcbgNSW/yP2SVeRtBjxzBtE/ppy8A+czhDS+EeoZNMgSEUHK/sZrOz8g2NHACHQPfgi29s28oqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:13:59.653075Z"},"content_sha256":"bf80cd346a2a0b4f3886d0c225c4737080db377ba10bc0ef54824f885ba24dba","schema_version":"1.0","event_id":"sha256:bf80cd346a2a0b4f3886d0c225c4737080db377ba10bc0ef54824f885ba24dba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RFJ744GOCXVHMEAYXFNMJTDCUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Describing the Routing Capacity Regions of Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"math.OC","authors_text":"Ali Kakhbod, S. M. Sadegh Tabatabaei Yazdi","submitted_at":"2010-04-08T03:43:15Z","abstract_excerpt":"The routing capacity region of networks with multiple unicast sessions can be characterized using Farkas' lemma as an infinite set of linear inequalities. In this paper this result is sharpened by exploiting properties of the solution satisfied by each rate-tuple on the boundary of the capacity region, and a finite description of the routing capacity region which depends on network parameters is offered. For the special case of undirected ring networks additional results on the complexity of the description are provided."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1236","kind":"arxiv","version":2},"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-18T04:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sseJATc0hbVdwTRNjkkBGVejKGD/HBcXYuuwpuVeKqmr7KVKVNLbn1QBU7lA6FIS/WgYevFau3IYAGf8irFpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:13:59.653801Z"},"content_sha256":"efa747699b79dcc7e4dd9d80b5414b63b94ca9272edfc3b5ef8e2e449b5c1c98","schema_version":"1.0","event_id":"sha256:efa747699b79dcc7e4dd9d80b5414b63b94ca9272edfc3b5ef8e2e449b5c1c98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFJ744GOCXVHMEAYXFNMJTDCUW/bundle.json","state_url":"https://pith.science/pith/RFJ744GOCXVHMEAYXFNMJTDCUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFJ744GOCXVHMEAYXFNMJTDCUW/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-29T16:13:59Z","links":{"resolver":"https://pith.science/pith/RFJ744GOCXVHMEAYXFNMJTDCUW","bundle":"https://pith.science/pith/RFJ744GOCXVHMEAYXFNMJTDCUW/bundle.json","state":"https://pith.science/pith/RFJ744GOCXVHMEAYXFNMJTDCUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFJ744GOCXVHMEAYXFNMJTDCUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RFJ744GOCXVHMEAYXFNMJTDCUW","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":"904e61616df6a4284c7fdf6328f1ed232062a9029c5105b29cbd3753b4821a88","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-08T03:43:15Z","title_canon_sha256":"f8e920d51bbd70d2445db6195a3c6ce2403a1e60e3e8b1eacbcd33be4227912a"},"schema_version":"1.0","source":{"id":"1004.1236","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1236","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1236v2","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1236","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"RFJ744GOCXVH","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RFJ744GOCXVHMEAY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RFJ744GO","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:efa747699b79dcc7e4dd9d80b5414b63b94ca9272edfc3b5ef8e2e449b5c1c98","target":"graph","created_at":"2026-05-18T04:02:37Z","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":"The routing capacity region of networks with multiple unicast sessions can be characterized using Farkas' lemma as an infinite set of linear inequalities. In this paper this result is sharpened by exploiting properties of the solution satisfied by each rate-tuple on the boundary of the capacity region, and a finite description of the routing capacity region which depends on network parameters is offered. For the special case of undirected ring networks additional results on the complexity of the description are provided.","authors_text":"Ali Kakhbod, S. M. Sadegh Tabatabaei Yazdi","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-08T03:43:15Z","title":"On Describing the Routing Capacity Regions of Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1236","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:bf80cd346a2a0b4f3886d0c225c4737080db377ba10bc0ef54824f885ba24dba","target":"record","created_at":"2026-05-18T04:02:37Z","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":"904e61616df6a4284c7fdf6328f1ed232062a9029c5105b29cbd3753b4821a88","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-08T03:43:15Z","title_canon_sha256":"f8e920d51bbd70d2445db6195a3c6ce2403a1e60e3e8b1eacbcd33be4227912a"},"schema_version":"1.0","source":{"id":"1004.1236","kind":"arxiv","version":2}},"canonical_sha256":"8953fe70ce15ea761018b95ac4cc62a5adff16e8cf224f43a1599b7d42a5a48c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8953fe70ce15ea761018b95ac4cc62a5adff16e8cf224f43a1599b7d42a5a48c","first_computed_at":"2026-05-18T04:02:37.872388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:37.872388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f7tAickbk1cRKExcy7nRFZDviRSMbMhrIJo28THE6JvMf3EHpPpVe3djQ9lwpAuWShA2k7dNYrvhWHYYPNiQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:37.873201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.1236","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf80cd346a2a0b4f3886d0c225c4737080db377ba10bc0ef54824f885ba24dba","sha256:efa747699b79dcc7e4dd9d80b5414b63b94ca9272edfc3b5ef8e2e449b5c1c98"],"state_sha256":"0313282c1c4390020dfb00698e6ff29cc1151450852c300e71db970f4a703b03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOisfR2Yzec74kByc7ECqgH7zjI6sy482xgH1M9xSNjjGry/BC+YQFOdnUWMxobRLyWgGSTteiuiyAH7EenhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:13:59.658057Z","bundle_sha256":"fb80e1b574dcbf545b24acfb4120ef0e42fd36ac1e2105a758c8e547a28cd848"}}