{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X343LJO6VQPGZAZRQL7JKM7DB3","short_pith_number":"pith:X343LJO6","canonical_record":{"source":{"id":"1810.04088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T15:45:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"98ef675b97227918557eaf77d1c4ce35e05ca7161d20af6c5f5c23fea217aeb1","abstract_canon_sha256":"327b342bc6dfec8a9eace33dc8f5e39860c311aed7222a87acd6a5a49cee2ade"},"schema_version":"1.0"},"canonical_sha256":"bef9b5a5deac1e6c833182fe9533e30ec7c2de2e7daab7e40dc7c6772381834a","source":{"kind":"arxiv","id":"1810.04088","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04088","created_at":"2026-05-17T23:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04088v2","created_at":"2026-05-17T23:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04088","created_at":"2026-05-17T23:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"X343LJO6VQPG","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X343LJO6VQPGZAZR","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X343LJO6","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X343LJO6VQPGZAZRQL7JKM7DB3","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T15:45:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"98ef675b97227918557eaf77d1c4ce35e05ca7161d20af6c5f5c23fea217aeb1","abstract_canon_sha256":"327b342bc6dfec8a9eace33dc8f5e39860c311aed7222a87acd6a5a49cee2ade"},"schema_version":"1.0"},"canonical_sha256":"bef9b5a5deac1e6c833182fe9533e30ec7c2de2e7daab7e40dc7c6772381834a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:40.621659Z","signature_b64":"8TZUgLlY3w7NgcL41WLtjRZ7JoQhE2Qb4RbxG3Wk6VIiFe7LeF5Kpn+KuPgMFGYRJcsst2Pzhze0oI/3uVjQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bef9b5a5deac1e6c833182fe9533e30ec7c2de2e7daab7e40dc7c6772381834a","last_reissued_at":"2026-05-17T23:52:40.620962Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:40.620962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04088","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZP4VzIvNzw8HfrNzzzKgkEC7n3/rOAEE3gSuPRYI3ykA2nXrT9Gqbow28Sb2ntTnm+DxbsbQKScHJml2FD7GBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:48:29.203079Z"},"content_sha256":"6459bd09b0b21fd1f7dc5cd86c9b7fcbc3027623b90333497a09515e4b580093","schema_version":"1.0","event_id":"sha256:6459bd09b0b21fd1f7dc5cd86c9b7fcbc3027623b90333497a09515e4b580093"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X343LJO6VQPGZAZRQL7JKM7DB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bridging the gap between regret minimization and best arm identification, with application to A/B tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cl\\'ement Calauz\\`enes, R\\'emy Degenne, Thomas Nedelec, Vianney Perchet","submitted_at":"2018-10-09T15:45:10Z","abstract_excerpt":"State of the art online learning procedures focus either on selecting the best alternative (\"best arm identification\") or on minimizing the cost (the \"regret\"). We merge these two objectives by providing the theoretical analysis of cost minimizing algorithms that are also delta-PAC (with a proven guaranteed bound on the decision time), hence fulfilling at the same time regret minimization and best arm identification. This analysis sheds light on the common observation that ill-callibrated UCB-algorithms minimize regret while still identifying quickly the best arm.\n  We also extend these result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04088","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxN4SI/V8VLU1iidISFkZFs5gZEmLGY8vHfPH0wK6jCWh2tWcayDhZnryxJY64nzw7lQWMRr0eZBbzGCrfj8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:48:29.203440Z"},"content_sha256":"8035e6b7363c7daab39e8d1427cbf50bf6819603d0eaa25dfad497a7939a55ef","schema_version":"1.0","event_id":"sha256:8035e6b7363c7daab39e8d1427cbf50bf6819603d0eaa25dfad497a7939a55ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X343LJO6VQPGZAZRQL7JKM7DB3/bundle.json","state_url":"https://pith.science/pith/X343LJO6VQPGZAZRQL7JKM7DB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X343LJO6VQPGZAZRQL7JKM7DB3/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-01T13:48:29Z","links":{"resolver":"https://pith.science/pith/X343LJO6VQPGZAZRQL7JKM7DB3","bundle":"https://pith.science/pith/X343LJO6VQPGZAZRQL7JKM7DB3/bundle.json","state":"https://pith.science/pith/X343LJO6VQPGZAZRQL7JKM7DB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X343LJO6VQPGZAZRQL7JKM7DB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X343LJO6VQPGZAZRQL7JKM7DB3","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":"327b342bc6dfec8a9eace33dc8f5e39860c311aed7222a87acd6a5a49cee2ade","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T15:45:10Z","title_canon_sha256":"98ef675b97227918557eaf77d1c4ce35e05ca7161d20af6c5f5c23fea217aeb1"},"schema_version":"1.0","source":{"id":"1810.04088","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04088","created_at":"2026-05-17T23:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04088v2","created_at":"2026-05-17T23:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04088","created_at":"2026-05-17T23:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"X343LJO6VQPG","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X343LJO6VQPGZAZR","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X343LJO6","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:8035e6b7363c7daab39e8d1427cbf50bf6819603d0eaa25dfad497a7939a55ef","target":"graph","created_at":"2026-05-17T23:52:40Z","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":"State of the art online learning procedures focus either on selecting the best alternative (\"best arm identification\") or on minimizing the cost (the \"regret\"). We merge these two objectives by providing the theoretical analysis of cost minimizing algorithms that are also delta-PAC (with a proven guaranteed bound on the decision time), hence fulfilling at the same time regret minimization and best arm identification. This analysis sheds light on the common observation that ill-callibrated UCB-algorithms minimize regret while still identifying quickly the best arm.\n  We also extend these result","authors_text":"Cl\\'ement Calauz\\`enes, R\\'emy Degenne, Thomas Nedelec, Vianney Perchet","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T15:45:10Z","title":"Bridging the gap between regret minimization and best arm identification, with application to A/B tests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04088","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:6459bd09b0b21fd1f7dc5cd86c9b7fcbc3027623b90333497a09515e4b580093","target":"record","created_at":"2026-05-17T23:52:40Z","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":"327b342bc6dfec8a9eace33dc8f5e39860c311aed7222a87acd6a5a49cee2ade","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-09T15:45:10Z","title_canon_sha256":"98ef675b97227918557eaf77d1c4ce35e05ca7161d20af6c5f5c23fea217aeb1"},"schema_version":"1.0","source":{"id":"1810.04088","kind":"arxiv","version":2}},"canonical_sha256":"bef9b5a5deac1e6c833182fe9533e30ec7c2de2e7daab7e40dc7c6772381834a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bef9b5a5deac1e6c833182fe9533e30ec7c2de2e7daab7e40dc7c6772381834a","first_computed_at":"2026-05-17T23:52:40.620962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:40.620962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8TZUgLlY3w7NgcL41WLtjRZ7JoQhE2Qb4RbxG3Wk6VIiFe7LeF5Kpn+KuPgMFGYRJcsst2Pzhze0oI/3uVjQCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:40.621659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04088","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6459bd09b0b21fd1f7dc5cd86c9b7fcbc3027623b90333497a09515e4b580093","sha256:8035e6b7363c7daab39e8d1427cbf50bf6819603d0eaa25dfad497a7939a55ef"],"state_sha256":"5957639a7690f0263e2c44b3648fbf99a06304e4cba126a5ebf82b9b19da528c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmxdrNWtZPbMtZaxbx6BIFZn/3GQ2mQ1N4Hxp9Pxx2RpqLDSqUjjTWMU7BQYL1c1ahj1imB7LzbEAcXtCDuhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:48:29.205348Z","bundle_sha256":"01a0e08e68038fec4f0522984ce418b5eaeeec592f5e2ca8b5f7c07129c80c1c"}}