{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:USYPNT2HCYWR6N5ODTMREL5EHG","short_pith_number":"pith:USYPNT2H","schema_version":"1.0","canonical_sha256":"a4b0f6cf47162d1f37ae1cd9122fa439a34a94591321a83c4757b5e2c9b8d150","source":{"kind":"arxiv","id":"cs/9809091","version":1},"attestation_state":"computed","paper":{"title":"Congestion Control in Computer Networks: Trends and Issues","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"R. Jain","submitted_at":"1998-09-24T04:56:33Z","abstract_excerpt":"Popular myths that cheaper memory, high-speed links and high-speed processors will solve the problem of congestion in computer networks are shown to be false. A simple definition for congestion based on supply and demand of resources is proposed and is then used to classify various congestion schemes. The issues that make the congestion problem a difficult one are discussed, and then the architectural decisions that affect the design of a congestion scheme are presented. It is argued that long-, medium- and short-term congestion problems require different solutions. Some of the recent schemes "},"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/9809091","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"1998-09-24T04:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"3e33d921679bc2f23e495429ab0105bf5cafc69357e6afe217d24688632329f7","abstract_canon_sha256":"48849971ad830907dbdead9170d758a0ff131f8405ae4cb1fcbf30d51abe65df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:56.027384Z","signature_b64":"rGpVMidG94yBJ86E/2MVnbdGIxnP7xrW1dpz3cT9DVYeAFVmtEBuMAnGKot26+5WRhgAFqLrg3fRmYmX3QysCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4b0f6cf47162d1f37ae1cd9122fa439a34a94591321a83c4757b5e2c9b8d150","last_reissued_at":"2026-05-18T00:58:56.026736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:56.026736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Congestion Control in Computer Networks: Trends and Issues","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"R. Jain","submitted_at":"1998-09-24T04:56:33Z","abstract_excerpt":"Popular myths that cheaper memory, high-speed links and high-speed processors will solve the problem of congestion in computer networks are shown to be false. A simple definition for congestion based on supply and demand of resources is proposed and is then used to classify various congestion schemes. The issues that make the congestion problem a difficult one are discussed, and then the architectural decisions that affect the design of a congestion scheme are presented. It is argued that long-, medium- and short-term congestion problems require different solutions. Some of the recent schemes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9809091","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":"cs/9809091","created_at":"2026-05-18T00:58:56.026823+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9809091v1","created_at":"2026-05-18T00:58:56.026823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809091","created_at":"2026-05-18T00:58:56.026823+00:00"},{"alias_kind":"pith_short_12","alias_value":"USYPNT2HCYWR","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"USYPNT2HCYWR6N5O","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"USYPNT2H","created_at":"2026-05-18T12:25:49.038998+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/USYPNT2HCYWR6N5ODTMREL5EHG","json":"https://pith.science/pith/USYPNT2HCYWR6N5ODTMREL5EHG.json","graph_json":"https://pith.science/api/pith-number/USYPNT2HCYWR6N5ODTMREL5EHG/graph.json","events_json":"https://pith.science/api/pith-number/USYPNT2HCYWR6N5ODTMREL5EHG/events.json","paper":"https://pith.science/paper/USYPNT2H"},"agent_actions":{"view_html":"https://pith.science/pith/USYPNT2HCYWR6N5ODTMREL5EHG","download_json":"https://pith.science/pith/USYPNT2HCYWR6N5ODTMREL5EHG.json","view_paper":"https://pith.science/paper/USYPNT2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9809091&json=true","fetch_graph":"https://pith.science/api/pith-number/USYPNT2HCYWR6N5ODTMREL5EHG/graph.json","fetch_events":"https://pith.science/api/pith-number/USYPNT2HCYWR6N5ODTMREL5EHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USYPNT2HCYWR6N5ODTMREL5EHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USYPNT2HCYWR6N5ODTMREL5EHG/action/storage_attestation","attest_author":"https://pith.science/pith/USYPNT2HCYWR6N5ODTMREL5EHG/action/author_attestation","sign_citation":"https://pith.science/pith/USYPNT2HCYWR6N5ODTMREL5EHG/action/citation_signature","submit_replication":"https://pith.science/pith/USYPNT2HCYWR6N5ODTMREL5EHG/action/replication_record"}},"created_at":"2026-05-18T00:58:56.026823+00:00","updated_at":"2026-05-18T00:58:56.026823+00:00"}