{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OJ5IZ6YYEGHJ2LCTQTU64DGUJD","short_pith_number":"pith:OJ5IZ6YY","schema_version":"1.0","canonical_sha256":"727a8cfb18218e9d2c5384e9ee0cd448d034d5f8b390728ed43a4db16e7083eb","source":{"kind":"arxiv","id":"1206.6406","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimal Active Search and Surveying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jeff Schneider (Carnegie Mellon University), Richard Mann (Uppsala Universitet), Roman Garnett (Carnegie Mellon University), Xuehan Xiong (Carnegie Mellon University), Yamuna Krishnamurthy (Carnegie Mellon University)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We consider two active binary-classification problems with atypical objectives. In the first, active search, our goal is to actively uncover as many members of a given class as possible. In the second, active surveying, our goal is to actively query points to ultimately predict the proportion of a given class. Numerous real-world problems can be framed in these terms, and in either case typical model-based concerns such as generalization error are only of secondary importance.\n  We approach these problems via Bayesian decision theory; after choosing natural utility functions, we derive the opt"},"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":"1206.6406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bfa11ef3ae68e87daa785bc9815654a61da078473e709f2f7bf1e09a15e0aa7a","abstract_canon_sha256":"e28fbc14802a6b6d612ffb650625fae7007c0d8d358a72a2f8a21e53ea4b8a72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:35.752258Z","signature_b64":"bHhKye0dvOLlQ8gV5WxAa52zLWxrPw+z65vbViZLs39JUo/gfUMrJls2ZBcPEPAKuzZDRC2OqdPtPYgDhFDODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"727a8cfb18218e9d2c5384e9ee0cd448d034d5f8b390728ed43a4db16e7083eb","last_reissued_at":"2026-05-18T00:59:35.751595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:35.751595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimal Active Search and Surveying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jeff Schneider (Carnegie Mellon University), Richard Mann (Uppsala Universitet), Roman Garnett (Carnegie Mellon University), Xuehan Xiong (Carnegie Mellon University), Yamuna Krishnamurthy (Carnegie Mellon University)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We consider two active binary-classification problems with atypical objectives. In the first, active search, our goal is to actively uncover as many members of a given class as possible. In the second, active surveying, our goal is to actively query points to ultimately predict the proportion of a given class. Numerous real-world problems can be framed in these terms, and in either case typical model-based concerns such as generalization error are only of secondary importance.\n  We approach these problems via Bayesian decision theory; after choosing natural utility functions, we derive the opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6406","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":"1206.6406","created_at":"2026-05-18T00:59:35.751709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6406v1","created_at":"2026-05-18T00:59:35.751709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6406","created_at":"2026-05-18T00:59:35.751709+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJ5IZ6YYEGHJ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJ5IZ6YYEGHJ2LCT","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJ5IZ6YY","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.26657","citing_title":"Target-Aware Bandit Allocation for Scalable Surrogate Optimization in Chemical Space","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD","json":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD.json","graph_json":"https://pith.science/api/pith-number/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/graph.json","events_json":"https://pith.science/api/pith-number/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/events.json","paper":"https://pith.science/paper/OJ5IZ6YY"},"agent_actions":{"view_html":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD","download_json":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD.json","view_paper":"https://pith.science/paper/OJ5IZ6YY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6406&json=true","fetch_graph":"https://pith.science/api/pith-number/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/graph.json","fetch_events":"https://pith.science/api/pith-number/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/action/storage_attestation","attest_author":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/action/author_attestation","sign_citation":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/action/citation_signature","submit_replication":"https://pith.science/pith/OJ5IZ6YYEGHJ2LCTQTU64DGUJD/action/replication_record"}},"created_at":"2026-05-18T00:59:35.751709+00:00","updated_at":"2026-05-18T00:59:35.751709+00:00"}