{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7KU3I6PU6DYDAOKRXNZ5S3STUI","short_pith_number":"pith:7KU3I6PU","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"},"canonical_sha256":"faa9b479f4f0f0303951bb73d96e53a22762f7ff434aacd3827301098039dbf6","source":{"kind":"arxiv","id":"1510.03551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03551","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03551v1","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03551","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"7KU3I6PU6DYD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7KU3I6PU6DYDAOKR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7KU3I6PU","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7KU3I6PU6DYDAOKRXNZ5S3STUI","target":"record","payload":{"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"},"canonical_sha256":"faa9b479f4f0f0303951bb73d96e53a22762f7ff434aacd3827301098039dbf6","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"},"source_kind":"arxiv","source_id":"1510.03551","source_version":1,"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-18T01:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tkf7pR7MV5rI0Bne5nBh/6/deub8MW9HU1ZiuxeGvJuw4ppuj5tI0glRCWB8Jo9+C2h8DdiXtULCpHUzRC3vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:34:15.795520Z"},"content_sha256":"bc2b80b5f076787be46e306d83aab77cceef0b92acf150449f01d138f47e674b","schema_version":"1.0","event_id":"sha256:bc2b80b5f076787be46e306d83aab77cceef0b92acf150449f01d138f47e674b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7KU3I6PU6DYDAOKRXNZ5S3STUI","target":"graph","payload":{"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"},"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-18T01:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"et6OHlEmONcqWvH8dbFzIjlamGhGl+PzBQrDbxYfXEyZOV/01PewR+57kY+2OdQ2SHSh+mr7ihXGR8MwBWBsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:34:15.796182Z"},"content_sha256":"2185826beb9428e47175bad53e9d58f00fb69828478163e4f06e4fbdf31ae565","schema_version":"1.0","event_id":"sha256:2185826beb9428e47175bad53e9d58f00fb69828478163e4f06e4fbdf31ae565"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/bundle.json","state_url":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/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-26T16:34:15Z","links":{"resolver":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI","bundle":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/bundle.json","state":"https://pith.science/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KU3I6PU6DYDAOKRXNZ5S3STUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7KU3I6PU6DYDAOKRXNZ5S3STUI","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":"c8fd520d36433340b701ca845ff27f807dcf59b226d6b996d36ff9be31d853a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-10-13T07:01:32Z","title_canon_sha256":"5c94dfd3b406caf69053c1bb1cca01ae671437c4f17f74836803123e06dd3a26"},"schema_version":"1.0","source":{"id":"1510.03551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03551","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03551v1","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03551","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"7KU3I6PU6DYD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7KU3I6PU6DYDAOKR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7KU3I6PU","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:2185826beb9428e47175bad53e9d58f00fb69828478163e4f06e4fbdf31ae565","target":"graph","created_at":"2026-05-18T01:30:16Z","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 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","authors_text":"Rachit Agarwal, Radhika Mittal, Scott Shenker, Sylvia Ratnasamy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-10-13T07:01:32Z","title":"Universal Packet Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03551","kind":"arxiv","version":1},"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:bc2b80b5f076787be46e306d83aab77cceef0b92acf150449f01d138f47e674b","target":"record","created_at":"2026-05-18T01:30:16Z","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":"c8fd520d36433340b701ca845ff27f807dcf59b226d6b996d36ff9be31d853a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-10-13T07:01:32Z","title_canon_sha256":"5c94dfd3b406caf69053c1bb1cca01ae671437c4f17f74836803123e06dd3a26"},"schema_version":"1.0","source":{"id":"1510.03551","kind":"arxiv","version":1}},"canonical_sha256":"faa9b479f4f0f0303951bb73d96e53a22762f7ff434aacd3827301098039dbf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faa9b479f4f0f0303951bb73d96e53a22762f7ff434aacd3827301098039dbf6","first_computed_at":"2026-05-18T01:30:16.858629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:16.858629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k7uu1ZGgkN0Uq0Y00tWTlOI6A1Ymn23S30xgfxt1BmFG3W7R9pPA0xGwZjc3xF5nW3ejDuYDNzwMB/huXfbxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:16.859158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc2b80b5f076787be46e306d83aab77cceef0b92acf150449f01d138f47e674b","sha256:2185826beb9428e47175bad53e9d58f00fb69828478163e4f06e4fbdf31ae565"],"state_sha256":"bbe0ea84b8a11e59c1d7a8db338432e8f3bfc13037be3dabdee744e4e3f7e74d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBt9d5C+sbQd2WkVvwwv2o96CEtTIbEmnPdpWjgjVwe+Kc6XsXLj43nyyqX4L8qgsiQ/yIGRtrV5uyCk01nQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:34:15.799542Z","bundle_sha256":"373b44e570291cfb440f26962b7fba2cfc4a1be5e15cd0f3baf2a4dc83c69150"}}