{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GO4A6EUWJXKFDK6DTWIOZB3U3Z","short_pith_number":"pith:GO4A6EUW","schema_version":"1.0","canonical_sha256":"33b80f12964dd451abc39d90ec8774de5924625e5505643e5d5a4e568429661c","source":{"kind":"arxiv","id":"1902.07802","version":2},"attestation_state":"computed","paper":{"title":"AdaLinUCB: Opportunistic Learning for Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Xiaoxiao Wang, Xin Liu, Xueying Guo","submitted_at":"2019-02-20T22:35:24Z","abstract_excerpt":"In this paper, we propose and study opportunistic contextual bandits - a special case of contextual bandits where the exploration cost varies under different environmental conditions, such as network load or return variation in recommendations. When the exploration cost is low, so is the actual regret of pulling a sub-optimal arm (e.g., trying a suboptimal recommendation). Therefore, intuitively, we could explore more when the exploration cost is relatively low and exploit more when the exploration cost is relatively high. Inspired by this intuition, for opportunistic contextual bandits with L"},"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":"1902.07802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-20T22:35:24Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"21f17744b1e941aec61308c903f3a5e68432f83faf67ed0b9cffd9707dae4085","abstract_canon_sha256":"e5bea455aa28fc3c300d6a63d322073bab7d95124e0a25fd96b49f427b0e9b30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:55.245535Z","signature_b64":"SGiBqX6FleY2+zVxNBrAjTkT99CmWjE62sjb7gB6RKuppHtsCcno+PXaAyOlYEiaqXvWgzqcD3XWyJk/JUEDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33b80f12964dd451abc39d90ec8774de5924625e5505643e5d5a4e568429661c","last_reissued_at":"2026-05-17T23:44:55.244592Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:55.244592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaLinUCB: Opportunistic Learning for Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Xiaoxiao Wang, Xin Liu, Xueying Guo","submitted_at":"2019-02-20T22:35:24Z","abstract_excerpt":"In this paper, we propose and study opportunistic contextual bandits - a special case of contextual bandits where the exploration cost varies under different environmental conditions, such as network load or return variation in recommendations. When the exploration cost is low, so is the actual regret of pulling a sub-optimal arm (e.g., trying a suboptimal recommendation). Therefore, intuitively, we could explore more when the exploration cost is relatively low and exploit more when the exploration cost is relatively high. Inspired by this intuition, for opportunistic contextual bandits with L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07802","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.07802","created_at":"2026-05-17T23:44:55.244754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07802v2","created_at":"2026-05-17T23:44:55.244754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07802","created_at":"2026-05-17T23:44:55.244754+00:00"},{"alias_kind":"pith_short_12","alias_value":"GO4A6EUWJXKF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GO4A6EUWJXKFDK6D","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GO4A6EUW","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.20022","citing_title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z","json":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z.json","graph_json":"https://pith.science/api/pith-number/GO4A6EUWJXKFDK6DTWIOZB3U3Z/graph.json","events_json":"https://pith.science/api/pith-number/GO4A6EUWJXKFDK6DTWIOZB3U3Z/events.json","paper":"https://pith.science/paper/GO4A6EUW"},"agent_actions":{"view_html":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z","download_json":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z.json","view_paper":"https://pith.science/paper/GO4A6EUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07802&json=true","fetch_graph":"https://pith.science/api/pith-number/GO4A6EUWJXKFDK6DTWIOZB3U3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/GO4A6EUWJXKFDK6DTWIOZB3U3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z/action/storage_attestation","attest_author":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z/action/author_attestation","sign_citation":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z/action/citation_signature","submit_replication":"https://pith.science/pith/GO4A6EUWJXKFDK6DTWIOZB3U3Z/action/replication_record"}},"created_at":"2026-05-17T23:44:55.244754+00:00","updated_at":"2026-05-17T23:44:55.244754+00:00"}