{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F7XJ662Y7GAQLONHUZFADBDJNF","short_pith_number":"pith:F7XJ662Y","schema_version":"1.0","canonical_sha256":"2fee9f7b58f98105b9a7a64a018469695af4d9f6897fdcb7dc3a6b5ee55dda6d","source":{"kind":"arxiv","id":"1610.09559","version":4},"attestation_state":"computed","paper":{"title":"Fair Algorithms for Infinite and Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Jamie Morgenstern, Matthew Joseph, Michael Kearns, Seth Neel","submitted_at":"2016-10-29T18:46:11Z","abstract_excerpt":"We study fairness in linear bandit problems. Starting from the notion of meritocratic fairness introduced in Joseph et al. [2016], we carry out a more refined analysis of a more general problem, achieving better performance guarantees with fewer modelling assumptions on the number and structure of available choices as well as the number selected. We also analyze the previously-unstudied question of fairness in infinite linear bandit problems, obtaining instance-dependent regret upper bounds as well as lower bounds demonstrating that this instance-dependence is necessary. The result is a framew"},"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":"1610.09559","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-29T18:46:11Z","cross_cats_sorted":[],"title_canon_sha256":"e625d748eca6dcc3b5b297bb6d6865f7dd5f47f812d3c415d69807b922a15733","abstract_canon_sha256":"38cb7bf83edb8fe6f860e09d2ff637d7ac658c11c6e021781c999625a588e465"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:18.160722Z","signature_b64":"FDV4qdKxugAA9BiMoOSSd7xQccU6qCbXLPpkb1+eIrmJdxL+2+vTAFbQu+2iHENW1vcilrX1O4PrqaH60PRlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fee9f7b58f98105b9a7a64a018469695af4d9f6897fdcb7dc3a6b5ee55dda6d","last_reissued_at":"2026-05-18T00:41:18.160076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:18.160076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Algorithms for Infinite and Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Jamie Morgenstern, Matthew Joseph, Michael Kearns, Seth Neel","submitted_at":"2016-10-29T18:46:11Z","abstract_excerpt":"We study fairness in linear bandit problems. Starting from the notion of meritocratic fairness introduced in Joseph et al. [2016], we carry out a more refined analysis of a more general problem, achieving better performance guarantees with fewer modelling assumptions on the number and structure of available choices as well as the number selected. We also analyze the previously-unstudied question of fairness in infinite linear bandit problems, obtaining instance-dependent regret upper bounds as well as lower bounds demonstrating that this instance-dependence is necessary. The result is a framew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09559","kind":"arxiv","version":4},"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":"1610.09559","created_at":"2026-05-18T00:41:18.160179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09559v4","created_at":"2026-05-18T00:41:18.160179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09559","created_at":"2026-05-18T00:41:18.160179+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7XJ662Y7GAQ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7XJ662Y7GAQLONH","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7XJ662Y","created_at":"2026-05-18T12:30:15.759754+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/F7XJ662Y7GAQLONHUZFADBDJNF","json":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF.json","graph_json":"https://pith.science/api/pith-number/F7XJ662Y7GAQLONHUZFADBDJNF/graph.json","events_json":"https://pith.science/api/pith-number/F7XJ662Y7GAQLONHUZFADBDJNF/events.json","paper":"https://pith.science/paper/F7XJ662Y"},"agent_actions":{"view_html":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF","download_json":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF.json","view_paper":"https://pith.science/paper/F7XJ662Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09559&json=true","fetch_graph":"https://pith.science/api/pith-number/F7XJ662Y7GAQLONHUZFADBDJNF/graph.json","fetch_events":"https://pith.science/api/pith-number/F7XJ662Y7GAQLONHUZFADBDJNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/action/storage_attestation","attest_author":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/action/author_attestation","sign_citation":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/action/citation_signature","submit_replication":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/action/replication_record"}},"created_at":"2026-05-18T00:41:18.160179+00:00","updated_at":"2026-05-18T00:41:18.160179+00:00"}