{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KNUJXFVPMMKBD7YVGDE6HDQQMS","short_pith_number":"pith:KNUJXFVP","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"},"canonical_sha256":"53689b96af631411ff1530c9e38e1064b1731dff6786d077158cb7dc4bb24b6d","source":{"kind":"arxiv","id":"2601.19300","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.19300","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"2601.19300v2","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.19300","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"KNUJXFVPMMKB","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_16","alias_value":"KNUJXFVPMMKBD7YV","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_8","alias_value":"KNUJXFVP","created_at":"2026-05-20T00:04:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KNUJXFVPMMKBD7YVGDE6HDQQMS","target":"record","payload":{"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"},"canonical_sha256":"53689b96af631411ff1530c9e38e1064b1731dff6786d077158cb7dc4bb24b6d","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"},"source_kind":"arxiv","source_id":"2601.19300","source_version":2,"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-05-20T00:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krSAc81sfmODfRHkw3rXBsF9/f8ynEgz23aLh6XcxzorJtQYsOWQ6z3DYpyxKtWymK6uF7/b23erqZbjEd+6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:49:44.260644Z"},"content_sha256":"0565e653acb2ce3ef4cf31096b33cd7de3262c789ae72adfdcfa49207d233069","schema_version":"1.0","event_id":"sha256:0565e653acb2ce3ef4cf31096b33cd7de3262c789ae72adfdcfa49207d233069"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KNUJXFVPMMKBD7YVGDE6HDQQMS","target":"graph","payload":{"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"},"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-05-20T00:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKGNhb2tCa+7MxN5ypMZ0+X8T1Y9HS2LrnK/vbKc9Dvmi5T1MF2t4WCSRGShMJo/XbDisISDK/zqjHtcZR7tBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:49:44.261251Z"},"content_sha256":"89fed0ec56bf96871d6a9a5f13163cbb4ef19e54b0095dd5ed48ed722238611d","schema_version":"1.0","event_id":"sha256:89fed0ec56bf96871d6a9a5f13163cbb4ef19e54b0095dd5ed48ed722238611d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/bundle.json","state_url":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/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-05-21T11:49:44Z","links":{"resolver":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS","bundle":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/bundle.json","state":"https://pith.science/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNUJXFVPMMKBD7YVGDE6HDQQMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KNUJXFVPMMKBD7YVGDE6HDQQMS","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":"aa1e95b89464abe16b91fe2807938968d0cd0763a0be747cad826154cef8dd85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-01-27T07:40:23Z","title_canon_sha256":"799204cebfcc69cf27447967ff219d00733281d61c9ac74d332893d4169aef1a"},"schema_version":"1.0","source":{"id":"2601.19300","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.19300","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"2601.19300v2","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.19300","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"KNUJXFVPMMKB","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_16","alias_value":"KNUJXFVPMMKBD7YV","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_8","alias_value":"KNUJXFVP","created_at":"2026-05-20T00:04:23Z"}],"graph_snapshots":[{"event_id":"sha256:89fed0ec56bf96871d6a9a5f13163cbb4ef19e54b0095dd5ed48ed722238611d","target":"graph","created_at":"2026-05-20T00:04:23Z","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/2601.19300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dabeen Lee, Garyeong Kang, Seoungbin Bae","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-01-27T07:40:23Z","title":"Queue Length Regret Bounds for Contextual Queueing Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.19300","kind":"arxiv","version":2},"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:0565e653acb2ce3ef4cf31096b33cd7de3262c789ae72adfdcfa49207d233069","target":"record","created_at":"2026-05-20T00:04:23Z","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":"aa1e95b89464abe16b91fe2807938968d0cd0763a0be747cad826154cef8dd85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-01-27T07:40:23Z","title_canon_sha256":"799204cebfcc69cf27447967ff219d00733281d61c9ac74d332893d4169aef1a"},"schema_version":"1.0","source":{"id":"2601.19300","kind":"arxiv","version":2}},"canonical_sha256":"53689b96af631411ff1530c9e38e1064b1731dff6786d077158cb7dc4bb24b6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53689b96af631411ff1530c9e38e1064b1731dff6786d077158cb7dc4bb24b6d","first_computed_at":"2026-05-20T00:04:23.545478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:23.545478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TR3ZaHQKaRz0P05l3wLnaoHppS1Z+Di4Bdoag71VcrGa8UrK7HJMliHpuif8rJSQUDoWUwgd9hDSqnemfE7XCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:23.546352Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.19300","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0565e653acb2ce3ef4cf31096b33cd7de3262c789ae72adfdcfa49207d233069","sha256:89fed0ec56bf96871d6a9a5f13163cbb4ef19e54b0095dd5ed48ed722238611d"],"state_sha256":"57ea1e40feb64613cc593e753c30cb5dcd65ea4344127828049239ed676199fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JafMwU2QGrxLbew6eh3JaUOJwhHkrVwnCYbDJ+zJ4eciDVA/c0mboXcflDBRUn0apl/p22CB5JvghrlnMmzqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T11:49:44.263740Z","bundle_sha256":"399ac61c2dd2c5c868615e27953e447b1a28720a42d99347769c9ba4ee0fee3b"}}