{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:B4O6Y3WZW6POTNIEWILMBTJV23","short_pith_number":"pith:B4O6Y3WZ","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"},"canonical_sha256":"0f1dec6ed9b79ee9b504b216c0cd35d6e9bd43ce9976c89a53a96a0a4d002e02","source":{"kind":"arxiv","id":"2606.20022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20022","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20022v1","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20022","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"B4O6Y3WZW6PO","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"pith_short_16","alias_value":"B4O6Y3WZW6POTNIE","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"pith_short_8","alias_value":"B4O6Y3WZ","created_at":"2026-06-19T16:13:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:B4O6Y3WZW6POTNIEWILMBTJV23","target":"record","payload":{"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"},"canonical_sha256":"0f1dec6ed9b79ee9b504b216c0cd35d6e9bd43ce9976c89a53a96a0a4d002e02","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"},"source_kind":"arxiv","source_id":"2606.20022","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-06-19T16:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+KfLJFKdaLoJnNNrv4cnTg2pC2+s4pHJChwTEWl64FdwadjiuTmoOhj8dvua42rLm8BGHZNDhqTUGlEP7AsACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:58:13.849875Z"},"content_sha256":"89ded202939e5260a33f6b47d0ae811145ddd0827971a6a0c066108fe098396d","schema_version":"1.0","event_id":"sha256:89ded202939e5260a33f6b47d0ae811145ddd0827971a6a0c066108fe098396d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:B4O6Y3WZW6POTNIEWILMBTJV23","target":"graph","payload":{"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"},"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-06-19T16:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0eo2etiiWP8wpKA6zepmOrToclW42iAzIMWPvIu8oyirOWVjAEBzOt8l1xFcGhmb8hYzvjgubacNTkQDgbsiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:58:13.850372Z"},"content_sha256":"9458c4a303248b29c42ff54c74d4ba6da48c56e721c6214aa8c41b530ed1fd93","schema_version":"1.0","event_id":"sha256:9458c4a303248b29c42ff54c74d4ba6da48c56e721c6214aa8c41b530ed1fd93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/bundle.json","state_url":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4O6Y3WZW6POTNIEWILMBTJV23/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-08T22:58:13Z","links":{"resolver":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23","bundle":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/bundle.json","state":"https://pith.science/pith/B4O6Y3WZW6POTNIEWILMBTJV23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4O6Y3WZW6POTNIEWILMBTJV23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B4O6Y3WZW6POTNIEWILMBTJV23","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":"3da28a7f96ee2756ff3e749ebc856969a478acfd988a3461160885287fc44eb7","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-06-18T09:54:23Z","title_canon_sha256":"b62a19b32f37bfc00b0d8f3771c40d8f286ced74dabd707ddedfbcf052c71979"},"schema_version":"1.0","source":{"id":"2606.20022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20022","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20022v1","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20022","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"B4O6Y3WZW6PO","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"pith_short_16","alias_value":"B4O6Y3WZW6POTNIE","created_at":"2026-06-19T16:13:00Z"},{"alias_kind":"pith_short_8","alias_value":"B4O6Y3WZ","created_at":"2026-06-19T16:13:00Z"}],"graph_snapshots":[{"event_id":"sha256:9458c4a303248b29c42ff54c74d4ba6da48c56e721c6214aa8c41b530ed1fd93","target":"graph","created_at":"2026-06-19T16:13:00Z","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/2606.20022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haonan Xu, Yingying Li","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20022","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:89ded202939e5260a33f6b47d0ae811145ddd0827971a6a0c066108fe098396d","target":"record","created_at":"2026-06-19T16:13:00Z","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":"3da28a7f96ee2756ff3e749ebc856969a478acfd988a3461160885287fc44eb7","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-06-18T09:54:23Z","title_canon_sha256":"b62a19b32f37bfc00b0d8f3771c40d8f286ced74dabd707ddedfbcf052c71979"},"schema_version":"1.0","source":{"id":"2606.20022","kind":"arxiv","version":1}},"canonical_sha256":"0f1dec6ed9b79ee9b504b216c0cd35d6e9bd43ce9976c89a53a96a0a4d002e02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f1dec6ed9b79ee9b504b216c0cd35d6e9bd43ce9976c89a53a96a0a4d002e02","first_computed_at":"2026-06-19T16:13:00.898361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:00.898361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gc5OxCygZVFKi7ccA3Xp8iKVeMB/1b5Uy1FQeB2WwTi0Y4TCYNkulwQAL/SQQ5suH1XRuWSdRRv0wESEcRExAw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:00.898735Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89ded202939e5260a33f6b47d0ae811145ddd0827971a6a0c066108fe098396d","sha256:9458c4a303248b29c42ff54c74d4ba6da48c56e721c6214aa8c41b530ed1fd93"],"state_sha256":"411d0957b303dc0062c351fa47d1dbbc105ef85e33f7458a454d00285cc66e44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhWviAHyu9Xy2MD/MlBc33qzQKiJ4GYas7rdlX1Jgs+POi6AF1ufk1rJcKlFqFOdxBVerA/qmylUnpKSNzodAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T22:58:13.854744Z","bundle_sha256":"f23e3f5d1fc8cb8c079a75e649332614ee96fb074b9d274f547f9af5b5fb9484"}}