{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ZR2VFB4KGBPY6WNZGFERBQPX2Q","short_pith_number":"pith:ZR2VFB4K","canonical_record":{"source":{"id":"2107.11911","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-07-25T23:27:12Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"3e56e06274f9510e19a38d4890d3f06fe5965ac233f83eeb5cae35c51d4ab9f2","abstract_canon_sha256":"7a85534d63ae364b6350183331cfbab762ae9f6260e182bbd23a5f3a463e8d31"},"schema_version":"1.0"},"canonical_sha256":"cc7552878a305f8f59b9314910c1f7d4138e569d9bc97975d2bb4686b50cfb37","source":{"kind":"arxiv","id":"2107.11911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.11911","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"2107.11911v1","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11911","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZR2VFB4KGBPY","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"pith_short_16","alias_value":"ZR2VFB4KGBPY6WNZ","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"pith_short_8","alias_value":"ZR2VFB4K","created_at":"2026-07-05T03:00:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ZR2VFB4KGBPY6WNZGFERBQPX2Q","target":"record","payload":{"canonical_record":{"source":{"id":"2107.11911","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-07-25T23:27:12Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"3e56e06274f9510e19a38d4890d3f06fe5965ac233f83eeb5cae35c51d4ab9f2","abstract_canon_sha256":"7a85534d63ae364b6350183331cfbab762ae9f6260e182bbd23a5f3a463e8d31"},"schema_version":"1.0"},"canonical_sha256":"cc7552878a305f8f59b9314910c1f7d4138e569d9bc97975d2bb4686b50cfb37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:38.580428Z","signature_b64":"4GQDu/4L8H9KJ/VnMiJvflqEwzw3ZPLDZeztbjBaYEyHb2VOrWnVHKYFe4oa/DbqUFR58D4V2iCCPwZfp20YDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc7552878a305f8f59b9314910c1f7d4138e569d9bc97975d2bb4686b50cfb37","last_reissued_at":"2026-07-05T03:00:38.579930Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:38.579930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.11911","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-07-05T03:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnAkQhHHAQeu97F9fC7Zb6VT1NTnveTm7ISVg6omBu7YC/HJOZL5MO0p/T3xfEBsSZkqt/Dci9+vOug9PYN/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T09:29:32.179909Z"},"content_sha256":"c5aeb572ba02e2f78d1a55f781fd4593755f5f58e25d1ab554310eda6f7aabad","schema_version":"1.0","event_id":"sha256:c5aeb572ba02e2f78d1a55f781fd4593755f5f58e25d1ab554310eda6f7aabad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ZR2VFB4KGBPY6WNZGFERBQPX2Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Restless Bandits with Many Arms: Beating the Central Limit Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.PR"],"primary_cat":"math.OC","authors_text":"Peter I. Frazier, Xiangyu Zhang","submitted_at":"2021-07-25T23:27:12Z","abstract_excerpt":"We consider finite-horizon restless bandits with multiple pulls per period, which play an important role in recommender systems, active learning, revenue management, and many other areas. While an optimal policy can be computed, in principle, using dynamic programming, the computation required scales exponentially in the number of arms $N$. Thus, there is substantial value in understanding the performance of index policies and other policies that can be computed efficiently for large $N$. We study the growth of the optimality gap, i.e., the loss in expected performance compared to an optimal p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11911","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.11911/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-05T03:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNNlBtp+SB31Hqj7RleUt1U3+QJDLU2UROgFrOyv4xjdpF723OQwojETNQ3oyb1VUahOo9lgTb3GtSqk5jqMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T09:29:32.180404Z"},"content_sha256":"6740027788ac8ff5908381654ba40e8b97b99c3cf8f9c86831d3a853a2663da8","schema_version":"1.0","event_id":"sha256:6740027788ac8ff5908381654ba40e8b97b99c3cf8f9c86831d3a853a2663da8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZR2VFB4KGBPY6WNZGFERBQPX2Q/bundle.json","state_url":"https://pith.science/pith/ZR2VFB4KGBPY6WNZGFERBQPX2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZR2VFB4KGBPY6WNZGFERBQPX2Q/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-13T09:29:32Z","links":{"resolver":"https://pith.science/pith/ZR2VFB4KGBPY6WNZGFERBQPX2Q","bundle":"https://pith.science/pith/ZR2VFB4KGBPY6WNZGFERBQPX2Q/bundle.json","state":"https://pith.science/pith/ZR2VFB4KGBPY6WNZGFERBQPX2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZR2VFB4KGBPY6WNZGFERBQPX2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ZR2VFB4KGBPY6WNZGFERBQPX2Q","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":"7a85534d63ae364b6350183331cfbab762ae9f6260e182bbd23a5f3a463e8d31","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-07-25T23:27:12Z","title_canon_sha256":"3e56e06274f9510e19a38d4890d3f06fe5965ac233f83eeb5cae35c51d4ab9f2"},"schema_version":"1.0","source":{"id":"2107.11911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.11911","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"2107.11911v1","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11911","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZR2VFB4KGBPY","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"pith_short_16","alias_value":"ZR2VFB4KGBPY6WNZ","created_at":"2026-07-05T03:00:38Z"},{"alias_kind":"pith_short_8","alias_value":"ZR2VFB4K","created_at":"2026-07-05T03:00:38Z"}],"graph_snapshots":[{"event_id":"sha256:6740027788ac8ff5908381654ba40e8b97b99c3cf8f9c86831d3a853a2663da8","target":"graph","created_at":"2026-07-05T03:00:38Z","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/2107.11911/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider finite-horizon restless bandits with multiple pulls per period, which play an important role in recommender systems, active learning, revenue management, and many other areas. While an optimal policy can be computed, in principle, using dynamic programming, the computation required scales exponentially in the number of arms $N$. Thus, there is substantial value in understanding the performance of index policies and other policies that can be computed efficiently for large $N$. We study the growth of the optimality gap, i.e., the loss in expected performance compared to an optimal p","authors_text":"Peter I. Frazier, Xiangyu Zhang","cross_cats":["cs.LG","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-07-25T23:27:12Z","title":"Restless Bandits with Many Arms: Beating the Central Limit Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11911","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:c5aeb572ba02e2f78d1a55f781fd4593755f5f58e25d1ab554310eda6f7aabad","target":"record","created_at":"2026-07-05T03:00:38Z","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":"7a85534d63ae364b6350183331cfbab762ae9f6260e182bbd23a5f3a463e8d31","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-07-25T23:27:12Z","title_canon_sha256":"3e56e06274f9510e19a38d4890d3f06fe5965ac233f83eeb5cae35c51d4ab9f2"},"schema_version":"1.0","source":{"id":"2107.11911","kind":"arxiv","version":1}},"canonical_sha256":"cc7552878a305f8f59b9314910c1f7d4138e569d9bc97975d2bb4686b50cfb37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc7552878a305f8f59b9314910c1f7d4138e569d9bc97975d2bb4686b50cfb37","first_computed_at":"2026-07-05T03:00:38.579930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:00:38.579930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4GQDu/4L8H9KJ/VnMiJvflqEwzw3ZPLDZeztbjBaYEyHb2VOrWnVHKYFe4oa/DbqUFR58D4V2iCCPwZfp20YDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:00:38.580428Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.11911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5aeb572ba02e2f78d1a55f781fd4593755f5f58e25d1ab554310eda6f7aabad","sha256:6740027788ac8ff5908381654ba40e8b97b99c3cf8f9c86831d3a853a2663da8"],"state_sha256":"f3401c07a95e6c114252d50b8052303a3e46d914358b5944028f79d0cc652eeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0EaeCpj5hNfhWSP8Kl02q4zWGyiXojXOOGdY/HbXVjHO7gZiiHVlfD6pXV+jhkhzauc5QUaPCv8dx/ohBVhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T09:29:32.185541Z","bundle_sha256":"d220f378b024ec19ffbbc09ea7eb621ef1743f224e107052788bdb4df9e8370d"}}