{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VF5ENWIYGTW5ELRLQVYPYHR3XJ","short_pith_number":"pith:VF5ENWIY","schema_version":"1.0","canonical_sha256":"a97a46d91834edd22e2b8570fc1e3bba6f125ca7d2fa58d30b37e63be618287e","source":{"kind":"arxiv","id":"2106.04707","version":2},"attestation_state":"computed","paper":{"title":"Job Dispatching Policies for Queueing Systems with Unknown Service Rates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Gauri Joshi, Sanjay Shakkottai, Tuhinangshu Choudhury, Weina Wang","submitted_at":"2021-06-08T21:55:07Z","abstract_excerpt":"In multi-server queueing systems where there is no central queue holding all incoming jobs, job dispatching policies are used to assign incoming jobs to the queue at one of the servers. Classic job dispatching policies such as join-the-shortest-queue and shortest expected delay assume that the service rates and queue lengths of the servers are known to the dispatcher. In this work, we tackle the problem of job dispatching without the knowledge of service rates and queue lengths, where the dispatcher can only obtain noisy estimates of the service rates by observing job departures. This problem "},"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":"2106.04707","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2021-06-08T21:55:07Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"fdd2ca42c55415bec4c6f2771d5b437af7112fec9924d4129fca92d2f55711d8","abstract_canon_sha256":"8c174727b841d8e547789554a1816e10282b21c95a4efa86fddde2bad694bdc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:11.612651Z","signature_b64":"l+UoNkVivg+pOp8YXOn3Iv4rwa+HzED7jmJI5Qe15t5Gya3sq+ikrVq0dP9V0S5kBnVcj9qM5sxgAj6j/qBxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a97a46d91834edd22e2b8570fc1e3bba6f125ca7d2fa58d30b37e63be618287e","last_reissued_at":"2026-07-05T02:48:11.612248Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:11.612248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Job Dispatching Policies for Queueing Systems with Unknown Service Rates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Gauri Joshi, Sanjay Shakkottai, Tuhinangshu Choudhury, Weina Wang","submitted_at":"2021-06-08T21:55:07Z","abstract_excerpt":"In multi-server queueing systems where there is no central queue holding all incoming jobs, job dispatching policies are used to assign incoming jobs to the queue at one of the servers. Classic job dispatching policies such as join-the-shortest-queue and shortest expected delay assume that the service rates and queue lengths of the servers are known to the dispatcher. In this work, we tackle the problem of job dispatching without the knowledge of service rates and queue lengths, where the dispatcher can only obtain noisy estimates of the service rates by observing job departures. This problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04707","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.04707/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.04707","created_at":"2026-07-05T02:48:11.612303+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04707v2","created_at":"2026-07-05T02:48:11.612303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04707","created_at":"2026-07-05T02:48:11.612303+00:00"},{"alias_kind":"pith_short_12","alias_value":"VF5ENWIYGTW5","created_at":"2026-07-05T02:48:11.612303+00:00"},{"alias_kind":"pith_short_16","alias_value":"VF5ENWIYGTW5ELRL","created_at":"2026-07-05T02:48:11.612303+00:00"},{"alias_kind":"pith_short_8","alias_value":"VF5ENWIY","created_at":"2026-07-05T02:48:11.612303+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/VF5ENWIYGTW5ELRLQVYPYHR3XJ","json":"https://pith.science/pith/VF5ENWIYGTW5ELRLQVYPYHR3XJ.json","graph_json":"https://pith.science/api/pith-number/VF5ENWIYGTW5ELRLQVYPYHR3XJ/graph.json","events_json":"https://pith.science/api/pith-number/VF5ENWIYGTW5ELRLQVYPYHR3XJ/events.json","paper":"https://pith.science/paper/VF5ENWIY"},"agent_actions":{"view_html":"https://pith.science/pith/VF5ENWIYGTW5ELRLQVYPYHR3XJ","download_json":"https://pith.science/pith/VF5ENWIYGTW5ELRLQVYPYHR3XJ.json","view_paper":"https://pith.science/paper/VF5ENWIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04707&json=true","fetch_graph":"https://pith.science/api/pith-number/VF5ENWIYGTW5ELRLQVYPYHR3XJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VF5ENWIYGTW5ELRLQVYPYHR3XJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VF5ENWIYGTW5ELRLQVYPYHR3XJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VF5ENWIYGTW5ELRLQVYPYHR3XJ/action/storage_attestation","attest_author":"https://pith.science/pith/VF5ENWIYGTW5ELRLQVYPYHR3XJ/action/author_attestation","sign_citation":"https://pith.science/pith/VF5ENWIYGTW5ELRLQVYPYHR3XJ/action/citation_signature","submit_replication":"https://pith.science/pith/VF5ENWIYGTW5ELRLQVYPYHR3XJ/action/replication_record"}},"created_at":"2026-07-05T02:48:11.612303+00:00","updated_at":"2026-07-05T02:48:11.612303+00:00"}