{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y57HPO6JFP422ATAYHEN3L6PLF","short_pith_number":"pith:Y57HPO6J","canonical_record":{"source":{"id":"1707.00205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-01T21:08:25Z","cross_cats_sorted":[],"title_canon_sha256":"eb785ce44f1d5597b9485ee83123a8249622adc4621e3478c899b7b704627b9c","abstract_canon_sha256":"9bff172a3dbe6a0037b416dd1267fb630819ab6e53612c86740e038066ba0f49"},"schema_version":"1.0"},"canonical_sha256":"c77e77bbc92bf9ad0260c1c8ddafcf59416c999760e5b6253a0ab99dd99ffaba","source":{"kind":"arxiv","id":"1707.00205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00205","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00205v1","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00205","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"Y57HPO6JFP42","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y57HPO6JFP422ATA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y57HPO6J","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y57HPO6JFP422ATAYHEN3L6PLF","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-01T21:08:25Z","cross_cats_sorted":[],"title_canon_sha256":"eb785ce44f1d5597b9485ee83123a8249622adc4621e3478c899b7b704627b9c","abstract_canon_sha256":"9bff172a3dbe6a0037b416dd1267fb630819ab6e53612c86740e038066ba0f49"},"schema_version":"1.0"},"canonical_sha256":"c77e77bbc92bf9ad0260c1c8ddafcf59416c999760e5b6253a0ab99dd99ffaba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:04.148728Z","signature_b64":"WCzp7sZqehlHAnzI67IcUJsZTaRaRhBbtp4a8NbfD6tC5rc9TaOQigtznKWFQejTtJfvN5nDSv6ZiDokbO2dDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c77e77bbc92bf9ad0260c1c8ddafcf59416c999760e5b6253a0ab99dd99ffaba","last_reissued_at":"2026-05-18T00:41:04.148018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:04.148018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00205","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-18T00:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fa+Mq5tTdzUpiCbyinMyszB2jGxxI1ZLVY5U6hZ3kA3a2oWNoQyDbUw9stLDeZ0WTLwe8mlLHUZoNqLG0Xo0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:22:50.418578Z"},"content_sha256":"d5df83f9ec6a3c1fb2385ccaf659ac8ec3efa7c0f09ab463b535f679943b815b","schema_version":"1.0","event_id":"sha256:d5df83f9ec6a3c1fb2385ccaf659ac8ec3efa7c0f09ab463b535f679943b815b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y57HPO6JFP422ATAYHEN3L6PLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Asymptotically Optimal Index Policy for Finite-Horizon Restless Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Peter Frazier, Weici Hu","submitted_at":"2017-07-01T21:08:25Z","abstract_excerpt":"We consider restless multi-armed bandit (RMAB) with a finite horizon and multiple pulls per period. Leveraging the Lagrangian relaxation, we approximate the problem with a collection of single arm problems. We then propose an index-based policy that uses optimal solutions of the single arm problems to index individual arms, and offer a proof that it is asymptotically optimal as the number of arms tends to infinity. We also use simulation to show that this index-based policy performs better than the state-of-art heuristics in various problem settings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00205","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-18T00:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBwR1ilR8aaiW27VolAHv9CRt7FrvIyLkSLu0KQmYJOQb6a2hj15wnoiHrltd9Vt3flgxH2MnkfE/siClWKdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:22:50.419248Z"},"content_sha256":"f568dc989e8857ae1bd68c6f99d8e20782025f7481a6dcbdf74af95f1cb64316","schema_version":"1.0","event_id":"sha256:f568dc989e8857ae1bd68c6f99d8e20782025f7481a6dcbdf74af95f1cb64316"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/bundle.json","state_url":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y57HPO6JFP422ATAYHEN3L6PLF/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-05-25T19:22:50Z","links":{"resolver":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF","bundle":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/bundle.json","state":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y57HPO6JFP422ATAYHEN3L6PLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y57HPO6JFP422ATAYHEN3L6PLF","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":"9bff172a3dbe6a0037b416dd1267fb630819ab6e53612c86740e038066ba0f49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-01T21:08:25Z","title_canon_sha256":"eb785ce44f1d5597b9485ee83123a8249622adc4621e3478c899b7b704627b9c"},"schema_version":"1.0","source":{"id":"1707.00205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00205","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00205v1","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00205","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"Y57HPO6JFP42","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y57HPO6JFP422ATA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y57HPO6J","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:f568dc989e8857ae1bd68c6f99d8e20782025f7481a6dcbdf74af95f1cb64316","target":"graph","created_at":"2026-05-18T00:41: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":"We consider restless multi-armed bandit (RMAB) with a finite horizon and multiple pulls per period. Leveraging the Lagrangian relaxation, we approximate the problem with a collection of single arm problems. We then propose an index-based policy that uses optimal solutions of the single arm problems to index individual arms, and offer a proof that it is asymptotically optimal as the number of arms tends to infinity. We also use simulation to show that this index-based policy performs better than the state-of-art heuristics in various problem settings.","authors_text":"Peter Frazier, Weici Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-01T21:08:25Z","title":"An Asymptotically Optimal Index Policy for Finite-Horizon Restless Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00205","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:d5df83f9ec6a3c1fb2385ccaf659ac8ec3efa7c0f09ab463b535f679943b815b","target":"record","created_at":"2026-05-18T00:41: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":"9bff172a3dbe6a0037b416dd1267fb630819ab6e53612c86740e038066ba0f49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-01T21:08:25Z","title_canon_sha256":"eb785ce44f1d5597b9485ee83123a8249622adc4621e3478c899b7b704627b9c"},"schema_version":"1.0","source":{"id":"1707.00205","kind":"arxiv","version":1}},"canonical_sha256":"c77e77bbc92bf9ad0260c1c8ddafcf59416c999760e5b6253a0ab99dd99ffaba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c77e77bbc92bf9ad0260c1c8ddafcf59416c999760e5b6253a0ab99dd99ffaba","first_computed_at":"2026-05-18T00:41:04.148018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:04.148018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WCzp7sZqehlHAnzI67IcUJsZTaRaRhBbtp4a8NbfD6tC5rc9TaOQigtznKWFQejTtJfvN5nDSv6ZiDokbO2dDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:04.148728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5df83f9ec6a3c1fb2385ccaf659ac8ec3efa7c0f09ab463b535f679943b815b","sha256:f568dc989e8857ae1bd68c6f99d8e20782025f7481a6dcbdf74af95f1cb64316"],"state_sha256":"2e07f6f50749668a5c0660bbd0ba248fd267d84f1b2ce71bfe5be74991341359"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxnEuAEs98RQAXN4GkDMgwN9/6vguZxzDh06bjIlUWD6QWqcYd+tKyEkUyrEW/xkjxMEtdOIxYqhOu/FiD+uBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:22:50.422376Z","bundle_sha256":"4c5f1fa230221bcb6982ec5e9d971a680fd2209942f239b4339fb8a3ce014acc"}}