{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HCLXMYKY4TEUUBLMTXSC2H3KIP","short_pith_number":"pith:HCLXMYKY","schema_version":"1.0","canonical_sha256":"3897766158e4c94a056c9de42d1f6a43cb352ba6ac505cb27409e5695ed38650","source":{"kind":"arxiv","id":"2606.08977","version":1},"attestation_state":"computed","paper":{"title":"Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Chen Wang, Liudeng Wang, Samson Zhou, Vladimir Braverman","submitted_at":"2026-06-08T03:21:54Z","abstract_excerpt":"Motivated by the recency effect in online learning, we study algorithms for single-pass *sliding-window streaming multi-armed bandits (MABs)* in this paper. In this setting, we are given $n$ arms with unknown sub-Gaussian reward distributions and a parameter $W$. The arms arrive in a single-pass stream, and only the most recent $W$ arms are considered valid. The algorithm is required to perform pure exploration and regret minimization with limited memory, defined as the number of stored arms. The model is a natural extension of the streaming multi-armed bandits model (without the sliding windo"},"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.08977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-08T03:21:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ee89d6a58b17a04df4f121ec86862aeae454e79a606217b0b40693e2c4421500","abstract_canon_sha256":"732c863e0e6aab6d635436ffa7a4da818992496594036b2609f92ad27c6d94a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:51.342676Z","signature_b64":"Zr9gKEeRSy6DGmPIsVEGkArwjSo2cLekPKKJhzmyjBkDgi8asvp2Ctm2vQIiFAcB/RhHCoYYZtcGe1SkTih1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3897766158e4c94a056c9de42d1f6a43cb352ba6ac505cb27409e5695ed38650","last_reissued_at":"2026-06-09T02:07:51.341582Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:51.341582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Chen Wang, Liudeng Wang, Samson Zhou, Vladimir Braverman","submitted_at":"2026-06-08T03:21:54Z","abstract_excerpt":"Motivated by the recency effect in online learning, we study algorithms for single-pass *sliding-window streaming multi-armed bandits (MABs)* in this paper. In this setting, we are given $n$ arms with unknown sub-Gaussian reward distributions and a parameter $W$. The arms arrive in a single-pass stream, and only the most recent $W$ arms are considered valid. The algorithm is required to perform pure exploration and regret minimization with limited memory, defined as the number of stored arms. The model is a natural extension of the streaming multi-armed bandits model (without the sliding windo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08977","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.08977/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.08977","created_at":"2026-06-09T02:07:51.341759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08977v1","created_at":"2026-06-09T02:07:51.341759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08977","created_at":"2026-06-09T02:07:51.341759+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCLXMYKY4TEU","created_at":"2026-06-09T02:07:51.341759+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCLXMYKY4TEUUBLM","created_at":"2026-06-09T02:07:51.341759+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCLXMYKY","created_at":"2026-06-09T02:07:51.341759+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/HCLXMYKY4TEUUBLMTXSC2H3KIP","json":"https://pith.science/pith/HCLXMYKY4TEUUBLMTXSC2H3KIP.json","graph_json":"https://pith.science/api/pith-number/HCLXMYKY4TEUUBLMTXSC2H3KIP/graph.json","events_json":"https://pith.science/api/pith-number/HCLXMYKY4TEUUBLMTXSC2H3KIP/events.json","paper":"https://pith.science/paper/HCLXMYKY"},"agent_actions":{"view_html":"https://pith.science/pith/HCLXMYKY4TEUUBLMTXSC2H3KIP","download_json":"https://pith.science/pith/HCLXMYKY4TEUUBLMTXSC2H3KIP.json","view_paper":"https://pith.science/paper/HCLXMYKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08977&json=true","fetch_graph":"https://pith.science/api/pith-number/HCLXMYKY4TEUUBLMTXSC2H3KIP/graph.json","fetch_events":"https://pith.science/api/pith-number/HCLXMYKY4TEUUBLMTXSC2H3KIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCLXMYKY4TEUUBLMTXSC2H3KIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCLXMYKY4TEUUBLMTXSC2H3KIP/action/storage_attestation","attest_author":"https://pith.science/pith/HCLXMYKY4TEUUBLMTXSC2H3KIP/action/author_attestation","sign_citation":"https://pith.science/pith/HCLXMYKY4TEUUBLMTXSC2H3KIP/action/citation_signature","submit_replication":"https://pith.science/pith/HCLXMYKY4TEUUBLMTXSC2H3KIP/action/replication_record"}},"created_at":"2026-06-09T02:07:51.341759+00:00","updated_at":"2026-06-09T02:07:51.341759+00:00"}