{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XZ4A3NBTHESGDQQMOOW2XYHWIQ","short_pith_number":"pith:XZ4A3NBT","canonical_record":{"source":{"id":"1605.08481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T00:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"8066884b6e48ffce8af16784c6a656bfe474c55d36b9b746cdc65f53349aee19","abstract_canon_sha256":"232e982d9bb0adacb8ad673f752e6d7e5399763a20df4af130c025586d73e109"},"schema_version":"1.0"},"canonical_sha256":"be780db433392461c20c73adabe0f64422da60c3546bd6b7d44749918fd1e87c","source":{"kind":"arxiv","id":"1605.08481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08481","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08481v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08481","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"XZ4A3NBTHESG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XZ4A3NBTHESGDQQM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XZ4A3NBT","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XZ4A3NBTHESGDQQMOOW2XYHWIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T00:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"8066884b6e48ffce8af16784c6a656bfe474c55d36b9b746cdc65f53349aee19","abstract_canon_sha256":"232e982d9bb0adacb8ad673f752e6d7e5399763a20df4af130c025586d73e109"},"schema_version":"1.0"},"canonical_sha256":"be780db433392461c20c73adabe0f64422da60c3546bd6b7d44749918fd1e87c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.831572Z","signature_b64":"l1vht3BYhYty9Sp25TikaVTvYoHKz39ZT0elNmgCq5cwJDL2/R8ZUfdE+2bdFU7nKLlz5sAWOY5zFk/Uzo4wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be780db433392461c20c73adabe0f64422da60c3546bd6b7d44749918fd1e87c","last_reissued_at":"2026-05-18T01:13:29.830914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.830914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08481","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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"576TDIxBM82a0llpHi20nSrM9C+O9umq1sh8LXzGSxkqa3USd0vjEUy7fvOIcls4xD/R/wKmkpPKThU9L66fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T10:30:20.047069Z"},"content_sha256":"2d3e04ebfa543370c23976fc6e9464fb734cbb17f14b93199abeb68dab53ffbe","schema_version":"1.0","event_id":"sha256:2d3e04ebfa543370c23976fc6e9464fb734cbb17f14b93199abeb68dab53ffbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XZ4A3NBTHESGDQQMOOW2XYHWIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen","submitted_at":"2016-05-27T00:23:39Z","abstract_excerpt":"The best arm identification problem (BEST-1-ARM) is the most basic pure exploration problem in stochastic multi-armed bandits. The problem has a long history and attracted significant attention for the last decade. However, we do not yet have a complete understanding of the optimal sample complexity of the problem: The state-of-the-art algorithms achieve a sample complexity of $O(\\sum_{i=2}^{n} \\Delta_{i}^{-2}(\\ln\\delta^{-1} + \\ln\\ln\\Delta_i^{-1}))$ ($\\Delta_{i}$ is the difference between the largest mean and the $i^{th}$ mean), while the best known lower bound is $\\Omega(\\sum_{i=2}^{n} \\Delta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08481","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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wKOGNLDwlMNNiJxoU5Nck0lFRX08CQZM9UsOVZ4jdako4npZJCgjr7IL9q2yxHPvEtwxT41uC4uHUxO4h/ABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T10:30:20.047429Z"},"content_sha256":"ca0b915a5e97b7951f7c22f517757c2c1bc2bb8fef9efe2be67faa59f02acb43","schema_version":"1.0","event_id":"sha256:ca0b915a5e97b7951f7c22f517757c2c1bc2bb8fef9efe2be67faa59f02acb43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/bundle.json","state_url":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/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-21T10:30:20Z","links":{"resolver":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ","bundle":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/bundle.json","state":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XZ4A3NBTHESGDQQMOOW2XYHWIQ","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":"232e982d9bb0adacb8ad673f752e6d7e5399763a20df4af130c025586d73e109","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T00:23:39Z","title_canon_sha256":"8066884b6e48ffce8af16784c6a656bfe474c55d36b9b746cdc65f53349aee19"},"schema_version":"1.0","source":{"id":"1605.08481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08481","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08481v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08481","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"XZ4A3NBTHESG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XZ4A3NBTHESGDQQM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XZ4A3NBT","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ca0b915a5e97b7951f7c22f517757c2c1bc2bb8fef9efe2be67faa59f02acb43","target":"graph","created_at":"2026-05-18T01:13:29Z","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":"The best arm identification problem (BEST-1-ARM) is the most basic pure exploration problem in stochastic multi-armed bandits. The problem has a long history and attracted significant attention for the last decade. However, we do not yet have a complete understanding of the optimal sample complexity of the problem: The state-of-the-art algorithms achieve a sample complexity of $O(\\sum_{i=2}^{n} \\Delta_{i}^{-2}(\\ln\\delta^{-1} + \\ln\\ln\\Delta_i^{-1}))$ ($\\Delta_{i}$ is the difference between the largest mean and the $i^{th}$ mean), while the best known lower bound is $\\Omega(\\sum_{i=2}^{n} \\Delta","authors_text":"Jian Li, Lijie Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T00:23:39Z","title":"Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08481","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:2d3e04ebfa543370c23976fc6e9464fb734cbb17f14b93199abeb68dab53ffbe","target":"record","created_at":"2026-05-18T01:13:29Z","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":"232e982d9bb0adacb8ad673f752e6d7e5399763a20df4af130c025586d73e109","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T00:23:39Z","title_canon_sha256":"8066884b6e48ffce8af16784c6a656bfe474c55d36b9b746cdc65f53349aee19"},"schema_version":"1.0","source":{"id":"1605.08481","kind":"arxiv","version":1}},"canonical_sha256":"be780db433392461c20c73adabe0f64422da60c3546bd6b7d44749918fd1e87c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be780db433392461c20c73adabe0f64422da60c3546bd6b7d44749918fd1e87c","first_computed_at":"2026-05-18T01:13:29.830914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.830914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l1vht3BYhYty9Sp25TikaVTvYoHKz39ZT0elNmgCq5cwJDL2/R8ZUfdE+2bdFU7nKLlz5sAWOY5zFk/Uzo4wCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.831572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d3e04ebfa543370c23976fc6e9464fb734cbb17f14b93199abeb68dab53ffbe","sha256:ca0b915a5e97b7951f7c22f517757c2c1bc2bb8fef9efe2be67faa59f02acb43"],"state_sha256":"f0ac85de8ceefcbc3f0968cc1c9ebf09d3b8133e5ea94729b99e54e1dbf7d280"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOoqazXl6xpE0B8Et7lgh6ETC0OTCsz2IKjpQE9sqly3rItulM1Qi0IOZRUcSEuQkzNR8UCM/bcLtn4kry4VDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T10:30:20.051439Z","bundle_sha256":"3ce002c549e58246c3699a88b339b2fb3a2b2cb570191a55131a70ee2973c13a"}}