{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y57HPO6JFP422ATAYHEN3L6PLF","short_pith_number":"pith:Y57HPO6J","schema_version":"1.0","canonical_sha256":"c77e77bbc92bf9ad0260c1c8ddafcf59416c999760e5b6253a0ab99dd99ffaba","source":{"kind":"arxiv","id":"1707.00205","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.00205","created_at":"2026-05-18T00:41:04.148138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00205v1","created_at":"2026-05-18T00:41:04.148138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00205","created_at":"2026-05-18T00:41:04.148138+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y57HPO6JFP42","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y57HPO6JFP422ATA","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y57HPO6J","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF","json":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF.json","graph_json":"https://pith.science/api/pith-number/Y57HPO6JFP422ATAYHEN3L6PLF/graph.json","events_json":"https://pith.science/api/pith-number/Y57HPO6JFP422ATAYHEN3L6PLF/events.json","paper":"https://pith.science/paper/Y57HPO6J"},"agent_actions":{"view_html":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF","download_json":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF.json","view_paper":"https://pith.science/paper/Y57HPO6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00205&json=true","fetch_graph":"https://pith.science/api/pith-number/Y57HPO6JFP422ATAYHEN3L6PLF/graph.json","fetch_events":"https://pith.science/api/pith-number/Y57HPO6JFP422ATAYHEN3L6PLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/action/storage_attestation","attest_author":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/action/author_attestation","sign_citation":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/action/citation_signature","submit_replication":"https://pith.science/pith/Y57HPO6JFP422ATAYHEN3L6PLF/action/replication_record"}},"created_at":"2026-05-18T00:41:04.148138+00:00","updated_at":"2026-05-18T00:41:04.148138+00:00"}