{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6GYVQGXHNPD6UYXRVWCIW5UMHW","short_pith_number":"pith:6GYVQGXH","schema_version":"1.0","canonical_sha256":"f1b1581ae76bc7ea62f1ad848b768c3da87643d25795bc5d3984151b522f05bc","source":{"kind":"arxiv","id":"1811.08871","version":2},"attestation_state":"computed","paper":{"title":"Efficient nonmyopic active search with applications in drug and materials discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin Moseley, Gustavo Malkomes, Roman Garnett, Shali Jiang","submitted_at":"2018-11-21T18:32:33Z","abstract_excerpt":"Active search is a learning paradigm for actively identifying as many members of a given class as possible. A critical target scenario is high-throughput screening for scientific discovery, such as drug or materials discovery. In this paper, we approach this problem in Bayesian decision framework. We first derive the Bayesian optimal policy under a natural utility, and establish a theoretical hardness of active search, proving that the optimal policy can not be approximated for any constant ratio. We also study the batch setting for the first time, where a batch of $b>1$ points can be queried "},"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":"1811.08871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-21T18:32:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e5197f2666dac5fbc96590492ad2ca6d47ae6cf7ee39d949f2fe90cd7c1b52a0","abstract_canon_sha256":"6f26d06eb517354efe462ec8a1f24b205ad94dba680e6876129bb5e283ba8cd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:01.646691Z","signature_b64":"D/HGwTZcUhCBWdHK07e8gGZI4HZoUdWTIzk66Rql0cX/4lf7Zgt1ne+Tmn1qDObvUsFlGbL7f5UtAdUNO/ZjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1b1581ae76bc7ea62f1ad848b768c3da87643d25795bc5d3984151b522f05bc","last_reissued_at":"2026-05-18T00:00:01.646179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:01.646179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient nonmyopic active search with applications in drug and materials discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin Moseley, Gustavo Malkomes, Roman Garnett, Shali Jiang","submitted_at":"2018-11-21T18:32:33Z","abstract_excerpt":"Active search is a learning paradigm for actively identifying as many members of a given class as possible. A critical target scenario is high-throughput screening for scientific discovery, such as drug or materials discovery. In this paper, we approach this problem in Bayesian decision framework. We first derive the Bayesian optimal policy under a natural utility, and establish a theoretical hardness of active search, proving that the optimal policy can not be approximated for any constant ratio. We also study the batch setting for the first time, where a batch of $b>1$ points can be queried "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08871","kind":"arxiv","version":2},"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":"1811.08871","created_at":"2026-05-18T00:00:01.646266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08871v2","created_at":"2026-05-18T00:00:01.646266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08871","created_at":"2026-05-18T00:00:01.646266+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GYVQGXHNPD6","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GYVQGXHNPD6UYXR","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GYVQGXH","created_at":"2026-05-18T12:32:08.215937+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/6GYVQGXHNPD6UYXRVWCIW5UMHW","json":"https://pith.science/pith/6GYVQGXHNPD6UYXRVWCIW5UMHW.json","graph_json":"https://pith.science/api/pith-number/6GYVQGXHNPD6UYXRVWCIW5UMHW/graph.json","events_json":"https://pith.science/api/pith-number/6GYVQGXHNPD6UYXRVWCIW5UMHW/events.json","paper":"https://pith.science/paper/6GYVQGXH"},"agent_actions":{"view_html":"https://pith.science/pith/6GYVQGXHNPD6UYXRVWCIW5UMHW","download_json":"https://pith.science/pith/6GYVQGXHNPD6UYXRVWCIW5UMHW.json","view_paper":"https://pith.science/paper/6GYVQGXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08871&json=true","fetch_graph":"https://pith.science/api/pith-number/6GYVQGXHNPD6UYXRVWCIW5UMHW/graph.json","fetch_events":"https://pith.science/api/pith-number/6GYVQGXHNPD6UYXRVWCIW5UMHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GYVQGXHNPD6UYXRVWCIW5UMHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GYVQGXHNPD6UYXRVWCIW5UMHW/action/storage_attestation","attest_author":"https://pith.science/pith/6GYVQGXHNPD6UYXRVWCIW5UMHW/action/author_attestation","sign_citation":"https://pith.science/pith/6GYVQGXHNPD6UYXRVWCIW5UMHW/action/citation_signature","submit_replication":"https://pith.science/pith/6GYVQGXHNPD6UYXRVWCIW5UMHW/action/replication_record"}},"created_at":"2026-05-18T00:00:01.646266+00:00","updated_at":"2026-05-18T00:00:01.646266+00:00"}