{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6UY3SMFLZUU6HWKUUBOARRPGHU","short_pith_number":"pith:6UY3SMFL","canonical_record":{"source":{"id":"1901.10604","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T23:09:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"73307ead50f7438bdfe6f9f61f514b9101f89154fdde95c2936c0e4dc32448ed","abstract_canon_sha256":"2fb39466828f3f7cc62c7191f2383ba6b095052192639f73a51ed9b4c0145eb8"},"schema_version":"1.0"},"canonical_sha256":"f531b930abcd29e3d954a05c08c5e63d2462db3d35b39b947abfbf98142d75f1","source":{"kind":"arxiv","id":"1901.10604","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10604","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10604v2","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10604","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"6UY3SMFLZUU6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6UY3SMFLZUU6HWKU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6UY3SMFL","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6UY3SMFLZUU6HWKUUBOARRPGHU","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10604","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T23:09:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"73307ead50f7438bdfe6f9f61f514b9101f89154fdde95c2936c0e4dc32448ed","abstract_canon_sha256":"2fb39466828f3f7cc62c7191f2383ba6b095052192639f73a51ed9b4c0145eb8"},"schema_version":"1.0"},"canonical_sha256":"f531b930abcd29e3d954a05c08c5e63d2462db3d35b39b947abfbf98142d75f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:09.109734Z","signature_b64":"ErvjyJppX6BN/WjGVMXFcxfPExaP3uM4ZUkSdqdRV+0bMug/DMP2BrUJOfz5iYQbgtqizfe/krUtSWzaj+kuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f531b930abcd29e3d954a05c08c5e63d2462db3d35b39b947abfbf98142d75f1","last_reissued_at":"2026-05-17T23:43:09.109126Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:09.109126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10604","source_version":2,"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-17T23:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+oGnbwXdlrRfu3NMIjAGI590Os7vLST2L67WPza2H6eMxVLht3R08SLHTswzC6+iip8CuOzGJtyxVfC1RZVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:19:46.469498Z"},"content_sha256":"c03440483ada47df2e010a1e64c47bc925e83ebb6865d8d6c62bc8338d64cf32","schema_version":"1.0","event_id":"sha256:c03440483ada47df2e010a1e64c47bc925e83ebb6865d8d6c62bc8338d64cf32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6UY3SMFLZUU6HWKUUBOARRPGHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Path-length Regret Bounds for Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen-Yu Wei, Haipeng Luo, S\\'ebastien Bubeck, Yuanzhi Li","submitted_at":"2019-01-29T23:09:37Z","abstract_excerpt":"We study adaptive regret bounds in terms of the variation of the losses (the so-called path-length bounds) for both multi-armed bandit and more generally linear bandit. We first show that the seemingly suboptimal path-length bound of (Wei and Luo, 2018) is in fact not improvable for adaptive adversary. Despite this negative result, we then develop two new algorithms, one that strictly improves over (Wei and Luo, 2018) with a smaller path-length measure, and the other which improves over (Wei and Luo, 2018) for oblivious adversary when the path-length is large. Our algorithms are based on the w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10604","kind":"arxiv","version":2},"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-17T23:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXXe1V2V2LuZtcTpZaLk3Fzh7BK5Q48Uo37EX5DDY47KR8rzV8YVBGCn+x85fBVPWz2CztD4QzllrOYu22c8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:19:46.470187Z"},"content_sha256":"f9de450ff95bb3eec62c3d24a8fdd11775b8c17f25b29b791d2bafedefb9271d","schema_version":"1.0","event_id":"sha256:f9de450ff95bb3eec62c3d24a8fdd11775b8c17f25b29b791d2bafedefb9271d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UY3SMFLZUU6HWKUUBOARRPGHU/bundle.json","state_url":"https://pith.science/pith/6UY3SMFLZUU6HWKUUBOARRPGHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UY3SMFLZUU6HWKUUBOARRPGHU/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-06-11T04:19:46Z","links":{"resolver":"https://pith.science/pith/6UY3SMFLZUU6HWKUUBOARRPGHU","bundle":"https://pith.science/pith/6UY3SMFLZUU6HWKUUBOARRPGHU/bundle.json","state":"https://pith.science/pith/6UY3SMFLZUU6HWKUUBOARRPGHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UY3SMFLZUU6HWKUUBOARRPGHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6UY3SMFLZUU6HWKUUBOARRPGHU","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":"2fb39466828f3f7cc62c7191f2383ba6b095052192639f73a51ed9b4c0145eb8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T23:09:37Z","title_canon_sha256":"73307ead50f7438bdfe6f9f61f514b9101f89154fdde95c2936c0e4dc32448ed"},"schema_version":"1.0","source":{"id":"1901.10604","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10604","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10604v2","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10604","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"6UY3SMFLZUU6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6UY3SMFLZUU6HWKU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6UY3SMFL","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f9de450ff95bb3eec62c3d24a8fdd11775b8c17f25b29b791d2bafedefb9271d","target":"graph","created_at":"2026-05-17T23:43:09Z","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 adaptive regret bounds in terms of the variation of the losses (the so-called path-length bounds) for both multi-armed bandit and more generally linear bandit. We first show that the seemingly suboptimal path-length bound of (Wei and Luo, 2018) is in fact not improvable for adaptive adversary. Despite this negative result, we then develop two new algorithms, one that strictly improves over (Wei and Luo, 2018) with a smaller path-length measure, and the other which improves over (Wei and Luo, 2018) for oblivious adversary when the path-length is large. Our algorithms are based on the w","authors_text":"Chen-Yu Wei, Haipeng Luo, S\\'ebastien Bubeck, Yuanzhi Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T23:09:37Z","title":"Improved Path-length Regret Bounds for Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10604","kind":"arxiv","version":2},"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:c03440483ada47df2e010a1e64c47bc925e83ebb6865d8d6c62bc8338d64cf32","target":"record","created_at":"2026-05-17T23:43:09Z","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":"2fb39466828f3f7cc62c7191f2383ba6b095052192639f73a51ed9b4c0145eb8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T23:09:37Z","title_canon_sha256":"73307ead50f7438bdfe6f9f61f514b9101f89154fdde95c2936c0e4dc32448ed"},"schema_version":"1.0","source":{"id":"1901.10604","kind":"arxiv","version":2}},"canonical_sha256":"f531b930abcd29e3d954a05c08c5e63d2462db3d35b39b947abfbf98142d75f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f531b930abcd29e3d954a05c08c5e63d2462db3d35b39b947abfbf98142d75f1","first_computed_at":"2026-05-17T23:43:09.109126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:09.109126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ErvjyJppX6BN/WjGVMXFcxfPExaP3uM4ZUkSdqdRV+0bMug/DMP2BrUJOfz5iYQbgtqizfe/krUtSWzaj+kuBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:09.109734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10604","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c03440483ada47df2e010a1e64c47bc925e83ebb6865d8d6c62bc8338d64cf32","sha256:f9de450ff95bb3eec62c3d24a8fdd11775b8c17f25b29b791d2bafedefb9271d"],"state_sha256":"c032bba4b88d5c8ce2350d1fe5bbca15fbe3c7e7defdd1144d785cea352a9fd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08MpwbiZDLk5Vo9t2H6r2hjI7xft3hPmHTOKvtlIm97S2BcfUKPR5XHWUO4Hw6l3IEQkDCwo+oPlDbzIybBOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:19:46.473946Z","bundle_sha256":"cfdfb2f2dd98367276a90554be5384c5bf46022476d05a62480e4ec8077a19c6"}}