{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZR6LQ563OVK4DILQ5Q2HGOJUWD","short_pith_number":"pith:ZR6LQ563","canonical_record":{"source":{"id":"1109.1533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-07T18:33:59Z","cross_cats_sorted":["cs.LG","cs.NI","cs.SY","math.PR"],"title_canon_sha256":"24f6199c68029bfcc4275ea0dcea356cbed4f7a4dee6cb60d790b8b341c30e21","abstract_canon_sha256":"9d898173976ce5d5f0497a76949556ecb78008833e935648d54f10d14e23da7e"},"schema_version":"1.0"},"canonical_sha256":"cc7cb877db7555c1a170ec34733934b0fd5a5d0aaae0fe06cc6cf4bbef48ab5c","source":{"kind":"arxiv","id":"1109.1533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1533","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1533v1","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1533","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZR6LQ563OVK4","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZR6LQ563OVK4DILQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZR6LQ563","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZR6LQ563OVK4DILQ5Q2HGOJUWD","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-07T18:33:59Z","cross_cats_sorted":["cs.LG","cs.NI","cs.SY","math.PR"],"title_canon_sha256":"24f6199c68029bfcc4275ea0dcea356cbed4f7a4dee6cb60d790b8b341c30e21","abstract_canon_sha256":"9d898173976ce5d5f0497a76949556ecb78008833e935648d54f10d14e23da7e"},"schema_version":"1.0"},"canonical_sha256":"cc7cb877db7555c1a170ec34733934b0fd5a5d0aaae0fe06cc6cf4bbef48ab5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:47.067378Z","signature_b64":"su6X1IvRg6djNhlISz+Z4pNcHjDxh+gd1yE9pH788lDx30J7iR6/jTpbEh2hRQ/PkZ1C+gQDEgILWBn7S9uUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc7cb877db7555c1a170ec34733934b0fd5a5d0aaae0fe06cc6cf4bbef48ab5c","last_reissued_at":"2026-05-18T04:05:47.066929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:47.066929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1533","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-05-18T04:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PL6lI7k3yizoQLG99su/GtLxNaYCXLKKLGRJwaUiXdjUUOw7m0hoLkk49HcVNp24H2Kdz/3xyUf1NRFNlnIIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:39:35.486874Z"},"content_sha256":"5a6674ee204dce94be6ff937e838dba48d5e1950984a71107e599a5efe2f1ef8","schema_version":"1.0","event_id":"sha256:5a6674ee204dce94be6ff937e838dba48d5e1950984a71107e599a5efe2f1ef8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZR6LQ563OVK4DILQ5Q2HGOJUWD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Non-Bayesian Restless Multi-Armed Bandit: A Case of Near-Logarithmic Strict Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NI","cs.SY","math.PR"],"primary_cat":"math.OC","authors_text":"Bhaskar Krishnamachari, Qing Zhao, Wenhan Dai, Yi Gai","submitted_at":"2011-09-07T18:33:59Z","abstract_excerpt":"In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are $N$ arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A player seeks to activate $K \\geq 1$ arms at each time in order to maximize the expected total reward obtained over multiple plays. RMAB is a challenging problem that is known to be PSPACE-hard in general. We consider in this work the even harder non-Bayesian RMAB, in which the parameters of the Markov chain are assumed to be unknown \\emph{a priori}. We develop an original approach to this problem that is applicable when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1533","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":""},"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-18T04:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsBI0cAPoXyD+VAsXGayocS/nlC0rXxZ9wtFIJJ68p+htMGbQ02S6RYh2HZSfaXL+aaXdMQnJFXjxpuC7htzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:39:35.487439Z"},"content_sha256":"fd6089a92ba9b049b96a55fc924d959bbca4c76df4caa571dd21b531934091fb","schema_version":"1.0","event_id":"sha256:fd6089a92ba9b049b96a55fc924d959bbca4c76df4caa571dd21b531934091fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZR6LQ563OVK4DILQ5Q2HGOJUWD/bundle.json","state_url":"https://pith.science/pith/ZR6LQ563OVK4DILQ5Q2HGOJUWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZR6LQ563OVK4DILQ5Q2HGOJUWD/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-07T02:39:35Z","links":{"resolver":"https://pith.science/pith/ZR6LQ563OVK4DILQ5Q2HGOJUWD","bundle":"https://pith.science/pith/ZR6LQ563OVK4DILQ5Q2HGOJUWD/bundle.json","state":"https://pith.science/pith/ZR6LQ563OVK4DILQ5Q2HGOJUWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZR6LQ563OVK4DILQ5Q2HGOJUWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZR6LQ563OVK4DILQ5Q2HGOJUWD","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":"9d898173976ce5d5f0497a76949556ecb78008833e935648d54f10d14e23da7e","cross_cats_sorted":["cs.LG","cs.NI","cs.SY","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-07T18:33:59Z","title_canon_sha256":"24f6199c68029bfcc4275ea0dcea356cbed4f7a4dee6cb60d790b8b341c30e21"},"schema_version":"1.0","source":{"id":"1109.1533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1533","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1533v1","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1533","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZR6LQ563OVK4","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZR6LQ563OVK4DILQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZR6LQ563","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:fd6089a92ba9b049b96a55fc924d959bbca4c76df4caa571dd21b531934091fb","target":"graph","created_at":"2026-05-18T04:05:47Z","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":"In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are $N$ arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A player seeks to activate $K \\geq 1$ arms at each time in order to maximize the expected total reward obtained over multiple plays. RMAB is a challenging problem that is known to be PSPACE-hard in general. We consider in this work the even harder non-Bayesian RMAB, in which the parameters of the Markov chain are assumed to be unknown \\emph{a priori}. We develop an original approach to this problem that is applicable when","authors_text":"Bhaskar Krishnamachari, Qing Zhao, Wenhan Dai, Yi Gai","cross_cats":["cs.LG","cs.NI","cs.SY","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-07T18:33:59Z","title":"The Non-Bayesian Restless Multi-Armed Bandit: A Case of Near-Logarithmic Strict Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1533","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:5a6674ee204dce94be6ff937e838dba48d5e1950984a71107e599a5efe2f1ef8","target":"record","created_at":"2026-05-18T04:05:47Z","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":"9d898173976ce5d5f0497a76949556ecb78008833e935648d54f10d14e23da7e","cross_cats_sorted":["cs.LG","cs.NI","cs.SY","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-07T18:33:59Z","title_canon_sha256":"24f6199c68029bfcc4275ea0dcea356cbed4f7a4dee6cb60d790b8b341c30e21"},"schema_version":"1.0","source":{"id":"1109.1533","kind":"arxiv","version":1}},"canonical_sha256":"cc7cb877db7555c1a170ec34733934b0fd5a5d0aaae0fe06cc6cf4bbef48ab5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc7cb877db7555c1a170ec34733934b0fd5a5d0aaae0fe06cc6cf4bbef48ab5c","first_computed_at":"2026-05-18T04:05:47.066929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:47.066929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"su6X1IvRg6djNhlISz+Z4pNcHjDxh+gd1yE9pH788lDx30J7iR6/jTpbEh2hRQ/PkZ1C+gQDEgILWBn7S9uUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:47.067378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a6674ee204dce94be6ff937e838dba48d5e1950984a71107e599a5efe2f1ef8","sha256:fd6089a92ba9b049b96a55fc924d959bbca4c76df4caa571dd21b531934091fb"],"state_sha256":"6869714318d2d3172f394c592b8e43d6b6e09be59ec28da57ee24f6df96b48cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2vbNyhoExJpWWnw1AFj099R9HCCbIhsBTTCU407c5aCv6a7qT0eZ+Rp9I1tn5XqTxfVqWttD73VQNZUwrWQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:39:35.490247Z","bundle_sha256":"375d98500e73556b4dd75e254d9a00e2f37a6695742ba495488d852539eef6f1"}}