{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7KU3I6PU6DYDAOKRXNZ5S3STUI","short_pith_number":"pith:7KU3I6PU","schema_version":"1.0","canonical_sha256":"faa9b479f4f0f0303951bb73d96e53a22762f7ff434aacd3827301098039dbf6","source":{"kind":"arxiv","id":"1510.03551","version":1},"attestation_state":"computed","paper":{"title":"Universal Packet Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Rachit Agarwal, Radhika Mittal, Scott Shenker, Sylvia Ratnasamy","submitted_at":"2015-10-13T07:01:32Z","abstract_excerpt":"In this paper we address a seemingly simple question: Is there a universal packet scheduling algorithm? More precisely, we analyze (both theoretically and empirically) whether there is a single packet scheduling algorithm that, at a network-wide level, can match the results of any given scheduling algorithm. We find that in general the answer is \"no\". However, we show theoretically that the classical Least Slack Time First (LSTF) scheduling algorithm comes closest to being universal and demonstrate empirically that LSTF can closely, though not perfectly, replay a wide range of scheduling algor"},"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":"1510.03551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-10-13T07:01:32Z","cross_cats_sorted":[],"title_canon_sha256":"5c94dfd3b406caf69053c1bb1cca01ae671437c4f17f74836803123e06dd3a26","abstract_canon_sha256":"c8fd520d36433340b701ca845ff27f807dcf59b226d6b996d36ff9be31d853a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:16.859158Z","signature_b64":"k7uu1ZGgkN0Uq0Y00tWTlOI6A1Ymn23S30xgfxt1BmFG3W7R9pPA0xGwZjc3xF5nW3ejDuYDNzwMB/huXfbxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faa9b479f4f0f0303951bb73d96e53a22762f7ff434aacd3827301098039dbf6","last_reissued_at":"2026-05-18T01:30:16.858629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:16.858629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Packet Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Rachit Agarwal, Radhika Mittal, Scott Shenker, Sylvia Ratnasamy","submitted_at":"2015-10-13T07:01:32Z","abstract_excerpt":"In this paper we address a seemingly simple question: Is there a universal packet scheduling algorithm? More precisely, we analyze (both theoretically and empirically) whether there is a single packet scheduling algorithm that, at a network-wide level, can match the results of any given scheduling algorithm. We find that in general the answer is \"no\". However, we show theoretically that the classical Least Slack Time First (LSTF) scheduling algorithm comes closest to being universal and demonstrate empirically that LSTF can closely, though not perfectly, replay a wide range of scheduling algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03551","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":"1510.03551","created_at":"2026-05-18T01:30:16.858709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03551v1","created_at":"2026-05-18T01:30:16.858709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03551","created_at":"2026-05-18T01:30:16.858709+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KU3I6PU6DYD","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KU3I6PU6DYDAOKR","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KU3I6PU","created_at":"2026-05-18T12:29:10.953037+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/7KU3I6PU6DYDAOKRXNZ5S3STUI","json":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI.json","graph_json":"https://pith.science/api/pith-number/7KU3I6PU6DYDAOKRXNZ5S3STUI/graph.json","events_json":"https://pith.science/api/pith-number/7KU3I6PU6DYDAOKRXNZ5S3STUI/events.json","paper":"https://pith.science/paper/7KU3I6PU"},"agent_actions":{"view_html":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI","download_json":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI.json","view_paper":"https://pith.science/paper/7KU3I6PU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03551&json=true","fetch_graph":"https://pith.science/api/pith-number/7KU3I6PU6DYDAOKRXNZ5S3STUI/graph.json","fetch_events":"https://pith.science/api/pith-number/7KU3I6PU6DYDAOKRXNZ5S3STUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/action/storage_attestation","attest_author":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/action/author_attestation","sign_citation":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/action/citation_signature","submit_replication":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/action/replication_record"}},"created_at":"2026-05-18T01:30:16.858709+00:00","updated_at":"2026-05-18T01:30:16.858709+00:00"}