{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B4O6Y3WZW6POTNIEWILMBTJV23","short_pith_number":"pith:B4O6Y3WZ","schema_version":"1.0","canonical_sha256":"0f1dec6ed9b79ee9b504b216c0cd35d6e9bd43ce9976c89a53a96a0a4d002e02","source":{"kind":"arxiv","id":"2606.20022","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Haonan Xu, Yingying Li","submitted_at":"2026-06-18T09:54:23Z","abstract_excerpt":"This paper considers stochastic linear contextual bandits (SLCB) with bounded reward noise. Existing works typically assume sub-Gaussian reward noise and bounded expected rewards, under which the optimal regret bound scales as $\\tilde{O}(\\sqrt{T})$ in terms of horizon $T$. However, in many applications, realized/observed rewards are also naturally bounded, implying bounded reward noise. Bounded noise is more informative than the sub-Gaussian condition but has not been leveraged explicitly in the SLCB literature. In this paper, we propose a novel algorithm SME-OFU by utilizing an uncertainty qu"},"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":"2606.20022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-06-18T09:54:23Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"b62a19b32f37bfc00b0d8f3771c40d8f286ced74dabd707ddedfbcf052c71979","abstract_canon_sha256":"3da28a7f96ee2756ff3e749ebc856969a478acfd988a3461160885287fc44eb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:00.898735Z","signature_b64":"Gc5OxCygZVFKi7ccA3Xp8iKVeMB/1b5Uy1FQeB2WwTi0Y4TCYNkulwQAL/SQQ5suH1XRuWSdRRv0wESEcRExAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f1dec6ed9b79ee9b504b216c0cd35d6e9bd43ce9976c89a53a96a0a4d002e02","last_reissued_at":"2026-06-19T16:13:00.898361Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:00.898361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Haonan Xu, Yingying Li","submitted_at":"2026-06-18T09:54:23Z","abstract_excerpt":"This paper considers stochastic linear contextual bandits (SLCB) with bounded reward noise. Existing works typically assume sub-Gaussian reward noise and bounded expected rewards, under which the optimal regret bound scales as $\\tilde{O}(\\sqrt{T})$ in terms of horizon $T$. However, in many applications, realized/observed rewards are also naturally bounded, implying bounded reward noise. Bounded noise is more informative than the sub-Gaussian condition but has not been leveraged explicitly in the SLCB literature. In this paper, we propose a novel algorithm SME-OFU by utilizing an uncertainty qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20022","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.20022/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.20022","created_at":"2026-06-19T16:13:00.898418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20022v1","created_at":"2026-06-19T16:13:00.898418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20022","created_at":"2026-06-19T16:13:00.898418+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4O6Y3WZW6PO","created_at":"2026-06-19T16:13:00.898418+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4O6Y3WZW6POTNIE","created_at":"2026-06-19T16:13:00.898418+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4O6Y3WZ","created_at":"2026-06-19T16:13:00.898418+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/B4O6Y3WZW6POTNIEWILMBTJV23","json":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23.json","graph_json":"https://pith.science/api/pith-number/B4O6Y3WZW6POTNIEWILMBTJV23/graph.json","events_json":"https://pith.science/api/pith-number/B4O6Y3WZW6POTNIEWILMBTJV23/events.json","paper":"https://pith.science/paper/B4O6Y3WZ"},"agent_actions":{"view_html":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23","download_json":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23.json","view_paper":"https://pith.science/paper/B4O6Y3WZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20022&json=true","fetch_graph":"https://pith.science/api/pith-number/B4O6Y3WZW6POTNIEWILMBTJV23/graph.json","fetch_events":"https://pith.science/api/pith-number/B4O6Y3WZW6POTNIEWILMBTJV23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/action/storage_attestation","attest_author":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/action/author_attestation","sign_citation":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/action/citation_signature","submit_replication":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/action/replication_record"}},"created_at":"2026-06-19T16:13:00.898418+00:00","updated_at":"2026-06-19T16:13:00.898418+00:00"}