{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MPTIWURBAKWPI3BP5UOUY6LQSM","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":"6075333ea383c8cbea222be8654eaa40b233bde11323757dbd29922bc3ca79cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-19T11:43:59Z","title_canon_sha256":"63f4ae8ad935d3d898155e7dd842564af4c92f5a9d4067966809fc2b94634d6a"},"schema_version":"1.0","source":{"id":"1108.3944","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3944","created_at":"2026-05-18T03:37:19Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3944v3","created_at":"2026-05-18T03:37:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3944","created_at":"2026-05-18T03:37:19Z"},{"alias_kind":"pith_short_12","alias_value":"MPTIWURBAKWP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MPTIWURBAKWPI3BP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MPTIWURB","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:92f71cfd5a50f57c3f1ed9230d1d2deb4d7cf5a2b679c9f235156c9d143aa4e9","target":"graph","created_at":"2026-05-18T03:37:19Z","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 network utility maximization problem (NUM) for multi-path is a problem which is non-strictly convex and non-separable. Using Jensen's inequality, we approximate the NUM to a strictly convex and separable problem which can be solved efficiently by the dual decomposition method. After a series of approximations, the result of the approximation problem converges to the globally optimal solution of the original problem.\n  Moreover, because of the separable and dual-based natures of the proposed algorithm, we utilize the reverse engineering frameworks of the current TCPs to develop a series of ","authors_text":"Anh T. Le, Choong S. Hong, Phuong L. Vo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-19T11:43:59Z","title":"The Multi-path Utility Maximization and Multi-path TCP Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3944","kind":"arxiv","version":3},"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:d113def83300bb58bfbf4cc815db6b6617bf12842b7da65e2e85c1b4d8d1f542","target":"record","created_at":"2026-05-18T03:37:19Z","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":"6075333ea383c8cbea222be8654eaa40b233bde11323757dbd29922bc3ca79cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-19T11:43:59Z","title_canon_sha256":"63f4ae8ad935d3d898155e7dd842564af4c92f5a9d4067966809fc2b94634d6a"},"schema_version":"1.0","source":{"id":"1108.3944","kind":"arxiv","version":3}},"canonical_sha256":"63e68b522102acf46c2fed1d4c79709327856b8636bd05252360b77aec862ceb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63e68b522102acf46c2fed1d4c79709327856b8636bd05252360b77aec862ceb","first_computed_at":"2026-05-18T03:37:19.133184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:19.133184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+7LWaahmEoaMnpvm3a5bTBFp9WwevGzSvbgwt/RV3Pwk1IEj7vlfLfgUKSZ8lT8nRBIec8khWCa3wMsd7ObiDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:19.133877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3944","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d113def83300bb58bfbf4cc815db6b6617bf12842b7da65e2e85c1b4d8d1f542","sha256:92f71cfd5a50f57c3f1ed9230d1d2deb4d7cf5a2b679c9f235156c9d143aa4e9"],"state_sha256":"06a11605286bbf18a9f937c605ecf3e4b92624cc752dc7519f5630d590ef1ff1"}