{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BSEWEM23F7TM6KN3ADYV3PQS7B","short_pith_number":"pith:BSEWEM23","canonical_record":{"source":{"id":"2406.16802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T17:14:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"410ac3de5b70fec8b334ea889740cc739c746143addf190c7dd1f3d9bdea5fd7","abstract_canon_sha256":"a9d882aadb45cb960303bdaf193991c619f05a5a283041f1f6f45cd0abb68c83"},"schema_version":"1.0"},"canonical_sha256":"0c8962335b2fe6cf29bb00f15dbe12f85ec102199ba2799e50c72d3670ff64ae","source":{"kind":"arxiv","id":"2406.16802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.16802","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.16802v1","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16802","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"BSEWEM23F7TM","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_16","alias_value":"BSEWEM23F7TM6KN3","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_8","alias_value":"BSEWEM23","created_at":"2026-07-05T08:36:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BSEWEM23F7TM6KN3ADYV3PQS7B","target":"record","payload":{"canonical_record":{"source":{"id":"2406.16802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T17:14:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"410ac3de5b70fec8b334ea889740cc739c746143addf190c7dd1f3d9bdea5fd7","abstract_canon_sha256":"a9d882aadb45cb960303bdaf193991c619f05a5a283041f1f6f45cd0abb68c83"},"schema_version":"1.0"},"canonical_sha256":"0c8962335b2fe6cf29bb00f15dbe12f85ec102199ba2799e50c72d3670ff64ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:03.876596Z","signature_b64":"en08QS67onyXSFB4Ecu2+BNossbxJzweGqt1/pC/ERPcU9gWf3NzBV4GHSa0eDkL8jIt+wBh21S+ayHPScLsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8962335b2fe6cf29bb00f15dbe12f85ec102199ba2799e50c72d3670ff64ae","last_reissued_at":"2026-07-05T08:36:03.876155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:03.876155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.16802","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-05T08:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubly6Etka0z2uYwvKVagFq8dBU0ls1uYKCe6F+Ol0TX4obVFHr8W+aUm2hf+nIkbY81ykUaNnSKrAjcFVtePAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T17:50:30.008673Z"},"content_sha256":"6022324c781e7b02f27d42287444551992b7796b65515b100345e290b8cb3132","schema_version":"1.0","event_id":"sha256:6022324c781e7b02f27d42287444551992b7796b65515b100345e290b8cb3132"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BSEWEM23F7TM6KN3ADYV3PQS7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Regret Bounds for Bandits with Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Emmanuel Esposito, Julia Olkhovskaya, Khaled Eldowa, Nicol\\`o Cesa-Bianchi","submitted_at":"2024-06-24T17:14:31Z","abstract_excerpt":"In this research note, we revisit the bandits with expert advice problem. Under a restricted feedback model, we prove a lower bound of order $\\sqrt{K T \\ln(N/K)}$ for the worst-case regret, where $K$ is the number of actions, $N>K$ the number of experts, and $T$ the time horizon. This matches a previously known upper bound of the same order and improves upon the best available lower bound of $\\sqrt{K T (\\ln N) / (\\ln K)}$. For the standard feedback model, we prove a new instance-based upper bound that depends on the agreement between the experts and provides a logarithmic improvement compared "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16802","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/2406.16802/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-05T08:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oe/ru/04hG1aC7+WrS4gyXvLRv19goPpo6V9ReEHSzZcmgRDu9hieWiWPgRgQVYe6ouoJ+JTIkI64ZIvQR60Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T17:50:30.009049Z"},"content_sha256":"6535dc12864dc7fbe8ce09b93f0ac2635b9c846593726f7a29c1bcf33efe7b59","schema_version":"1.0","event_id":"sha256:6535dc12864dc7fbe8ce09b93f0ac2635b9c846593726f7a29c1bcf33efe7b59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSEWEM23F7TM6KN3ADYV3PQS7B/bundle.json","state_url":"https://pith.science/pith/BSEWEM23F7TM6KN3ADYV3PQS7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSEWEM23F7TM6KN3ADYV3PQS7B/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-07-11T17:50:30Z","links":{"resolver":"https://pith.science/pith/BSEWEM23F7TM6KN3ADYV3PQS7B","bundle":"https://pith.science/pith/BSEWEM23F7TM6KN3ADYV3PQS7B/bundle.json","state":"https://pith.science/pith/BSEWEM23F7TM6KN3ADYV3PQS7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSEWEM23F7TM6KN3ADYV3PQS7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BSEWEM23F7TM6KN3ADYV3PQS7B","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":"a9d882aadb45cb960303bdaf193991c619f05a5a283041f1f6f45cd0abb68c83","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T17:14:31Z","title_canon_sha256":"410ac3de5b70fec8b334ea889740cc739c746143addf190c7dd1f3d9bdea5fd7"},"schema_version":"1.0","source":{"id":"2406.16802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.16802","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.16802v1","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16802","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"BSEWEM23F7TM","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_16","alias_value":"BSEWEM23F7TM6KN3","created_at":"2026-07-05T08:36:03Z"},{"alias_kind":"pith_short_8","alias_value":"BSEWEM23","created_at":"2026-07-05T08:36:03Z"}],"graph_snapshots":[{"event_id":"sha256:6535dc12864dc7fbe8ce09b93f0ac2635b9c846593726f7a29c1bcf33efe7b59","target":"graph","created_at":"2026-07-05T08:36:03Z","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/2406.16802/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this research note, we revisit the bandits with expert advice problem. Under a restricted feedback model, we prove a lower bound of order $\\sqrt{K T \\ln(N/K)}$ for the worst-case regret, where $K$ is the number of actions, $N>K$ the number of experts, and $T$ the time horizon. This matches a previously known upper bound of the same order and improves upon the best available lower bound of $\\sqrt{K T (\\ln N) / (\\ln K)}$. For the standard feedback model, we prove a new instance-based upper bound that depends on the agreement between the experts and provides a logarithmic improvement compared ","authors_text":"Emmanuel Esposito, Julia Olkhovskaya, Khaled Eldowa, Nicol\\`o Cesa-Bianchi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T17:14:31Z","title":"Improved Regret Bounds for Bandits with Expert Advice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16802","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:6022324c781e7b02f27d42287444551992b7796b65515b100345e290b8cb3132","target":"record","created_at":"2026-07-05T08:36:03Z","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":"a9d882aadb45cb960303bdaf193991c619f05a5a283041f1f6f45cd0abb68c83","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T17:14:31Z","title_canon_sha256":"410ac3de5b70fec8b334ea889740cc739c746143addf190c7dd1f3d9bdea5fd7"},"schema_version":"1.0","source":{"id":"2406.16802","kind":"arxiv","version":1}},"canonical_sha256":"0c8962335b2fe6cf29bb00f15dbe12f85ec102199ba2799e50c72d3670ff64ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c8962335b2fe6cf29bb00f15dbe12f85ec102199ba2799e50c72d3670ff64ae","first_computed_at":"2026-07-05T08:36:03.876155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:36:03.876155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"en08QS67onyXSFB4Ecu2+BNossbxJzweGqt1/pC/ERPcU9gWf3NzBV4GHSa0eDkL8jIt+wBh21S+ayHPScLsCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:36:03.876596Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.16802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6022324c781e7b02f27d42287444551992b7796b65515b100345e290b8cb3132","sha256:6535dc12864dc7fbe8ce09b93f0ac2635b9c846593726f7a29c1bcf33efe7b59"],"state_sha256":"923767fc185d2291329a7ffc5c798cafaac9bfe0c0ae79933f31ef77f09e25f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+LWLFvDi75HQm+WNTht5b9faJJ0MctHmSu9jI0Ze1Bv798QLoJJR9MymoBa+gZAZDS9HTvElNUzNTwX/bH/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T17:50:30.011192Z","bundle_sha256":"75f96e35596f9f835dbcf9e0e6cb0e4a0be48afe1bf573ad14a6bfdffbdca167"}}