{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YWKSEX2ACAHBQEOP4SDTLZK73D","short_pith_number":"pith:YWKSEX2A","schema_version":"1.0","canonical_sha256":"c595225f40100e1811cfe48735e55fd8ece3908ce604fb4cd50e93f34854594b","source":{"kind":"arxiv","id":"1802.06723","version":2},"attestation_state":"computed","paper":{"title":"On Learning the $c\\mu$ Rule in Single and Parallel Server Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.PF","authors_text":"Ari Arapostathis, Ramesh Johari, Sanjay Shakkottai, Subhashini Krishnasamy","submitted_at":"2018-02-02T05:57:26Z","abstract_excerpt":"We consider learning-based variants of the $c \\mu$ rule for scheduling in single and parallel server settings of multi-class queueing systems.\n  In the single server setting, the $c \\mu$ rule is known to minimize the expected holding-cost (weighted queue-lengths summed over classes and a fixed time horizon). We focus on the problem where the service rates $\\mu$ are unknown with the holding-cost regret (regret against the $c \\mu$ rule with known $\\mu$) as our objective. We show that the greedy algorithm that uses empirically learned service rates results in a constant holding-cost regret (the r"},"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":"1802.06723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-02-02T05:57:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"cd9d7c4339695d6c0f2d331b36a2946a329f15353a166de8b49f68e2b2789338","abstract_canon_sha256":"f05df4440c9ad0f977a42fc05821d227f9df2d988a1bf9979d0e5b936cb273c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:57.356748Z","signature_b64":"iU4J5xZOAjqbLGcKLiIccaB9hZeCkv9bcQkYEX/jrBgH2TiMJ52kUuhkCVp/7QkOToD26gfPVcNSblcsA2Y/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c595225f40100e1811cfe48735e55fd8ece3908ce604fb4cd50e93f34854594b","last_reissued_at":"2026-05-18T00:11:57.355938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:57.355938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Learning the $c\\mu$ Rule in Single and Parallel Server Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.PF","authors_text":"Ari Arapostathis, Ramesh Johari, Sanjay Shakkottai, Subhashini Krishnasamy","submitted_at":"2018-02-02T05:57:26Z","abstract_excerpt":"We consider learning-based variants of the $c \\mu$ rule for scheduling in single and parallel server settings of multi-class queueing systems.\n  In the single server setting, the $c \\mu$ rule is known to minimize the expected holding-cost (weighted queue-lengths summed over classes and a fixed time horizon). We focus on the problem where the service rates $\\mu$ are unknown with the holding-cost regret (regret against the $c \\mu$ rule with known $\\mu$) as our objective. We show that the greedy algorithm that uses empirically learned service rates results in a constant holding-cost regret (the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06723","kind":"arxiv","version":2},"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":"1802.06723","created_at":"2026-05-18T00:11:57.356074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06723v2","created_at":"2026-05-18T00:11:57.356074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06723","created_at":"2026-05-18T00:11:57.356074+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWKSEX2ACAHB","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWKSEX2ACAHBQEOP","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWKSEX2A","created_at":"2026-05-18T12:33:04.347982+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/YWKSEX2ACAHBQEOP4SDTLZK73D","json":"https://pith.science/pith/YWKSEX2ACAHBQEOP4SDTLZK73D.json","graph_json":"https://pith.science/api/pith-number/YWKSEX2ACAHBQEOP4SDTLZK73D/graph.json","events_json":"https://pith.science/api/pith-number/YWKSEX2ACAHBQEOP4SDTLZK73D/events.json","paper":"https://pith.science/paper/YWKSEX2A"},"agent_actions":{"view_html":"https://pith.science/pith/YWKSEX2ACAHBQEOP4SDTLZK73D","download_json":"https://pith.science/pith/YWKSEX2ACAHBQEOP4SDTLZK73D.json","view_paper":"https://pith.science/paper/YWKSEX2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06723&json=true","fetch_graph":"https://pith.science/api/pith-number/YWKSEX2ACAHBQEOP4SDTLZK73D/graph.json","fetch_events":"https://pith.science/api/pith-number/YWKSEX2ACAHBQEOP4SDTLZK73D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWKSEX2ACAHBQEOP4SDTLZK73D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWKSEX2ACAHBQEOP4SDTLZK73D/action/storage_attestation","attest_author":"https://pith.science/pith/YWKSEX2ACAHBQEOP4SDTLZK73D/action/author_attestation","sign_citation":"https://pith.science/pith/YWKSEX2ACAHBQEOP4SDTLZK73D/action/citation_signature","submit_replication":"https://pith.science/pith/YWKSEX2ACAHBQEOP4SDTLZK73D/action/replication_record"}},"created_at":"2026-05-18T00:11:57.356074+00:00","updated_at":"2026-05-18T00:11:57.356074+00:00"}