{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QVZ75EUFZIKUY7PCS3MLQ2GR2J","short_pith_number":"pith:QVZ75EUF","canonical_record":{"source":{"id":"1602.04676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T13:55:45Z","cross_cats_sorted":["cs.GT","stat.ML","stat.TH"],"title_canon_sha256":"14a794c210eeb28b72837d8c38d75367d72a2d19063c2efc8b94fbd1be232a41","abstract_canon_sha256":"d75924bcf72a2b8de4cdbbb8071ce53a17c69ca87c577f6326f82ca54aa134ec"},"schema_version":"1.0"},"canonical_sha256":"8573fe9285ca154c7de296d8b868d1d264fbb3cba5e17223f447879968620306","source":{"kind":"arxiv","id":"1602.04676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04676","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04676v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04676","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"QVZ75EUFZIKU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QVZ75EUFZIKUY7PC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QVZ75EUF","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QVZ75EUFZIKUY7PCS3MLQ2GR2J","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T13:55:45Z","cross_cats_sorted":["cs.GT","stat.ML","stat.TH"],"title_canon_sha256":"14a794c210eeb28b72837d8c38d75367d72a2d19063c2efc8b94fbd1be232a41","abstract_canon_sha256":"d75924bcf72a2b8de4cdbbb8071ce53a17c69ca87c577f6326f82ca54aa134ec"},"schema_version":"1.0"},"canonical_sha256":"8573fe9285ca154c7de296d8b868d1d264fbb3cba5e17223f447879968620306","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:49.428105Z","signature_b64":"iwgTbJxMSV4YbGGI9mVQGW52VgSUgudoP3ght20+ilSlrD+P4cr5jDp93kD2cgLwOWXan2hQorLZxVOj06+2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8573fe9285ca154c7de296d8b868d1d264fbb3cba5e17223f447879968620306","last_reissued_at":"2026-05-18T01:20:49.427757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:49.427757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04676","source_version":1,"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-18T01:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZuuEPh4X9P3DtAP3c9xkHo9kbEceuwBoxTKAQb71e8I/ryjPt+e8sAzptx5ClGFRbAdIXN20Ts8Rly895t1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:46:31.380124Z"},"content_sha256":"75fefeb5234adcc37164cb81bb5717e2233eac00da0f354933e8e4cee6194f7c","schema_version":"1.0","event_id":"sha256:75fefeb5234adcc37164cb81bb5717e2233eac00da0f354933e8e4cee6194f7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QVZ75EUFZIKUY7PCS3MLQ2GR2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximin Action Identification: A New Bandit Framework for Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aur\\'elien Garivier (IMT), Emilie Kaufmann (CRIStAL, SEQUEL), Wouter Koolen (CWI)","submitted_at":"2016-02-15T13:55:45Z","abstract_excerpt":"We study an original problem of pure exploration in a strategic bandit model motivated by Monte Carlo Tree Search. It consists in identifying the best action in a game, when the player may sample random outcomes of sequentially chosen pairs of actions. We propose two strategies for the fixed-confidence setting: Maximin-LUCB, based on lower-and upper-confidence bounds; and Maximin-Racing, which operates by successively eliminating the sub-optimal actions. We discuss the sample complexity of both methods and compare their performance empirically. We sketch a lower bound analysis, and possible co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04676","kind":"arxiv","version":1},"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-18T01:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1+oEADPygkhOOPHEpowuNYaFklexk9xH0CKok9gSCm2m6ey3uuLTHzVOXayDu+xQT2EcLLc9nVatR7SR+tsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:46:31.380512Z"},"content_sha256":"10513240bd517b330903021299405e00363f591967113ff1581b5a68764856fb","schema_version":"1.0","event_id":"sha256:10513240bd517b330903021299405e00363f591967113ff1581b5a68764856fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVZ75EUFZIKUY7PCS3MLQ2GR2J/bundle.json","state_url":"https://pith.science/pith/QVZ75EUFZIKUY7PCS3MLQ2GR2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVZ75EUFZIKUY7PCS3MLQ2GR2J/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-04T03:46:31Z","links":{"resolver":"https://pith.science/pith/QVZ75EUFZIKUY7PCS3MLQ2GR2J","bundle":"https://pith.science/pith/QVZ75EUFZIKUY7PCS3MLQ2GR2J/bundle.json","state":"https://pith.science/pith/QVZ75EUFZIKUY7PCS3MLQ2GR2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVZ75EUFZIKUY7PCS3MLQ2GR2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QVZ75EUFZIKUY7PCS3MLQ2GR2J","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":"d75924bcf72a2b8de4cdbbb8071ce53a17c69ca87c577f6326f82ca54aa134ec","cross_cats_sorted":["cs.GT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T13:55:45Z","title_canon_sha256":"14a794c210eeb28b72837d8c38d75367d72a2d19063c2efc8b94fbd1be232a41"},"schema_version":"1.0","source":{"id":"1602.04676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04676","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04676v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04676","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"QVZ75EUFZIKU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QVZ75EUFZIKUY7PC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QVZ75EUF","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:10513240bd517b330903021299405e00363f591967113ff1581b5a68764856fb","target":"graph","created_at":"2026-05-18T01:20:49Z","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 study an original problem of pure exploration in a strategic bandit model motivated by Monte Carlo Tree Search. It consists in identifying the best action in a game, when the player may sample random outcomes of sequentially chosen pairs of actions. We propose two strategies for the fixed-confidence setting: Maximin-LUCB, based on lower-and upper-confidence bounds; and Maximin-Racing, which operates by successively eliminating the sub-optimal actions. We discuss the sample complexity of both methods and compare their performance empirically. We sketch a lower bound analysis, and possible co","authors_text":"Aur\\'elien Garivier (IMT), Emilie Kaufmann (CRIStAL, SEQUEL), Wouter Koolen (CWI)","cross_cats":["cs.GT","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T13:55:45Z","title":"Maximin Action Identification: A New Bandit Framework for Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04676","kind":"arxiv","version":1},"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:75fefeb5234adcc37164cb81bb5717e2233eac00da0f354933e8e4cee6194f7c","target":"record","created_at":"2026-05-18T01:20:49Z","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":"d75924bcf72a2b8de4cdbbb8071ce53a17c69ca87c577f6326f82ca54aa134ec","cross_cats_sorted":["cs.GT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T13:55:45Z","title_canon_sha256":"14a794c210eeb28b72837d8c38d75367d72a2d19063c2efc8b94fbd1be232a41"},"schema_version":"1.0","source":{"id":"1602.04676","kind":"arxiv","version":1}},"canonical_sha256":"8573fe9285ca154c7de296d8b868d1d264fbb3cba5e17223f447879968620306","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8573fe9285ca154c7de296d8b868d1d264fbb3cba5e17223f447879968620306","first_computed_at":"2026-05-18T01:20:49.427757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:49.427757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iwgTbJxMSV4YbGGI9mVQGW52VgSUgudoP3ght20+ilSlrD+P4cr5jDp93kD2cgLwOWXan2hQorLZxVOj06+2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:49.428105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75fefeb5234adcc37164cb81bb5717e2233eac00da0f354933e8e4cee6194f7c","sha256:10513240bd517b330903021299405e00363f591967113ff1581b5a68764856fb"],"state_sha256":"ee3a040fc8c60b5ffa06480744d4f7a8464340f862f04b8760ee6f1bbb88df3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bhjF+ewaoA453sKKWZZYBqODquEXLzUEP+3mYC5pdu92sqq8GD+/KxDva5FKkYKasSYyXIt7agewd/tZCsntAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:46:31.382914Z","bundle_sha256":"fdc20aef310a0e2e08e07781694353ef85db3897cefb7d02e694bfdcc831572d"}}