{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZTCIIDU2KIKDXMLIPR5QIB52WA","short_pith_number":"pith:ZTCIIDU2","canonical_record":{"source":{"id":"1712.09007","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-25T05:04:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ace7934a12c1432b78b9bc1e3158f3159da0142128ac7bca8d0c5d262b674852","abstract_canon_sha256":"6fd325a183940be3f98ea861f1e91f385547b131af700401c36085e5e364a912"},"schema_version":"1.0"},"canonical_sha256":"ccc4840e9a52143bb1687c7b0407bab0314828d151f75d252370ef649bd88b80","source":{"kind":"arxiv","id":"1712.09007","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09007","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09007v2","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09007","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZTCIIDU2KIKD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTCIIDU2KIKDXMLI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTCIIDU2","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZTCIIDU2KIKDXMLIPR5QIB52WA","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09007","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-25T05:04:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ace7934a12c1432b78b9bc1e3158f3159da0142128ac7bca8d0c5d262b674852","abstract_canon_sha256":"6fd325a183940be3f98ea861f1e91f385547b131af700401c36085e5e364a912"},"schema_version":"1.0"},"canonical_sha256":"ccc4840e9a52143bb1687c7b0407bab0314828d151f75d252370ef649bd88b80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:52.040731Z","signature_b64":"5rD2MEYNclKKXdIpbwyaFSUMIOrz89D2H+2SpD+jMV+jFLcIy0BD3z+TBIc7pZd2X+b1erjYRDDkmUsfFheQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccc4840e9a52143bb1687c7b0407bab0314828d151f75d252370ef649bd88b80","last_reissued_at":"2026-05-18T00:15:52.040064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:52.040064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09007","source_version":2,"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-05-18T00:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XTto0Rhr6wcQ8fCoZk2rurJjY1FCQarySntRp1Pee4xHKMFV2OCa3UUG2pm6RmyYGcI0Dgu/P+NcVJjtS67TAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:05:14.387177Z"},"content_sha256":"5b430eeebf2318e7bf39dd1103a8cada6aa9d76105d0cb9f1952a2618c15bfd3","schema_version":"1.0","event_id":"sha256:5b430eeebf2318e7bf39dd1103a8cada6aa9d76105d0cb9f1952a2618c15bfd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZTCIIDU2KIKDXMLIPR5QIB52WA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Multi-armed Bandits in Constant Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"David Liau, Eric Price, Ger Yang, Zhao Song","submitted_at":"2017-12-25T05:04:35Z","abstract_excerpt":"We consider the stochastic bandit problem in the sublinear space setting, where one cannot record the win-loss record for all $K$ arms. We give an algorithm using $O(1)$ words of space with regret \\[\n  \\sum_{i=1}^{K}\\frac{1}{\\Delta_i}\\log \\frac{\\Delta_i}{\\Delta}\\log T \\] where $\\Delta_i$ is the gap between the best arm and arm $i$ and $\\Delta$ is the gap between the best and the second-best arms. If the rewards are bounded away from $0$ and $1$, this is within an $O(\\log 1/\\Delta)$ factor of the optimum regret possible without space constraints."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09007","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"},"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-05-18T00:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abBq8aC/YuAseTYkBL32wUjHgYSPiJP7x/3lgBUpyEOLxokBcRh2DKZixZgeVL4o8kRLYniPHnlhtiQUbzqaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:05:14.387538Z"},"content_sha256":"a36a0b9eb7dd26725470beece173808492a332d15c356b6202b22dbe542718c1","schema_version":"1.0","event_id":"sha256:a36a0b9eb7dd26725470beece173808492a332d15c356b6202b22dbe542718c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTCIIDU2KIKDXMLIPR5QIB52WA/bundle.json","state_url":"https://pith.science/pith/ZTCIIDU2KIKDXMLIPR5QIB52WA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTCIIDU2KIKDXMLIPR5QIB52WA/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-06-01T03:05:14Z","links":{"resolver":"https://pith.science/pith/ZTCIIDU2KIKDXMLIPR5QIB52WA","bundle":"https://pith.science/pith/ZTCIIDU2KIKDXMLIPR5QIB52WA/bundle.json","state":"https://pith.science/pith/ZTCIIDU2KIKDXMLIPR5QIB52WA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTCIIDU2KIKDXMLIPR5QIB52WA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZTCIIDU2KIKDXMLIPR5QIB52WA","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":"6fd325a183940be3f98ea861f1e91f385547b131af700401c36085e5e364a912","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-25T05:04:35Z","title_canon_sha256":"ace7934a12c1432b78b9bc1e3158f3159da0142128ac7bca8d0c5d262b674852"},"schema_version":"1.0","source":{"id":"1712.09007","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09007","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09007v2","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09007","created_at":"2026-05-18T00:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZTCIIDU2KIKD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTCIIDU2KIKDXMLI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTCIIDU2","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a36a0b9eb7dd26725470beece173808492a332d15c356b6202b22dbe542718c1","target":"graph","created_at":"2026-05-18T00:15:52Z","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"},"paper":{"abstract_excerpt":"We consider the stochastic bandit problem in the sublinear space setting, where one cannot record the win-loss record for all $K$ arms. We give an algorithm using $O(1)$ words of space with regret \\[\n  \\sum_{i=1}^{K}\\frac{1}{\\Delta_i}\\log \\frac{\\Delta_i}{\\Delta}\\log T \\] where $\\Delta_i$ is the gap between the best arm and arm $i$ and $\\Delta$ is the gap between the best and the second-best arms. If the rewards are bounded away from $0$ and $1$, this is within an $O(\\log 1/\\Delta)$ factor of the optimum regret possible without space constraints.","authors_text":"David Liau, Eric Price, Ger Yang, Zhao Song","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-25T05:04:35Z","title":"Stochastic Multi-armed Bandits in Constant Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09007","kind":"arxiv","version":2},"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:5b430eeebf2318e7bf39dd1103a8cada6aa9d76105d0cb9f1952a2618c15bfd3","target":"record","created_at":"2026-05-18T00:15:52Z","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":"6fd325a183940be3f98ea861f1e91f385547b131af700401c36085e5e364a912","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-25T05:04:35Z","title_canon_sha256":"ace7934a12c1432b78b9bc1e3158f3159da0142128ac7bca8d0c5d262b674852"},"schema_version":"1.0","source":{"id":"1712.09007","kind":"arxiv","version":2}},"canonical_sha256":"ccc4840e9a52143bb1687c7b0407bab0314828d151f75d252370ef649bd88b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccc4840e9a52143bb1687c7b0407bab0314828d151f75d252370ef649bd88b80","first_computed_at":"2026-05-18T00:15:52.040064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:52.040064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5rD2MEYNclKKXdIpbwyaFSUMIOrz89D2H+2SpD+jMV+jFLcIy0BD3z+TBIc7pZd2X+b1erjYRDDkmUsfFheQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:52.040731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09007","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b430eeebf2318e7bf39dd1103a8cada6aa9d76105d0cb9f1952a2618c15bfd3","sha256:a36a0b9eb7dd26725470beece173808492a332d15c356b6202b22dbe542718c1"],"state_sha256":"dc4b5674d6843b41b96d91a6b08817cb9887098ee3f672334d0c7e5c8bbd55a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U81tuuMCc9O6oiyM/R2fxVo9zwUbYvUkzXzGz/lCaAglT8GpNQLC3G1Dtu9Al9vXByYfOQLdepeqp1Z+D8UQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:05:14.389586Z","bundle_sha256":"80b0cc2ca8b49aace3fec08e649d20014d476ef42a2978c65ee8158585671a1f"}}