{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:CAJXS32SNHYYPDM6YYULK6PB3Q","short_pith_number":"pith:CAJXS32S","canonical_record":{"source":{"id":"2109.13595","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-28T10:11:06Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"ac00d81b337de92a1bb5aec418c5dd0911f15951ecf98819873190460831923a","abstract_canon_sha256":"dde2b232e9cfcbf0a954fcac2701eb22582a5b67408aad319c64ad82cf67ed3c"},"schema_version":"1.0"},"canonical_sha256":"1013796f5269f1878d9ec628b579e1dc1ba6a64e35c9ae530d9ff779bf2db711","source":{"kind":"arxiv","id":"2109.13595","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.13595","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"2109.13595v8","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.13595","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"CAJXS32SNHYY","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"pith_short_16","alias_value":"CAJXS32SNHYYPDM6","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"pith_short_8","alias_value":"CAJXS32S","created_at":"2026-07-05T09:34:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:CAJXS32SNHYYPDM6YYULK6PB3Q","target":"record","payload":{"canonical_record":{"source":{"id":"2109.13595","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-28T10:11:06Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"ac00d81b337de92a1bb5aec418c5dd0911f15951ecf98819873190460831923a","abstract_canon_sha256":"dde2b232e9cfcbf0a954fcac2701eb22582a5b67408aad319c64ad82cf67ed3c"},"schema_version":"1.0"},"canonical_sha256":"1013796f5269f1878d9ec628b579e1dc1ba6a64e35c9ae530d9ff779bf2db711","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:32.294628Z","signature_b64":"HsVcNHNJghW3oYcjCJc88UXBqm9aemzXkvvklTUUYldqd7po7gxoBg7TFa1AM103htetjbmaIcgks6jl0L9yCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1013796f5269f1878d9ec628b579e1dc1ba6a64e35c9ae530d9ff779bf2db711","last_reissued_at":"2026-07-05T09:34:32.294159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:32.294159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.13595","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-05T09:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QI9RurdIDwjjdCCbuZcERFUinOOeLIJQ/QDhl7FV0cLF3N/YRx9jXEvfmWOznRRFgR60xp5RQxPC5tskFTPoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:31:11.575846Z"},"content_sha256":"e956bbd3600477df71e26b7fdeaade31d413b84a93a86076f1e784f9abb4a180","schema_version":"1.0","event_id":"sha256:e956bbd3600477df71e26b7fdeaade31d413b84a93a86076f1e784f9abb4a180"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:CAJXS32SNHYYPDM6YYULK6PB3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Fragility of Optimized Bandit Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Lin Fan, Peter W. Glynn","submitted_at":"2021-09-28T10:11:06Z","abstract_excerpt":"Much of the literature on optimal design of bandit algorithms is based on minimization of expected regret. It is well known that designs that are optimal over certain exponential families can achieve expected regret that grows logarithmically in the number of arm plays, at a rate governed by the Lai-Robbins lower bound. In this paper, we show that when one uses such optimized designs, the regret distribution of the associated algorithms necessarily has a very heavy tail, specifically, that of a truncated Cauchy distribution. Furthermore, for $p>1$, the $p$'th moment of the regret distribution "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.13595","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/2109.13595/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-05T09:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GM9XTrG2HAzrCN0ei+ihHmOPv8ruDDvRd3TFPB7C8NilHwrgOm6zgavB5EdYp8nABtWmfweFqIP95/ZD8kVtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:31:11.576834Z"},"content_sha256":"208f871b3537e831058acff1d9df9a387fa3a258c7ce8b1e846b35cb8e9234fd","schema_version":"1.0","event_id":"sha256:208f871b3537e831058acff1d9df9a387fa3a258c7ce8b1e846b35cb8e9234fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAJXS32SNHYYPDM6YYULK6PB3Q/bundle.json","state_url":"https://pith.science/pith/CAJXS32SNHYYPDM6YYULK6PB3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAJXS32SNHYYPDM6YYULK6PB3Q/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-13T08:31:11Z","links":{"resolver":"https://pith.science/pith/CAJXS32SNHYYPDM6YYULK6PB3Q","bundle":"https://pith.science/pith/CAJXS32SNHYYPDM6YYULK6PB3Q/bundle.json","state":"https://pith.science/pith/CAJXS32SNHYYPDM6YYULK6PB3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAJXS32SNHYYPDM6YYULK6PB3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:CAJXS32SNHYYPDM6YYULK6PB3Q","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":"dde2b232e9cfcbf0a954fcac2701eb22582a5b67408aad319c64ad82cf67ed3c","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-28T10:11:06Z","title_canon_sha256":"ac00d81b337de92a1bb5aec418c5dd0911f15951ecf98819873190460831923a"},"schema_version":"1.0","source":{"id":"2109.13595","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.13595","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"2109.13595v8","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.13595","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"CAJXS32SNHYY","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"pith_short_16","alias_value":"CAJXS32SNHYYPDM6","created_at":"2026-07-05T09:34:32Z"},{"alias_kind":"pith_short_8","alias_value":"CAJXS32S","created_at":"2026-07-05T09:34:32Z"}],"graph_snapshots":[{"event_id":"sha256:208f871b3537e831058acff1d9df9a387fa3a258c7ce8b1e846b35cb8e9234fd","target":"graph","created_at":"2026-07-05T09:34:32Z","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/2109.13595/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Much of the literature on optimal design of bandit algorithms is based on minimization of expected regret. It is well known that designs that are optimal over certain exponential families can achieve expected regret that grows logarithmically in the number of arm plays, at a rate governed by the Lai-Robbins lower bound. In this paper, we show that when one uses such optimized designs, the regret distribution of the associated algorithms necessarily has a very heavy tail, specifically, that of a truncated Cauchy distribution. Furthermore, for $p>1$, the $p$'th moment of the regret distribution ","authors_text":"Lin Fan, Peter W. Glynn","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-28T10:11:06Z","title":"The Fragility of Optimized Bandit Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.13595","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:e956bbd3600477df71e26b7fdeaade31d413b84a93a86076f1e784f9abb4a180","target":"record","created_at":"2026-07-05T09:34:32Z","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":"dde2b232e9cfcbf0a954fcac2701eb22582a5b67408aad319c64ad82cf67ed3c","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-28T10:11:06Z","title_canon_sha256":"ac00d81b337de92a1bb5aec418c5dd0911f15951ecf98819873190460831923a"},"schema_version":"1.0","source":{"id":"2109.13595","kind":"arxiv","version":8}},"canonical_sha256":"1013796f5269f1878d9ec628b579e1dc1ba6a64e35c9ae530d9ff779bf2db711","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1013796f5269f1878d9ec628b579e1dc1ba6a64e35c9ae530d9ff779bf2db711","first_computed_at":"2026-07-05T09:34:32.294159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:34:32.294159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HsVcNHNJghW3oYcjCJc88UXBqm9aemzXkvvklTUUYldqd7po7gxoBg7TFa1AM103htetjbmaIcgks6jl0L9yCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:34:32.294628Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.13595","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e956bbd3600477df71e26b7fdeaade31d413b84a93a86076f1e784f9abb4a180","sha256:208f871b3537e831058acff1d9df9a387fa3a258c7ce8b1e846b35cb8e9234fd"],"state_sha256":"0c6cb6db883e9301eada6d3148dfe4902c9daac1de6514f06c0614c768be0e9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hw2zXJXEA1numKxlEfN5ouytcuiDEMgNZpi4iuL7eoI0XK8vtCrhzEuPzMxqgVcSLJN+w2ja9wRE7Z6l3PqPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:31:11.668361Z","bundle_sha256":"a0ab1f8948da712f7b66c8dfbbb814c607baa40848d0f84001cf92e39752126a"}}