{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M7IPWUSDXX44J7OPLEKODSKC2S","short_pith_number":"pith:M7IPWUSD","schema_version":"1.0","canonical_sha256":"67d0fb5243bdf9c4fdcf5914e1c942d495b8cbb05bc72d3dfd83b2c0b4323670","source":{"kind":"arxiv","id":"2410.00983","version":2},"attestation_state":"computed","paper":{"title":"Robust Guided Diffusion for Offline Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Can Sam Chen, Christopher Beckham, Christopher Pal, Xue Liu, Zixuan Liu","submitted_at":"2024-10-01T18:14:25Z","abstract_excerpt":"Offline black-box optimization aims to maximize a black-box function using an offline dataset of designs and their measured properties. Two main approaches have emerged: the forward approach, which learns a mapping from input to its value, thereby acting as a proxy to guide optimization, and the inverse approach, which learns a mapping from value to input for conditional generation. (a) Although proxy-free~(classifier-free) diffusion shows promise in robustly modeling the inverse mapping, it lacks explicit guidance from proxies, essential for generating high-performance samples beyond the trai"},"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":"2410.00983","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-01T18:14:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"36b7d651bbaccd221dcf11603fe1cc0914d9ac2603c41c3244f77f14dcd5d3e3","abstract_canon_sha256":"c9f21801bf88871607fce6ed30011bc0a7e6900128816df13ffecbd5c5ccb615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:34.886001Z","signature_b64":"uOusS6nMogX1/MlwNbxerUAUlG+5iu8dj5MfEpNJ3euYs5jBpZ9ZHE0IgD3Y3yapKfk4k3mDEAnI5C8CqSkMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67d0fb5243bdf9c4fdcf5914e1c942d495b8cbb05bc72d3dfd83b2c0b4323670","last_reissued_at":"2026-07-05T09:55:34.885458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:34.885458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Guided Diffusion for Offline Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Can Sam Chen, Christopher Beckham, Christopher Pal, Xue Liu, Zixuan Liu","submitted_at":"2024-10-01T18:14:25Z","abstract_excerpt":"Offline black-box optimization aims to maximize a black-box function using an offline dataset of designs and their measured properties. Two main approaches have emerged: the forward approach, which learns a mapping from input to its value, thereby acting as a proxy to guide optimization, and the inverse approach, which learns a mapping from value to input for conditional generation. (a) Although proxy-free~(classifier-free) diffusion shows promise in robustly modeling the inverse mapping, it lacks explicit guidance from proxies, essential for generating high-performance samples beyond the trai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.00983","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/2410.00983/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":"2410.00983","created_at":"2026-07-05T09:55:34.885540+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.00983v2","created_at":"2026-07-05T09:55:34.885540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.00983","created_at":"2026-07-05T09:55:34.885540+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7IPWUSDXX44","created_at":"2026-07-05T09:55:34.885540+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7IPWUSDXX44J7OP","created_at":"2026-07-05T09:55:34.885540+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7IPWUSD","created_at":"2026-07-05T09:55:34.885540+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00691","citing_title":"Generative Refinement for Low-Budget Black-Box Optimization","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S","json":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S.json","graph_json":"https://pith.science/api/pith-number/M7IPWUSDXX44J7OPLEKODSKC2S/graph.json","events_json":"https://pith.science/api/pith-number/M7IPWUSDXX44J7OPLEKODSKC2S/events.json","paper":"https://pith.science/paper/M7IPWUSD"},"agent_actions":{"view_html":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S","download_json":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S.json","view_paper":"https://pith.science/paper/M7IPWUSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.00983&json=true","fetch_graph":"https://pith.science/api/pith-number/M7IPWUSDXX44J7OPLEKODSKC2S/graph.json","fetch_events":"https://pith.science/api/pith-number/M7IPWUSDXX44J7OPLEKODSKC2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S/action/storage_attestation","attest_author":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S/action/author_attestation","sign_citation":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S/action/citation_signature","submit_replication":"https://pith.science/pith/M7IPWUSDXX44J7OPLEKODSKC2S/action/replication_record"}},"created_at":"2026-07-05T09:55:34.885540+00:00","updated_at":"2026-07-05T09:55:34.885540+00:00"}