{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:X6QTI5Q7JXWU3Z7YNGP2455RBY","short_pith_number":"pith:X6QTI5Q7","schema_version":"1.0","canonical_sha256":"bfa134761f4ded4de7f8699fae77b10e2a4800aed76cb8f673ea352986006f72","source":{"kind":"arxiv","id":"1104.3636","version":1},"attestation_state":"computed","paper":{"title":"A Large Family of Multi-path Dual Congestion Control Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hongying Liu, Ke Xu, Meng Shen, Yifeng Zhong, Ying Liu","submitted_at":"2011-04-19T04:38:21Z","abstract_excerpt":"The goal of traffic management is efficiently utilizing network resources via adapting of source sending rates and routes selection. Traditionally, this problem is formulated into a utilization maximization problem. The single-path routing scheme fails to react to instantaneous network congestion. Multi-path routing schemes thus have been proposed aiming at improving network efficiency. Unfortunately, the natural optimization problem to consider is concave but not strictly concave. It thus brings a huge challenge to design stable multi-path congestion control algorithms.\n  In this paper, we pr"},"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":"1104.3636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-19T04:38:21Z","cross_cats_sorted":[],"title_canon_sha256":"aeeaf2ead566f3e0acf732fc63a011ed5d1a44097b27b86d6d264a5555e989fa","abstract_canon_sha256":"e4464a7b525153eb9697122f960af80a9169049da8952d04fb6f9e576308cc96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:02.298954Z","signature_b64":"o5gY6LL1AckP0sm49WK7AXzbaMXLof2MEQVkYz88dFheyD73Y+oVHW999cnlRfTUA/ThHJxjLwU7OjoCi382Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa134761f4ded4de7f8699fae77b10e2a4800aed76cb8f673ea352986006f72","last_reissued_at":"2026-05-18T02:22:02.298295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:02.298295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Large Family of Multi-path Dual Congestion Control Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hongying Liu, Ke Xu, Meng Shen, Yifeng Zhong, Ying Liu","submitted_at":"2011-04-19T04:38:21Z","abstract_excerpt":"The goal of traffic management is efficiently utilizing network resources via adapting of source sending rates and routes selection. Traditionally, this problem is formulated into a utilization maximization problem. The single-path routing scheme fails to react to instantaneous network congestion. Multi-path routing schemes thus have been proposed aiming at improving network efficiency. Unfortunately, the natural optimization problem to consider is concave but not strictly concave. It thus brings a huge challenge to design stable multi-path congestion control algorithms.\n  In this paper, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3636","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":"1104.3636","created_at":"2026-05-18T02:22:02.298409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3636v1","created_at":"2026-05-18T02:22:02.298409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3636","created_at":"2026-05-18T02:22:02.298409+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6QTI5Q7JXWU","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6QTI5Q7JXWU3Z7Y","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6QTI5Q7","created_at":"2026-05-18T12:26:44.992195+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/X6QTI5Q7JXWU3Z7YNGP2455RBY","json":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY.json","graph_json":"https://pith.science/api/pith-number/X6QTI5Q7JXWU3Z7YNGP2455RBY/graph.json","events_json":"https://pith.science/api/pith-number/X6QTI5Q7JXWU3Z7YNGP2455RBY/events.json","paper":"https://pith.science/paper/X6QTI5Q7"},"agent_actions":{"view_html":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY","download_json":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY.json","view_paper":"https://pith.science/paper/X6QTI5Q7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3636&json=true","fetch_graph":"https://pith.science/api/pith-number/X6QTI5Q7JXWU3Z7YNGP2455RBY/graph.json","fetch_events":"https://pith.science/api/pith-number/X6QTI5Q7JXWU3Z7YNGP2455RBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/action/storage_attestation","attest_author":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/action/author_attestation","sign_citation":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/action/citation_signature","submit_replication":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/action/replication_record"}},"created_at":"2026-05-18T02:22:02.298409+00:00","updated_at":"2026-05-18T02:22:02.298409+00:00"}