{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FTSW45DHQE7KNNMLXF3WUOK65M","short_pith_number":"pith:FTSW45DH","canonical_record":{"source":{"id":"1810.05188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-11T18:07:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4c8951bc3a063b1c397cf834717813e883a5f74dcb7652e5b598b27e5e38950b","abstract_canon_sha256":"130371338e5d2fe47e888cc1ccc90894251bf868e667fe4cfdf0abd22c5b052e"},"schema_version":"1.0"},"canonical_sha256":"2ce56e7467813ea6b58bb9776a395eeb32dbae5d193901780915ef6ddbe2a937","source":{"kind":"arxiv","id":"1810.05188","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05188","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05188v2","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05188","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"FTSW45DHQE7K","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FTSW45DHQE7KNNML","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FTSW45DH","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FTSW45DHQE7KNNMLXF3WUOK65M","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-11T18:07:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4c8951bc3a063b1c397cf834717813e883a5f74dcb7652e5b598b27e5e38950b","abstract_canon_sha256":"130371338e5d2fe47e888cc1ccc90894251bf868e667fe4cfdf0abd22c5b052e"},"schema_version":"1.0"},"canonical_sha256":"2ce56e7467813ea6b58bb9776a395eeb32dbae5d193901780915ef6ddbe2a937","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:42.992973Z","signature_b64":"S5quk+nEB9AoPBihIbe/gDE91xqKaNlK8HnCyLcLiGJrrl9rgY+P6wAP/6ZD5aPmbpQ5LqjCDcTRZJmI5AYECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ce56e7467813ea6b58bb9776a395eeb32dbae5d193901780915ef6ddbe2a937","last_reissued_at":"2026-05-17T23:43:42.992426Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:42.992426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05188","source_version":2,"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-17T23:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqawB/YIdxEh5Lf8K2NkschmkzH5scXTgnOH3ylwp+k+FQb+PZlnavhGTWlL8U9ZsFFHR9sxmBv2Wdh34tUwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:15:54.026711Z"},"content_sha256":"239f1ce8c122ea33e4739b50b7af28801fec153b4c0d434b999f7cc7bf6ee83d","schema_version":"1.0","event_id":"sha256:239f1ce8c122ea33e4739b50b7af28801fec153b4c0d434b999f7cc7bf6ee83d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FTSW45DHQE7KNNMLXF3WUOK65M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fighting Contextual Bandits with Stochastic Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ambuj Tewari, Young Hun Jung","submitted_at":"2018-10-11T18:07:43Z","abstract_excerpt":"We introduce a new stochastic smoothing perspective to study adversarial contextual bandit problems. We propose a general algorithm template that represents random perturbation based algorithms and identify several perturbation distributions that lead to strong regret bounds. Using the idea of smoothness, we provide an $O(\\sqrt{T})$ zero-order bound for the vanilla algorithm and an $O(L^{*2/3}_{T})$ first-order bound for the clipped version. These bounds hold when the algorithms use with a variety of distributions that have a bounded hazard rate. Our algorithm template includes EXP4 as a speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05188","kind":"arxiv","version":2},"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-17T23:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouc5sIYSniDnzdVtw43egPI53QxnN/3wBvydtexU/+VCZSAVURttthesGUF3nRq3EED0KsS3OJorsNwu3rozDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:15:54.027064Z"},"content_sha256":"f4b1c41d7f969d44b75af07c1cb162c93e2e878c713d45905b0db470a3824cb5","schema_version":"1.0","event_id":"sha256:f4b1c41d7f969d44b75af07c1cb162c93e2e878c713d45905b0db470a3824cb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTSW45DHQE7KNNMLXF3WUOK65M/bundle.json","state_url":"https://pith.science/pith/FTSW45DHQE7KNNMLXF3WUOK65M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTSW45DHQE7KNNMLXF3WUOK65M/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-06-01T04:15:54Z","links":{"resolver":"https://pith.science/pith/FTSW45DHQE7KNNMLXF3WUOK65M","bundle":"https://pith.science/pith/FTSW45DHQE7KNNMLXF3WUOK65M/bundle.json","state":"https://pith.science/pith/FTSW45DHQE7KNNMLXF3WUOK65M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTSW45DHQE7KNNMLXF3WUOK65M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FTSW45DHQE7KNNMLXF3WUOK65M","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":"130371338e5d2fe47e888cc1ccc90894251bf868e667fe4cfdf0abd22c5b052e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-11T18:07:43Z","title_canon_sha256":"4c8951bc3a063b1c397cf834717813e883a5f74dcb7652e5b598b27e5e38950b"},"schema_version":"1.0","source":{"id":"1810.05188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05188","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05188v2","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05188","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"FTSW45DHQE7K","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FTSW45DHQE7KNNML","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FTSW45DH","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:f4b1c41d7f969d44b75af07c1cb162c93e2e878c713d45905b0db470a3824cb5","target":"graph","created_at":"2026-05-17T23:43:42Z","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 introduce a new stochastic smoothing perspective to study adversarial contextual bandit problems. We propose a general algorithm template that represents random perturbation based algorithms and identify several perturbation distributions that lead to strong regret bounds. Using the idea of smoothness, we provide an $O(\\sqrt{T})$ zero-order bound for the vanilla algorithm and an $O(L^{*2/3}_{T})$ first-order bound for the clipped version. These bounds hold when the algorithms use with a variety of distributions that have a bounded hazard rate. Our algorithm template includes EXP4 as a speci","authors_text":"Ambuj Tewari, Young Hun Jung","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-11T18:07:43Z","title":"Fighting Contextual Bandits with Stochastic Smoothing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05188","kind":"arxiv","version":2},"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:239f1ce8c122ea33e4739b50b7af28801fec153b4c0d434b999f7cc7bf6ee83d","target":"record","created_at":"2026-05-17T23:43:42Z","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":"130371338e5d2fe47e888cc1ccc90894251bf868e667fe4cfdf0abd22c5b052e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-11T18:07:43Z","title_canon_sha256":"4c8951bc3a063b1c397cf834717813e883a5f74dcb7652e5b598b27e5e38950b"},"schema_version":"1.0","source":{"id":"1810.05188","kind":"arxiv","version":2}},"canonical_sha256":"2ce56e7467813ea6b58bb9776a395eeb32dbae5d193901780915ef6ddbe2a937","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ce56e7467813ea6b58bb9776a395eeb32dbae5d193901780915ef6ddbe2a937","first_computed_at":"2026-05-17T23:43:42.992426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:42.992426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S5quk+nEB9AoPBihIbe/gDE91xqKaNlK8HnCyLcLiGJrrl9rgY+P6wAP/6ZD5aPmbpQ5LqjCDcTRZJmI5AYECg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:42.992973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:239f1ce8c122ea33e4739b50b7af28801fec153b4c0d434b999f7cc7bf6ee83d","sha256:f4b1c41d7f969d44b75af07c1cb162c93e2e878c713d45905b0db470a3824cb5"],"state_sha256":"20227254c10759c8001b79f5429364cc9cf37bc89f9054ac6ef123a10f2ac4d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heiks9CAZ7eLTidtGXZ3hjllfLhezuAui0Fj/Q588bM/XfcMjt4JgNR/xUZDJ63iS0b2XEtpP9VBwg/laa1AAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:15:54.029123Z","bundle_sha256":"1e2640b33780ba241afb4ff5f3ed2248f8dc74c14e5ea8c9c11d9a4fbaa1ec0c"}}