{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:I2QWTEVLJWNYEGJZWWPKPVC4V3","short_pith_number":"pith:I2QWTEVL","canonical_record":{"source":{"id":"1505.02865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-12T03:35:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"56a7a0f224f48a3f9fb273bad8e2d3defce084aae6fb19728a5c7a36153b0f22","abstract_canon_sha256":"8e56fba531fa95e594bb0182438082eeeb7d0a9ba501f8ed8660e5724c18b34d"},"schema_version":"1.0"},"canonical_sha256":"46a16992ab4d9b821939b59ea7d45caef2f99b7a87888ee5a467bbf1d8a9b0a7","source":{"kind":"arxiv","id":"1505.02865","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02865","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02865v2","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02865","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"I2QWTEVLJWNY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I2QWTEVLJWNYEGJZ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I2QWTEVL","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:I2QWTEVLJWNYEGJZWWPKPVC4V3","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-12T03:35:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"56a7a0f224f48a3f9fb273bad8e2d3defce084aae6fb19728a5c7a36153b0f22","abstract_canon_sha256":"8e56fba531fa95e594bb0182438082eeeb7d0a9ba501f8ed8660e5724c18b34d"},"schema_version":"1.0"},"canonical_sha256":"46a16992ab4d9b821939b59ea7d45caef2f99b7a87888ee5a467bbf1d8a9b0a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:10.829413Z","signature_b64":"ildYfkfAnexkkog0mewPgBtwxHwsff4SRjHsS+dVxjadc5x1CM+w3LC4Wa6E95+TXs/WwASQdV+kbAI0ELFsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46a16992ab4d9b821939b59ea7d45caef2f99b7a87888ee5a467bbf1d8a9b0a7","last_reissued_at":"2026-05-18T01:24:10.828951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:10.828951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02865","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-18T01:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmEjM+C0YN+uJpFP+C0nXalFqHHeyXiUT/GxyYOS6vIet3KWiStKktuC8PNsXtMCAKH5i0uuqFDMu76iRZcrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:10:13.527597Z"},"content_sha256":"361ce3256a84e357d091d89e4ded26484121b40ab6243d7cc870c64ca96ca2f3","schema_version":"1.0","event_id":"sha256:361ce3256a84e357d091d89e4ded26484121b40ab6243d7cc870c64ca96ca2f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:I2QWTEVLJWNYEGJZWWPKPVC4V3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Behavior of Minimal-Exploration Allocation Policies: Almost Sure, Arbitrarily Slow Growing Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Michael N. Katehakis, Wesley Cowan","submitted_at":"2015-05-12T03:35:47Z","abstract_excerpt":"The purpose of this paper is to provide further understanding into the structure of the sequential allocation (\"stochastic multi-armed bandit\", or MAB) problem by establishing probability one finite horizon bounds and convergence rates for the sample (or \"pseudo\") regret associated with two simple classes of allocation policies $\\pi$.\n  For any slowly increasing function $g$, subject to mild regularity constraints, we construct two policies (the $g$-Forcing, and the $g$-Inflated Sample Mean) that achieve a measure of regret of order $ O(g(n))$ almost surely as $n \\to \\infty$, bound from above "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02865","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-18T01:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPstqd9ncyh0Rlc8S8trkjcBmf/olJWDOiQtP5zmkyIAiLdQrtP7RWrxTkGO3Z7Ld/eyxwyk/YCKqrL4QUyADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:10:13.528201Z"},"content_sha256":"5fd0def91c8696ada2004802238b4aebcea483eaca06f9a79a6ec46d7af872dd","schema_version":"1.0","event_id":"sha256:5fd0def91c8696ada2004802238b4aebcea483eaca06f9a79a6ec46d7af872dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2QWTEVLJWNYEGJZWWPKPVC4V3/bundle.json","state_url":"https://pith.science/pith/I2QWTEVLJWNYEGJZWWPKPVC4V3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2QWTEVLJWNYEGJZWWPKPVC4V3/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-08T19:10:13Z","links":{"resolver":"https://pith.science/pith/I2QWTEVLJWNYEGJZWWPKPVC4V3","bundle":"https://pith.science/pith/I2QWTEVLJWNYEGJZWWPKPVC4V3/bundle.json","state":"https://pith.science/pith/I2QWTEVLJWNYEGJZWWPKPVC4V3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2QWTEVLJWNYEGJZWWPKPVC4V3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:I2QWTEVLJWNYEGJZWWPKPVC4V3","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":"8e56fba531fa95e594bb0182438082eeeb7d0a9ba501f8ed8660e5724c18b34d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-12T03:35:47Z","title_canon_sha256":"56a7a0f224f48a3f9fb273bad8e2d3defce084aae6fb19728a5c7a36153b0f22"},"schema_version":"1.0","source":{"id":"1505.02865","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02865","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02865v2","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02865","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"I2QWTEVLJWNY","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I2QWTEVLJWNYEGJZ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I2QWTEVL","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:5fd0def91c8696ada2004802238b4aebcea483eaca06f9a79a6ec46d7af872dd","target":"graph","created_at":"2026-05-18T01:24: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"},"paper":{"abstract_excerpt":"The purpose of this paper is to provide further understanding into the structure of the sequential allocation (\"stochastic multi-armed bandit\", or MAB) problem by establishing probability one finite horizon bounds and convergence rates for the sample (or \"pseudo\") regret associated with two simple classes of allocation policies $\\pi$.\n  For any slowly increasing function $g$, subject to mild regularity constraints, we construct two policies (the $g$-Forcing, and the $g$-Inflated Sample Mean) that achieve a measure of regret of order $ O(g(n))$ almost surely as $n \\to \\infty$, bound from above ","authors_text":"Michael N. Katehakis, Wesley Cowan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-12T03:35:47Z","title":"Asymptotic Behavior of Minimal-Exploration Allocation Policies: Almost Sure, Arbitrarily Slow Growing Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02865","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:361ce3256a84e357d091d89e4ded26484121b40ab6243d7cc870c64ca96ca2f3","target":"record","created_at":"2026-05-18T01:24: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":"8e56fba531fa95e594bb0182438082eeeb7d0a9ba501f8ed8660e5724c18b34d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-12T03:35:47Z","title_canon_sha256":"56a7a0f224f48a3f9fb273bad8e2d3defce084aae6fb19728a5c7a36153b0f22"},"schema_version":"1.0","source":{"id":"1505.02865","kind":"arxiv","version":2}},"canonical_sha256":"46a16992ab4d9b821939b59ea7d45caef2f99b7a87888ee5a467bbf1d8a9b0a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46a16992ab4d9b821939b59ea7d45caef2f99b7a87888ee5a467bbf1d8a9b0a7","first_computed_at":"2026-05-18T01:24:10.828951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:10.828951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ildYfkfAnexkkog0mewPgBtwxHwsff4SRjHsS+dVxjadc5x1CM+w3LC4Wa6E95+TXs/WwASQdV+kbAI0ELFsDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:10.829413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02865","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:361ce3256a84e357d091d89e4ded26484121b40ab6243d7cc870c64ca96ca2f3","sha256:5fd0def91c8696ada2004802238b4aebcea483eaca06f9a79a6ec46d7af872dd"],"state_sha256":"6debb15b020e3bac6b7ea425a267219fbb96df0b362cb2e4ba5fb6a6d6affc07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIYFClYwvYzQq/YxdtKZ9od9CS0dhwpI2F7tKFrUCBmm4inusjjFu0AlC0WEXmkECZWv2S/OHOVaydpLG8cEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:10:13.532028Z","bundle_sha256":"de03d5a9c5ba5549e227578b471e98a4cfd2eebb1f8d14ee4e625b455959a41b"}}