{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GM55MUDPSZ7GCAJAJOZCG2N6XI","short_pith_number":"pith:GM55MUDP","schema_version":"1.0","canonical_sha256":"333bd6506f967e6101204bb22369beba33059504b260ff99ebece7222e43582e","source":{"kind":"arxiv","id":"2304.11787","version":2},"attestation_state":"computed","paper":{"title":"B2Opt: Learning to Optimize Black-box Optimization with Little Budget","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Handing Wang, Jing Liu, Kai Wu, Xiaobin Li, Xiaoyu Zhang","submitted_at":"2023-04-24T01:48:01Z","abstract_excerpt":"The core challenge of high-dimensional and expensive black-box optimization (BBO) is how to obtain better performance faster with little function evaluation cost. The essence of the problem is how to design an efficient optimization strategy tailored to the target task. This paper designs a powerful optimization framework to automatically learn the optimization strategies from the target or cheap surrogate task without human intervention. However, current methods are weak for this due to poor representation of optimization strategy. To achieve this, 1) drawing on the mechanism of genetic algor"},"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":"2304.11787","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-24T01:48:01Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"9598ecefe9f727b15c5cde60affb64c29e1479cf421681d30d9cd3eead905cba","abstract_canon_sha256":"8baee559e966c063c755826cba184350ae593282f328f76f0a4c8c81eb19f9a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:05.389146Z","signature_b64":"09X/r/ib2mt8emjcNb7ogmxNc6wcyeXy8bzRZNyki8YoGOjMG5HRuuKNvDouq395PCRuYX26XjuSel5MGC8HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"333bd6506f967e6101204bb22369beba33059504b260ff99ebece7222e43582e","last_reissued_at":"2026-07-05T06:34:05.388646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:05.388646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"B2Opt: Learning to Optimize Black-box Optimization with Little Budget","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Handing Wang, Jing Liu, Kai Wu, Xiaobin Li, Xiaoyu Zhang","submitted_at":"2023-04-24T01:48:01Z","abstract_excerpt":"The core challenge of high-dimensional and expensive black-box optimization (BBO) is how to obtain better performance faster with little function evaluation cost. The essence of the problem is how to design an efficient optimization strategy tailored to the target task. This paper designs a powerful optimization framework to automatically learn the optimization strategies from the target or cheap surrogate task without human intervention. However, current methods are weak for this due to poor representation of optimization strategy. To achieve this, 1) drawing on the mechanism of genetic algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11787","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.11787/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":"2304.11787","created_at":"2026-07-05T06:34:05.388705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.11787v2","created_at":"2026-07-05T06:34:05.388705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11787","created_at":"2026-07-05T06:34:05.388705+00:00"},{"alias_kind":"pith_short_12","alias_value":"GM55MUDPSZ7G","created_at":"2026-07-05T06:34:05.388705+00:00"},{"alias_kind":"pith_short_16","alias_value":"GM55MUDPSZ7GCAJA","created_at":"2026-07-05T06:34:05.388705+00:00"},{"alias_kind":"pith_short_8","alias_value":"GM55MUDP","created_at":"2026-07-05T06:34:05.388705+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.02200","citing_title":"Learning Evolution via Optimization Knowledge Adaptation","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI","json":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI.json","graph_json":"https://pith.science/api/pith-number/GM55MUDPSZ7GCAJAJOZCG2N6XI/graph.json","events_json":"https://pith.science/api/pith-number/GM55MUDPSZ7GCAJAJOZCG2N6XI/events.json","paper":"https://pith.science/paper/GM55MUDP"},"agent_actions":{"view_html":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI","download_json":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI.json","view_paper":"https://pith.science/paper/GM55MUDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.11787&json=true","fetch_graph":"https://pith.science/api/pith-number/GM55MUDPSZ7GCAJAJOZCG2N6XI/graph.json","fetch_events":"https://pith.science/api/pith-number/GM55MUDPSZ7GCAJAJOZCG2N6XI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI/action/storage_attestation","attest_author":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI/action/author_attestation","sign_citation":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI/action/citation_signature","submit_replication":"https://pith.science/pith/GM55MUDPSZ7GCAJAJOZCG2N6XI/action/replication_record"}},"created_at":"2026-07-05T06:34:05.388705+00:00","updated_at":"2026-07-05T06:34:05.388705+00:00"}