{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P6KWOMMXTWA7GLJSV6HT2TJM73","short_pith_number":"pith:P6KWOMMX","canonical_record":{"source":{"id":"1802.04064","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T14:30:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"00b8e8bd4e8e6d6c24bc6ccb0a3beaf3a19084119d386a80e8f7fe82cb07ff67","abstract_canon_sha256":"9da63e26942c448df80fa5635b5c70a0afbde73756b8e0d5aa144db59dc5e9c0"},"schema_version":"1.0"},"canonical_sha256":"7f956731979d81f32d32af8f3d4d2cfefb893411b2faa67692457276b22e8427","source":{"kind":"arxiv","id":"1802.04064","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04064","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04064v5","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04064","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"P6KWOMMXTWA7","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"pith_short_16","alias_value":"P6KWOMMXTWA7GLJS","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"pith_short_8","alias_value":"P6KWOMMX","created_at":"2026-07-05T02:46:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P6KWOMMXTWA7GLJSV6HT2TJM73","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04064","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T14:30:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"00b8e8bd4e8e6d6c24bc6ccb0a3beaf3a19084119d386a80e8f7fe82cb07ff67","abstract_canon_sha256":"9da63e26942c448df80fa5635b5c70a0afbde73756b8e0d5aa144db59dc5e9c0"},"schema_version":"1.0"},"canonical_sha256":"7f956731979d81f32d32af8f3d4d2cfefb893411b2faa67692457276b22e8427","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:22.211280Z","signature_b64":"GGO/dZeAEpyK/84EthdRkah89e6OAiaYkRzZ12zA4/lc9+cELa+LHmdUYN9Y2Feg5QlJS6U/kT/3JwHlzMEjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f956731979d81f32d32af8f3d4d2cfefb893411b2faa67692457276b22e8427","last_reissued_at":"2026-07-05T02:46:22.210803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:22.210803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04064","source_version":5,"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-05T02:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEh+qynRiiPnAozfy/4OPOYbQr+92a8+beCdAoTm56G9Qx5LbAeWQEc3IG6t7DEU/tgYDwROFouXU8vKchOZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:12:45.413980Z"},"content_sha256":"edbf6dd4d2358a722d3eb3174a96ececcd23d8d1fd690006b4b14d05eb918420","schema_version":"1.0","event_id":"sha256:edbf6dd4d2358a722d3eb3174a96ececcd23d8d1fd690006b4b14d05eb918420"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P6KWOMMXTWA7GLJSV6HT2TJM73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Contextual Bandit Bake-off","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alberto Bietti, Alekh Agarwal, John Langford","submitted_at":"2018-02-12T14:30:56Z","abstract_excerpt":"Contextual bandit algorithms are essential for solving many real-world interactive machine learning problems. Despite multiple recent successes on statistically and computationally efficient methods, the practical behavior of these algorithms is still poorly understood. We leverage the availability of large numbers of supervised learning datasets to empirically evaluate contextual bandit algorithms, focusing on practical methods that learn by relying on optimization oracles from supervised learning. We find that a recent method (Foster et al., 2018) using optimism under uncertainty works the b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04064","kind":"arxiv","version":5},"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/1802.04064/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-05T02:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioJxQy+OBS/Kpc8jhWXLVcT8/ZNAZDCjK9oBLsBeenZ/0ReM4Bo+MNkcsXpPNoHGzR47WaymBK1HSrI7Z3lHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:12:45.414500Z"},"content_sha256":"5ee1ae18b489a59daad928f4d2e80f5259520b49197065b3ae41d8844a508929","schema_version":"1.0","event_id":"sha256:5ee1ae18b489a59daad928f4d2e80f5259520b49197065b3ae41d8844a508929"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6KWOMMXTWA7GLJSV6HT2TJM73/bundle.json","state_url":"https://pith.science/pith/P6KWOMMXTWA7GLJSV6HT2TJM73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6KWOMMXTWA7GLJSV6HT2TJM73/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-10T14:12:45Z","links":{"resolver":"https://pith.science/pith/P6KWOMMXTWA7GLJSV6HT2TJM73","bundle":"https://pith.science/pith/P6KWOMMXTWA7GLJSV6HT2TJM73/bundle.json","state":"https://pith.science/pith/P6KWOMMXTWA7GLJSV6HT2TJM73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6KWOMMXTWA7GLJSV6HT2TJM73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P6KWOMMXTWA7GLJSV6HT2TJM73","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":"9da63e26942c448df80fa5635b5c70a0afbde73756b8e0d5aa144db59dc5e9c0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T14:30:56Z","title_canon_sha256":"00b8e8bd4e8e6d6c24bc6ccb0a3beaf3a19084119d386a80e8f7fe82cb07ff67"},"schema_version":"1.0","source":{"id":"1802.04064","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04064","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04064v5","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04064","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"P6KWOMMXTWA7","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"pith_short_16","alias_value":"P6KWOMMXTWA7GLJS","created_at":"2026-07-05T02:46:22Z"},{"alias_kind":"pith_short_8","alias_value":"P6KWOMMX","created_at":"2026-07-05T02:46:22Z"}],"graph_snapshots":[{"event_id":"sha256:5ee1ae18b489a59daad928f4d2e80f5259520b49197065b3ae41d8844a508929","target":"graph","created_at":"2026-07-05T02:46:22Z","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/1802.04064/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Contextual bandit algorithms are essential for solving many real-world interactive machine learning problems. Despite multiple recent successes on statistically and computationally efficient methods, the practical behavior of these algorithms is still poorly understood. We leverage the availability of large numbers of supervised learning datasets to empirically evaluate contextual bandit algorithms, focusing on practical methods that learn by relying on optimization oracles from supervised learning. We find that a recent method (Foster et al., 2018) using optimism under uncertainty works the b","authors_text":"Alberto Bietti, Alekh Agarwal, John Langford","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T14:30:56Z","title":"A Contextual Bandit Bake-off"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04064","kind":"arxiv","version":5},"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:edbf6dd4d2358a722d3eb3174a96ececcd23d8d1fd690006b4b14d05eb918420","target":"record","created_at":"2026-07-05T02:46:22Z","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":"9da63e26942c448df80fa5635b5c70a0afbde73756b8e0d5aa144db59dc5e9c0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T14:30:56Z","title_canon_sha256":"00b8e8bd4e8e6d6c24bc6ccb0a3beaf3a19084119d386a80e8f7fe82cb07ff67"},"schema_version":"1.0","source":{"id":"1802.04064","kind":"arxiv","version":5}},"canonical_sha256":"7f956731979d81f32d32af8f3d4d2cfefb893411b2faa67692457276b22e8427","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f956731979d81f32d32af8f3d4d2cfefb893411b2faa67692457276b22e8427","first_computed_at":"2026-07-05T02:46:22.210803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:46:22.210803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GGO/dZeAEpyK/84EthdRkah89e6OAiaYkRzZ12zA4/lc9+cELa+LHmdUYN9Y2Feg5QlJS6U/kT/3JwHlzMEjCw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:46:22.211280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04064","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edbf6dd4d2358a722d3eb3174a96ececcd23d8d1fd690006b4b14d05eb918420","sha256:5ee1ae18b489a59daad928f4d2e80f5259520b49197065b3ae41d8844a508929"],"state_sha256":"f3a567a2d6b01d3bd303aeebf2b9d97b2d29735394a189c9edabb59b4d32a556"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DLvC308ScXFbXBVBK5nVuHw7ooly+zjMoZysQQ1hsN+9BGZHw2KzPoVY9SyVDvmbUwCFANHgNBleoRW4X1sBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T14:12:45.420041Z","bundle_sha256":"146e94751566c2c41bfc05bc32fe3379bab0a99a1f7dcb44eb8a8b7e3d448f69"}}