{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VBK4IMZDZ5JYALXWPX4JP5QE4T","short_pith_number":"pith:VBK4IMZD","canonical_record":{"source":{"id":"1710.06360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-17T16:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"daa91c3d20ee9d8d7c2e6dffc1920eba306862a09ddf8f06e9ef49829c583fd4","abstract_canon_sha256":"ed5a469490074385a813c59857546b918a2dad967d1bd4421873d446fe77501a"},"schema_version":"1.0"},"canonical_sha256":"a855c43323cf53802ef67df897f604e4ebf8b704cf8c3856e8838757c799fc80","source":{"kind":"arxiv","id":"1710.06360","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06360","created_at":"2026-05-18T00:23:52Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06360v2","created_at":"2026-05-18T00:23:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06360","created_at":"2026-05-18T00:23:52Z"},{"alias_kind":"pith_short_12","alias_value":"VBK4IMZDZ5JY","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VBK4IMZDZ5JYALXW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VBK4IMZD","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VBK4IMZDZ5JYALXWPX4JP5QE4T","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-17T16:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"daa91c3d20ee9d8d7c2e6dffc1920eba306862a09ddf8f06e9ef49829c583fd4","abstract_canon_sha256":"ed5a469490074385a813c59857546b918a2dad967d1bd4421873d446fe77501a"},"schema_version":"1.0"},"canonical_sha256":"a855c43323cf53802ef67df897f604e4ebf8b704cf8c3856e8838757c799fc80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:52.796661Z","signature_b64":"BL6R7cXFFkmvffiUKXZbCtzeX+uowqMCAJeylEB805EWRU3O6XhA01bg6RHv9022Tq42hHYATfQMAYBOeFYXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a855c43323cf53802ef67df897f604e4ebf8b704cf8c3856e8838757c799fc80","last_reissued_at":"2026-05-18T00:23:52.795925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:52.795925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06360","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-18T00:23:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koag7bt+oIeuuLaS0UFHo9/F5t2aaunmjKdIWE2qMGc3SgVVHSc4S7rxaEjtOQ3Yd/LYcuccQ58dBqig/L5AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:34:19.399830Z"},"content_sha256":"afdd9090bd88978bc721ef25114c420f0bb914726cc363862cf3008bc5e131dd","schema_version":"1.0","event_id":"sha256:afdd9090bd88978bc721ef25114c420f0bb914726cc363862cf3008bc5e131dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VBK4IMZDZ5JYALXWPX4JP5QE4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Good Arm Identification via Bandit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Atsuyoshi Nakamura, Hideaki Kano, Junya Honda, Kentaro Matsuura, Kentaro Sakamaki, Masashi Sugiyama","submitted_at":"2017-10-17T16:08:16Z","abstract_excerpt":"We consider a novel stochastic multi-armed bandit problem called {\\em good arm identification} (GAI), where a good arm is defined as an arm with expected reward greater than or equal to a given threshold. GAI is a pure-exploration problem that a single agent repeats a process of outputting an arm as soon as it is identified as a good one before confirming the other arms are actually not good. The objective of GAI is to minimize the number of samples for each process. We find that GAI faces a new kind of dilemma, the {\\em exploration-exploitation dilemma of confidence}, which is different diffi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06360","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-18T00:23:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpI8L605+m7PTu+czhigLq/+4Di3ikVSgTdTSCdhDOI2vpfnLYrZ9PsfxYqv8d11ZH0dRwS3e+Hf4pwV3wsjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:34:19.400178Z"},"content_sha256":"b3b9835674d1504f1954dbdcb20fedea8062a05b0d1a7a4b7f4616b7b2d54613","schema_version":"1.0","event_id":"sha256:b3b9835674d1504f1954dbdcb20fedea8062a05b0d1a7a4b7f4616b7b2d54613"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBK4IMZDZ5JYALXWPX4JP5QE4T/bundle.json","state_url":"https://pith.science/pith/VBK4IMZDZ5JYALXWPX4JP5QE4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBK4IMZDZ5JYALXWPX4JP5QE4T/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-26T11:34:19Z","links":{"resolver":"https://pith.science/pith/VBK4IMZDZ5JYALXWPX4JP5QE4T","bundle":"https://pith.science/pith/VBK4IMZDZ5JYALXWPX4JP5QE4T/bundle.json","state":"https://pith.science/pith/VBK4IMZDZ5JYALXWPX4JP5QE4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBK4IMZDZ5JYALXWPX4JP5QE4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VBK4IMZDZ5JYALXWPX4JP5QE4T","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":"ed5a469490074385a813c59857546b918a2dad967d1bd4421873d446fe77501a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-17T16:08:16Z","title_canon_sha256":"daa91c3d20ee9d8d7c2e6dffc1920eba306862a09ddf8f06e9ef49829c583fd4"},"schema_version":"1.0","source":{"id":"1710.06360","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06360","created_at":"2026-05-18T00:23:52Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06360v2","created_at":"2026-05-18T00:23:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06360","created_at":"2026-05-18T00:23:52Z"},{"alias_kind":"pith_short_12","alias_value":"VBK4IMZDZ5JY","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VBK4IMZDZ5JYALXW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VBK4IMZD","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:b3b9835674d1504f1954dbdcb20fedea8062a05b0d1a7a4b7f4616b7b2d54613","target":"graph","created_at":"2026-05-18T00:23:52Z","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 consider a novel stochastic multi-armed bandit problem called {\\em good arm identification} (GAI), where a good arm is defined as an arm with expected reward greater than or equal to a given threshold. GAI is a pure-exploration problem that a single agent repeats a process of outputting an arm as soon as it is identified as a good one before confirming the other arms are actually not good. The objective of GAI is to minimize the number of samples for each process. We find that GAI faces a new kind of dilemma, the {\\em exploration-exploitation dilemma of confidence}, which is different diffi","authors_text":"Atsuyoshi Nakamura, Hideaki Kano, Junya Honda, Kentaro Matsuura, Kentaro Sakamaki, Masashi Sugiyama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-17T16:08:16Z","title":"Good Arm Identification via Bandit Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06360","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:afdd9090bd88978bc721ef25114c420f0bb914726cc363862cf3008bc5e131dd","target":"record","created_at":"2026-05-18T00:23:52Z","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":"ed5a469490074385a813c59857546b918a2dad967d1bd4421873d446fe77501a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-17T16:08:16Z","title_canon_sha256":"daa91c3d20ee9d8d7c2e6dffc1920eba306862a09ddf8f06e9ef49829c583fd4"},"schema_version":"1.0","source":{"id":"1710.06360","kind":"arxiv","version":2}},"canonical_sha256":"a855c43323cf53802ef67df897f604e4ebf8b704cf8c3856e8838757c799fc80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a855c43323cf53802ef67df897f604e4ebf8b704cf8c3856e8838757c799fc80","first_computed_at":"2026-05-18T00:23:52.795925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:52.795925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BL6R7cXFFkmvffiUKXZbCtzeX+uowqMCAJeylEB805EWRU3O6XhA01bg6RHv9022Tq42hHYATfQMAYBOeFYXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:52.796661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06360","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afdd9090bd88978bc721ef25114c420f0bb914726cc363862cf3008bc5e131dd","sha256:b3b9835674d1504f1954dbdcb20fedea8062a05b0d1a7a4b7f4616b7b2d54613"],"state_sha256":"583d742389d5421a29b6484f3a84684714bb7fec306a084e35452c937e7bb323"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvEN/48b+o5BnSwl6ApKnM+S7gZ7ZG0J7/58r1azxDyXA/vm496W5s3soV061Kc5TCZStruaq2h3gcVAAiEnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:34:19.402435Z","bundle_sha256":"ca5df3eedfdbbcff51e76728da7d6f69ba07646dfdf1240b96b9d87ff28d7a3c"}}