{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SJRZB2QTI3XITGTBZHFQ5YXIZW","short_pith_number":"pith:SJRZB2QT","schema_version":"1.0","canonical_sha256":"926390ea1346ee899a61c9cb0ee2e8cdb58373813abf4a11768f1861bcd1cf65","source":{"kind":"arxiv","id":"1905.11260","version":3},"attestation_state":"computed","paper":{"title":"Achieving Fairness in Stochastic Multi-armed Bandit Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ganesh Ghalme, Vineet Nair, Vishakha Patil, Y. Narahari","submitted_at":"2019-05-27T14:27:49Z","abstract_excerpt":"We study an interesting variant of the stochastic multi-armed bandit problem, called the Fair-SMAB problem, where each arm is required to be pulled for at least a given fraction of the total available rounds. We investigate the interplay between learning and fairness in terms of a pre-specified vector denoting the fractions of guaranteed pulls. We define a fairness-aware regret, called r-Regret, that takes into account the above fairness constraints and naturally extends the conventional notion of regret. Our primary contribution is characterizing a class of Fair-SMAB algorithms by two paramet"},"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":"1905.11260","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T14:27:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9234a764f3856ed48f6e1f509c579cf0aad0b0789678de753ad6854d00e8289c","abstract_canon_sha256":"9852c965c0a91652335c383df297fd1124e4fd064a5e0be9138925140152b482"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:53.739747Z","signature_b64":"I16cjk3NlhfkqepmrUbqhTJedaMSPi52oxfB3IeiGtMbLDahGK+SYEdSxvnJe9DPBGsuca0IPruurF5yuuHAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926390ea1346ee899a61c9cb0ee2e8cdb58373813abf4a11768f1861bcd1cf65","last_reissued_at":"2026-05-17T23:39:53.739172Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:53.739172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Fairness in Stochastic Multi-armed Bandit Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ganesh Ghalme, Vineet Nair, Vishakha Patil, Y. Narahari","submitted_at":"2019-05-27T14:27:49Z","abstract_excerpt":"We study an interesting variant of the stochastic multi-armed bandit problem, called the Fair-SMAB problem, where each arm is required to be pulled for at least a given fraction of the total available rounds. We investigate the interplay between learning and fairness in terms of a pre-specified vector denoting the fractions of guaranteed pulls. We define a fairness-aware regret, called r-Regret, that takes into account the above fairness constraints and naturally extends the conventional notion of regret. Our primary contribution is characterizing a class of Fair-SMAB algorithms by two paramet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11260","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":""},"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":"1905.11260","created_at":"2026-05-17T23:39:53.739250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11260v3","created_at":"2026-05-17T23:39:53.739250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11260","created_at":"2026-05-17T23:39:53.739250+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJRZB2QTI3XI","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJRZB2QTI3XITGTB","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJRZB2QT","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW","json":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW.json","graph_json":"https://pith.science/api/pith-number/SJRZB2QTI3XITGTBZHFQ5YXIZW/graph.json","events_json":"https://pith.science/api/pith-number/SJRZB2QTI3XITGTBZHFQ5YXIZW/events.json","paper":"https://pith.science/paper/SJRZB2QT"},"agent_actions":{"view_html":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW","download_json":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW.json","view_paper":"https://pith.science/paper/SJRZB2QT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11260&json=true","fetch_graph":"https://pith.science/api/pith-number/SJRZB2QTI3XITGTBZHFQ5YXIZW/graph.json","fetch_events":"https://pith.science/api/pith-number/SJRZB2QTI3XITGTBZHFQ5YXIZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW/action/storage_attestation","attest_author":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW/action/author_attestation","sign_citation":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW/action/citation_signature","submit_replication":"https://pith.science/pith/SJRZB2QTI3XITGTBZHFQ5YXIZW/action/replication_record"}},"created_at":"2026-05-17T23:39:53.739250+00:00","updated_at":"2026-05-17T23:39:53.739250+00:00"}