{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E4BREWOCVBQMGCECSTGMPV3JAI","short_pith_number":"pith:E4BREWOC","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"},"canonical_sha256":"27031259c2a860c3088294ccc7d769020d4b0e46a6ad29423be38e187c663b62","source":{"kind":"arxiv","id":"1107.2900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2900","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2900v2","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2900","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"E4BREWOCVBQM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E4BREWOCVBQMGCEC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E4BREWOC","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E4BREWOCVBQMGCECSTGMPV3JAI","target":"record","payload":{"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"},"canonical_sha256":"27031259c2a860c3088294ccc7d769020d4b0e46a6ad29423be38e187c663b62","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"},"source_kind":"arxiv","source_id":"1107.2900","source_version":2,"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-18T03:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PxkKvB/3q/XfTTnxY62B+W77rv7M27ZP0AakHGSYBFUWNS3iA51JMLF9cOZ7Dy2/Of+PbkHFKntMNuXU5rRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:06:41.088965Z"},"content_sha256":"6b365cba4c737442d5e346e3152a127d287df0052e7deaf68f5b9e0cd53cd5f3","schema_version":"1.0","event_id":"sha256:6b365cba4c737442d5e346e3152a127d287df0052e7deaf68f5b9e0cd53cd5f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E4BREWOCVBQMGCECSTGMPV3JAI","target":"graph","payload":{"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"},"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-18T03:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ToPzfsxKX+TYmLGLhJTSjK8zn3ZsSYRfDPZpZjBmx1HhysDjLw8VxoBn/eiQ3q25p05dEZuNfHlx9FRL/JiCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:06:41.089685Z"},"content_sha256":"e9256dacc903aa76cb59a5c92d320cab576d04f0f1511ed08e5d23bf7f245516","schema_version":"1.0","event_id":"sha256:e9256dacc903aa76cb59a5c92d320cab576d04f0f1511ed08e5d23bf7f245516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/bundle.json","state_url":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4BREWOCVBQMGCECSTGMPV3JAI/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-05-27T20:06:41Z","links":{"resolver":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI","bundle":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/bundle.json","state":"https://pith.science/pith/E4BREWOCVBQMGCECSTGMPV3JAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4BREWOCVBQMGCECSTGMPV3JAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E4BREWOCVBQMGCECSTGMPV3JAI","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":"5e896b50c24d456970ae723ad54b2c83b11936b7bfee5448f2b2408cc2da7fc5","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-14T19:14:18Z","title_canon_sha256":"eac7f0c4d60bdd4d9a26416bac0b21715c09add5a0d2a30275045b12097cb33f"},"schema_version":"1.0","source":{"id":"1107.2900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2900","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2900v2","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2900","created_at":"2026-05-18T03:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"E4BREWOCVBQM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E4BREWOCVBQMGCEC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E4BREWOC","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:e9256dacc903aa76cb59a5c92d320cab576d04f0f1511ed08e5d23bf7f245516","target":"graph","created_at":"2026-05-18T03:03:32Z","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":"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.","authors_text":"Cristobal Guzman, Roberto Cominetti","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-14T19:14:18Z","title":"Network Congestion Control with Markovian Multipath Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2900","kind":"arxiv","version":2},"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:6b365cba4c737442d5e346e3152a127d287df0052e7deaf68f5b9e0cd53cd5f3","target":"record","created_at":"2026-05-18T03:03:32Z","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":"5e896b50c24d456970ae723ad54b2c83b11936b7bfee5448f2b2408cc2da7fc5","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-14T19:14:18Z","title_canon_sha256":"eac7f0c4d60bdd4d9a26416bac0b21715c09add5a0d2a30275045b12097cb33f"},"schema_version":"1.0","source":{"id":"1107.2900","kind":"arxiv","version":2}},"canonical_sha256":"27031259c2a860c3088294ccc7d769020d4b0e46a6ad29423be38e187c663b62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27031259c2a860c3088294ccc7d769020d4b0e46a6ad29423be38e187c663b62","first_computed_at":"2026-05-18T03:03:32.931194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:32.931194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SMWT0bCKajFJUOjCTLgSdNfFySkP0IFf2EwdLtuuemI9ZMgI2KbEVtSqhf0o7tpkGKdxdSA5UbRJKSH42SihBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:32.931970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b365cba4c737442d5e346e3152a127d287df0052e7deaf68f5b9e0cd53cd5f3","sha256:e9256dacc903aa76cb59a5c92d320cab576d04f0f1511ed08e5d23bf7f245516"],"state_sha256":"370cf68cf56d6f939fa1c40d25706678fbdef8b865bb277c5d2dc1f774ce5df4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7m+14FaEF508yBzHi0jMyxVlGCt8rKjhL8jl6jc7kUZhi1jPRqkwjazjGBp4E4kDgSnQWFoyRHzbO86XWtTgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:06:41.093509Z","bundle_sha256":"165d8dadd010c97685e147a3a96e33155803f2ea66f8632b84d16d74980eb953"}}