{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E2EEJBPW55JC552RNOCCUWGJPW","short_pith_number":"pith:E2EEJBPW","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"},"canonical_sha256":"26884485f6ef522ef7516b842a58c97d9aa363de5ab738abe53cee26b2ea4d5c","source":{"kind":"arxiv","id":"1806.03408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03408","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03408v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03408","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"E2EEJBPW55JC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2EEJBPW55JC552R","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2EEJBPW","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E2EEJBPW55JC552RNOCCUWGJPW","target":"record","payload":{"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"},"canonical_sha256":"26884485f6ef522ef7516b842a58c97d9aa363de5ab738abe53cee26b2ea4d5c","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"},"source_kind":"arxiv","source_id":"1806.03408","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-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TXL0me2I7se9Lr7dbJRyZhih3AEhb7nuxnuwW848gVsB4nDSt/H4aWbKaPidB1x+CUecMYCJABsVFl79yoHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:48:08.233703Z"},"content_sha256":"e27339e55a7ed7825bfe272fa95597ebce95c58bb4e462c9ed3d468a92da4a4e","schema_version":"1.0","event_id":"sha256:e27339e55a7ed7825bfe272fa95597ebce95c58bb4e462c9ed3d468a92da4a4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E2EEJBPW55JC552RNOCCUWGJPW","target":"graph","payload":{"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"},"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-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycwFfOLRD9xqt++JlWZrT4Xgh0cotezg41qGbdCcsXP6e+UfmJIQmwf8HL+cxZCn9e7IoDsLjJOr7GibBpwWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:48:08.234043Z"},"content_sha256":"f48d464a5ec606b9a9d7e552c4332903b8c5b48f51f2b3041472d56c1db8137b","schema_version":"1.0","event_id":"sha256:f48d464a5ec606b9a9d7e552c4332903b8c5b48f51f2b3041472d56c1db8137b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/bundle.json","state_url":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2EEJBPW55JC552RNOCCUWGJPW/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-06-23T05:48:08Z","links":{"resolver":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW","bundle":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/bundle.json","state":"https://pith.science/pith/E2EEJBPW55JC552RNOCCUWGJPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2EEJBPW55JC552RNOCCUWGJPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E2EEJBPW55JC552RNOCCUWGJPW","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":"475052237fb936945b610cb7f974ecdb78e463b4b06530e87abb3a9dad7c9ee6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-09T04:22:02Z","title_canon_sha256":"a43915c78de165b843369c43a1b739deac26da65db899e5f1d08c915fc811796"},"schema_version":"1.0","source":{"id":"1806.03408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03408","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03408v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03408","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"E2EEJBPW55JC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2EEJBPW55JC552R","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2EEJBPW","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:f48d464a5ec606b9a9d7e552c4332903b8c5b48f51f2b3041472d56c1db8137b","target":"graph","created_at":"2026-05-18T00:13:43Z","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 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","authors_text":"Guangyue Han, Kai Cai","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-09T04:22:02Z","title":"An Optimization Approach to the Langberg-M\\'edard Multiple Unicast Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03408","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:e27339e55a7ed7825bfe272fa95597ebce95c58bb4e462c9ed3d468a92da4a4e","target":"record","created_at":"2026-05-18T00:13:43Z","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":"475052237fb936945b610cb7f974ecdb78e463b4b06530e87abb3a9dad7c9ee6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-09T04:22:02Z","title_canon_sha256":"a43915c78de165b843369c43a1b739deac26da65db899e5f1d08c915fc811796"},"schema_version":"1.0","source":{"id":"1806.03408","kind":"arxiv","version":1}},"canonical_sha256":"26884485f6ef522ef7516b842a58c97d9aa363de5ab738abe53cee26b2ea4d5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26884485f6ef522ef7516b842a58c97d9aa363de5ab738abe53cee26b2ea4d5c","first_computed_at":"2026-05-18T00:13:43.478801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:43.478801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UvAMu5mnTnFK/0mt/FuUz8bDew44L0Iy4cCZcaR4hTWGRGgipLT+5EA98O0wK0NDZ23cNxcSX9y80RjKbruODA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:43.479599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e27339e55a7ed7825bfe272fa95597ebce95c58bb4e462c9ed3d468a92da4a4e","sha256:f48d464a5ec606b9a9d7e552c4332903b8c5b48f51f2b3041472d56c1db8137b"],"state_sha256":"d66724ea5abb375149c5c202dda1cc176c660002f5f7656ec22314b1cbb3675c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/IQLI5UGxi6UmfntTLbZRbcg10ISR+C0t9Z5A8bnR1NIh33jijiPfkTGT211IGaTYl8TjvtrfuJUbcJo8laDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:48:08.236045Z","bundle_sha256":"7e548fdc70c5eeb2ce90fb65a9d8c288ffc7275382bff711d10e87d545e57615"}}