{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YFFFJ3CIJ56VPRYGGMPV34LINU","short_pith_number":"pith:YFFFJ3CI","canonical_record":{"source":{"id":"1704.09011","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T17:15:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23cc4810c29bb0c70bf47de651b1415891329c6593bbd9abd72494924571559f","abstract_canon_sha256":"f4ab7dd30033aca8d8b15b8602ad936fef5b2edf3ce8a5acaf65f6c608228db0"},"schema_version":"1.0"},"canonical_sha256":"c14a54ec484f7d57c706331f5df1686d3a0607ac213f70b937a19ba8211d30cc","source":{"kind":"arxiv","id":"1704.09011","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.09011","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.09011v8","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.09011","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"YFFFJ3CIJ56V","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"pith_short_16","alias_value":"YFFFJ3CIJ56VPRYG","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"pith_short_8","alias_value":"YFFFJ3CI","created_at":"2026-07-05T00:55:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YFFFJ3CIJ56VPRYGGMPV34LINU","target":"record","payload":{"canonical_record":{"source":{"id":"1704.09011","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T17:15:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23cc4810c29bb0c70bf47de651b1415891329c6593bbd9abd72494924571559f","abstract_canon_sha256":"f4ab7dd30033aca8d8b15b8602ad936fef5b2edf3ce8a5acaf65f6c608228db0"},"schema_version":"1.0"},"canonical_sha256":"c14a54ec484f7d57c706331f5df1686d3a0607ac213f70b937a19ba8211d30cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:53.816910Z","signature_b64":"wpbuA7zrOOvinHrKXauB5/HVjQSPP6o9GAro+DQ5HN+ZVxc4cN+GI39h1W0LYw90auwsYHAR4l1NbWzsIrjZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c14a54ec484f7d57c706331f5df1686d3a0607ac213f70b937a19ba8211d30cc","last_reissued_at":"2026-07-05T00:55:53.816471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:53.816471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.09011","source_version":8,"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-05T00:55:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjlEU67l4YjviRG5zL0BzqcXRIg1ALfOA6ehBVqsIQQLIAkr+mZXb6y4ZLTuwHSirb5BvzH44sxk80891sPPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:48:51.620997Z"},"content_sha256":"8cd8fedefbdb2926b34bb2945cd945e022123a360bfc84d052b4306928fb9e86","schema_version":"1.0","event_id":"sha256:8cd8fedefbdb2926b34bb2945cd945e022123a360bfc84d052b4306928fb9e86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YFFFJ3CIJ56VPRYGGMPV34LINU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mostly Exploration-Free Algorithms for Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hamsa Bastani, Khashayar Khosravi, Mohsen Bayati","submitted_at":"2017-04-28T17:15:56Z","abstract_excerpt":"The contextual bandit literature has traditionally focused on algorithms that address the exploration-exploitation tradeoff. In particular, greedy algorithms that exploit current estimates without any exploration may be sub-optimal in general. However, exploration-free greedy algorithms are desirable in practical settings where exploration may be costly or unethical (e.g., clinical trials). Surprisingly, we find that a simple greedy algorithm can be rate optimal (achieves asymptotically optimal regret) if there is sufficient randomness in the observed contexts (covariates). We prove that this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.09011","kind":"arxiv","version":8},"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/1704.09011/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-05T00:55:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGhHgToWUyynOMUf1eXCzgn1QQ+p3w9TC4xuM4cXICXDJjRaPFJSretSrcQmnnfwr+UwSSbTp1PgTCTR8iqECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:48:51.621491Z"},"content_sha256":"2a7e8f0573941f1c7d3db318e5a1560965e89026107f1425515f8ece7a064f1d","schema_version":"1.0","event_id":"sha256:2a7e8f0573941f1c7d3db318e5a1560965e89026107f1425515f8ece7a064f1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFFFJ3CIJ56VPRYGGMPV34LINU/bundle.json","state_url":"https://pith.science/pith/YFFFJ3CIJ56VPRYGGMPV34LINU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFFFJ3CIJ56VPRYGGMPV34LINU/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-16T10:48:51Z","links":{"resolver":"https://pith.science/pith/YFFFJ3CIJ56VPRYGGMPV34LINU","bundle":"https://pith.science/pith/YFFFJ3CIJ56VPRYGGMPV34LINU/bundle.json","state":"https://pith.science/pith/YFFFJ3CIJ56VPRYGGMPV34LINU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFFFJ3CIJ56VPRYGGMPV34LINU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YFFFJ3CIJ56VPRYGGMPV34LINU","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":"f4ab7dd30033aca8d8b15b8602ad936fef5b2edf3ce8a5acaf65f6c608228db0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T17:15:56Z","title_canon_sha256":"23cc4810c29bb0c70bf47de651b1415891329c6593bbd9abd72494924571559f"},"schema_version":"1.0","source":{"id":"1704.09011","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.09011","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.09011v8","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.09011","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"YFFFJ3CIJ56V","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"pith_short_16","alias_value":"YFFFJ3CIJ56VPRYG","created_at":"2026-07-05T00:55:53Z"},{"alias_kind":"pith_short_8","alias_value":"YFFFJ3CI","created_at":"2026-07-05T00:55:53Z"}],"graph_snapshots":[{"event_id":"sha256:2a7e8f0573941f1c7d3db318e5a1560965e89026107f1425515f8ece7a064f1d","target":"graph","created_at":"2026-07-05T00:55:53Z","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/1704.09011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The contextual bandit literature has traditionally focused on algorithms that address the exploration-exploitation tradeoff. In particular, greedy algorithms that exploit current estimates without any exploration may be sub-optimal in general. However, exploration-free greedy algorithms are desirable in practical settings where exploration may be costly or unethical (e.g., clinical trials). Surprisingly, we find that a simple greedy algorithm can be rate optimal (achieves asymptotically optimal regret) if there is sufficient randomness in the observed contexts (covariates). We prove that this ","authors_text":"Hamsa Bastani, Khashayar Khosravi, Mohsen Bayati","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T17:15:56Z","title":"Mostly Exploration-Free Algorithms for Contextual Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.09011","kind":"arxiv","version":8},"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:8cd8fedefbdb2926b34bb2945cd945e022123a360bfc84d052b4306928fb9e86","target":"record","created_at":"2026-07-05T00:55:53Z","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":"f4ab7dd30033aca8d8b15b8602ad936fef5b2edf3ce8a5acaf65f6c608228db0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-28T17:15:56Z","title_canon_sha256":"23cc4810c29bb0c70bf47de651b1415891329c6593bbd9abd72494924571559f"},"schema_version":"1.0","source":{"id":"1704.09011","kind":"arxiv","version":8}},"canonical_sha256":"c14a54ec484f7d57c706331f5df1686d3a0607ac213f70b937a19ba8211d30cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c14a54ec484f7d57c706331f5df1686d3a0607ac213f70b937a19ba8211d30cc","first_computed_at":"2026-07-05T00:55:53.816471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:55:53.816471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpbuA7zrOOvinHrKXauB5/HVjQSPP6o9GAro+DQ5HN+ZVxc4cN+GI39h1W0LYw90auwsYHAR4l1NbWzsIrjZAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:55:53.816910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.09011","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cd8fedefbdb2926b34bb2945cd945e022123a360bfc84d052b4306928fb9e86","sha256:2a7e8f0573941f1c7d3db318e5a1560965e89026107f1425515f8ece7a064f1d"],"state_sha256":"52711a0226862814edaacc8a1b6d233ecec33f3c329b3c36d44a96677d5491a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"liNOABaJAqETF9TqFVjXt7qclmAS9ALf2+Vl3hPSXZvZ2iAAJwyDG51SWS1hOMxr9OBQs7+USkC2ErwVPE+8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:48:51.625575Z","bundle_sha256":"52576bea071c9fc66ab89665a921556cff73ab22356557205c8f822730c878fe"}}