{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:E4BREWOCVBQMGCECSTGMPV3JAI","short_pith_number":"pith:E4BREWOC","schema_version":"1.0","canonical_sha256":"27031259c2a860c3088294ccc7d769020d4b0e46a6ad29423be38e187c663b62","source":{"kind":"arxiv","id":"1107.2900","version":2},"attestation_state":"computed","paper":{"title":"Network Congestion Control with Markovian Multipath Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.NI","authors_text":"Cristobal Guzman, Roberto Cominetti","submitted_at":"2011-07-14T19:14:18Z","abstract_excerpt":"In this paper we consider an integrated model for TCP/IP protocols with multipath routing. The model combines a Network Utility Maximization for rate control based on end-to-end queuing delays, with a Markovian Traffic Equilibrium for routing based on total expected delays. We prove the existence of a unique equilibrium state which is characterized as the solution of an unconstrained strictly convex program. A distributed algorithm for solving this optimization problem is proposed, with a brief discussion of how it can be implemented by adapting the current Internet protocols."},"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":"1107.2900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-14T19:14:18Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"eac7f0c4d60bdd4d9a26416bac0b21715c09add5a0d2a30275045b12097cb33f","abstract_canon_sha256":"5e896b50c24d456970ae723ad54b2c83b11936b7bfee5448f2b2408cc2da7fc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:32.931970Z","signature_b64":"SMWT0bCKajFJUOjCTLgSdNfFySkP0IFf2EwdLtuuemI9ZMgI2KbEVtSqhf0o7tpkGKdxdSA5UbRJKSH42SihBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27031259c2a860c3088294ccc7d769020d4b0e46a6ad29423be38e187c663b62","last_reissued_at":"2026-05-18T03:03:32.931194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:32.931194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Congestion Control with Markovian Multipath Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.NI","authors_text":"Cristobal Guzman, Roberto Cominetti","submitted_at":"2011-07-14T19:14:18Z","abstract_excerpt":"In this paper we consider an integrated model for TCP/IP protocols with multipath routing. The model combines a Network Utility Maximization for rate control based on end-to-end queuing delays, with a Markovian Traffic Equilibrium for routing based on total expected delays. We prove the existence of a unique equilibrium state which is characterized as the solution of an unconstrained strictly convex program. A distributed algorithm for solving this optimization problem is proposed, with a brief discussion of how it can be implemented by adapting the current Internet protocols."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2900","kind":"arxiv","version":2},"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":"1107.2900","created_at":"2026-05-18T03:03:32.931333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2900v2","created_at":"2026-05-18T03:03:32.931333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2900","created_at":"2026-05-18T03:03:32.931333+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4BREWOCVBQM","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4BREWOCVBQMGCEC","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4BREWOC","created_at":"2026-05-18T12:26:26.731475+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/E4BREWOCVBQMGCECSTGMPV3JAI","json":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI.json","graph_json":"https://pith.science/api/pith-number/E4BREWOCVBQMGCECSTGMPV3JAI/graph.json","events_json":"https://pith.science/api/pith-number/E4BREWOCVBQMGCECSTGMPV3JAI/events.json","paper":"https://pith.science/paper/E4BREWOC"},"agent_actions":{"view_html":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI","download_json":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI.json","view_paper":"https://pith.science/paper/E4BREWOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2900&json=true","fetch_graph":"https://pith.science/api/pith-number/E4BREWOCVBQMGCECSTGMPV3JAI/graph.json","fetch_events":"https://pith.science/api/pith-number/E4BREWOCVBQMGCECSTGMPV3JAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/action/storage_attestation","attest_author":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/action/author_attestation","sign_citation":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/action/citation_signature","submit_replication":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/action/replication_record"}},"created_at":"2026-05-18T03:03:32.931333+00:00","updated_at":"2026-05-18T03:03:32.931333+00:00"}