{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LGOI6H7JKNNVTUNHSAAG5ODSM7","short_pith_number":"pith:LGOI6H7J","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"},"canonical_sha256":"599c8f1fe9535b59d1a790006eb87267dd8db8a886a0fd70253af8221c729826","source":{"kind":"arxiv","id":"2505.17869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17869","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17869v1","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17869","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"LGOI6H7JKNNV","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_16","alias_value":"LGOI6H7JKNNVTUNH","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_8","alias_value":"LGOI6H7J","created_at":"2026-07-05T11:08:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LGOI6H7JKNNVTUNHSAAG5ODSM7","target":"record","payload":{"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"},"canonical_sha256":"599c8f1fe9535b59d1a790006eb87267dd8db8a886a0fd70253af8221c729826","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"},"source_kind":"arxiv","source_id":"2505.17869","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-07-05T11:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7lbStjuLWGcB0jHClK2jNDa/0p6mfENX3s2NIumitqb5B5ysiVDaVyHUn7Kk7PvzEKXkWUofTp7vrnLk3nWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:13:48.275032Z"},"content_sha256":"df12350c24b2d7c09df4dd61d19f7d95e85210ad2fc2848bc9749a95c1311ac1","schema_version":"1.0","event_id":"sha256:df12350c24b2d7c09df4dd61d19f7d95e85210ad2fc2848bc9749a95c1311ac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LGOI6H7JKNNVTUNHSAAG5ODSM7","target":"graph","payload":{"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"},"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-07-05T11:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+L290BaL8rOWrA344pNcLc9iol1pgCEzLYuTvEvkd4kkTomM+tkejhymJ97AQNgM5BZ1SCBCbAiVgANc+0nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:13:48.275519Z"},"content_sha256":"cefb491693153cce5a699762e7c69ced7e9b0158aa7e79f55d8f9ffbde256d6d","schema_version":"1.0","event_id":"sha256:cefb491693153cce5a699762e7c69ced7e9b0158aa7e79f55d8f9ffbde256d6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/bundle.json","state_url":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/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-08-08T13:13:48Z","links":{"resolver":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7","bundle":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/bundle.json","state":"https://pith.science/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGOI6H7JKNNVTUNHSAAG5ODSM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LGOI6H7JKNNVTUNHSAAG5ODSM7","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":"e3dea4995c1f297895a5e225a424e119ae26eeda563bd4a533c8cdc35d61bc74","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T13:16:59Z","title_canon_sha256":"d4e49623906bc847a8455d32fd19eb4eab98e968a617657b3f1e8fde77062270"},"schema_version":"1.0","source":{"id":"2505.17869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17869","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17869v1","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17869","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"LGOI6H7JKNNV","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_16","alias_value":"LGOI6H7JKNNVTUNH","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_8","alias_value":"LGOI6H7J","created_at":"2026-07-05T11:08:33Z"}],"graph_snapshots":[{"event_id":"sha256:cefb491693153cce5a699762e7c69ced7e9b0158aa7e79f55d8f9ffbde256d6d","target":"graph","created_at":"2026-07-05T11:08:33Z","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/2505.17869/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mohammad Reza Badri, Mohammad Shahverdikondori, Negar Kiyavash","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T13:16:59Z","title":"Best Group Identification in Multi-Objective Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17869","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:df12350c24b2d7c09df4dd61d19f7d95e85210ad2fc2848bc9749a95c1311ac1","target":"record","created_at":"2026-07-05T11:08:33Z","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":"e3dea4995c1f297895a5e225a424e119ae26eeda563bd4a533c8cdc35d61bc74","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T13:16:59Z","title_canon_sha256":"d4e49623906bc847a8455d32fd19eb4eab98e968a617657b3f1e8fde77062270"},"schema_version":"1.0","source":{"id":"2505.17869","kind":"arxiv","version":1}},"canonical_sha256":"599c8f1fe9535b59d1a790006eb87267dd8db8a886a0fd70253af8221c729826","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"599c8f1fe9535b59d1a790006eb87267dd8db8a886a0fd70253af8221c729826","first_computed_at":"2026-07-05T11:08:33.133247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:33.133247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lc59lKvjCjU5nAXQqXWwpiren5C9j8k7K985iTFsCgOAgNV4OHnftuATDtLzqklbfJnbnuB5TamBbHrVXLvaAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:33.133839Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.17869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df12350c24b2d7c09df4dd61d19f7d95e85210ad2fc2848bc9749a95c1311ac1","sha256:cefb491693153cce5a699762e7c69ced7e9b0158aa7e79f55d8f9ffbde256d6d"],"state_sha256":"e6834d400b159c87d0b0a9b2d45b7d198fe1f46ef639edc2f94f0eb7003d5112"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojYeGjM5w0/+LkaeJFmzqwYGQuYWrVxl8TnHLECSJ+aggueen7eiP6Y7X/kcrdwG7zFyBIFNlUBBTpfRywQWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:13:48.279033Z","bundle_sha256":"bcfdacd4647eb69cdbd916300f4e24b0ac8469e22f17d53c66ab7cfa88f28f4c"}}