{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:MECSCUOJVYCD46HSB2O676SCPA","short_pith_number":"pith:MECSCUOJ","schema_version":"1.0","canonical_sha256":"61052151c9ae043e78f20e9deffa42781b09cb98fdddbdc297e2cbd84974e379","source":{"kind":"arxiv","id":"cs/0205032","version":2},"attestation_state":"computed","paper":{"title":"On-Line End-to-End Congestion Control","license":"","headline":"","cross_cats":["cs.CC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Naveen Garg, Neal E. Young","submitted_at":"2002-05-18T01:54:56Z","abstract_excerpt":"Congestion control in the current Internet is accomplished mainly by TCP/IP. To understand the macroscopic network behavior that results from TCP/IP and similar end-to-end protocols, one main analytic technique is to show that the the protocol maximizes some global objective function of the network traffic. Here we analyze a particular end-to-end, MIMD (multiplicative-increase, multiplicative-decrease) protocol. We show that if all users of the network use the protocol, and all connections last for at least logarithmically many rounds, then the total weighted throughput (value of all packets r"},"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":"cs/0205032","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T01:54:56Z","cross_cats_sorted":["cs.CC","cs.NI"],"title_canon_sha256":"9bea6330aeabee6c1ab53b6b9d280fbbfdfbe0a1576e3bfc327d71a00f3c1c6a","abstract_canon_sha256":"1ce9866c8c40cf54a0827d8958d86be5729bb962b879bc54e8400843a95dc601"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:54.006212Z","signature_b64":"zlGxJtnpyxKp1OSSzZEvY/dVld2yKekuCaHtAxxTAShX/jgwqsd4S1NrhgrlEattsovsitZHDsW2PkASfIUZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61052151c9ae043e78f20e9deffa42781b09cb98fdddbdc297e2cbd84974e379","last_reissued_at":"2026-05-18T01:59:54.005619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:54.005619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On-Line End-to-End Congestion Control","license":"","headline":"","cross_cats":["cs.CC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Naveen Garg, Neal E. Young","submitted_at":"2002-05-18T01:54:56Z","abstract_excerpt":"Congestion control in the current Internet is accomplished mainly by TCP/IP. To understand the macroscopic network behavior that results from TCP/IP and similar end-to-end protocols, one main analytic technique is to show that the the protocol maximizes some global objective function of the network traffic. Here we analyze a particular end-to-end, MIMD (multiplicative-increase, multiplicative-decrease) protocol. We show that if all users of the network use the protocol, and all connections last for at least logarithmically many rounds, then the total weighted throughput (value of all packets r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205032","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":"cs/0205032","created_at":"2026-05-18T01:59:54.005726+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205032v2","created_at":"2026-05-18T01:59:54.005726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205032","created_at":"2026-05-18T01:59:54.005726+00:00"},{"alias_kind":"pith_short_12","alias_value":"MECSCUOJVYCD","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"MECSCUOJVYCD46HS","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"MECSCUOJ","created_at":"2026-05-18T12:25:51.375804+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/MECSCUOJVYCD46HSB2O676SCPA","json":"https://pith.science/pith/MECSCUOJVYCD46HSB2O676SCPA.json","graph_json":"https://pith.science/api/pith-number/MECSCUOJVYCD46HSB2O676SCPA/graph.json","events_json":"https://pith.science/api/pith-number/MECSCUOJVYCD46HSB2O676SCPA/events.json","paper":"https://pith.science/paper/MECSCUOJ"},"agent_actions":{"view_html":"https://pith.science/pith/MECSCUOJVYCD46HSB2O676SCPA","download_json":"https://pith.science/pith/MECSCUOJVYCD46HSB2O676SCPA.json","view_paper":"https://pith.science/paper/MECSCUOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205032&json=true","fetch_graph":"https://pith.science/api/pith-number/MECSCUOJVYCD46HSB2O676SCPA/graph.json","fetch_events":"https://pith.science/api/pith-number/MECSCUOJVYCD46HSB2O676SCPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MECSCUOJVYCD46HSB2O676SCPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MECSCUOJVYCD46HSB2O676SCPA/action/storage_attestation","attest_author":"https://pith.science/pith/MECSCUOJVYCD46HSB2O676SCPA/action/author_attestation","sign_citation":"https://pith.science/pith/MECSCUOJVYCD46HSB2O676SCPA/action/citation_signature","submit_replication":"https://pith.science/pith/MECSCUOJVYCD46HSB2O676SCPA/action/replication_record"}},"created_at":"2026-05-18T01:59:54.005726+00:00","updated_at":"2026-05-18T01:59:54.005726+00:00"}