{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DMHGJ73DID5XWQ7JCLHE4L5YEW","short_pith_number":"pith:DMHGJ73D","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"},"canonical_sha256":"1b0e64ff6340fb7b43e912ce4e2fb825be6b301eef432fb29c841690d4980f14","source":{"kind":"arxiv","id":"1604.06377","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06377","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06377v4","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06377","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"pith_short_12","alias_value":"DMHGJ73DID5X","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"pith_short_16","alias_value":"DMHGJ73DID5XWQ7J","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"pith_short_8","alias_value":"DMHGJ73D","created_at":"2026-06-04T18:09:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DMHGJ73DID5XWQ7JCLHE4L5YEW","target":"record","payload":{"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"},"canonical_sha256":"1b0e64ff6340fb7b43e912ce4e2fb825be6b301eef432fb29c841690d4980f14","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"},"source_kind":"arxiv","source_id":"1604.06377","source_version":4,"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-06-04T18:09:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSe6Biu+dn1cxyZL3lhUR29N/U2G7Fn/qIzTGeKmG/z+fOptiafQWMZ1NCu0NaDPC58SIHeIlBVeFzGKtcrfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:21:45.581546Z"},"content_sha256":"cdac82b14135751ac49905b81263a7774f25bdbaf71aa7334d5912246d62b982","schema_version":"1.0","event_id":"sha256:cdac82b14135751ac49905b81263a7774f25bdbaf71aa7334d5912246d62b982"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DMHGJ73DID5XWQ7JCLHE4L5YEW","target":"graph","payload":{"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"},"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-06-04T18:09:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XgpWrV2CEFJ/nOsj/05q83p1wlatN0KHjkVI3Hk80cwiIAH5VzFJgLYAPX7K9TNosXwn5Tl4a36FOfdEdqxNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:21:45.581919Z"},"content_sha256":"074edffdeec3655e0ec872de14e6de58f0055c9f7657451f194e673363d4e4aa","schema_version":"1.0","event_id":"sha256:074edffdeec3655e0ec872de14e6de58f0055c9f7657451f194e673363d4e4aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/bundle.json","state_url":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/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-06-08T11:21:45Z","links":{"resolver":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW","bundle":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/bundle.json","state":"https://pith.science/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMHGJ73DID5XWQ7JCLHE4L5YEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DMHGJ73DID5XWQ7JCLHE4L5YEW","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":"4b372d50d0ec64e85cc5fa5379608f0201e7104fe2d113ef12529d973a20cdba","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2016-04-21T16:43:27Z","title_canon_sha256":"2adb7c8358d413d9f70901dae9ce51cf640d2ab3762e79b23d9997ad06eb8303"},"schema_version":"1.0","source":{"id":"1604.06377","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06377","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06377v4","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06377","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"pith_short_12","alias_value":"DMHGJ73DID5X","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"pith_short_16","alias_value":"DMHGJ73DID5XWQ7J","created_at":"2026-06-04T18:09:37Z"},{"alias_kind":"pith_short_8","alias_value":"DMHGJ73D","created_at":"2026-06-04T18:09:37Z"}],"graph_snapshots":[{"event_id":"sha256:074edffdeec3655e0ec872de14e6de58f0055c9f7657451f194e673363d4e4aa","target":"graph","created_at":"2026-06-04T18:09:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1604.06377/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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: ","authors_text":"Rajat Sen, Ramesh Johari, Sanjay Shakkottai, Subhashini Krishnasamy","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2016-04-21T16:43:27Z","title":"Learning Unknown Service Rates in Queues: A Multi-Armed Bandit Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06377","kind":"arxiv","version":4},"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:cdac82b14135751ac49905b81263a7774f25bdbaf71aa7334d5912246d62b982","target":"record","created_at":"2026-06-04T18:09:37Z","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":"4b372d50d0ec64e85cc5fa5379608f0201e7104fe2d113ef12529d973a20cdba","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2016-04-21T16:43:27Z","title_canon_sha256":"2adb7c8358d413d9f70901dae9ce51cf640d2ab3762e79b23d9997ad06eb8303"},"schema_version":"1.0","source":{"id":"1604.06377","kind":"arxiv","version":4}},"canonical_sha256":"1b0e64ff6340fb7b43e912ce4e2fb825be6b301eef432fb29c841690d4980f14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b0e64ff6340fb7b43e912ce4e2fb825be6b301eef432fb29c841690d4980f14","first_computed_at":"2026-06-04T18:09:37.630653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T18:09:37.630653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QOAmEsPYhzq665SbVwpIH1VoEWHT+0fX6cuMtvYRtlGxaydTfLJudATBG/TieeMQySwyknedbfVXC+yFyYieCg==","signature_status":"signed_v1","signed_at":"2026-06-04T18:09:37.631183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06377","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdac82b14135751ac49905b81263a7774f25bdbaf71aa7334d5912246d62b982","sha256:074edffdeec3655e0ec872de14e6de58f0055c9f7657451f194e673363d4e4aa"],"state_sha256":"1a7f0e0bb99f245d7ed5a54ce69c04bc3eacd32226adef2cbf939d5bdf19fe54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHV9FG7VCJgEfDHMfYbsW2rsGb7Py7kMYwvY9PumBV0PKetHPs7LGFa0CfjZTQlQ9IAXZZKPE/RTgEV2fXBsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:21:45.583827Z","bundle_sha256":"fc4966bfabe5ad00114884f506cc86b40280e809c4a4fa92ebeb4d68f370bac4"}}