{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S34UTKYKILWAMY2QDUBS62CKDK","short_pith_number":"pith:S34UTKYK","schema_version":"1.0","canonical_sha256":"96f949ab0a42ec0663501d032f684a1aa26e4d08314ad6012f838e57026582f2","source":{"kind":"arxiv","id":"1803.04665","version":1},"attestation_state":"computed","paper":{"title":"Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"CNRS, CRIStAL), Emilie Kaufmann (SEQUEL, Javed Aslam, Jesse Anderton, Maryam Aziz","submitted_at":"2018-03-13T07:36:31Z","abstract_excerpt":"We consider the problem of near-optimal arm identification in the fixed confidence setting of the infinitely armed bandit problem when nothing is known about the arm reservoir distribution. We (1) introduce a PAC-like framework within which to derive and cast results; (2) derive a sample complexity lower bound for near-optimal arm identification; (3) propose an algorithm that identifies a nearly-optimal arm with high probability and derive an upper bound on its sample complexity which is within a log factor of our lower bound; and (4) discuss whether our log^2(1/delta) dependence is inescapabl"},"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":"1803.04665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-13T07:36:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"77685f7ca671ba1b720ea080e21beea433bd2754d6d23540e0e545ba69cb6ffa","abstract_canon_sha256":"40a9c771211bd9330f35c607c622b879388158192331ba11f87e9e76a7013d85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:36.439288Z","signature_b64":"OpsaDF1moDGNZwqqWzvXqaRxJ1b2pLyKo0Ny3NQnQj/lxMBFpb6nihpq4fyt1LhnEk+Ov1BwKINo6UgW6PvMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96f949ab0a42ec0663501d032f684a1aa26e4d08314ad6012f838e57026582f2","last_reissued_at":"2026-05-18T00:15:36.438555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:36.438555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"CNRS, CRIStAL), Emilie Kaufmann (SEQUEL, Javed Aslam, Jesse Anderton, Maryam Aziz","submitted_at":"2018-03-13T07:36:31Z","abstract_excerpt":"We consider the problem of near-optimal arm identification in the fixed confidence setting of the infinitely armed bandit problem when nothing is known about the arm reservoir distribution. We (1) introduce a PAC-like framework within which to derive and cast results; (2) derive a sample complexity lower bound for near-optimal arm identification; (3) propose an algorithm that identifies a nearly-optimal arm with high probability and derive an upper bound on its sample complexity which is within a log factor of our lower bound; and (4) discuss whether our log^2(1/delta) dependence is inescapabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04665","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.04665","created_at":"2026-05-18T00:15:36.438678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04665v1","created_at":"2026-05-18T00:15:36.438678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04665","created_at":"2026-05-18T00:15:36.438678+00:00"},{"alias_kind":"pith_short_12","alias_value":"S34UTKYKILWA","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S34UTKYKILWAMY2Q","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S34UTKYK","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK","json":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK.json","graph_json":"https://pith.science/api/pith-number/S34UTKYKILWAMY2QDUBS62CKDK/graph.json","events_json":"https://pith.science/api/pith-number/S34UTKYKILWAMY2QDUBS62CKDK/events.json","paper":"https://pith.science/paper/S34UTKYK"},"agent_actions":{"view_html":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK","download_json":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK.json","view_paper":"https://pith.science/paper/S34UTKYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04665&json=true","fetch_graph":"https://pith.science/api/pith-number/S34UTKYKILWAMY2QDUBS62CKDK/graph.json","fetch_events":"https://pith.science/api/pith-number/S34UTKYKILWAMY2QDUBS62CKDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/action/storage_attestation","attest_author":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/action/author_attestation","sign_citation":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/action/citation_signature","submit_replication":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/action/replication_record"}},"created_at":"2026-05-18T00:15:36.438678+00:00","updated_at":"2026-05-18T00:15:36.438678+00:00"}