{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RHS3SENUG73RFSN2DQC7EG55HO","short_pith_number":"pith:RHS3SENU","canonical_record":{"source":{"id":"2304.05219","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-11T13:39:47Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"ec57525aa72f929167de47a7b79a8a2bfcbdaf3abb8a4f0c44675852f966609e","abstract_canon_sha256":"3d5b3b0db01127c02fd4782db81c6bba38f51a10e48093dc7d0296228284035b"},"schema_version":"1.0"},"canonical_sha256":"89e5b911b437f712c9ba1c05f21bbd3bb732b5c1cdd4ea4af2dbe46fe15939ca","source":{"kind":"arxiv","id":"2304.05219","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.05219","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2304.05219v3","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.05219","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"RHS3SENUG73R","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"RHS3SENUG73RFSN2","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"RHS3SENU","created_at":"2026-07-05T08:17:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RHS3SENUG73RFSN2DQC7EG55HO","target":"record","payload":{"canonical_record":{"source":{"id":"2304.05219","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-11T13:39:47Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"ec57525aa72f929167de47a7b79a8a2bfcbdaf3abb8a4f0c44675852f966609e","abstract_canon_sha256":"3d5b3b0db01127c02fd4782db81c6bba38f51a10e48093dc7d0296228284035b"},"schema_version":"1.0"},"canonical_sha256":"89e5b911b437f712c9ba1c05f21bbd3bb732b5c1cdd4ea4af2dbe46fe15939ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:56.607154Z","signature_b64":"WvnX56iFMUnsQE7aNBzmplFRNepv+qZQNuU9MEfs/N/Y/y1Keq1aOZAuouUwaCyiq8lLrrt/t21WsuAnVi/zAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89e5b911b437f712c9ba1c05f21bbd3bb732b5c1cdd4ea4af2dbe46fe15939ca","last_reissued_at":"2026-07-05T08:17:56.606763Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:56.606763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.05219","source_version":3,"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-05T08:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJcZVdN2lE8WehPAPvw7/jhOi2kdd30asVlVpEyw4Uole4AMOi9V0YwXkQBd8yp9xnKnrRFFpwqfaVsT6n8bAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:13:09.863825Z"},"content_sha256":"e3dab3d8c22e0e42b89fbb3f8a2d05f27e8b128dc8e915a76708962e464212d1","schema_version":"1.0","event_id":"sha256:e3dab3d8c22e0e42b89fbb3f8a2d05f27e8b128dc8e915a76708962e464212d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RHS3SENUG73RFSN2DQC7EG55HO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BanditQ: Fair Bandits with Guaranteed Rewards","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.LG","authors_text":"Abhishek Sinha","submitted_at":"2023-04-11T13:39:47Z","abstract_excerpt":"Classic no-regret multi-armed bandit algorithms, including the Upper Confidence Bound (UCB), Hedge, and EXP3, are inherently unfair by design. Their unfairness stems from their objective of playing the most rewarding arm as frequently as possible while ignoring the rest. In this paper, we consider a fair prediction problem in the stochastic setting with a guaranteed minimum rate of accrual of rewards for each arm. We study the problem in both full-information and bandit feedback settings. Combining queueing-theoretic techniques with adversarial bandits, we propose a new online policy, called B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.05219","kind":"arxiv","version":3},"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/2304.05219/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-05T08:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlWIlP6dMnbSIMToWE/EsSRWyLi8c6XeRNTvVtfNEllX+0HGaYSt1RWyhf2zPvMaAnUfe0wunoJmk+T1od1UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:13:09.864323Z"},"content_sha256":"fd8536bfae18e4b6ac97b70c7f4db54ffa9b64d1f0c814275d53fde250104d43","schema_version":"1.0","event_id":"sha256:fd8536bfae18e4b6ac97b70c7f4db54ffa9b64d1f0c814275d53fde250104d43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHS3SENUG73RFSN2DQC7EG55HO/bundle.json","state_url":"https://pith.science/pith/RHS3SENUG73RFSN2DQC7EG55HO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHS3SENUG73RFSN2DQC7EG55HO/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-19T08:13:09Z","links":{"resolver":"https://pith.science/pith/RHS3SENUG73RFSN2DQC7EG55HO","bundle":"https://pith.science/pith/RHS3SENUG73RFSN2DQC7EG55HO/bundle.json","state":"https://pith.science/pith/RHS3SENUG73RFSN2DQC7EG55HO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHS3SENUG73RFSN2DQC7EG55HO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RHS3SENUG73RFSN2DQC7EG55HO","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":"3d5b3b0db01127c02fd4782db81c6bba38f51a10e48093dc7d0296228284035b","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-11T13:39:47Z","title_canon_sha256":"ec57525aa72f929167de47a7b79a8a2bfcbdaf3abb8a4f0c44675852f966609e"},"schema_version":"1.0","source":{"id":"2304.05219","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.05219","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2304.05219v3","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.05219","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"RHS3SENUG73R","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"RHS3SENUG73RFSN2","created_at":"2026-07-05T08:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"RHS3SENU","created_at":"2026-07-05T08:17:56Z"}],"graph_snapshots":[{"event_id":"sha256:fd8536bfae18e4b6ac97b70c7f4db54ffa9b64d1f0c814275d53fde250104d43","target":"graph","created_at":"2026-07-05T08:17:56Z","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/2304.05219/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Classic no-regret multi-armed bandit algorithms, including the Upper Confidence Bound (UCB), Hedge, and EXP3, are inherently unfair by design. Their unfairness stems from their objective of playing the most rewarding arm as frequently as possible while ignoring the rest. In this paper, we consider a fair prediction problem in the stochastic setting with a guaranteed minimum rate of accrual of rewards for each arm. We study the problem in both full-information and bandit feedback settings. Combining queueing-theoretic techniques with adversarial bandits, we propose a new online policy, called B","authors_text":"Abhishek Sinha","cross_cats":["cs.PF"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-11T13:39:47Z","title":"BanditQ: Fair Bandits with Guaranteed Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.05219","kind":"arxiv","version":3},"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:e3dab3d8c22e0e42b89fbb3f8a2d05f27e8b128dc8e915a76708962e464212d1","target":"record","created_at":"2026-07-05T08:17:56Z","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":"3d5b3b0db01127c02fd4782db81c6bba38f51a10e48093dc7d0296228284035b","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-11T13:39:47Z","title_canon_sha256":"ec57525aa72f929167de47a7b79a8a2bfcbdaf3abb8a4f0c44675852f966609e"},"schema_version":"1.0","source":{"id":"2304.05219","kind":"arxiv","version":3}},"canonical_sha256":"89e5b911b437f712c9ba1c05f21bbd3bb732b5c1cdd4ea4af2dbe46fe15939ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89e5b911b437f712c9ba1c05f21bbd3bb732b5c1cdd4ea4af2dbe46fe15939ca","first_computed_at":"2026-07-05T08:17:56.606763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:17:56.606763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WvnX56iFMUnsQE7aNBzmplFRNepv+qZQNuU9MEfs/N/Y/y1Keq1aOZAuouUwaCyiq8lLrrt/t21WsuAnVi/zAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:17:56.607154Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.05219","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3dab3d8c22e0e42b89fbb3f8a2d05f27e8b128dc8e915a76708962e464212d1","sha256:fd8536bfae18e4b6ac97b70c7f4db54ffa9b64d1f0c814275d53fde250104d43"],"state_sha256":"4b0cb25eb28a92f1659cc096f13b85548764bb7dd77201e795662f96befcc970"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbyxeiHch2PRyh3VeRNlDP/u3wUk1sWCIHZ3a6hCq+296hgBA2Zq0HlOoZXMdOUOfOdFcvPMfzKry2GLFlABBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T08:13:09.869272Z","bundle_sha256":"b86f2fa317b059000c51749b5e3894cc9d8e7c1d51c4859f98bb5b0f0d5b8d73"}}