{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:E2EEJBPW55JC552RNOCCUWGJPW","short_pith_number":"pith:E2EEJBPW","schema_version":"1.0","canonical_sha256":"26884485f6ef522ef7516b842a58c97d9aa363de5ab738abe53cee26b2ea4d5c","source":{"kind":"arxiv","id":"1806.03408","version":1},"attestation_state":"computed","paper":{"title":"An Optimization Approach to the Langberg-M\\'edard Multiple Unicast Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guangyue Han, Kai Cai","submitted_at":"2018-06-09T04:22:02Z","abstract_excerpt":"The Langberg-M\\'edard multiple unicast conjecture claims that for any strongly reachable $k$-pair network, there exists a multi-flow with rate $(1,1,\\dots,1)$. In a previous work, through combining and concatenating the so-called elementary flows, we have constructed a multi-flow with rate at least $(\\frac{8}{9}, \\frac{8}{9}, \\dots, \\frac{8}{9})$ for any $k$. In this paper, we examine an optimization problem arising from this construction framework. We first show that our previous construction yields a sequence of asymptotically optimal solutions to the aforementioned optimization problem. And"},"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":"1806.03408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-09T04:22:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a43915c78de165b843369c43a1b739deac26da65db899e5f1d08c915fc811796","abstract_canon_sha256":"475052237fb936945b610cb7f974ecdb78e463b4b06530e87abb3a9dad7c9ee6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:43.479599Z","signature_b64":"UvAMu5mnTnFK/0mt/FuUz8bDew44L0Iy4cCZcaR4hTWGRGgipLT+5EA98O0wK0NDZ23cNxcSX9y80RjKbruODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26884485f6ef522ef7516b842a58c97d9aa363de5ab738abe53cee26b2ea4d5c","last_reissued_at":"2026-05-18T00:13:43.478801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:43.478801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimization Approach to the Langberg-M\\'edard Multiple Unicast Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guangyue Han, Kai Cai","submitted_at":"2018-06-09T04:22:02Z","abstract_excerpt":"The Langberg-M\\'edard multiple unicast conjecture claims that for any strongly reachable $k$-pair network, there exists a multi-flow with rate $(1,1,\\dots,1)$. In a previous work, through combining and concatenating the so-called elementary flows, we have constructed a multi-flow with rate at least $(\\frac{8}{9}, \\frac{8}{9}, \\dots, \\frac{8}{9})$ for any $k$. In this paper, we examine an optimization problem arising from this construction framework. We first show that our previous construction yields a sequence of asymptotically optimal solutions to the aforementioned optimization problem. And"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03408","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":"1806.03408","created_at":"2026-05-18T00:13:43.478918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03408v1","created_at":"2026-05-18T00:13:43.478918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03408","created_at":"2026-05-18T00:13:43.478918+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2EEJBPW55JC","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2EEJBPW55JC552R","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2EEJBPW","created_at":"2026-05-18T12:32:19.392346+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/E2EEJBPW55JC552RNOCCUWGJPW","json":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW.json","graph_json":"https://pith.science/api/pith-number/E2EEJBPW55JC552RNOCCUWGJPW/graph.json","events_json":"https://pith.science/api/pith-number/E2EEJBPW55JC552RNOCCUWGJPW/events.json","paper":"https://pith.science/paper/E2EEJBPW"},"agent_actions":{"view_html":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW","download_json":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW.json","view_paper":"https://pith.science/paper/E2EEJBPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03408&json=true","fetch_graph":"https://pith.science/api/pith-number/E2EEJBPW55JC552RNOCCUWGJPW/graph.json","fetch_events":"https://pith.science/api/pith-number/E2EEJBPW55JC552RNOCCUWGJPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/action/storage_attestation","attest_author":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/action/author_attestation","sign_citation":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/action/citation_signature","submit_replication":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/action/replication_record"}},"created_at":"2026-05-18T00:13:43.478918+00:00","updated_at":"2026-05-18T00:13:43.478918+00:00"}