{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:X6QTI5Q7JXWU3Z7YNGP2455RBY","short_pith_number":"pith:X6QTI5Q7","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"},"canonical_sha256":"bfa134761f4ded4de7f8699fae77b10e2a4800aed76cb8f673ea352986006f72","source":{"kind":"arxiv","id":"1104.3636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3636","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3636v1","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3636","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"X6QTI5Q7JXWU","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X6QTI5Q7JXWU3Z7Y","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X6QTI5Q7","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:X6QTI5Q7JXWU3Z7YNGP2455RBY","target":"record","payload":{"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"},"canonical_sha256":"bfa134761f4ded4de7f8699fae77b10e2a4800aed76cb8f673ea352986006f72","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"},"source_kind":"arxiv","source_id":"1104.3636","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-18T02:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtMdM6iBU0LShqmM8NXQVAX1CIXhl/ThJcOLG0472nRXKsFxVy11VbFleefG6qhbNl5h6H0/tazlGNpEpB7RDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:04:52.839730Z"},"content_sha256":"b3dc9dae850ac6c611cc7b9e0bd25bbcb029d24e4512122a8a4f342c5f93f6b6","schema_version":"1.0","event_id":"sha256:b3dc9dae850ac6c611cc7b9e0bd25bbcb029d24e4512122a8a4f342c5f93f6b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:X6QTI5Q7JXWU3Z7YNGP2455RBY","target":"graph","payload":{"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"},"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-18T02:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3NbY7Sg0Ap85yMwTj/p+DBDWGwkMbizDV0Tx8LUZ/iLOAVUM+IVX8D9IGe/kIoe0xNSfG5ie4V6zh9BHXaGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:04:52.840398Z"},"content_sha256":"19532d5554202be23953ef945dd1224be79b3c4d8f4a1e76e5f1b20bc272483c","schema_version":"1.0","event_id":"sha256:19532d5554202be23953ef945dd1224be79b3c4d8f4a1e76e5f1b20bc272483c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/bundle.json","state_url":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/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-05T08:04:52Z","links":{"resolver":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY","bundle":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/bundle.json","state":"https://pith.science/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6QTI5Q7JXWU3Z7YNGP2455RBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X6QTI5Q7JXWU3Z7YNGP2455RBY","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":"e4464a7b525153eb9697122f960af80a9169049da8952d04fb6f9e576308cc96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-19T04:38:21Z","title_canon_sha256":"aeeaf2ead566f3e0acf732fc63a011ed5d1a44097b27b86d6d264a5555e989fa"},"schema_version":"1.0","source":{"id":"1104.3636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3636","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3636v1","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3636","created_at":"2026-05-18T02:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"X6QTI5Q7JXWU","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X6QTI5Q7JXWU3Z7Y","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X6QTI5Q7","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:19532d5554202be23953ef945dd1224be79b3c4d8f4a1e76e5f1b20bc272483c","target":"graph","created_at":"2026-05-18T02:22:02Z","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 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","authors_text":"Hongying Liu, Ke Xu, Meng Shen, Yifeng Zhong, Ying Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-19T04:38:21Z","title":"A Large Family of Multi-path Dual Congestion Control Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3636","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:b3dc9dae850ac6c611cc7b9e0bd25bbcb029d24e4512122a8a4f342c5f93f6b6","target":"record","created_at":"2026-05-18T02:22:02Z","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":"e4464a7b525153eb9697122f960af80a9169049da8952d04fb6f9e576308cc96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-19T04:38:21Z","title_canon_sha256":"aeeaf2ead566f3e0acf732fc63a011ed5d1a44097b27b86d6d264a5555e989fa"},"schema_version":"1.0","source":{"id":"1104.3636","kind":"arxiv","version":1}},"canonical_sha256":"bfa134761f4ded4de7f8699fae77b10e2a4800aed76cb8f673ea352986006f72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfa134761f4ded4de7f8699fae77b10e2a4800aed76cb8f673ea352986006f72","first_computed_at":"2026-05-18T02:22:02.298295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:02.298295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o5gY6LL1AckP0sm49WK7AXzbaMXLof2MEQVkYz88dFheyD73Y+oVHW999cnlRfTUA/ThHJxjLwU7OjoCi382Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:02.298954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3dc9dae850ac6c611cc7b9e0bd25bbcb029d24e4512122a8a4f342c5f93f6b6","sha256:19532d5554202be23953ef945dd1224be79b3c4d8f4a1e76e5f1b20bc272483c"],"state_sha256":"16462045a07266ec21b9d60cab7a0c64a51b7597b16bdb94771c96ca89becd96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSO5NtQ6Br9+qvQLM/NPdkICSaMxiDmvgOs71P4b2/t1fsHBWWq5AHibz25h3yPkNSG2ev7HissXK1mgap3XAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:04:52.843944Z","bundle_sha256":"449646cdc9eb2349e69d5722506e9b53eb1c69f01e008ac9be79b46fdbeded8f"}}