{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F7XJ662Y7GAQLONHUZFADBDJNF","short_pith_number":"pith:F7XJ662Y","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"},"canonical_sha256":"2fee9f7b58f98105b9a7a64a018469695af4d9f6897fdcb7dc3a6b5ee55dda6d","source":{"kind":"arxiv","id":"1610.09559","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09559","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09559v4","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09559","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"F7XJ662Y7GAQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F7XJ662Y7GAQLONH","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F7XJ662Y","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F7XJ662Y7GAQLONHUZFADBDJNF","target":"record","payload":{"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"},"canonical_sha256":"2fee9f7b58f98105b9a7a64a018469695af4d9f6897fdcb7dc3a6b5ee55dda6d","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"},"source_kind":"arxiv","source_id":"1610.09559","source_version":4,"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-18T00:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xo/FfagtDexF6fzzDbei/DS6lBjopcDHkLsNN29g9h+TQ60iZdZVfHaXoQ73+IKw0jVRrXXx9vq7pobRDepaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:50:28.437369Z"},"content_sha256":"cdff4fd6bd4212e3c0ba48e270f75906d80a722a6560812f8903d46a892a6db3","schema_version":"1.0","event_id":"sha256:cdff4fd6bd4212e3c0ba48e270f75906d80a722a6560812f8903d46a892a6db3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F7XJ662Y7GAQLONHUZFADBDJNF","target":"graph","payload":{"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"},"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-18T00:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2B6+hvcw44tdEcWweVvAY6tPRs7Lcpyo4YAJLPgblmGuyli5u8B8jMYQhmXwsacjlhtEhQKEQaeY8tVe9ymBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:50:28.437877Z"},"content_sha256":"0b16aa0de0b4ab3487cef85de5ec623f9af3db4bdea8925615954ff7dac75dd0","schema_version":"1.0","event_id":"sha256:0b16aa0de0b4ab3487cef85de5ec623f9af3db4bdea8925615954ff7dac75dd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/bundle.json","state_url":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7XJ662Y7GAQLONHUZFADBDJNF/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-30T09:50:28Z","links":{"resolver":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF","bundle":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/bundle.json","state":"https://pith.science/pith/F7XJ662Y7GAQLONHUZFADBDJNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7XJ662Y7GAQLONHUZFADBDJNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F7XJ662Y7GAQLONHUZFADBDJNF","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":"38cb7bf83edb8fe6f860e09d2ff637d7ac658c11c6e021781c999625a588e465","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-29T18:46:11Z","title_canon_sha256":"e625d748eca6dcc3b5b297bb6d6865f7dd5f47f812d3c415d69807b922a15733"},"schema_version":"1.0","source":{"id":"1610.09559","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09559","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09559v4","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09559","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"F7XJ662Y7GAQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F7XJ662Y7GAQLONH","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F7XJ662Y","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:0b16aa0de0b4ab3487cef85de5ec623f9af3db4bdea8925615954ff7dac75dd0","target":"graph","created_at":"2026-05-18T00:41:18Z","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"},"paper":{"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","authors_text":"Aaron Roth, Jamie Morgenstern, Matthew Joseph, Michael Kearns, Seth Neel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-29T18:46:11Z","title":"Fair Algorithms for Infinite and Contextual Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09559","kind":"arxiv","version":4},"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:cdff4fd6bd4212e3c0ba48e270f75906d80a722a6560812f8903d46a892a6db3","target":"record","created_at":"2026-05-18T00:41:18Z","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":"38cb7bf83edb8fe6f860e09d2ff637d7ac658c11c6e021781c999625a588e465","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-29T18:46:11Z","title_canon_sha256":"e625d748eca6dcc3b5b297bb6d6865f7dd5f47f812d3c415d69807b922a15733"},"schema_version":"1.0","source":{"id":"1610.09559","kind":"arxiv","version":4}},"canonical_sha256":"2fee9f7b58f98105b9a7a64a018469695af4d9f6897fdcb7dc3a6b5ee55dda6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fee9f7b58f98105b9a7a64a018469695af4d9f6897fdcb7dc3a6b5ee55dda6d","first_computed_at":"2026-05-18T00:41:18.160076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:18.160076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FDV4qdKxugAA9BiMoOSSd7xQccU6qCbXLPpkb1+eIrmJdxL+2+vTAFbQu+2iHENW1vcilrX1O4PrqaH60PRlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:18.160722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09559","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdff4fd6bd4212e3c0ba48e270f75906d80a722a6560812f8903d46a892a6db3","sha256:0b16aa0de0b4ab3487cef85de5ec623f9af3db4bdea8925615954ff7dac75dd0"],"state_sha256":"cb5aa08dc3c19e93e98d3b832a10048fea46d6ddab95b2c83f45f902aa1c4f5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ljK80AXZnqTFq3tZZHSSImcCe2r9X3vYRNXWyScmT1LG7U8lR15bA47dJI34uW/at6INYQjDm4+jFYGWO8wDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:50:28.439975Z","bundle_sha256":"dc8d2e2fb5717682a4af1066fb2d6d8597e84e5bfe2eece9b18280c11b4ea860"}}