{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KF2TTPNXDB2YKQV723755CYNHN","short_pith_number":"pith:KF2TTPNX","canonical_record":{"source":{"id":"1905.01435","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-04T05:51:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8c3ceb61c6b4ad05cd49837d3270f5436537fc2760436121b7701858aa242cf0","abstract_canon_sha256":"3cb89b8ead6337829ba03074d9955b509fdf1d6b0a90d827dcc15a56b32396cc"},"schema_version":"1.0"},"canonical_sha256":"517539bdb718758542bfd6ffde8b0d3b76446e273a4c883426d587bd9ada5614","source":{"kind":"arxiv","id":"1905.01435","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01435","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01435v3","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01435","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"KF2TTPNXDB2Y","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"pith_short_16","alias_value":"KF2TTPNXDB2YKQV7","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"pith_short_8","alias_value":"KF2TTPNX","created_at":"2026-07-05T02:10:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KF2TTPNXDB2YKQV723755CYNHN","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01435","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-04T05:51:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8c3ceb61c6b4ad05cd49837d3270f5436537fc2760436121b7701858aa242cf0","abstract_canon_sha256":"3cb89b8ead6337829ba03074d9955b509fdf1d6b0a90d827dcc15a56b32396cc"},"schema_version":"1.0"},"canonical_sha256":"517539bdb718758542bfd6ffde8b0d3b76446e273a4c883426d587bd9ada5614","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:05.095572Z","signature_b64":"crmP5PFeJUZOuYNT2ImRdM7R9QDYd6BBTS1Bl3pHnymg2tQ4Pr/8RdTu6hPXKhLiB/AR1tRZ5gKeqWkF3knaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"517539bdb718758542bfd6ffde8b0d3b76446e273a4c883426d587bd9ada5614","last_reissued_at":"2026-07-05T02:10:05.095147Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:05.095147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01435","source_version":3,"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-05T02:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ookRQbaDUK9JfwPhl4eUbHJY2P2uL34GlS0pP5SaH726xtn0pTKPFtLuc9ZwP4b5jyDCFRWuV+5fIG/LTJvzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:11:24.136301Z"},"content_sha256":"b64a93189d03568df7b58e315e939f9b9f1e3d1b220573ab571a77eb98d606f6","schema_version":"1.0","event_id":"sha256:b64a93189d03568df7b58e315e939f9b9f1e3d1b220573ab571a77eb98d606f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KF2TTPNXDB2YKQV723755CYNHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Regret Bounds for Infinite-armed Linear Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Xi Chen, Yingkai Li, Yining Wang, Yuan Zhou","submitted_at":"2019-05-04T05:51:30Z","abstract_excerpt":"Linear contextual bandit is an important class of sequential decision making problems with a wide range of applications to recommender systems, online advertising, healthcare, and many other machine learning related tasks. While there is a lot of prior research, tight regret bounds of linear contextual bandit with infinite action sets remain open. In this paper, we address this open problem by considering the linear contextual bandit with (changing) infinite action sets. We prove a regret upper bound on the order of $O(\\sqrt{d^2T\\log T})\\times \\text{poly}(\\log\\log T)$ where $d$ is the domain d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01435","kind":"arxiv","version":3},"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/1905.01435/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-05T02:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUYWCG9y6XbACoZnlPwOwD2rAW1WWkfAvf74XdrUtwb3h8qmx/eEY22P+iOusHvEwpHUoEPj0z4We3hcJ5TJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:11:24.136806Z"},"content_sha256":"7d72a40c0c782d08eef9d9ea942723bb94c5ce61ef1b8a8bcfd0da3ed2e4db99","schema_version":"1.0","event_id":"sha256:7d72a40c0c782d08eef9d9ea942723bb94c5ce61ef1b8a8bcfd0da3ed2e4db99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KF2TTPNXDB2YKQV723755CYNHN/bundle.json","state_url":"https://pith.science/pith/KF2TTPNXDB2YKQV723755CYNHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KF2TTPNXDB2YKQV723755CYNHN/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-08-20T08:11:24Z","links":{"resolver":"https://pith.science/pith/KF2TTPNXDB2YKQV723755CYNHN","bundle":"https://pith.science/pith/KF2TTPNXDB2YKQV723755CYNHN/bundle.json","state":"https://pith.science/pith/KF2TTPNXDB2YKQV723755CYNHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KF2TTPNXDB2YKQV723755CYNHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KF2TTPNXDB2YKQV723755CYNHN","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":"3cb89b8ead6337829ba03074d9955b509fdf1d6b0a90d827dcc15a56b32396cc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-04T05:51:30Z","title_canon_sha256":"8c3ceb61c6b4ad05cd49837d3270f5436537fc2760436121b7701858aa242cf0"},"schema_version":"1.0","source":{"id":"1905.01435","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01435","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01435v3","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01435","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"KF2TTPNXDB2Y","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"pith_short_16","alias_value":"KF2TTPNXDB2YKQV7","created_at":"2026-07-05T02:10:05Z"},{"alias_kind":"pith_short_8","alias_value":"KF2TTPNX","created_at":"2026-07-05T02:10:05Z"}],"graph_snapshots":[{"event_id":"sha256:7d72a40c0c782d08eef9d9ea942723bb94c5ce61ef1b8a8bcfd0da3ed2e4db99","target":"graph","created_at":"2026-07-05T02:10:05Z","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/1905.01435/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Linear contextual bandit is an important class of sequential decision making problems with a wide range of applications to recommender systems, online advertising, healthcare, and many other machine learning related tasks. While there is a lot of prior research, tight regret bounds of linear contextual bandit with infinite action sets remain open. In this paper, we address this open problem by considering the linear contextual bandit with (changing) infinite action sets. We prove a regret upper bound on the order of $O(\\sqrt{d^2T\\log T})\\times \\text{poly}(\\log\\log T)$ where $d$ is the domain d","authors_text":"Xi Chen, Yingkai Li, Yining Wang, Yuan Zhou","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-04T05:51:30Z","title":"Tight Regret Bounds for Infinite-armed Linear Contextual Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01435","kind":"arxiv","version":3},"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:b64a93189d03568df7b58e315e939f9b9f1e3d1b220573ab571a77eb98d606f6","target":"record","created_at":"2026-07-05T02:10:05Z","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":"3cb89b8ead6337829ba03074d9955b509fdf1d6b0a90d827dcc15a56b32396cc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-04T05:51:30Z","title_canon_sha256":"8c3ceb61c6b4ad05cd49837d3270f5436537fc2760436121b7701858aa242cf0"},"schema_version":"1.0","source":{"id":"1905.01435","kind":"arxiv","version":3}},"canonical_sha256":"517539bdb718758542bfd6ffde8b0d3b76446e273a4c883426d587bd9ada5614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"517539bdb718758542bfd6ffde8b0d3b76446e273a4c883426d587bd9ada5614","first_computed_at":"2026-07-05T02:10:05.095147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:10:05.095147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"crmP5PFeJUZOuYNT2ImRdM7R9QDYd6BBTS1Bl3pHnymg2tQ4Pr/8RdTu6hPXKhLiB/AR1tRZ5gKeqWkF3knaAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:10:05.095572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01435","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b64a93189d03568df7b58e315e939f9b9f1e3d1b220573ab571a77eb98d606f6","sha256:7d72a40c0c782d08eef9d9ea942723bb94c5ce61ef1b8a8bcfd0da3ed2e4db99"],"state_sha256":"6dd0274560c26496d13630cf1d24b2b86352e4dc72f43afc0741eea55f3b1e2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAzsndGvIooY+uswPbkOCUp/A1XHx4lN10evHZK3jNnINnCJHfob6+o0oRiYECtwv/mU1I3Gk/7r8uexYEYPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T08:11:24.143078Z","bundle_sha256":"32c4a1395ba251eece531f60d2d8878b3a17c674e35aaf1d6b1d248ad11dac0b"}}