{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NCQOIIFVDGLJKCR4CGKA6O5WLV","short_pith_number":"pith:NCQOIIFV","schema_version":"1.0","canonical_sha256":"68a0e420b51996950a3c11940f3bb65d5057600d0f39d776ec37d01879e188f1","source":{"kind":"arxiv","id":"1606.04624","version":1},"attestation_state":"computed","paper":{"title":"Finite-time Analysis for the Knowledge-Gradient Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Warren Powell, Yingfei Wang","submitted_at":"2016-06-15T02:44:02Z","abstract_excerpt":"We consider sequential decision problems in which we adaptively choose one of finitely many alternatives and observe a stochastic reward. We offer a new perspective of interpreting Bayesian ranking and selection problems as adaptive stochastic multi-set maximization problems and derive the first finite-time bound of the knowledge-gradient policy for adaptive submodular objective functions. In addition, we introduce the concept of prior-optimality and provide another insight into the performance of the knowledge gradient policy based on the submodular assumption on the value of information. We "},"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":"1606.04624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-15T02:44:02Z","cross_cats_sorted":[],"title_canon_sha256":"b32a22e348cb8bc0c4bedc263ef1107508ba5b0aebdfb5919e82e6e0da2d3653","abstract_canon_sha256":"74d0086c55fcd305a1b82eaf3082a129cd9e26e16d4af7fc36f30504d6cbfec5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:24.676243Z","signature_b64":"9P5BxJCMjKkGiBmuqwUc+T51FsCpVPEs8rexeEHaFUHHjqTz5VJdks87nwaflPabJJ1BNsVi0mEv8ohZ09QBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68a0e420b51996950a3c11940f3bb65d5057600d0f39d776ec37d01879e188f1","last_reissued_at":"2026-05-18T01:12:24.675915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:24.675915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-time Analysis for the Knowledge-Gradient Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Warren Powell, Yingfei Wang","submitted_at":"2016-06-15T02:44:02Z","abstract_excerpt":"We consider sequential decision problems in which we adaptively choose one of finitely many alternatives and observe a stochastic reward. We offer a new perspective of interpreting Bayesian ranking and selection problems as adaptive stochastic multi-set maximization problems and derive the first finite-time bound of the knowledge-gradient policy for adaptive submodular objective functions. In addition, we introduce the concept of prior-optimality and provide another insight into the performance of the knowledge gradient policy based on the submodular assumption on the value of information. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04624","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":"1606.04624","created_at":"2026-05-18T01:12:24.675966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04624v1","created_at":"2026-05-18T01:12:24.675966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04624","created_at":"2026-05-18T01:12:24.675966+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCQOIIFVDGLJ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCQOIIFVDGLJKCR4","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCQOIIFV","created_at":"2026-05-18T12:30:32.724797+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/NCQOIIFVDGLJKCR4CGKA6O5WLV","json":"https://pith.science/pith/NCQOIIFVDGLJKCR4CGKA6O5WLV.json","graph_json":"https://pith.science/api/pith-number/NCQOIIFVDGLJKCR4CGKA6O5WLV/graph.json","events_json":"https://pith.science/api/pith-number/NCQOIIFVDGLJKCR4CGKA6O5WLV/events.json","paper":"https://pith.science/paper/NCQOIIFV"},"agent_actions":{"view_html":"https://pith.science/pith/NCQOIIFVDGLJKCR4CGKA6O5WLV","download_json":"https://pith.science/pith/NCQOIIFVDGLJKCR4CGKA6O5WLV.json","view_paper":"https://pith.science/paper/NCQOIIFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04624&json=true","fetch_graph":"https://pith.science/api/pith-number/NCQOIIFVDGLJKCR4CGKA6O5WLV/graph.json","fetch_events":"https://pith.science/api/pith-number/NCQOIIFVDGLJKCR4CGKA6O5WLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCQOIIFVDGLJKCR4CGKA6O5WLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCQOIIFVDGLJKCR4CGKA6O5WLV/action/storage_attestation","attest_author":"https://pith.science/pith/NCQOIIFVDGLJKCR4CGKA6O5WLV/action/author_attestation","sign_citation":"https://pith.science/pith/NCQOIIFVDGLJKCR4CGKA6O5WLV/action/citation_signature","submit_replication":"https://pith.science/pith/NCQOIIFVDGLJKCR4CGKA6O5WLV/action/replication_record"}},"created_at":"2026-05-18T01:12:24.675966+00:00","updated_at":"2026-05-18T01:12:24.675966+00:00"}