{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KNUJXFVPMMKBD7YVGDE6HDQQMS","short_pith_number":"pith:KNUJXFVP","schema_version":"1.0","canonical_sha256":"53689b96af631411ff1530c9e38e1064b1731dff6786d077158cb7dc4bb24b6d","source":{"kind":"arxiv","id":"2601.19300","version":2},"attestation_state":"computed","paper":{"title":"Queue Length Regret Bounds for Contextual Queueing Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dabeen Lee, Garyeong Kang, Seoungbin Bae","submitted_at":"2026-01-27T07:40:23Z","abstract_excerpt":"We introduce contextual queueing bandits, a new context-aware framework for scheduling while simultaneously learning unknown service rates. Individual jobs carry heterogeneous contextual features, based on which the agent chooses a job and matches it with a server to maximize the departure rate. The service/departure rate is governed by a logistic model of the contextual feature with an unknown server-specific parameter. To evaluate the performance of a policy, we consider queue length regret, defined as the difference in queue length between the policy and the optimal policy. The main challen"},"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":"2601.19300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-01-27T07:40:23Z","cross_cats_sorted":[],"title_canon_sha256":"799204cebfcc69cf27447967ff219d00733281d61c9ac74d332893d4169aef1a","abstract_canon_sha256":"aa1e95b89464abe16b91fe2807938968d0cd0763a0be747cad826154cef8dd85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:23.546352Z","signature_b64":"TR3ZaHQKaRz0P05l3wLnaoHppS1Z+Di4Bdoag71VcrGa8UrK7HJMliHpuif8rJSQUDoWUwgd9hDSqnemfE7XCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53689b96af631411ff1530c9e38e1064b1731dff6786d077158cb7dc4bb24b6d","last_reissued_at":"2026-05-20T00:04:23.545478Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:23.545478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Queue Length Regret Bounds for Contextual Queueing Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dabeen Lee, Garyeong Kang, Seoungbin Bae","submitted_at":"2026-01-27T07:40:23Z","abstract_excerpt":"We introduce contextual queueing bandits, a new context-aware framework for scheduling while simultaneously learning unknown service rates. Individual jobs carry heterogeneous contextual features, based on which the agent chooses a job and matches it with a server to maximize the departure rate. The service/departure rate is governed by a logistic model of the contextual feature with an unknown server-specific parameter. To evaluate the performance of a policy, we consider queue length regret, defined as the difference in queue length between the policy and the optimal policy. The main challen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.19300","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/2601.19300/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":"2601.19300","created_at":"2026-05-20T00:04:23.545632+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.19300v2","created_at":"2026-05-20T00:04:23.545632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.19300","created_at":"2026-05-20T00:04:23.545632+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNUJXFVPMMKB","created_at":"2026-05-20T00:04:23.545632+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNUJXFVPMMKBD7YV","created_at":"2026-05-20T00:04:23.545632+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNUJXFVP","created_at":"2026-05-20T00:04:23.545632+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.22161","citing_title":"Logistic Bandits with $\\tilde{O}(\\sqrt{dT})$ Regret without Context Diversity Assumptions","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS","json":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS.json","graph_json":"https://pith.science/api/pith-number/KNUJXFVPMMKBD7YVGDE6HDQQMS/graph.json","events_json":"https://pith.science/api/pith-number/KNUJXFVPMMKBD7YVGDE6HDQQMS/events.json","paper":"https://pith.science/paper/KNUJXFVP"},"agent_actions":{"view_html":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS","download_json":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS.json","view_paper":"https://pith.science/paper/KNUJXFVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.19300&json=true","fetch_graph":"https://pith.science/api/pith-number/KNUJXFVPMMKBD7YVGDE6HDQQMS/graph.json","fetch_events":"https://pith.science/api/pith-number/KNUJXFVPMMKBD7YVGDE6HDQQMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/action/storage_attestation","attest_author":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/action/author_attestation","sign_citation":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/action/citation_signature","submit_replication":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/action/replication_record"}},"created_at":"2026-05-20T00:04:23.545632+00:00","updated_at":"2026-05-20T00:04:23.545632+00:00"}