{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EUVNJP3LCJRFD4NTIP3XBHK22O","short_pith_number":"pith:EUVNJP3L","schema_version":"1.0","canonical_sha256":"252ad4bf6b126251f1b343f7709d5ad392090868dfe0f211af6583107aca96b0","source":{"kind":"arxiv","id":"2406.03616","version":5},"attestation_state":"computed","paper":{"title":"BEACON: A Bayesian Optimization Inspired Strategy for Efficient Novelty Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ankush Chakrabarty, Joel A. Paulson, Wei-Ting Tang","submitted_at":"2024-06-05T20:23:52Z","abstract_excerpt":"Novelty search (NS) aims to uncover diverse system behaviors through simulation or experiment without requiring a pre-specified scalar objective. This capability is especially relevant to modern discovery problems in chemistry, materials science, and molecular design, where researchers often seek broad coverage of attainable property space rather than a single optimum and where each evaluation may require a costly computation or experiment. For such expensive black-box settings, we propose BEACON, a sample-efficient NS strategy inspired by Bayesian optimization principles. BEACON models the in"},"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":"2406.03616","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-06-05T20:23:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f87bab30af78b06621215384005da1c42d6c13bac103191a598d530befb1fcf3","abstract_canon_sha256":"90559ef58c06674f185bea0f112440be351f819606d05b1df92dac0c70404811"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:19.654261Z","signature_b64":"hIfBbs3lrSUOlHKyGemguNxepuZdbWTXBPlIX1OECgJCTkta+/137UMooa/Vsh925tTdXRbIG2tvmCBDrQQlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"252ad4bf6b126251f1b343f7709d5ad392090868dfe0f211af6583107aca96b0","last_reissued_at":"2026-06-30T01:17:19.653362Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:19.653362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BEACON: A Bayesian Optimization Inspired Strategy for Efficient Novelty Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ankush Chakrabarty, Joel A. Paulson, Wei-Ting Tang","submitted_at":"2024-06-05T20:23:52Z","abstract_excerpt":"Novelty search (NS) aims to uncover diverse system behaviors through simulation or experiment without requiring a pre-specified scalar objective. This capability is especially relevant to modern discovery problems in chemistry, materials science, and molecular design, where researchers often seek broad coverage of attainable property space rather than a single optimum and where each evaluation may require a costly computation or experiment. For such expensive black-box settings, we propose BEACON, a sample-efficient NS strategy inspired by Bayesian optimization principles. BEACON models the in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.03616","kind":"arxiv","version":5},"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/2406.03616/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.03616","created_at":"2026-06-30T01:17:19.653472+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.03616v5","created_at":"2026-06-30T01:17:19.653472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03616","created_at":"2026-06-30T01:17:19.653472+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUVNJP3LCJRF","created_at":"2026-06-30T01:17:19.653472+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUVNJP3LCJRFD4NT","created_at":"2026-06-30T01:17:19.653472+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUVNJP3L","created_at":"2026-06-30T01:17:19.653472+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.22967","citing_title":"Rethinking Trust Region Bayesian Optimization in High Dimensions","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O","json":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O.json","graph_json":"https://pith.science/api/pith-number/EUVNJP3LCJRFD4NTIP3XBHK22O/graph.json","events_json":"https://pith.science/api/pith-number/EUVNJP3LCJRFD4NTIP3XBHK22O/events.json","paper":"https://pith.science/paper/EUVNJP3L"},"agent_actions":{"view_html":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O","download_json":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O.json","view_paper":"https://pith.science/paper/EUVNJP3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.03616&json=true","fetch_graph":"https://pith.science/api/pith-number/EUVNJP3LCJRFD4NTIP3XBHK22O/graph.json","fetch_events":"https://pith.science/api/pith-number/EUVNJP3LCJRFD4NTIP3XBHK22O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O/action/storage_attestation","attest_author":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O/action/author_attestation","sign_citation":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O/action/citation_signature","submit_replication":"https://pith.science/pith/EUVNJP3LCJRFD4NTIP3XBHK22O/action/replication_record"}},"created_at":"2026-06-30T01:17:19.653472+00:00","updated_at":"2026-06-30T01:17:19.653472+00:00"}