{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JX4FFOSH4UZF3NKBMAE2HDRYUW","short_pith_number":"pith:JX4FFOSH","schema_version":"1.0","canonical_sha256":"4df852ba47e5325db5416009a38e38a59d5aaade2ca24e75ee4104363707b86a","source":{"kind":"arxiv","id":"1706.05198","version":2},"attestation_state":"computed","paper":{"title":"Structured Best Arm Identification with Fixed Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Csaba Szepesv\\'ari, Martin M\\\"uller, Mohammad M. Ajallooeian, Ruitong Huang","submitted_at":"2017-06-16T09:51:36Z","abstract_excerpt":"We study the problem of identifying the best action among a set of possible options when the value of each action is given by a mapping from a number of noisy micro-observables in the so-called fixed confidence setting. Our main motivation is the application to the minimax game search, which has been a major topic of interest in artificial intelligence. In this paper we introduce an abstract setting to clearly describe the essential properties of the problem. While previous work only considered a two-move game tree search problem, our abstract setting can be applied to the general minimax game"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.05198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-16T09:51:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e3b018ac3315e0c105cb47470c10d79323690f299dd372d812b31d3602eeeed3","abstract_canon_sha256":"119d7279f3858fed92a83dfabf5b6df8bb1968a3e663550c507ca95cc0d4ab2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:11.800040Z","signature_b64":"5k0v2L8ofIJgOWQgpwBDAm/Evlh3dgS3d370HQ8+CZGISZRVfLxLXwlBywzC+SeTRWkGU00EtnNseGTZdJTECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df852ba47e5325db5416009a38e38a59d5aaade2ca24e75ee4104363707b86a","last_reissued_at":"2026-05-18T00:42:11.799448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:11.799448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Best Arm Identification with Fixed Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Csaba Szepesv\\'ari, Martin M\\\"uller, Mohammad M. Ajallooeian, Ruitong Huang","submitted_at":"2017-06-16T09:51:36Z","abstract_excerpt":"We study the problem of identifying the best action among a set of possible options when the value of each action is given by a mapping from a number of noisy micro-observables in the so-called fixed confidence setting. Our main motivation is the application to the minimax game search, which has been a major topic of interest in artificial intelligence. In this paper we introduce an abstract setting to clearly describe the essential properties of the problem. While previous work only considered a two-move game tree search problem, our abstract setting can be applied to the general minimax game"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05198","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.05198","created_at":"2026-05-18T00:42:11.799536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05198v2","created_at":"2026-05-18T00:42:11.799536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05198","created_at":"2026-05-18T00:42:11.799536+00:00"},{"alias_kind":"pith_short_12","alias_value":"JX4FFOSH4UZF","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JX4FFOSH4UZF3NKB","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JX4FFOSH","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19695","citing_title":"Planning in entropy-regularized Markov decision processes and games","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW","json":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW.json","graph_json":"https://pith.science/api/pith-number/JX4FFOSH4UZF3NKBMAE2HDRYUW/graph.json","events_json":"https://pith.science/api/pith-number/JX4FFOSH4UZF3NKBMAE2HDRYUW/events.json","paper":"https://pith.science/paper/JX4FFOSH"},"agent_actions":{"view_html":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW","download_json":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW.json","view_paper":"https://pith.science/paper/JX4FFOSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05198&json=true","fetch_graph":"https://pith.science/api/pith-number/JX4FFOSH4UZF3NKBMAE2HDRYUW/graph.json","fetch_events":"https://pith.science/api/pith-number/JX4FFOSH4UZF3NKBMAE2HDRYUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/action/storage_attestation","attest_author":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/action/author_attestation","sign_citation":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/action/citation_signature","submit_replication":"https://pith.science/pith/JX4FFOSH4UZF3NKBMAE2HDRYUW/action/replication_record"}},"created_at":"2026-05-18T00:42:11.799536+00:00","updated_at":"2026-05-18T00:42:11.799536+00:00"}