{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:USLGY6PSEORSBE7C66LR5JCLIN","short_pith_number":"pith:USLGY6PS","canonical_record":{"source":{"id":"1011.4752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-22T09:07:55Z","cross_cats_sorted":["cs.LG","cs.NI","math.PR"],"title_canon_sha256":"05c460213fbccf99877ac760195edbc44a4297ee59fab9b571f6c8471b7ec3ac","abstract_canon_sha256":"f7ec40f254e307ac29616369a2f940f79478d9cd6669e3f2bf73e43efedd8bd8"},"schema_version":"1.0"},"canonical_sha256":"a4966c79f223a32093e2f7971ea44b434e432f30cac2413a759ca1f5bfabae60","source":{"kind":"arxiv","id":"1011.4752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4752","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4752v1","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4752","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"USLGY6PSEORS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"USLGY6PSEORSBE7C","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"USLGY6PS","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:USLGY6PSEORSBE7C66LR5JCLIN","target":"record","payload":{"canonical_record":{"source":{"id":"1011.4752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-22T09:07:55Z","cross_cats_sorted":["cs.LG","cs.NI","math.PR"],"title_canon_sha256":"05c460213fbccf99877ac760195edbc44a4297ee59fab9b571f6c8471b7ec3ac","abstract_canon_sha256":"f7ec40f254e307ac29616369a2f940f79478d9cd6669e3f2bf73e43efedd8bd8"},"schema_version":"1.0"},"canonical_sha256":"a4966c79f223a32093e2f7971ea44b434e432f30cac2413a759ca1f5bfabae60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:04.026998Z","signature_b64":"OeTYzE6rHu7lpO/KBhYY56it0SlrdTTjPr4Vq2zv9vo2o0vZDsGRVqpiyYzpd6gawHWVl1u+smaRoj76aM8PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4966c79f223a32093e2f7971ea44b434e432f30cac2413a759ca1f5bfabae60","last_reissued_at":"2026-05-18T04:35:04.026581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:04.026581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.4752","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:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F92T1pUVA2DOudukWhwS8fLcb7fzca3rwv3u4JhDLhxf+B3+uk+AsGrbbE/uON04Y2UiYXBK7G/Ca3ogO//nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:35:10.051106Z"},"content_sha256":"b820385c677f9420d2ae22e155b3c348f94257346aff2ab42ba020a2e8a9359f","schema_version":"1.0","event_id":"sha256:b820385c677f9420d2ae22e155b3c348f94257346aff2ab42ba020a2e8a9359f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:USLGY6PSEORSBE7C66LR5JCLIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NI","math.PR"],"primary_cat":"math.OC","authors_text":"Bhaskar Krishnamachari, Qing Zhao, Wenhan Dai, Yi Gai","submitted_at":"2010-11-22T09:07:55Z","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":"1011.4752","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:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N9FhZA5GL7XAJrGiM+TCYznubvIZemWckUA+hGTFprTafbxWbY5b/QsR4LKgpWoXwCmRLskyIwMx5ljxo89VBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:35:10.051740Z"},"content_sha256":"a2e23edda72be6605bfeb6bf749e21827f6c055d475c1245926b4f6d1f38c5fc","schema_version":"1.0","event_id":"sha256:a2e23edda72be6605bfeb6bf749e21827f6c055d475c1245926b4f6d1f38c5fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USLGY6PSEORSBE7C66LR5JCLIN/bundle.json","state_url":"https://pith.science/pith/USLGY6PSEORSBE7C66LR5JCLIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USLGY6PSEORSBE7C66LR5JCLIN/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-06T16:35:10Z","links":{"resolver":"https://pith.science/pith/USLGY6PSEORSBE7C66LR5JCLIN","bundle":"https://pith.science/pith/USLGY6PSEORSBE7C66LR5JCLIN/bundle.json","state":"https://pith.science/pith/USLGY6PSEORSBE7C66LR5JCLIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USLGY6PSEORSBE7C66LR5JCLIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:USLGY6PSEORSBE7C66LR5JCLIN","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":"f7ec40f254e307ac29616369a2f940f79478d9cd6669e3f2bf73e43efedd8bd8","cross_cats_sorted":["cs.LG","cs.NI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-22T09:07:55Z","title_canon_sha256":"05c460213fbccf99877ac760195edbc44a4297ee59fab9b571f6c8471b7ec3ac"},"schema_version":"1.0","source":{"id":"1011.4752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4752","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4752v1","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4752","created_at":"2026-05-18T04:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"USLGY6PSEORS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"USLGY6PSEORSBE7C","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"USLGY6PS","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:a2e23edda72be6605bfeb6bf749e21827f6c055d475c1245926b4f6d1f38c5fc","target":"graph","created_at":"2026-05-18T04:35:04Z","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","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-22T09:07:55Z","title":"The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4752","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:b820385c677f9420d2ae22e155b3c348f94257346aff2ab42ba020a2e8a9359f","target":"record","created_at":"2026-05-18T04:35:04Z","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":"f7ec40f254e307ac29616369a2f940f79478d9cd6669e3f2bf73e43efedd8bd8","cross_cats_sorted":["cs.LG","cs.NI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-22T09:07:55Z","title_canon_sha256":"05c460213fbccf99877ac760195edbc44a4297ee59fab9b571f6c8471b7ec3ac"},"schema_version":"1.0","source":{"id":"1011.4752","kind":"arxiv","version":1}},"canonical_sha256":"a4966c79f223a32093e2f7971ea44b434e432f30cac2413a759ca1f5bfabae60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4966c79f223a32093e2f7971ea44b434e432f30cac2413a759ca1f5bfabae60","first_computed_at":"2026-05-18T04:35:04.026581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:04.026581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OeTYzE6rHu7lpO/KBhYY56it0SlrdTTjPr4Vq2zv9vo2o0vZDsGRVqpiyYzpd6gawHWVl1u+smaRoj76aM8PCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:04.026998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b820385c677f9420d2ae22e155b3c348f94257346aff2ab42ba020a2e8a9359f","sha256:a2e23edda72be6605bfeb6bf749e21827f6c055d475c1245926b4f6d1f38c5fc"],"state_sha256":"7196afe987051da0cbf3507b2560637c2988143834095e44fa597979c487603c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2begNNlKOfI2gTsvnMdPwsnu7JdHEURSzL0ntBZ81Fyv+HOYVDVQ73J07C5dwUDdvw7Vk2IaNU6SaPCEg8RyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:35:10.054842Z","bundle_sha256":"5d05be79d7800b4b5e015f5a36aa4157b8024f9109c4042cc83bae6260b7abb1"}}