{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TJ626OQFOA5CSDRD7DVR6356VX","short_pith_number":"pith:TJ626OQF","schema_version":"1.0","canonical_sha256":"9a7daf3a05703a290e23f8eb1f6fbeade0153f712f5faea5bc409390a3993140","source":{"kind":"arxiv","id":"1810.03259","version":3},"attestation_state":"computed","paper":{"title":"Internet Congestion Control via Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aviv Tamar, Michael Schapira, Nathan Jay, Noga H. Rotman, P. Brighten Godfrey","submitted_at":"2018-10-08T03:43:25Z","abstract_excerpt":"We present and investigate a novel and timely application domain for deep reinforcement learning (RL): Internet congestion control. Congestion control is the core networking task of modulating traffic sources' data-transmission rates to efficiently utilize network capacity, and is the subject of extensive attention in light of the advent of Internet services such as live video, virtual reality, Internet-of-Things, and more. We show that casting congestion control as RL enables training deep network policies that capture intricate patterns in data traffic and network conditions, and leverage th"},"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":"1810.03259","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-08T03:43:25Z","cross_cats_sorted":[],"title_canon_sha256":"4fea08784e980cc70d501d491b45b0e5b83224c2a17efc8b82d9c367d6a369d7","abstract_canon_sha256":"0db77a61ef2cdfc7604e4ae9ba7ce3aa5cf611cb349e243508be66cf40abc8b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:46.668880Z","signature_b64":"QAFVXoZeA9pQLfwkDr60+UvCB07w5jNbfeUzea14WvEEVetY/gnuaJdNR8OCiGKt36/9+I3rKJB+wyz7ga3fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a7daf3a05703a290e23f8eb1f6fbeade0153f712f5faea5bc409390a3993140","last_reissued_at":"2026-05-17T23:45:46.668327Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:46.668327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Internet Congestion Control via Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aviv Tamar, Michael Schapira, Nathan Jay, Noga H. Rotman, P. Brighten Godfrey","submitted_at":"2018-10-08T03:43:25Z","abstract_excerpt":"We present and investigate a novel and timely application domain for deep reinforcement learning (RL): Internet congestion control. Congestion control is the core networking task of modulating traffic sources' data-transmission rates to efficiently utilize network capacity, and is the subject of extensive attention in light of the advent of Internet services such as live video, virtual reality, Internet-of-Things, and more. We show that casting congestion control as RL enables training deep network policies that capture intricate patterns in data traffic and network conditions, and leverage th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03259","kind":"arxiv","version":3},"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":"1810.03259","created_at":"2026-05-17T23:45:46.668416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03259v3","created_at":"2026-05-17T23:45:46.668416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03259","created_at":"2026-05-17T23:45:46.668416+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJ626OQFOA5C","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJ626OQFOA5CSDRD","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJ626OQF","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19909","citing_title":"Fair-Aurora: Comparing Fairness Strategies for Reinforcement Learning-Based Congestion Control in Multi-Flow Environments","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX","json":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX.json","graph_json":"https://pith.science/api/pith-number/TJ626OQFOA5CSDRD7DVR6356VX/graph.json","events_json":"https://pith.science/api/pith-number/TJ626OQFOA5CSDRD7DVR6356VX/events.json","paper":"https://pith.science/paper/TJ626OQF"},"agent_actions":{"view_html":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX","download_json":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX.json","view_paper":"https://pith.science/paper/TJ626OQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03259&json=true","fetch_graph":"https://pith.science/api/pith-number/TJ626OQFOA5CSDRD7DVR6356VX/graph.json","fetch_events":"https://pith.science/api/pith-number/TJ626OQFOA5CSDRD7DVR6356VX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX/action/storage_attestation","attest_author":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX/action/author_attestation","sign_citation":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX/action/citation_signature","submit_replication":"https://pith.science/pith/TJ626OQFOA5CSDRD7DVR6356VX/action/replication_record"}},"created_at":"2026-05-17T23:45:46.668416+00:00","updated_at":"2026-05-17T23:45:46.668416+00:00"}