{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DMHGJ73DID5XWQ7JCLHE4L5YEW","short_pith_number":"pith:DMHGJ73D","schema_version":"1.0","canonical_sha256":"1b0e64ff6340fb7b43e912ce4e2fb825be6b301eef432fb29c841690d4980f14","source":{"kind":"arxiv","id":"1604.06377","version":4},"attestation_state":"computed","paper":{"title":"Learning Unknown Service Rates in Queues: A Multi-Armed Bandit Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Rajat Sen, Ramesh Johari, Sanjay Shakkottai, Subhashini Krishnasamy","submitted_at":"2016-04-21T16:43:27Z","abstract_excerpt":"Consider a queueing system consisting of multiple servers. Jobs arrive over time and enter a queue for service; the goal is to minimize the size of this queue. At each opportunity for service, at most one server can be chosen, and at most one job can be served. Service is successful with a probability (the service probability) that is a priori unknown for each server. An algorithm that knows the service probabilities (the \"genie\") can always choose the server of highest service probability. We study algorithms that learn the unknown service probabilities. Our goal is to minimize queue-regret: "},"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":"1604.06377","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2016-04-21T16:43:27Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"2adb7c8358d413d9f70901dae9ce51cf640d2ab3762e79b23d9997ad06eb8303","abstract_canon_sha256":"4b372d50d0ec64e85cc5fa5379608f0201e7104fe2d113ef12529d973a20cdba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T18:09:37.631183Z","signature_b64":"QOAmEsPYhzq665SbVwpIH1VoEWHT+0fX6cuMtvYRtlGxaydTfLJudATBG/TieeMQySwyknedbfVXC+yFyYieCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b0e64ff6340fb7b43e912ce4e2fb825be6b301eef432fb29c841690d4980f14","last_reissued_at":"2026-06-04T18:09:37.630653Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T18:09:37.630653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Unknown Service Rates in Queues: A Multi-Armed Bandit Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Rajat Sen, Ramesh Johari, Sanjay Shakkottai, Subhashini Krishnasamy","submitted_at":"2016-04-21T16:43:27Z","abstract_excerpt":"Consider a queueing system consisting of multiple servers. Jobs arrive over time and enter a queue for service; the goal is to minimize the size of this queue. At each opportunity for service, at most one server can be chosen, and at most one job can be served. Service is successful with a probability (the service probability) that is a priori unknown for each server. An algorithm that knows the service probabilities (the \"genie\") can always choose the server of highest service probability. We study algorithms that learn the unknown service probabilities. Our goal is to minimize queue-regret: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06377","kind":"arxiv","version":4},"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/1604.06377/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":"1604.06377","created_at":"2026-06-04T18:09:37.630717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06377v4","created_at":"2026-06-04T18:09:37.630717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06377","created_at":"2026-06-04T18:09:37.630717+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMHGJ73DID5X","created_at":"2026-06-04T18:09:37.630717+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMHGJ73DID5XWQ7J","created_at":"2026-06-04T18:09:37.630717+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMHGJ73D","created_at":"2026-06-04T18:09:37.630717+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/DMHGJ73DID5XWQ7JCLHE4L5YEW","json":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW.json","graph_json":"https://pith.science/api/pith-number/DMHGJ73DID5XWQ7JCLHE4L5YEW/graph.json","events_json":"https://pith.science/api/pith-number/DMHGJ73DID5XWQ7JCLHE4L5YEW/events.json","paper":"https://pith.science/paper/DMHGJ73D"},"agent_actions":{"view_html":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW","download_json":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW.json","view_paper":"https://pith.science/paper/DMHGJ73D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06377&json=true","fetch_graph":"https://pith.science/api/pith-number/DMHGJ73DID5XWQ7JCLHE4L5YEW/graph.json","fetch_events":"https://pith.science/api/pith-number/DMHGJ73DID5XWQ7JCLHE4L5YEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/action/storage_attestation","attest_author":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/action/author_attestation","sign_citation":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/action/citation_signature","submit_replication":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/action/replication_record"}},"created_at":"2026-06-04T18:09:37.630717+00:00","updated_at":"2026-06-04T18:09:37.630717+00:00"}