{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7UNTWJPVCCVAIQ3T76RX7YC74A","short_pith_number":"pith:7UNTWJPV","schema_version":"1.0","canonical_sha256":"fd1b3b25f510aa044373ffa37fe05fe03baba607b63a22abdf8c486e650defa9","source":{"kind":"arxiv","id":"2605.13749","version":1},"attestation_state":"computed","paper":{"title":"SPLIT: SymPathy for Large jobs Improves Tail latency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Alan Scheller-Wolf, Mor Harchol-Balter, Zhouzi Li","submitted_at":"2026-05-13T16:32:11Z","abstract_excerpt":"We study the asymptotic response time tail in the M/G/n multi-server queue with heavy-tailed (regularly varying) job sizes, a setting representative of modern computing workloads. For single-server systems, tail optimization is well understood: under heavy-tailed job sizes, policies such as SRPT that strictly prioritize short jobs are strongly tail optimal, and giving any priority to large jobs is harmful. For multi-server systems, the question has been almost entirely open.\n  This paper gives the first strongly tail-optimal scheduling policies for the M/G/n queue with heavy-tailed job sizes. "},"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":"2605.13749","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2026-05-13T16:32:11Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"c53dbd2216c9cf5d008f739f89474e1a1390b9ef29d529f3442b0b368d8e4200","abstract_canon_sha256":"ee285f2575f6f2fc6229b602f102f4f827775dcb8357168304ec3558b3ee271b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:16.388397Z","signature_b64":"LNln6Jt5DjiQENYbtiz9fMBmsDR37Gm+m3aF828f02Y0PnXKVclYd0CQavbih3BbRHsbeFUG0ThSLRLmT6DVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd1b3b25f510aa044373ffa37fe05fe03baba607b63a22abdf8c486e650defa9","last_reissued_at":"2026-05-18T02:44:16.387997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:16.387997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPLIT: SymPathy for Large jobs Improves Tail latency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PF","authors_text":"Alan Scheller-Wolf, Mor Harchol-Balter, Zhouzi Li","submitted_at":"2026-05-13T16:32:11Z","abstract_excerpt":"We study the asymptotic response time tail in the M/G/n multi-server queue with heavy-tailed (regularly varying) job sizes, a setting representative of modern computing workloads. For single-server systems, tail optimization is well understood: under heavy-tailed job sizes, policies such as SRPT that strictly prioritize short jobs are strongly tail optimal, and giving any priority to large jobs is harmful. For multi-server systems, the question has been almost entirely open.\n  This paper gives the first strongly tail-optimal scheduling policies for the M/G/n queue with heavy-tailed job sizes. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.13749","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":"2605.13749","created_at":"2026-05-18T02:44:16.388051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13749v1","created_at":"2026-05-18T02:44:16.388051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13749","created_at":"2026-05-18T02:44:16.388051+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UNTWJPVCCVA","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UNTWJPVCCVAIQ3T","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UNTWJPV","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.18431","citing_title":"Beyond Prediction: Tail-Aware Scheduling for LLM Inference","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A","json":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A.json","graph_json":"https://pith.science/api/pith-number/7UNTWJPVCCVAIQ3T76RX7YC74A/graph.json","events_json":"https://pith.science/api/pith-number/7UNTWJPVCCVAIQ3T76RX7YC74A/events.json","paper":"https://pith.science/paper/7UNTWJPV"},"agent_actions":{"view_html":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A","download_json":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A.json","view_paper":"https://pith.science/paper/7UNTWJPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13749&json=true","fetch_graph":"https://pith.science/api/pith-number/7UNTWJPVCCVAIQ3T76RX7YC74A/graph.json","fetch_events":"https://pith.science/api/pith-number/7UNTWJPVCCVAIQ3T76RX7YC74A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A/action/storage_attestation","attest_author":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A/action/author_attestation","sign_citation":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A/action/citation_signature","submit_replication":"https://pith.science/pith/7UNTWJPVCCVAIQ3T76RX7YC74A/action/replication_record"}},"created_at":"2026-05-18T02:44:16.388051+00:00","updated_at":"2026-05-18T02:44:16.388051+00:00"}