{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:A2DPGAMJDPTQIHI54TJMNFWUJN","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":"411d6db86ebbd8e44b54b22b39f6ae3267af1812c651d1da09feb780f51b9f21","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T12:28:09Z","title_canon_sha256":"10aa226d6d0392ea91b009fdca8ea62dabc9a6ee18d8d1aab212e81fa672aed0"},"schema_version":"1.0","source":{"id":"2501.13607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13607","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13607v1","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13607","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"A2DPGAMJDPTQ","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"A2DPGAMJDPTQIHI5","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"A2DPGAMJ","created_at":"2026-07-05T10:04:31Z"}],"graph_snapshots":[{"event_id":"sha256:0ddec172deea7507d8a0d4db0d33c8a8ec0d503d0cb771d5b914768bc4e1f89d","target":"graph","created_at":"2026-07-05T10:04:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.13607/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a multi-armed bandit setting with finitely many arms, in which each arm yields an $M$-dimensional vector reward upon selection. We assume that the reward of each dimension (a.k.a. {\\em objective}) is generated independently of the others. The best arm of any given objective is the arm with the largest component of mean corresponding to the objective. The end goal is to identify the best arm of {\\em every} objective in the shortest (expected) time subject to an upper bound on the probability of error (i.e., fixed-confidence regime). We establish a problem-dependent lower bound on th","authors_text":"P.N. Karthik, Vincent Y. F. Tan, Yeow Meng Chee, Zhirui Chen","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T12:28:09Z","title":"Optimal Multi-Objective Best Arm Identification with Fixed Confidence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13607","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:9c92d620e3847ac99710dfaf82db23c4869dd03e9231dd20fba4c3bafb5e7d73","target":"record","created_at":"2026-07-05T10:04:31Z","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":"411d6db86ebbd8e44b54b22b39f6ae3267af1812c651d1da09feb780f51b9f21","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T12:28:09Z","title_canon_sha256":"10aa226d6d0392ea91b009fdca8ea62dabc9a6ee18d8d1aab212e81fa672aed0"},"schema_version":"1.0","source":{"id":"2501.13607","kind":"arxiv","version":1}},"canonical_sha256":"0686f301891be7041d1de4d2c696d44b6dda1fa20d4b0540cad670d0cb6df695","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0686f301891be7041d1de4d2c696d44b6dda1fa20d4b0540cad670d0cb6df695","first_computed_at":"2026-07-05T10:04:31.447277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:04:31.447277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uA7gTGhGVs33NuPVlu4dbAS4pQezIUUpL6IN7CYTD0wSXUJEc4dIWAcgVaxRduhZJRUMOeEfNrsTMUDORKoKDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:04:31.447767Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.13607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c92d620e3847ac99710dfaf82db23c4869dd03e9231dd20fba4c3bafb5e7d73","sha256:0ddec172deea7507d8a0d4db0d33c8a8ec0d503d0cb771d5b914768bc4e1f89d"],"state_sha256":"0742d59999b31709dcb4b697698ee56665a348e8ba29c12b9d87d7e222627d60"}