{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4YXNNRIKHZ7VLZBCVR7NJ65ZKQ","short_pith_number":"pith:4YXNNRIK","schema_version":"1.0","canonical_sha256":"e62ed6c50a3e7f55e422ac7ed4fbb9543653122673725f23bf75d43554942db3","source":{"kind":"arxiv","id":"2306.07180","version":2},"attestation_state":"computed","paper":{"title":"Diffusion Models for Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aditya Grover, Satvik Mehul Mashkaria, Siddarth Krishnamoorthy","submitted_at":"2023-06-12T15:26:44Z","abstract_excerpt":"The goal of offline black-box optimization (BBO) is to optimize an expensive black-box function using a fixed dataset of function evaluations. Prior works consider forward approaches that learn surrogates to the black-box function and inverse approaches that directly map function values to corresponding points in the input domain of the black-box function. These approaches are limited by the quality of the offline dataset and the difficulty in learning one-to-many mappings in high dimensions, respectively. We propose Denoising Diffusion Optimization Models (DDOM), a new inverse approach for of"},"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":"2306.07180","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-12T15:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"d82e8b6e146d51bc5be5b621eedf5cd3010f67231ae7b951c851ad9a744bf5ef","abstract_canon_sha256":"a6423335da7f983fc779ea9a030d6a9ff7ea212b1e587a259eb28c094733746e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:43:02.691114Z","signature_b64":"6tt5r51tabrX9m0oehr2wnyWsJoEQV0Biotfwh/tFlt1MiZ9/9q4fUtpc8ucVmMQCnVg39VNyLdy9KAuhldSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e62ed6c50a3e7f55e422ac7ed4fbb9543653122673725f23bf75d43554942db3","last_reissued_at":"2026-07-05T06:43:02.690641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:43:02.690641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion Models for Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aditya Grover, Satvik Mehul Mashkaria, Siddarth Krishnamoorthy","submitted_at":"2023-06-12T15:26:44Z","abstract_excerpt":"The goal of offline black-box optimization (BBO) is to optimize an expensive black-box function using a fixed dataset of function evaluations. Prior works consider forward approaches that learn surrogates to the black-box function and inverse approaches that directly map function values to corresponding points in the input domain of the black-box function. These approaches are limited by the quality of the offline dataset and the difficulty in learning one-to-many mappings in high dimensions, respectively. We propose Denoising Diffusion Optimization Models (DDOM), a new inverse approach for of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07180","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/2306.07180/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":"2306.07180","created_at":"2026-07-05T06:43:02.690699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.07180v2","created_at":"2026-07-05T06:43:02.690699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07180","created_at":"2026-07-05T06:43:02.690699+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YXNNRIKHZ7V","created_at":"2026-07-05T06:43:02.690699+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YXNNRIKHZ7VLZBC","created_at":"2026-07-05T06:43:02.690699+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YXNNRIK","created_at":"2026-07-05T06:43:02.690699+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07565","citing_title":"Ensemble Distributionally Robust Bayesian Optimisation with Continuous Context","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ","json":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ.json","graph_json":"https://pith.science/api/pith-number/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/graph.json","events_json":"https://pith.science/api/pith-number/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/events.json","paper":"https://pith.science/paper/4YXNNRIK"},"agent_actions":{"view_html":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ","download_json":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ.json","view_paper":"https://pith.science/paper/4YXNNRIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.07180&json=true","fetch_graph":"https://pith.science/api/pith-number/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/action/storage_attestation","attest_author":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/action/author_attestation","sign_citation":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/action/citation_signature","submit_replication":"https://pith.science/pith/4YXNNRIKHZ7VLZBCVR7NJ65ZKQ/action/replication_record"}},"created_at":"2026-07-05T06:43:02.690699+00:00","updated_at":"2026-07-05T06:43:02.690699+00:00"}