{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FVJTHQAZATDPVDUWCMHVTQVUDB","short_pith_number":"pith:FVJTHQAZ","canonical_record":{"source":{"id":"1706.04933","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-06-15T15:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"5b7810f1e432d29d490c062e8b633b568b7d0f2ae497559a53a943e91336fa79","abstract_canon_sha256":"397edffb89fda3133a1abbf5dc7032a9a9809a378a6fd2f28c2aec7cc05434b2"},"schema_version":"1.0"},"canonical_sha256":"2d5333c01904c6fa8e96130f59c2b4187b0a20023a070a6817c24c96bc62994b","source":{"kind":"arxiv","id":"1706.04933","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04933","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04933v1","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04933","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"FVJTHQAZATDP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVJTHQAZATDPVDUW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVJTHQAZ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FVJTHQAZATDPVDUWCMHVTQVUDB","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04933","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-06-15T15:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"5b7810f1e432d29d490c062e8b633b568b7d0f2ae497559a53a943e91336fa79","abstract_canon_sha256":"397edffb89fda3133a1abbf5dc7032a9a9809a378a6fd2f28c2aec7cc05434b2"},"schema_version":"1.0"},"canonical_sha256":"2d5333c01904c6fa8e96130f59c2b4187b0a20023a070a6817c24c96bc62994b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:18.486782Z","signature_b64":"MPXcQh3yOhGJX+X5acjnqnyO9ERnT64Ki3+bfYj872UahhW9/6fwMPrtWxl3xVmglwULwZxnj3yXEUjsWEGfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d5333c01904c6fa8e96130f59c2b4187b0a20023a070a6817c24c96bc62994b","last_reissued_at":"2026-05-18T00:42:18.486112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:18.486112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04933","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:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAZ4pInp+CZiZiUKCKA2cEKQRnyHVZZOW+QsqfPFefJDR2RsJellLFIFvLfwBLLQzG1GQ7Hwx0Ae8uaQeVBDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:37:45.135201Z"},"content_sha256":"13b14b2da845bcb5ab87cb9a8220c88d76bb70e0dcdf70ce320a75069a84bfba","schema_version":"1.0","event_id":"sha256:13b14b2da845bcb5ab87cb9a8220c88d76bb70e0dcdf70ce320a75069a84bfba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FVJTHQAZATDPVDUWCMHVTQVUDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-objective Bandits: Optimizing the Generalized Gini Index","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Balazs Szorenyi, Paul Weng, Robert Busa-Fekete, Shie Mannor","submitted_at":"2017-06-15T15:43:21Z","abstract_excerpt":"We study the multi-armed bandit (MAB) problem where the agent receives a vectorial feedback that encodes many possibly competing objectives to be optimized. The goal of the agent is to find a policy, which can optimize these objectives simultaneously in a fair way. This multi-objective online optimization problem is formalized by using the Generalized Gini Index (GGI) aggregation function. We propose an online gradient descent algorithm which exploits the convexity of the GGI aggregation function, and controls the exploration in a careful way achieving a distribution-free regret $\\tilde{\\bigO}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04933","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:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIbBxSabIvZzFB3Hl8VJ5G+tzPzvYyviKXqhnvJ0TodxjrMQ0/9+Lj8ku3LsDUtpPazZTG0/geKEiKNRg/Y2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:37:45.135581Z"},"content_sha256":"79a03e83def73a79221d205c7724904b6c8dee244f4861978f672b1e1a530485","schema_version":"1.0","event_id":"sha256:79a03e83def73a79221d205c7724904b6c8dee244f4861978f672b1e1a530485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVJTHQAZATDPVDUWCMHVTQVUDB/bundle.json","state_url":"https://pith.science/pith/FVJTHQAZATDPVDUWCMHVTQVUDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVJTHQAZATDPVDUWCMHVTQVUDB/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-30T08:37:45Z","links":{"resolver":"https://pith.science/pith/FVJTHQAZATDPVDUWCMHVTQVUDB","bundle":"https://pith.science/pith/FVJTHQAZATDPVDUWCMHVTQVUDB/bundle.json","state":"https://pith.science/pith/FVJTHQAZATDPVDUWCMHVTQVUDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVJTHQAZATDPVDUWCMHVTQVUDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FVJTHQAZATDPVDUWCMHVTQVUDB","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":"397edffb89fda3133a1abbf5dc7032a9a9809a378a6fd2f28c2aec7cc05434b2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-06-15T15:43:21Z","title_canon_sha256":"5b7810f1e432d29d490c062e8b633b568b7d0f2ae497559a53a943e91336fa79"},"schema_version":"1.0","source":{"id":"1706.04933","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04933","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04933v1","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04933","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"FVJTHQAZATDP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVJTHQAZATDPVDUW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVJTHQAZ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:79a03e83def73a79221d205c7724904b6c8dee244f4861978f672b1e1a530485","target":"graph","created_at":"2026-05-18T00:42:18Z","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 study the multi-armed bandit (MAB) problem where the agent receives a vectorial feedback that encodes many possibly competing objectives to be optimized. The goal of the agent is to find a policy, which can optimize these objectives simultaneously in a fair way. This multi-objective online optimization problem is formalized by using the Generalized Gini Index (GGI) aggregation function. We propose an online gradient descent algorithm which exploits the convexity of the GGI aggregation function, and controls the exploration in a careful way achieving a distribution-free regret $\\tilde{\\bigO}","authors_text":"Balazs Szorenyi, Paul Weng, Robert Busa-Fekete, Shie Mannor","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-06-15T15:43:21Z","title":"Multi-objective Bandits: Optimizing the Generalized Gini Index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04933","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:13b14b2da845bcb5ab87cb9a8220c88d76bb70e0dcdf70ce320a75069a84bfba","target":"record","created_at":"2026-05-18T00:42:18Z","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":"397edffb89fda3133a1abbf5dc7032a9a9809a378a6fd2f28c2aec7cc05434b2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-06-15T15:43:21Z","title_canon_sha256":"5b7810f1e432d29d490c062e8b633b568b7d0f2ae497559a53a943e91336fa79"},"schema_version":"1.0","source":{"id":"1706.04933","kind":"arxiv","version":1}},"canonical_sha256":"2d5333c01904c6fa8e96130f59c2b4187b0a20023a070a6817c24c96bc62994b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d5333c01904c6fa8e96130f59c2b4187b0a20023a070a6817c24c96bc62994b","first_computed_at":"2026-05-18T00:42:18.486112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:18.486112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MPXcQh3yOhGJX+X5acjnqnyO9ERnT64Ki3+bfYj872UahhW9/6fwMPrtWxl3xVmglwULwZxnj3yXEUjsWEGfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:18.486782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04933","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13b14b2da845bcb5ab87cb9a8220c88d76bb70e0dcdf70ce320a75069a84bfba","sha256:79a03e83def73a79221d205c7724904b6c8dee244f4861978f672b1e1a530485"],"state_sha256":"bcab366d0ff7ab32ac8cd82825f288d4d94806b73dc29e0c4ec35932b497a99e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFjliGHlB61UQL9StdItg7iWR6YlNsdUqbP4KJuznsyMMTI7zjzon8d0kACu6TrIymoM+KFtsv1a7TA56MmGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:37:45.137571Z","bundle_sha256":"82f6168c95c8dff6a825fe213f27b816f33a0d694fbb0e772eaeeb7d756cecc0"}}