{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:63ETLLQQWVNSKFLCA6ZHTAVNCG","short_pith_number":"pith:63ETLLQQ","canonical_record":{"source":{"id":"1503.05567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-18T20:01:22Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"6eb36826ef7bef488451e8ff39dfded6083d6691c34b078c551a8a16c5decbb8","abstract_canon_sha256":"a23553ed614c53d4632144ae9aeb2899b73e427bee916efd990d5a2ee1f81e42"},"schema_version":"1.0"},"canonical_sha256":"f6c935ae10b55b25156207b27982ad118dd3302d39c95cc4a451ec2f3d7d444e","source":{"kind":"arxiv","id":"1503.05567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05567","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05567v1","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05567","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"63ETLLQQWVNS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"63ETLLQQWVNSKFLC","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"63ETLLQQ","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:63ETLLQQWVNSKFLCA6ZHTAVNCG","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-18T20:01:22Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"6eb36826ef7bef488451e8ff39dfded6083d6691c34b078c551a8a16c5decbb8","abstract_canon_sha256":"a23553ed614c53d4632144ae9aeb2899b73e427bee916efd990d5a2ee1f81e42"},"schema_version":"1.0"},"canonical_sha256":"f6c935ae10b55b25156207b27982ad118dd3302d39c95cc4a451ec2f3d7d444e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:58.698292Z","signature_b64":"0afepRz16CIhM3aGchcoenc1N711aOSArfsHs+sAgRDjhUDyZHGKZvBoeSFEF9s97UAbx9AI359mef1WIX5yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c935ae10b55b25156207b27982ad118dd3302d39c95cc4a451ec2f3d7d444e","last_reissued_at":"2026-05-18T02:20:58.697742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:58.697742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05567","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-18T02:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsdROmvN+G4FgNEst5bXVGNRQCq+W4Ndg60UkVzOjDONJZwuz/exB9DZRqda+VzxAYcyZ1kwTEuYm8H5HtAGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:32:51.919582Z"},"content_sha256":"a8ca6b39daed9657a05fc8e70d0f354f8a2b01596aa073e6f7dbadd1c2c775b6","schema_version":"1.0","event_id":"sha256:a8ca6b39daed9657a05fc8e70d0f354f8a2b01596aa073e6f7dbadd1c2c775b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:63ETLLQQWVNSKFLCA6ZHTAVNCG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Knowledge Gradient Policy Using A Sparse Additive Belief Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"stat.ML","authors_text":"Han Liu, Warren Powell, Yan Li","submitted_at":"2015-03-18T20:01:22Z","abstract_excerpt":"We propose a sequential learning policy for noisy discrete global optimization and ranking and selection (R\\&S) problems with high dimensional sparse belief functions, where there are hundreds or even thousands of features, but only a small portion of these features contain explanatory power. We aim to identify the sparsity pattern and select the best alternative before the finite budget is exhausted. We derive a knowledge gradient policy for sparse linear models (KGSpLin) with group Lasso penalty. This policy is a unique and novel hybrid of Bayesian R\\&S with frequentist learning. Particularl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05567","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-18T02:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PssYE54nP0GSTf78HyJYhbrDX9szw9KHTm8Zdz0D+tdHy0JIYoRWeJ3vZwP7zltDDHddNLnjEjJ8NkehozaNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:32:51.919930Z"},"content_sha256":"a308b45d0188544819b8b34a6e9bed0f04c8de97cdd703938d3db002252b8669","schema_version":"1.0","event_id":"sha256:a308b45d0188544819b8b34a6e9bed0f04c8de97cdd703938d3db002252b8669"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63ETLLQQWVNSKFLCA6ZHTAVNCG/bundle.json","state_url":"https://pith.science/pith/63ETLLQQWVNSKFLCA6ZHTAVNCG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63ETLLQQWVNSKFLCA6ZHTAVNCG/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-06-04T08:32:51Z","links":{"resolver":"https://pith.science/pith/63ETLLQQWVNSKFLCA6ZHTAVNCG","bundle":"https://pith.science/pith/63ETLLQQWVNSKFLCA6ZHTAVNCG/bundle.json","state":"https://pith.science/pith/63ETLLQQWVNSKFLCA6ZHTAVNCG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63ETLLQQWVNSKFLCA6ZHTAVNCG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:63ETLLQQWVNSKFLCA6ZHTAVNCG","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":"a23553ed614c53d4632144ae9aeb2899b73e427bee916efd990d5a2ee1f81e42","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-18T20:01:22Z","title_canon_sha256":"6eb36826ef7bef488451e8ff39dfded6083d6691c34b078c551a8a16c5decbb8"},"schema_version":"1.0","source":{"id":"1503.05567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05567","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05567v1","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05567","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"63ETLLQQWVNS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"63ETLLQQWVNSKFLC","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"63ETLLQQ","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:a308b45d0188544819b8b34a6e9bed0f04c8de97cdd703938d3db002252b8669","target":"graph","created_at":"2026-05-18T02:20:58Z","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 propose a sequential learning policy for noisy discrete global optimization and ranking and selection (R\\&S) problems with high dimensional sparse belief functions, where there are hundreds or even thousands of features, but only a small portion of these features contain explanatory power. We aim to identify the sparsity pattern and select the best alternative before the finite budget is exhausted. We derive a knowledge gradient policy for sparse linear models (KGSpLin) with group Lasso penalty. This policy is a unique and novel hybrid of Bayesian R\\&S with frequentist learning. Particularl","authors_text":"Han Liu, Warren Powell, Yan Li","cross_cats":["cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-18T20:01:22Z","title":"The Knowledge Gradient Policy Using A Sparse Additive Belief Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05567","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:a8ca6b39daed9657a05fc8e70d0f354f8a2b01596aa073e6f7dbadd1c2c775b6","target":"record","created_at":"2026-05-18T02:20:58Z","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":"a23553ed614c53d4632144ae9aeb2899b73e427bee916efd990d5a2ee1f81e42","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-18T20:01:22Z","title_canon_sha256":"6eb36826ef7bef488451e8ff39dfded6083d6691c34b078c551a8a16c5decbb8"},"schema_version":"1.0","source":{"id":"1503.05567","kind":"arxiv","version":1}},"canonical_sha256":"f6c935ae10b55b25156207b27982ad118dd3302d39c95cc4a451ec2f3d7d444e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6c935ae10b55b25156207b27982ad118dd3302d39c95cc4a451ec2f3d7d444e","first_computed_at":"2026-05-18T02:20:58.697742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:58.697742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0afepRz16CIhM3aGchcoenc1N711aOSArfsHs+sAgRDjhUDyZHGKZvBoeSFEF9s97UAbx9AI359mef1WIX5yDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:58.698292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8ca6b39daed9657a05fc8e70d0f354f8a2b01596aa073e6f7dbadd1c2c775b6","sha256:a308b45d0188544819b8b34a6e9bed0f04c8de97cdd703938d3db002252b8669"],"state_sha256":"e699d9b547dd87db30dd3cf940f508fb73cccb2e11fef2fa9c9d7ca4153c48ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wt/+ISduR7SJzQUtW7YaH1RXGvXxj5CmteO+e4xhGN3mnUq3ysbWpFLyWijFibhXJadjiKyllgY0485YlsvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:32:51.922160Z","bundle_sha256":"69fd4c2f7150f22a61f4b18d34900228d2609bbf226c99e7f4e803a22fef2660"}}