{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:X74ATEOAPJ4LUXXDAVIZTEKQ6J","short_pith_number":"pith:X74ATEOA","canonical_record":{"source":{"id":"1405.5096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-20T14:15:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ac2913f961fd2f447297045956941d942554191de95500de7602b98b33aa47f","abstract_canon_sha256":"d9b20cdc4a74e8645208b02918af75b70452dab57a318ec425231b1bcca2a478"},"schema_version":"1.0"},"canonical_sha256":"bff80991c07a78ba5ee30551999150f264d416e46b373cd5d58e1f8c98578823","source":{"kind":"arxiv","id":"1405.5096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5096","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5096v1","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5096","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"X74ATEOAPJ4L","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X74ATEOAPJ4LUXXD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X74ATEOA","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:X74ATEOAPJ4LUXXDAVIZTEKQ6J","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-20T14:15:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ac2913f961fd2f447297045956941d942554191de95500de7602b98b33aa47f","abstract_canon_sha256":"d9b20cdc4a74e8645208b02918af75b70452dab57a318ec425231b1bcca2a478"},"schema_version":"1.0"},"canonical_sha256":"bff80991c07a78ba5ee30551999150f264d416e46b373cd5d58e1f8c98578823","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:32.146562Z","signature_b64":"iH8abtfP1Er5hvLprzqnWDflhoSGJxqXXDpCEGOtut1GPzFHmHvuVqlozWFvioxW3aV+fUfJArC1kKJJSG5HAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff80991c07a78ba5ee30551999150f264d416e46b373cd5d58e1f8c98578823","last_reissued_at":"2026-05-18T02:51:32.145391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:32.145391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5096","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-18T02:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEEE6pfrTAgx0H5mDVScg8RMTX6vojCPdLNJk7vA70pASg/KECUSgTCl2Ceh0eCPtKzy8N9/wlS/8XeFCbxqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:57:24.181232Z"},"content_sha256":"1ca098ceaa7c1a81cbd3a6eb9f1c45f3ce69ea509f66ec8d6072e4631c39fe32","schema_version":"1.0","event_id":"sha256:1ca098ceaa7c1a81cbd3a6eb9f1c45f3ce69ea509f66ec8d6072e4631c39fe32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:X74ATEOAPJ4LUXXDAVIZTEKQ6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre Proutiere, Richard Combes","submitted_at":"2014-05-20T14:15:54Z","abstract_excerpt":"We consider stochastic multi-armed bandits where the expected reward is a unimodal function over partially ordered arms. This important class of problems has been recently investigated in (Cope 2009, Yu 2011). The set of arms is either discrete, in which case arms correspond to the vertices of a finite graph whose structure represents similarity in rewards, or continuous, in which case arms belong to a bounded interval. For discrete unimodal bandits, we derive asymptotic lower bounds for the regret achieved under any algorithm, and propose OSUB, an algorithm whose regret matches this lower bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5096","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-18T02:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XM1aTemiyWH2da8mTV3CYqshdRI+Filpr2EVep96uuahcuxf8q5eMLCHFK5BjTzS9Vgi5NS1bh0yFOa4K5EBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:57:24.181834Z"},"content_sha256":"278385c336348323cabec47cd40f066eef98a60e7a40323e9836e8c4904a9bbe","schema_version":"1.0","event_id":"sha256:278385c336348323cabec47cd40f066eef98a60e7a40323e9836e8c4904a9bbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X74ATEOAPJ4LUXXDAVIZTEKQ6J/bundle.json","state_url":"https://pith.science/pith/X74ATEOAPJ4LUXXDAVIZTEKQ6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X74ATEOAPJ4LUXXDAVIZTEKQ6J/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-26T05:57:24Z","links":{"resolver":"https://pith.science/pith/X74ATEOAPJ4LUXXDAVIZTEKQ6J","bundle":"https://pith.science/pith/X74ATEOAPJ4LUXXDAVIZTEKQ6J/bundle.json","state":"https://pith.science/pith/X74ATEOAPJ4LUXXDAVIZTEKQ6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X74ATEOAPJ4LUXXDAVIZTEKQ6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:X74ATEOAPJ4LUXXDAVIZTEKQ6J","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":"d9b20cdc4a74e8645208b02918af75b70452dab57a318ec425231b1bcca2a478","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-20T14:15:54Z","title_canon_sha256":"7ac2913f961fd2f447297045956941d942554191de95500de7602b98b33aa47f"},"schema_version":"1.0","source":{"id":"1405.5096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5096","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5096v1","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5096","created_at":"2026-05-18T02:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"X74ATEOAPJ4L","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X74ATEOAPJ4LUXXD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X74ATEOA","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:278385c336348323cabec47cd40f066eef98a60e7a40323e9836e8c4904a9bbe","target":"graph","created_at":"2026-05-18T02:51:32Z","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 consider stochastic multi-armed bandits where the expected reward is a unimodal function over partially ordered arms. This important class of problems has been recently investigated in (Cope 2009, Yu 2011). The set of arms is either discrete, in which case arms correspond to the vertices of a finite graph whose structure represents similarity in rewards, or continuous, in which case arms belong to a bounded interval. For discrete unimodal bandits, we derive asymptotic lower bounds for the regret achieved under any algorithm, and propose OSUB, an algorithm whose regret matches this lower bou","authors_text":"Alexandre Proutiere, Richard Combes","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-20T14:15:54Z","title":"Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5096","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:1ca098ceaa7c1a81cbd3a6eb9f1c45f3ce69ea509f66ec8d6072e4631c39fe32","target":"record","created_at":"2026-05-18T02:51:32Z","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":"d9b20cdc4a74e8645208b02918af75b70452dab57a318ec425231b1bcca2a478","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-20T14:15:54Z","title_canon_sha256":"7ac2913f961fd2f447297045956941d942554191de95500de7602b98b33aa47f"},"schema_version":"1.0","source":{"id":"1405.5096","kind":"arxiv","version":1}},"canonical_sha256":"bff80991c07a78ba5ee30551999150f264d416e46b373cd5d58e1f8c98578823","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bff80991c07a78ba5ee30551999150f264d416e46b373cd5d58e1f8c98578823","first_computed_at":"2026-05-18T02:51:32.145391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:32.145391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iH8abtfP1Er5hvLprzqnWDflhoSGJxqXXDpCEGOtut1GPzFHmHvuVqlozWFvioxW3aV+fUfJArC1kKJJSG5HAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:32.146562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ca098ceaa7c1a81cbd3a6eb9f1c45f3ce69ea509f66ec8d6072e4631c39fe32","sha256:278385c336348323cabec47cd40f066eef98a60e7a40323e9836e8c4904a9bbe"],"state_sha256":"0646002e4ba7f99947a911cb9b1dc161d29f1427fc51c9fe19432a360302d466"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JSIxk7usmNtH6uMv3o6D8RF/oePql2pGLjkkFz6TrMlaHbXJACyrj7cD+CHN17Qb8ZI9p3n8UAyazsfPebotCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:57:24.185508Z","bundle_sha256":"4c1e7a7a41dfa024a7163cd10d439c281feccdf4112e746078988b729221107f"}}