{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RQA2VZUVE4W4456VCHC5Q4RGDE","short_pith_number":"pith:RQA2VZUV","canonical_record":{"source":{"id":"2306.07903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-13T16:54:13Z","cross_cats_sorted":[],"title_canon_sha256":"53e4e8dc215d8649ca70e39347e5698db40faee8a76283e43844f0a1c576dccc","abstract_canon_sha256":"97a87a4c6641c91d388c692478b08e588e9f1afd8e1d97fc8a5f6d13cf0223cb"},"schema_version":"1.0"},"canonical_sha256":"8c01aae695272dce77d511c5d872261927693904e00113b8d898a247151e4ac4","source":{"kind":"arxiv","id":"2306.07903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.07903","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"arxiv_version","alias_value":"2306.07903v1","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07903","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"pith_short_12","alias_value":"RQA2VZUVE4W4","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"pith_short_16","alias_value":"RQA2VZUVE4W4456V","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"pith_short_8","alias_value":"RQA2VZUV","created_at":"2026-07-05T06:20:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RQA2VZUVE4W4456VCHC5Q4RGDE","target":"record","payload":{"canonical_record":{"source":{"id":"2306.07903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-13T16:54:13Z","cross_cats_sorted":[],"title_canon_sha256":"53e4e8dc215d8649ca70e39347e5698db40faee8a76283e43844f0a1c576dccc","abstract_canon_sha256":"97a87a4c6641c91d388c692478b08e588e9f1afd8e1d97fc8a5f6d13cf0223cb"},"schema_version":"1.0"},"canonical_sha256":"8c01aae695272dce77d511c5d872261927693904e00113b8d898a247151e4ac4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:10.481169Z","signature_b64":"973duVJPHdfGx6TD8rcAXQ1Zw+IAtF+aNpxOPeoCE8HR6Wh34PGHpc2Mnmk2MJJ8jQbvJAO5q5McmkYfJbPyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c01aae695272dce77d511c5d872261927693904e00113b8d898a247151e4ac4","last_reissued_at":"2026-07-05T06:20:10.480702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:10.480702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.07903","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-07-05T06:20:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKjqipBJtEm7Z3QtsidmDD8WWVYonNczgdeDRRsrNokBL2Mcx5eWkD69Rb0gVI7vB+iSeyBdFPAP63YYf/PHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T00:42:38.262911Z"},"content_sha256":"b7732bb9a7ee124574c73b7cf6f657fbba9ae54a7e48c84b4cac87ce6e4b371d","schema_version":"1.0","event_id":"sha256:b7732bb9a7ee124574c73b7cf6f657fbba9ae54a7e48c84b4cac87ce6e4b371d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RQA2VZUVE4W4456VCHC5Q4RGDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Junhao Wang, Lan Zhang, Shaoang Li, Xiang-Yang Li","submitted_at":"2023-06-13T16:54:13Z","abstract_excerpt":"In this paper, we investigate the streaming bandits problem, wherein the learner aims to minimize regret by dealing with online arriving arms and sublinear arm memory. We establish the tight worst-case regret lower bound of $\\Omega \\left( (TB)^{\\alpha} K^{1-\\alpha}\\right), \\alpha = 2^{B} / (2^{B+1}-1)$ for any algorithm with a time horizon $T$, number of arms $K$, and number of passes $B$. The result reveals a separation between the stochastic bandits problem in the classical centralized setting and the streaming setting with bounded arm memory. Notably, in comparison to the well-known $\\Omega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07903","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/2306.07903/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-05T06:20:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHliXvcDtoJ285RVK2hogWZWhBlKdIeVv2MIaBxKheBxw2EJJuavfCJMDGJTBgaymiCk3kx93PykWrZTsqiHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T00:42:38.263487Z"},"content_sha256":"4c94713cbb5b61226933c41a79e09a432684cc9550a69e529577cfc135ecf716","schema_version":"1.0","event_id":"sha256:4c94713cbb5b61226933c41a79e09a432684cc9550a69e529577cfc135ecf716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/bundle.json","state_url":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/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-13T00:42:38Z","links":{"resolver":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE","bundle":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/bundle.json","state":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RQA2VZUVE4W4456VCHC5Q4RGDE","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":"97a87a4c6641c91d388c692478b08e588e9f1afd8e1d97fc8a5f6d13cf0223cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-13T16:54:13Z","title_canon_sha256":"53e4e8dc215d8649ca70e39347e5698db40faee8a76283e43844f0a1c576dccc"},"schema_version":"1.0","source":{"id":"2306.07903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.07903","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"arxiv_version","alias_value":"2306.07903v1","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07903","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"pith_short_12","alias_value":"RQA2VZUVE4W4","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"pith_short_16","alias_value":"RQA2VZUVE4W4456V","created_at":"2026-07-05T06:20:10Z"},{"alias_kind":"pith_short_8","alias_value":"RQA2VZUV","created_at":"2026-07-05T06:20:10Z"}],"graph_snapshots":[{"event_id":"sha256:4c94713cbb5b61226933c41a79e09a432684cc9550a69e529577cfc135ecf716","target":"graph","created_at":"2026-07-05T06:20:10Z","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/2306.07903/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate the streaming bandits problem, wherein the learner aims to minimize regret by dealing with online arriving arms and sublinear arm memory. We establish the tight worst-case regret lower bound of $\\Omega \\left( (TB)^{\\alpha} K^{1-\\alpha}\\right), \\alpha = 2^{B} / (2^{B+1}-1)$ for any algorithm with a time horizon $T$, number of arms $K$, and number of passes $B$. The result reveals a separation between the stochastic bandits problem in the classical centralized setting and the streaming setting with bounded arm memory. Notably, in comparison to the well-known $\\Omega","authors_text":"Junhao Wang, Lan Zhang, Shaoang Li, Xiang-Yang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-13T16:54:13Z","title":"Tight Memory-Regret Lower Bounds for Streaming Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07903","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:b7732bb9a7ee124574c73b7cf6f657fbba9ae54a7e48c84b4cac87ce6e4b371d","target":"record","created_at":"2026-07-05T06:20:10Z","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":"97a87a4c6641c91d388c692478b08e588e9f1afd8e1d97fc8a5f6d13cf0223cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-13T16:54:13Z","title_canon_sha256":"53e4e8dc215d8649ca70e39347e5698db40faee8a76283e43844f0a1c576dccc"},"schema_version":"1.0","source":{"id":"2306.07903","kind":"arxiv","version":1}},"canonical_sha256":"8c01aae695272dce77d511c5d872261927693904e00113b8d898a247151e4ac4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c01aae695272dce77d511c5d872261927693904e00113b8d898a247151e4ac4","first_computed_at":"2026-07-05T06:20:10.480702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:20:10.480702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"973duVJPHdfGx6TD8rcAXQ1Zw+IAtF+aNpxOPeoCE8HR6Wh34PGHpc2Mnmk2MJJ8jQbvJAO5q5McmkYfJbPyAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:20:10.481169Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.07903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7732bb9a7ee124574c73b7cf6f657fbba9ae54a7e48c84b4cac87ce6e4b371d","sha256:4c94713cbb5b61226933c41a79e09a432684cc9550a69e529577cfc135ecf716"],"state_sha256":"69346d4d33e4257828f12f1e76aa5b076970484ba1fbbf0a2946d0971394b7c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AqptzgUNdwKwIQoLogl0rtl50yQpImA4d3WTZRrL2V2wmTX0gmv5vjpziddFOrhklPWkPyf32peXNEfOmgJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T00:42:38.269592Z","bundle_sha256":"e8e18c797114dbbee5a6ca23a04fb5c128939c725f1be1201d5948aeea82d1b7"}}