{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MUGZWCZ6XA3ZZVFKNZYCODSM3L","short_pith_number":"pith:MUGZWCZ6","canonical_record":{"source":{"id":"2206.06847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-06-14T13:42:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"438c03020598364f07c9f0cf303d72e311c7b1d95108cac2d285d41056a05cc9","abstract_canon_sha256":"0c8c025e6a7d4152a381e8b1f8b79d0f1db583b33b0023f2fc706fc4962d1bf0"},"schema_version":"1.0"},"canonical_sha256":"650d9b0b3eb8379cd4aa6e70270e4cdacb5071e22edca4a36d1c88cda971a1fe","source":{"kind":"arxiv","id":"2206.06847","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.06847","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"2206.06847v3","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06847","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"MUGZWCZ6XA3Z","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"pith_short_16","alias_value":"MUGZWCZ6XA3ZZVFK","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"pith_short_8","alias_value":"MUGZWCZ6","created_at":"2026-07-05T05:18:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MUGZWCZ6XA3ZZVFKNZYCODSM3L","target":"record","payload":{"canonical_record":{"source":{"id":"2206.06847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-06-14T13:42:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"438c03020598364f07c9f0cf303d72e311c7b1d95108cac2d285d41056a05cc9","abstract_canon_sha256":"0c8c025e6a7d4152a381e8b1f8b79d0f1db583b33b0023f2fc706fc4962d1bf0"},"schema_version":"1.0"},"canonical_sha256":"650d9b0b3eb8379cd4aa6e70270e4cdacb5071e22edca4a36d1c88cda971a1fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:04.437063Z","signature_b64":"X+aTha7QbdTSDrER1akRNSLPrWU6Oh9Lw6KEZ0kJVqmqfqjMAlUDN2ywRJDf5ZGQzB/wGokfyjQCH0LWx4D2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650d9b0b3eb8379cd4aa6e70270e4cdacb5071e22edca4a36d1c88cda971a1fe","last_reissued_at":"2026-07-05T05:18:04.436650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:04.436650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.06847","source_version":3,"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-05T05:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jOHtFUqUd2XK0Ssir1fuTK9ApYLG31u7NTLP3+gkVxCiVJM5QigPQJ70rZ3BKvI2Vxo/Q7ohzAQ83KAGVANaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T09:34:44.273548Z"},"content_sha256":"06c87993dabd29d74a57855fbd16c838837b405cb97099916a81275d66a0ce19","schema_version":"1.0","event_id":"sha256:06c87993dabd29d74a57855fbd16c838837b405cb97099916a81275d66a0ce19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MUGZWCZ6XA3ZZVFKNZYCODSM3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Finite-Time Performance of the Knowledge Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Siyang Gao, Yanwen Li","submitted_at":"2022-06-14T13:42:05Z","abstract_excerpt":"The knowledge gradient (KG) algorithm is a popular and effective algorithm for the best arm identification (BAI) problem. Due to the complex calculation of KG, theoretical analysis of this algorithm is difficult, and existing results are mostly about the asymptotic performance of it, e.g., consistency, asymptotic sample allocation, etc. In this research, we present new theoretical results about the finite-time performance of the KG algorithm. Under independent and normally distributed rewards, we derive bounds for the sample allocation of the algorithm. With these bounds, existing asymptotic r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06847","kind":"arxiv","version":3},"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/2206.06847/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-05T05:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0uXou4wGLBkpErBIK5oAp/eQmwvQG9tItORjyBpb0Zuv3KmMa35Xz2wmh9GUsPzEXH+bvF6o68QlMgkEEjVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T09:34:44.274080Z"},"content_sha256":"da0a30b8ffd7f0a1fd3d2aa49e29ae3f8c2e3cd161ee3ba798245b0f9214a9da","schema_version":"1.0","event_id":"sha256:da0a30b8ffd7f0a1fd3d2aa49e29ae3f8c2e3cd161ee3ba798245b0f9214a9da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/bundle.json","state_url":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/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-21T09:34:44Z","links":{"resolver":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L","bundle":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/bundle.json","state":"https://pith.science/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUGZWCZ6XA3ZZVFKNZYCODSM3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MUGZWCZ6XA3ZZVFKNZYCODSM3L","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":"0c8c025e6a7d4152a381e8b1f8b79d0f1db583b33b0023f2fc706fc4962d1bf0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-06-14T13:42:05Z","title_canon_sha256":"438c03020598364f07c9f0cf303d72e311c7b1d95108cac2d285d41056a05cc9"},"schema_version":"1.0","source":{"id":"2206.06847","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.06847","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"2206.06847v3","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06847","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"MUGZWCZ6XA3Z","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"pith_short_16","alias_value":"MUGZWCZ6XA3ZZVFK","created_at":"2026-07-05T05:18:04Z"},{"alias_kind":"pith_short_8","alias_value":"MUGZWCZ6","created_at":"2026-07-05T05:18:04Z"}],"graph_snapshots":[{"event_id":"sha256:da0a30b8ffd7f0a1fd3d2aa49e29ae3f8c2e3cd161ee3ba798245b0f9214a9da","target":"graph","created_at":"2026-07-05T05:18: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.06847/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The knowledge gradient (KG) algorithm is a popular and effective algorithm for the best arm identification (BAI) problem. Due to the complex calculation of KG, theoretical analysis of this algorithm is difficult, and existing results are mostly about the asymptotic performance of it, e.g., consistency, asymptotic sample allocation, etc. In this research, we present new theoretical results about the finite-time performance of the KG algorithm. Under independent and normally distributed rewards, we derive bounds for the sample allocation of the algorithm. With these bounds, existing asymptotic r","authors_text":"Siyang Gao, Yanwen Li","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-06-14T13:42:05Z","title":"On the Finite-Time Performance of the Knowledge Gradient Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06847","kind":"arxiv","version":3},"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:06c87993dabd29d74a57855fbd16c838837b405cb97099916a81275d66a0ce19","target":"record","created_at":"2026-07-05T05:18: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":"0c8c025e6a7d4152a381e8b1f8b79d0f1db583b33b0023f2fc706fc4962d1bf0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-06-14T13:42:05Z","title_canon_sha256":"438c03020598364f07c9f0cf303d72e311c7b1d95108cac2d285d41056a05cc9"},"schema_version":"1.0","source":{"id":"2206.06847","kind":"arxiv","version":3}},"canonical_sha256":"650d9b0b3eb8379cd4aa6e70270e4cdacb5071e22edca4a36d1c88cda971a1fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"650d9b0b3eb8379cd4aa6e70270e4cdacb5071e22edca4a36d1c88cda971a1fe","first_computed_at":"2026-07-05T05:18:04.436650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:18:04.436650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X+aTha7QbdTSDrER1akRNSLPrWU6Oh9Lw6KEZ0kJVqmqfqjMAlUDN2ywRJDf5ZGQzB/wGokfyjQCH0LWx4D2CA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:18:04.437063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.06847","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06c87993dabd29d74a57855fbd16c838837b405cb97099916a81275d66a0ce19","sha256:da0a30b8ffd7f0a1fd3d2aa49e29ae3f8c2e3cd161ee3ba798245b0f9214a9da"],"state_sha256":"1d20e4bcbfeeaca16590f22cf432a5d2abf894de18b35eceaf8f16bb7d7fde55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqzj1xNEJ3RVgLJmILtTerT4czCJP/pEhqlOHM/F55OQ5JjyhePxgydpYL9QRIBi4+gTTvLl2wPNWGUNMZCNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T09:34:44.279537Z","bundle_sha256":"df62615a59c67b934afa66a8dfd3837f170fce53056f78ee04c13f316c49a337"}}