{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PTTL2DJEMSXMZ3R2DH5RICGRSB","short_pith_number":"pith:PTTL2DJE","canonical_record":{"source":{"id":"1509.07927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-26T00:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"6948b6c3f14a5a2f2d24e35363aca1569ae3ce7676380cb89ccd9d875cc1c05a","abstract_canon_sha256":"e6d72e54fe0f883fb7b8e4b8fc1a9df72da56f27457ef2efc90a7d44b43a3f23"},"schema_version":"1.0"},"canonical_sha256":"7ce6bd0d2464aeccee3a19fb1408d1907d5bfc7cca7e94fc7d23dced3cc0d73e","source":{"kind":"arxiv","id":"1509.07927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07927","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07927v1","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07927","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"PTTL2DJEMSXM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PTTL2DJEMSXMZ3R2","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PTTL2DJE","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PTTL2DJEMSXMZ3R2DH5RICGRSB","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-26T00:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"6948b6c3f14a5a2f2d24e35363aca1569ae3ce7676380cb89ccd9d875cc1c05a","abstract_canon_sha256":"e6d72e54fe0f883fb7b8e4b8fc1a9df72da56f27457ef2efc90a7d44b43a3f23"},"schema_version":"1.0"},"canonical_sha256":"7ce6bd0d2464aeccee3a19fb1408d1907d5bfc7cca7e94fc7d23dced3cc0d73e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:55.080781Z","signature_b64":"J8pYw6yDCQUaY0ZRYE61pnegXFbuFzkPjCcU0UiQnQgZ2N5qrxHpQ37TRrhvAKUtfvL5AfrrAX5RLwzEWzLmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce6bd0d2464aeccee3a19fb1408d1907d5bfc7cca7e94fc7d23dced3cc0d73e","last_reissued_at":"2026-05-18T01:31:55.080423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:55.080423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07927","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-18T01:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDEfohJBITUYa7EveJ+YfE6Q0pqYcG2oN+NAR0c95GnufAetFSSgedmJGMmRzHgIlmjTytfsVF4nNeTq+1WgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:28:23.723919Z"},"content_sha256":"0650d6a0674ea34bbdcb0ef3779103f48c2e2208e5a2203b347902af35a800f8","schema_version":"1.0","event_id":"sha256:0650d6a0674ea34bbdcb0ef3779103f48c2e2208e5a2203b347902af35a800f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PTTL2DJEMSXMZ3R2DH5RICGRSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Linear Bandits on Polyhedral Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amir Leshem, Manjesh K. Hanawal, Venkatesh Saligrama","submitted_at":"2015-09-26T00:17:38Z","abstract_excerpt":"We study stochastic linear optimization problem with bandit feedback. The set of arms take values in an $N$-dimensional space and belong to a bounded polyhedron described by finitely many linear inequalities. We provide a lower bound for the expected regret that scales as $\\Omega(N\\log T)$. We then provide a nearly optimal algorithm and show that its expected regret scales as $O(N\\log^{1+\\epsilon}(T))$ for an arbitrary small $\\epsilon >0$. The algorithm alternates between exploration and exploitation intervals sequentially where deterministic set of arms are played in the exploration intervals"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07927","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-18T01:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUMwtH6cqDKhdv7iNgPf9TL+MSaE3zbzIDXtj7E8t8PPvc+na+MfMDV7vfjqPKqwAVJtaqqVpTwkbKK6b1lCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:28:23.724281Z"},"content_sha256":"8cd291c45354eab6790299bf2099cdffc342e25f44369765271764f8a14f819e","schema_version":"1.0","event_id":"sha256:8cd291c45354eab6790299bf2099cdffc342e25f44369765271764f8a14f819e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTTL2DJEMSXMZ3R2DH5RICGRSB/bundle.json","state_url":"https://pith.science/pith/PTTL2DJEMSXMZ3R2DH5RICGRSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTTL2DJEMSXMZ3R2DH5RICGRSB/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-30T06:28:23Z","links":{"resolver":"https://pith.science/pith/PTTL2DJEMSXMZ3R2DH5RICGRSB","bundle":"https://pith.science/pith/PTTL2DJEMSXMZ3R2DH5RICGRSB/bundle.json","state":"https://pith.science/pith/PTTL2DJEMSXMZ3R2DH5RICGRSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTTL2DJEMSXMZ3R2DH5RICGRSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PTTL2DJEMSXMZ3R2DH5RICGRSB","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":"e6d72e54fe0f883fb7b8e4b8fc1a9df72da56f27457ef2efc90a7d44b43a3f23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-26T00:17:38Z","title_canon_sha256":"6948b6c3f14a5a2f2d24e35363aca1569ae3ce7676380cb89ccd9d875cc1c05a"},"schema_version":"1.0","source":{"id":"1509.07927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07927","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07927v1","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07927","created_at":"2026-05-18T01:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"PTTL2DJEMSXM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PTTL2DJEMSXMZ3R2","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PTTL2DJE","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:8cd291c45354eab6790299bf2099cdffc342e25f44369765271764f8a14f819e","target":"graph","created_at":"2026-05-18T01:31:55Z","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 stochastic linear optimization problem with bandit feedback. The set of arms take values in an $N$-dimensional space and belong to a bounded polyhedron described by finitely many linear inequalities. We provide a lower bound for the expected regret that scales as $\\Omega(N\\log T)$. We then provide a nearly optimal algorithm and show that its expected regret scales as $O(N\\log^{1+\\epsilon}(T))$ for an arbitrary small $\\epsilon >0$. The algorithm alternates between exploration and exploitation intervals sequentially where deterministic set of arms are played in the exploration intervals","authors_text":"Amir Leshem, Manjesh K. Hanawal, Venkatesh Saligrama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-26T00:17:38Z","title":"Algorithms for Linear Bandits on Polyhedral Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07927","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:0650d6a0674ea34bbdcb0ef3779103f48c2e2208e5a2203b347902af35a800f8","target":"record","created_at":"2026-05-18T01:31:55Z","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":"e6d72e54fe0f883fb7b8e4b8fc1a9df72da56f27457ef2efc90a7d44b43a3f23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-26T00:17:38Z","title_canon_sha256":"6948b6c3f14a5a2f2d24e35363aca1569ae3ce7676380cb89ccd9d875cc1c05a"},"schema_version":"1.0","source":{"id":"1509.07927","kind":"arxiv","version":1}},"canonical_sha256":"7ce6bd0d2464aeccee3a19fb1408d1907d5bfc7cca7e94fc7d23dced3cc0d73e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ce6bd0d2464aeccee3a19fb1408d1907d5bfc7cca7e94fc7d23dced3cc0d73e","first_computed_at":"2026-05-18T01:31:55.080423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:55.080423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J8pYw6yDCQUaY0ZRYE61pnegXFbuFzkPjCcU0UiQnQgZ2N5qrxHpQ37TRrhvAKUtfvL5AfrrAX5RLwzEWzLmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:55.080781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0650d6a0674ea34bbdcb0ef3779103f48c2e2208e5a2203b347902af35a800f8","sha256:8cd291c45354eab6790299bf2099cdffc342e25f44369765271764f8a14f819e"],"state_sha256":"9c2357f35ed2907973df9f100c9dcbc2e40c0cf4a5c2d87363a1dc4199203070"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHo6FomUuCyVztcypENY6/RPo1bRDKWNc4Wr2Jdf8MZn9JXyy059bE0fJgo9aiOMg89uLbJALY+ZUmgw8PQpDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:28:23.726327Z","bundle_sha256":"133ffac244b9566b76061a020be467d1f91140a6391e43d3287e1b35cf92eeb8"}}