{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YDI3ZC6WRUYDE6H2F5VR7JOOQY","short_pith_number":"pith:YDI3ZC6W","schema_version":"1.0","canonical_sha256":"c0d1bc8bd68d303278fa2f6b1fa5ce86211a0bdc702e6525c521ae69ac24d44d","source":{"kind":"arxiv","id":"1702.07444","version":1},"attestation_state":"computed","paper":{"title":"Bandits with Movement Costs and Adaptive Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Roi Livni, Tomer Koren, Yishay Mansour","submitted_at":"2017-02-24T01:51:48Z","abstract_excerpt":"We extend the model of Multi-armed Bandit with unit switching cost to incorporate a metric between the actions. We consider the case where the metric over the actions can be modeled by a complete binary tree, and the distance between two leaves is the size of the subtree of their least common ancestor, which abstracts the case that the actions are points on the continuous interval $[0,1]$ and the switching cost is their distance. In this setting, we give a new algorithm that establishes a regret of $\\widetilde{O}(\\sqrt{kT} + T/k)$, where $k$ is the number of actions and $T$ is the time horizon"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.07444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-24T01:51:48Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"25010891ca2ae144f66728bb1f3d193a3d64af3a5c135d13878f435fd0e733d4","abstract_canon_sha256":"56bd9291dac0daf2cdca9db5ce58c4f482b1b82a18ec96ab2bde79bc6eb59db8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.335461Z","signature_b64":"YmYSjInaTJJZITciYESCjdp2aTUVvtxLPC2F/oXiecxsiZP5qkpGUEO3dvQAMVIyU5SEl+pHHh7pODLxH+8/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d1bc8bd68d303278fa2f6b1fa5ce86211a0bdc702e6525c521ae69ac24d44d","last_reissued_at":"2026-05-18T00:50:03.334852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.334852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bandits with Movement Costs and Adaptive Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Roi Livni, Tomer Koren, Yishay Mansour","submitted_at":"2017-02-24T01:51:48Z","abstract_excerpt":"We extend the model of Multi-armed Bandit with unit switching cost to incorporate a metric between the actions. We consider the case where the metric over the actions can be modeled by a complete binary tree, and the distance between two leaves is the size of the subtree of their least common ancestor, which abstracts the case that the actions are points on the continuous interval $[0,1]$ and the switching cost is their distance. In this setting, we give a new algorithm that establishes a regret of $\\widetilde{O}(\\sqrt{kT} + T/k)$, where $k$ is the number of actions and $T$ is the time horizon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07444","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.07444","created_at":"2026-05-18T00:50:03.334942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07444v1","created_at":"2026-05-18T00:50:03.334942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07444","created_at":"2026-05-18T00:50:03.334942+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDI3ZC6WRUYD","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDI3ZC6WRUYDE6H2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDI3ZC6W","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY","json":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY.json","graph_json":"https://pith.science/api/pith-number/YDI3ZC6WRUYDE6H2F5VR7JOOQY/graph.json","events_json":"https://pith.science/api/pith-number/YDI3ZC6WRUYDE6H2F5VR7JOOQY/events.json","paper":"https://pith.science/paper/YDI3ZC6W"},"agent_actions":{"view_html":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY","download_json":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY.json","view_paper":"https://pith.science/paper/YDI3ZC6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07444&json=true","fetch_graph":"https://pith.science/api/pith-number/YDI3ZC6WRUYDE6H2F5VR7JOOQY/graph.json","fetch_events":"https://pith.science/api/pith-number/YDI3ZC6WRUYDE6H2F5VR7JOOQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY/action/storage_attestation","attest_author":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY/action/author_attestation","sign_citation":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY/action/citation_signature","submit_replication":"https://pith.science/pith/YDI3ZC6WRUYDE6H2F5VR7JOOQY/action/replication_record"}},"created_at":"2026-05-18T00:50:03.334942+00:00","updated_at":"2026-05-18T00:50:03.334942+00:00"}