{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:56FEJ42J6KSLFWEJVYWGFWXOB4","short_pith_number":"pith:56FEJ42J","canonical_record":{"source":{"id":"2303.01745","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T07:17:09Z","cross_cats_sorted":["cs.LG","cs.PF","cs.SY","eess.SY"],"title_canon_sha256":"ea9ec4d47ad05fcf28a3e5cd406c27b6faeb4611f65f40341bae7631c7b789fc","abstract_canon_sha256":"97091666cf313e343c3afc5d44822e4643c004339311d17f8947fe3f2c9142a7"},"schema_version":"1.0"},"canonical_sha256":"ef8a44f349f2a4b2d889ae2c62daee0f3236b6c8fd3750dfd2b79f005a56edf3","source":{"kind":"arxiv","id":"2303.01745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.01745","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"2303.01745v1","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01745","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"56FEJ42J6KSL","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"pith_short_16","alias_value":"56FEJ42J6KSLFWEJ","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"pith_short_8","alias_value":"56FEJ42J","created_at":"2026-07-05T05:48:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:56FEJ42J6KSLFWEJVYWGFWXOB4","target":"record","payload":{"canonical_record":{"source":{"id":"2303.01745","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T07:17:09Z","cross_cats_sorted":["cs.LG","cs.PF","cs.SY","eess.SY"],"title_canon_sha256":"ea9ec4d47ad05fcf28a3e5cd406c27b6faeb4611f65f40341bae7631c7b789fc","abstract_canon_sha256":"97091666cf313e343c3afc5d44822e4643c004339311d17f8947fe3f2c9142a7"},"schema_version":"1.0"},"canonical_sha256":"ef8a44f349f2a4b2d889ae2c62daee0f3236b6c8fd3750dfd2b79f005a56edf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:07.113079Z","signature_b64":"QlJnd7cLgLtXkdvFxlsOvCVEFGx5MDUtXB9jvslPTujMDXowIVarZCrNkms7lZJQ5ctw32UDRN6YhjawxWBLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef8a44f349f2a4b2d889ae2c62daee0f3236b6c8fd3750dfd2b79f005a56edf3","last_reissued_at":"2026-07-05T05:48:07.112522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:07.112522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.01745","source_version":1,"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-07-05T05:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fq+0QLsBhnaM59vkdaQf8kB5V6OAQlEgSSOSKHFqyLuTLSnFG9mNHFfwBPHm8EmKSItwRphMVxMX2zEGsi3VAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:29:07.004858Z"},"content_sha256":"0f06ca51030799a9bdfa3df0647cc1327634fc5f04ff145a754f4f2e12f17789","schema_version":"1.0","event_id":"sha256:0f06ca51030799a9bdfa3df0647cc1327634fc5f04ff145a754f4f2e12f17789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:56FEJ42J6KSLFWEJVYWGFWXOB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Queue Scheduling with Adversarial Bandit Learning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.PF","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Jiatai Huang, Leana Golubchik, Longbo Huang","submitted_at":"2023-03-03T07:17:09Z","abstract_excerpt":"In this paper, we study scheduling of a queueing system with zero knowledge of instantaneous network conditions. We consider a one-hop single-server queueing system consisting of $K$ queues, each with time-varying and non-stationary arrival and service rates. Our scheduling approach builds on an innovative combination of adversarial bandit learning and Lyapunov drift minimization, without knowledge of the instantaneous network state (the arrival and service rates) of each queue. We then present two novel algorithms \\texttt{SoftMW} (SoftMaxWeight) and \\texttt{SSMW} (Sliding-window SoftMaxWeight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01745","kind":"arxiv","version":1},"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/2303.01745/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-07-05T05:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QnalUI1HU+kVwOCYUuB0BXs3RRBOsoxvNSSc+C8puJhDNPKh3T8HQl9wcjeDkepCizJVDbyvcBrFe+gbHa9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:29:07.005456Z"},"content_sha256":"66ca2273922145bc26953412d31d6bc126b06f1893f7d01f05e624b127cf96ce","schema_version":"1.0","event_id":"sha256:66ca2273922145bc26953412d31d6bc126b06f1893f7d01f05e624b127cf96ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56FEJ42J6KSLFWEJVYWGFWXOB4/bundle.json","state_url":"https://pith.science/pith/56FEJ42J6KSLFWEJVYWGFWXOB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56FEJ42J6KSLFWEJVYWGFWXOB4/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-08-09T22:29:07Z","links":{"resolver":"https://pith.science/pith/56FEJ42J6KSLFWEJVYWGFWXOB4","bundle":"https://pith.science/pith/56FEJ42J6KSLFWEJVYWGFWXOB4/bundle.json","state":"https://pith.science/pith/56FEJ42J6KSLFWEJVYWGFWXOB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56FEJ42J6KSLFWEJVYWGFWXOB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:56FEJ42J6KSLFWEJVYWGFWXOB4","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":"97091666cf313e343c3afc5d44822e4643c004339311d17f8947fe3f2c9142a7","cross_cats_sorted":["cs.LG","cs.PF","cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T07:17:09Z","title_canon_sha256":"ea9ec4d47ad05fcf28a3e5cd406c27b6faeb4611f65f40341bae7631c7b789fc"},"schema_version":"1.0","source":{"id":"2303.01745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.01745","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"2303.01745v1","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01745","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"56FEJ42J6KSL","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"pith_short_16","alias_value":"56FEJ42J6KSLFWEJ","created_at":"2026-07-05T05:48:07Z"},{"alias_kind":"pith_short_8","alias_value":"56FEJ42J","created_at":"2026-07-05T05:48:07Z"}],"graph_snapshots":[{"event_id":"sha256:66ca2273922145bc26953412d31d6bc126b06f1893f7d01f05e624b127cf96ce","target":"graph","created_at":"2026-07-05T05:48:07Z","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/2303.01745/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study scheduling of a queueing system with zero knowledge of instantaneous network conditions. We consider a one-hop single-server queueing system consisting of $K$ queues, each with time-varying and non-stationary arrival and service rates. Our scheduling approach builds on an innovative combination of adversarial bandit learning and Lyapunov drift minimization, without knowledge of the instantaneous network state (the arrival and service rates) of each queue. We then present two novel algorithms \\texttt{SoftMW} (SoftMaxWeight) and \\texttt{SSMW} (Sliding-window SoftMaxWeight","authors_text":"Jiatai Huang, Leana Golubchik, Longbo Huang","cross_cats":["cs.LG","cs.PF","cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T07:17:09Z","title":"Queue Scheduling with Adversarial Bandit Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01745","kind":"arxiv","version":1},"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:0f06ca51030799a9bdfa3df0647cc1327634fc5f04ff145a754f4f2e12f17789","target":"record","created_at":"2026-07-05T05:48:07Z","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":"97091666cf313e343c3afc5d44822e4643c004339311d17f8947fe3f2c9142a7","cross_cats_sorted":["cs.LG","cs.PF","cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T07:17:09Z","title_canon_sha256":"ea9ec4d47ad05fcf28a3e5cd406c27b6faeb4611f65f40341bae7631c7b789fc"},"schema_version":"1.0","source":{"id":"2303.01745","kind":"arxiv","version":1}},"canonical_sha256":"ef8a44f349f2a4b2d889ae2c62daee0f3236b6c8fd3750dfd2b79f005a56edf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef8a44f349f2a4b2d889ae2c62daee0f3236b6c8fd3750dfd2b79f005a56edf3","first_computed_at":"2026-07-05T05:48:07.112522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:48:07.112522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QlJnd7cLgLtXkdvFxlsOvCVEFGx5MDUtXB9jvslPTujMDXowIVarZCrNkms7lZJQ5ctw32UDRN6YhjawxWBLDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:48:07.113079Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.01745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f06ca51030799a9bdfa3df0647cc1327634fc5f04ff145a754f4f2e12f17789","sha256:66ca2273922145bc26953412d31d6bc126b06f1893f7d01f05e624b127cf96ce"],"state_sha256":"edb0648de0b438afd23a622bbd82b6a12d6e1bbef16522d4016005b6d597aa6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdSF4FuX9pdigqz5DL6a5xVZmHI3JgMAScyUiZZCKBh5+r4BxfdSwQgYnFoe6oZrl2DULTRGM8BY6GaMKpVmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:29:07.010130Z","bundle_sha256":"fdc103213edd3f4ae2e874a2bc04fc612ac317698cc3e62496c677c9ee22578a"}}