{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S34UTKYKILWAMY2QDUBS62CKDK","short_pith_number":"pith:S34UTKYK","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"},"canonical_sha256":"96f949ab0a42ec0663501d032f684a1aa26e4d08314ad6012f838e57026582f2","source":{"kind":"arxiv","id":"1803.04665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04665","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04665v1","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04665","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"S34UTKYKILWA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S34UTKYKILWAMY2Q","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S34UTKYK","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S34UTKYKILWAMY2QDUBS62CKDK","target":"record","payload":{"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"},"canonical_sha256":"96f949ab0a42ec0663501d032f684a1aa26e4d08314ad6012f838e57026582f2","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"},"source_kind":"arxiv","source_id":"1803.04665","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-18T00:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ylf4/FnJQfvvW/Wu5o0szR5PfQHSs83qxo7+bYMopoUXYMflEIda+y25FdY3PBc3LPMeX99L20NR7iCiaS/GDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:12:18.962427Z"},"content_sha256":"3575a1674510862b13c63173108ba16f4fbc835c5dd1b4c183b70eb409da498b","schema_version":"1.0","event_id":"sha256:3575a1674510862b13c63173108ba16f4fbc835c5dd1b4c183b70eb409da498b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S34UTKYKILWAMY2QDUBS62CKDK","target":"graph","payload":{"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"},"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:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3/3Ota/R5MJkb8o+oWvvaOAMNkjAMb3PonEhhCQW99R9URImaVKfMz0HONNAQ4USDFbUAJEhb86kF3zfBY5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:12:18.962764Z"},"content_sha256":"e8172cf70943d503c5bf1a06427e7258ae3f33cb1c3313409c290e773535eb1e","schema_version":"1.0","event_id":"sha256:e8172cf70943d503c5bf1a06427e7258ae3f33cb1c3313409c290e773535eb1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/bundle.json","state_url":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S34UTKYKILWAMY2QDUBS62CKDK/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-05-31T02:12:18Z","links":{"resolver":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK","bundle":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/bundle.json","state":"https://pith.science/pith/S34UTKYKILWAMY2QDUBS62CKDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S34UTKYKILWAMY2QDUBS62CKDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S34UTKYKILWAMY2QDUBS62CKDK","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":"40a9c771211bd9330f35c607c622b879388158192331ba11f87e9e76a7013d85","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-13T07:36:31Z","title_canon_sha256":"77685f7ca671ba1b720ea080e21beea433bd2754d6d23540e0e545ba69cb6ffa"},"schema_version":"1.0","source":{"id":"1803.04665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04665","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04665v1","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04665","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"S34UTKYKILWA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S34UTKYKILWAMY2Q","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S34UTKYK","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:e8172cf70943d503c5bf1a06427e7258ae3f33cb1c3313409c290e773535eb1e","target":"graph","created_at":"2026-05-18T00:15:36Z","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 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","authors_text":"CNRS, CRIStAL), Emilie Kaufmann (SEQUEL, Javed Aslam, Jesse Anderton, Maryam Aziz","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-13T07:36:31Z","title":"Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04665","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:3575a1674510862b13c63173108ba16f4fbc835c5dd1b4c183b70eb409da498b","target":"record","created_at":"2026-05-18T00:15:36Z","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":"40a9c771211bd9330f35c607c622b879388158192331ba11f87e9e76a7013d85","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-13T07:36:31Z","title_canon_sha256":"77685f7ca671ba1b720ea080e21beea433bd2754d6d23540e0e545ba69cb6ffa"},"schema_version":"1.0","source":{"id":"1803.04665","kind":"arxiv","version":1}},"canonical_sha256":"96f949ab0a42ec0663501d032f684a1aa26e4d08314ad6012f838e57026582f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96f949ab0a42ec0663501d032f684a1aa26e4d08314ad6012f838e57026582f2","first_computed_at":"2026-05-18T00:15:36.438555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:36.438555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OpsaDF1moDGNZwqqWzvXqaRxJ1b2pLyKo0Ny3NQnQj/lxMBFpb6nihpq4fyt1LhnEk+Ov1BwKINo6UgW6PvMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:36.439288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3575a1674510862b13c63173108ba16f4fbc835c5dd1b4c183b70eb409da498b","sha256:e8172cf70943d503c5bf1a06427e7258ae3f33cb1c3313409c290e773535eb1e"],"state_sha256":"aae8a3af15ef34fca102af4ea8b2b6cb2c4e8113271a83cd5f0c8fe35dce934d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23r7LVI/DuHxsxoyzY7XBL1LEbQaLOtivN1px86HE5Dxzrf1IlfYK0w/oMz2qp/Ogrl6dIGdZjo3iVEhKQZKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:12:18.964677Z","bundle_sha256":"e8ce9c7971e91145105e54707115d37c08b4c319c2bc0f0d7c78c333dcfec79d"}}