{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LGOI6H7JKNNVTUNHSAAG5ODSM7","short_pith_number":"pith:LGOI6H7J","schema_version":"1.0","canonical_sha256":"599c8f1fe9535b59d1a790006eb87267dd8db8a886a0fd70253af8221c729826","source":{"kind":"arxiv","id":"2505.17869","version":1},"attestation_state":"computed","paper":{"title":"Best Group Identification in Multi-Objective Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Mohammad Reza Badri, Mohammad Shahverdikondori, Negar Kiyavash","submitted_at":"2025-05-23T13:16:59Z","abstract_excerpt":"We introduce the Best Group Identification problem in a multi-objective multi-armed bandit setting, where an agent interacts with groups of arms with vector-valued rewards. The performance of a group is determined by an efficiency vector which represents the group's best attainable rewards across different dimensions. The objective is to identify the set of optimal groups in the fixed-confidence setting. We investigate two key formulations: group Pareto set identification, where efficiency vectors of optimal groups are Pareto optimal and linear best group identification, where each reward dime"},"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":"2505.17869","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T13:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"d4e49623906bc847a8455d32fd19eb4eab98e968a617657b3f1e8fde77062270","abstract_canon_sha256":"e3dea4995c1f297895a5e225a424e119ae26eeda563bd4a533c8cdc35d61bc74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:33.133839Z","signature_b64":"Lc59lKvjCjU5nAXQqXWwpiren5C9j8k7K985iTFsCgOAgNV4OHnftuATDtLzqklbfJnbnuB5TamBbHrVXLvaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"599c8f1fe9535b59d1a790006eb87267dd8db8a886a0fd70253af8221c729826","last_reissued_at":"2026-07-05T11:08:33.133247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:33.133247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best Group Identification in Multi-Objective Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Mohammad Reza Badri, Mohammad Shahverdikondori, Negar Kiyavash","submitted_at":"2025-05-23T13:16:59Z","abstract_excerpt":"We introduce the Best Group Identification problem in a multi-objective multi-armed bandit setting, where an agent interacts with groups of arms with vector-valued rewards. The performance of a group is determined by an efficiency vector which represents the group's best attainable rewards across different dimensions. The objective is to identify the set of optimal groups in the fixed-confidence setting. We investigate two key formulations: group Pareto set identification, where efficiency vectors of optimal groups are Pareto optimal and linear best group identification, where each reward dime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17869","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.17869/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.17869","created_at":"2026-07-05T11:08:33.133323+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.17869v1","created_at":"2026-07-05T11:08:33.133323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17869","created_at":"2026-07-05T11:08:33.133323+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGOI6H7JKNNV","created_at":"2026-07-05T11:08:33.133323+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGOI6H7JKNNVTUNH","created_at":"2026-07-05T11:08:33.133323+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGOI6H7J","created_at":"2026-07-05T11:08:33.133323+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20040","citing_title":"Active Context Selection Improves Simple Regret in Contextual Bandits","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7","json":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7.json","graph_json":"https://pith.science/api/pith-number/LGOI6H7JKNNVTUNHSAAG5ODSM7/graph.json","events_json":"https://pith.science/api/pith-number/LGOI6H7JKNNVTUNHSAAG5ODSM7/events.json","paper":"https://pith.science/paper/LGOI6H7J"},"agent_actions":{"view_html":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7","download_json":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7.json","view_paper":"https://pith.science/paper/LGOI6H7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.17869&json=true","fetch_graph":"https://pith.science/api/pith-number/LGOI6H7JKNNVTUNHSAAG5ODSM7/graph.json","fetch_events":"https://pith.science/api/pith-number/LGOI6H7JKNNVTUNHSAAG5ODSM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/action/storage_attestation","attest_author":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/action/author_attestation","sign_citation":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/action/citation_signature","submit_replication":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/action/replication_record"}},"created_at":"2026-07-05T11:08:33.133323+00:00","updated_at":"2026-07-05T11:08:33.133323+00:00"}