{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NS6TS4K6HW2J64EEYTYZNC2OUY","short_pith_number":"pith:NS6TS4K6","canonical_record":{"source":{"id":"2410.06307","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T19:34:23Z","cross_cats_sorted":["cs.LG","math.PR","stat.ML"],"title_canon_sha256":"d2f9861927a1671e0dea5db740f7a59613e2932d789d7ecd6d2e230bd5138e1a","abstract_canon_sha256":"3111d39e194ae2438f8994ae8f111b9ab882ed122c7ab415281b8958b63002d0"},"schema_version":"1.0"},"canonical_sha256":"6cbd39715e3db49f7084c4f1968b4ea615a5a27aeea93ca4bd550e907280de4d","source":{"kind":"arxiv","id":"2410.06307","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06307","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06307v2","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06307","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"NS6TS4K6HW2J","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"NS6TS4K6HW2J64EE","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"NS6TS4K6","created_at":"2026-07-05T11:16:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NS6TS4K6HW2J64EEYTYZNC2OUY","target":"record","payload":{"canonical_record":{"source":{"id":"2410.06307","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T19:34:23Z","cross_cats_sorted":["cs.LG","math.PR","stat.ML"],"title_canon_sha256":"d2f9861927a1671e0dea5db740f7a59613e2932d789d7ecd6d2e230bd5138e1a","abstract_canon_sha256":"3111d39e194ae2438f8994ae8f111b9ab882ed122c7ab415281b8958b63002d0"},"schema_version":"1.0"},"canonical_sha256":"6cbd39715e3db49f7084c4f1968b4ea615a5a27aeea93ca4bd550e907280de4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:03.858245Z","signature_b64":"3B1rS9taGfUwvAsmtX3R8w7dvzTarPaG2jyV3cisBqVQa5PA6Ik0UobSn4Uh2GOO9DXlbf8GpkkkEGfvSlRFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cbd39715e3db49f7084c4f1968b4ea615a5a27aeea93ca4bd550e907280de4d","last_reissued_at":"2026-07-05T11:16:03.857742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:03.857742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.06307","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-07-05T11:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3Dl67w0u9BCtbEBfMXPTJ+22LOV7p74RcRZ5rMUMEh1w/6b/sN6WhTEMp8WQfZW6nTCT+bzVieCj8v48i3QDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:07:29.440649Z"},"content_sha256":"410b6c7b3b1fbc2b3101e476237dd462de4fb0c7077a0e86e2f00a956e9b2421","schema_version":"1.0","event_id":"sha256:410b6c7b3b1fbc2b3101e476237dd462de4fb0c7077a0e86e2f00a956e9b2421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NS6TS4K6HW2J64EEYTYZNC2OUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Predictive Control is Almost Optimal for Restless Bandit","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","math.PR","stat.ML"],"primary_cat":"math.OC","authors_text":"Dheeraj Narasimha, Nicolas Gast","submitted_at":"2024-10-08T19:34:23Z","abstract_excerpt":"We consider the discrete time infinite horizon average reward restless markovian bandit (RMAB) problem. We propose a \\emph{model predictive control} based non-stationary policy with a rolling computational horizon $\\tau$. At each time-slot, this policy solves a $\\tau$ horizon linear program whose first control value is kept as a control for the RMAB. Our solution requires minimal assumptions and quantifies the loss in optimality in terms of $\\tau$ and the number of arms, $N$. We show that its sub-optimality gap is $O(1/\\sqrt{N})$ in general, and $\\exp(-\\Omega(N))$ under a local-stability condi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06307","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.06307/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-05T11:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eu7fK9C4nCx8sOj9WLBXJvh9vqYwEhTo4/9BN2/ucPidwAW4A7Ns144A8CaA/frUX60al1Pp+zPX3Mr5Y3JsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:07:29.441165Z"},"content_sha256":"f5a896d24e5765817fffd7ee643d9e2b73560d12729768677bce95efe675c20d","schema_version":"1.0","event_id":"sha256:f5a896d24e5765817fffd7ee643d9e2b73560d12729768677bce95efe675c20d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NS6TS4K6HW2J64EEYTYZNC2OUY/bundle.json","state_url":"https://pith.science/pith/NS6TS4K6HW2J64EEYTYZNC2OUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NS6TS4K6HW2J64EEYTYZNC2OUY/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-08T04:07:29Z","links":{"resolver":"https://pith.science/pith/NS6TS4K6HW2J64EEYTYZNC2OUY","bundle":"https://pith.science/pith/NS6TS4K6HW2J64EEYTYZNC2OUY/bundle.json","state":"https://pith.science/pith/NS6TS4K6HW2J64EEYTYZNC2OUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NS6TS4K6HW2J64EEYTYZNC2OUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NS6TS4K6HW2J64EEYTYZNC2OUY","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":"3111d39e194ae2438f8994ae8f111b9ab882ed122c7ab415281b8958b63002d0","cross_cats_sorted":["cs.LG","math.PR","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T19:34:23Z","title_canon_sha256":"d2f9861927a1671e0dea5db740f7a59613e2932d789d7ecd6d2e230bd5138e1a"},"schema_version":"1.0","source":{"id":"2410.06307","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06307","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06307v2","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06307","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"NS6TS4K6HW2J","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"NS6TS4K6HW2J64EE","created_at":"2026-07-05T11:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"NS6TS4K6","created_at":"2026-07-05T11:16:03Z"}],"graph_snapshots":[{"event_id":"sha256:f5a896d24e5765817fffd7ee643d9e2b73560d12729768677bce95efe675c20d","target":"graph","created_at":"2026-07-05T11:16:03Z","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/2410.06307/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the discrete time infinite horizon average reward restless markovian bandit (RMAB) problem. We propose a \\emph{model predictive control} based non-stationary policy with a rolling computational horizon $\\tau$. At each time-slot, this policy solves a $\\tau$ horizon linear program whose first control value is kept as a control for the RMAB. Our solution requires minimal assumptions and quantifies the loss in optimality in terms of $\\tau$ and the number of arms, $N$. We show that its sub-optimality gap is $O(1/\\sqrt{N})$ in general, and $\\exp(-\\Omega(N))$ under a local-stability condi","authors_text":"Dheeraj Narasimha, Nicolas Gast","cross_cats":["cs.LG","math.PR","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T19:34:23Z","title":"Model Predictive Control is Almost Optimal for Restless Bandit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06307","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:410b6c7b3b1fbc2b3101e476237dd462de4fb0c7077a0e86e2f00a956e9b2421","target":"record","created_at":"2026-07-05T11:16:03Z","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":"3111d39e194ae2438f8994ae8f111b9ab882ed122c7ab415281b8958b63002d0","cross_cats_sorted":["cs.LG","math.PR","stat.ML"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-08T19:34:23Z","title_canon_sha256":"d2f9861927a1671e0dea5db740f7a59613e2932d789d7ecd6d2e230bd5138e1a"},"schema_version":"1.0","source":{"id":"2410.06307","kind":"arxiv","version":2}},"canonical_sha256":"6cbd39715e3db49f7084c4f1968b4ea615a5a27aeea93ca4bd550e907280de4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cbd39715e3db49f7084c4f1968b4ea615a5a27aeea93ca4bd550e907280de4d","first_computed_at":"2026-07-05T11:16:03.857742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:03.857742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3B1rS9taGfUwvAsmtX3R8w7dvzTarPaG2jyV3cisBqVQa5PA6Ik0UobSn4Uh2GOO9DXlbf8GpkkkEGfvSlRFCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:03.858245Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.06307","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:410b6c7b3b1fbc2b3101e476237dd462de4fb0c7077a0e86e2f00a956e9b2421","sha256:f5a896d24e5765817fffd7ee643d9e2b73560d12729768677bce95efe675c20d"],"state_sha256":"eddb869bae1ecfcaad9de2b3bd63f308e215117d1f27704c74e6fbb39caf55f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSPb51SvjmueVcg6cuIA7LNkKsXx0xaiIzALek+GUcO3kqmWyaEMNlPeRNmVa0R/mXAb3Ye+Yox6ydnMSjb4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:07:29.445114Z","bundle_sha256":"d974b6915d731f0c468513840f8be75806940443f3b9a8af894e2e241ffd2000"}}