{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RLMBCWTCEOB7TKHVRTL6ZU7RNI","short_pith_number":"pith:RLMBCWTC","canonical_record":{"source":{"id":"2607.00691","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T09:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"1d35bcc5d510794285e70e156c71c4162581fe88e2073fbe525033c97d8ea63c","abstract_canon_sha256":"4e04d63280833b92e7bed7e9e73c73ce962724a4561dfd963eb0e9d6820f5a01"},"schema_version":"1.0"},"canonical_sha256":"8ad8115a622383f9a8f58cd7ecd3f16a1928ca156abe1ba521cd629730f66e73","source":{"kind":"arxiv","id":"2607.00691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00691","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00691v1","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00691","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"RLMBCWTCEOB7","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"pith_short_16","alias_value":"RLMBCWTCEOB7TKHV","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"pith_short_8","alias_value":"RLMBCWTC","created_at":"2026-07-02T01:17:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RLMBCWTCEOB7TKHVRTL6ZU7RNI","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00691","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T09:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"1d35bcc5d510794285e70e156c71c4162581fe88e2073fbe525033c97d8ea63c","abstract_canon_sha256":"4e04d63280833b92e7bed7e9e73c73ce962724a4561dfd963eb0e9d6820f5a01"},"schema_version":"1.0"},"canonical_sha256":"8ad8115a622383f9a8f58cd7ecd3f16a1928ca156abe1ba521cd629730f66e73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:51.777665Z","signature_b64":"m/r/djJbXQG1egu9gEgzTKxpbtmfp89PbxxAXQr7u4PuB6Z1NQmgY9l/efU8ukse34CUwRxJfaTA+qM0TKc6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ad8115a622383f9a8f58cd7ecd3f16a1928ca156abe1ba521cd629730f66e73","last_reissued_at":"2026-07-02T01:17:51.777240Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:51.777240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00691","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-02T01:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Yf+lBDSfHSfy0KXWoNMXZvlo4RWR+pgYHkEmEqxF4CyPHblcPZO5o4rOBkMnt1NutEkqWPEC2aO72xX+1wYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:58:04.057978Z"},"content_sha256":"2684f1259b68d34aba249abce59dd5ced512fbf1c875a44308b5ff60f508d130","schema_version":"1.0","event_id":"sha256:2684f1259b68d34aba249abce59dd5ced512fbf1c875a44308b5ff60f508d130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RLMBCWTCEOB7TKHVRTL6ZU7RNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generative Refinement for Low-Budget Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Edouard R. Dufour, Pascal Fua","submitted_at":"2026-07-01T09:41:41Z","abstract_excerpt":"Black-box optimization is a fundamental science and engineering tool that makes it possible to optimize objectives without gradient information. Unfortunately, as it often requires many function evaluations, it can be challenging when each one is costly. This is especially true when the evaluation function is noisy or failure-prone, and when high-performing solutions are confined to thin, curved, or disconnected regions of the search space. Existing methods leveraging generative models to navigate these subspaces are built to sample from reward-aligned distributions. As a result, they require "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00691","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00691/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-02T01:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHquynOBwhUFyNPUZu9j+tFEcAHDX+6O/VtXBxTCGsVJ1Y5KwHt4LulcqdyddQm30xrwamsSsBA7yA0/IgVUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:58:04.058355Z"},"content_sha256":"0f55b2f03641f2c2706afc28b7a9b1c2e431e16d1c7cb8dd59b8cf513d1d6085","schema_version":"1.0","event_id":"sha256:0f55b2f03641f2c2706afc28b7a9b1c2e431e16d1c7cb8dd59b8cf513d1d6085"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLMBCWTCEOB7TKHVRTL6ZU7RNI/bundle.json","state_url":"https://pith.science/pith/RLMBCWTCEOB7TKHVRTL6ZU7RNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLMBCWTCEOB7TKHVRTL6ZU7RNI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T09:58:04Z","links":{"resolver":"https://pith.science/pith/RLMBCWTCEOB7TKHVRTL6ZU7RNI","bundle":"https://pith.science/pith/RLMBCWTCEOB7TKHVRTL6ZU7RNI/bundle.json","state":"https://pith.science/pith/RLMBCWTCEOB7TKHVRTL6ZU7RNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLMBCWTCEOB7TKHVRTL6ZU7RNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RLMBCWTCEOB7TKHVRTL6ZU7RNI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4e04d63280833b92e7bed7e9e73c73ce962724a4561dfd963eb0e9d6820f5a01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T09:41:41Z","title_canon_sha256":"1d35bcc5d510794285e70e156c71c4162581fe88e2073fbe525033c97d8ea63c"},"schema_version":"1.0","source":{"id":"2607.00691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00691","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00691v1","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00691","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"RLMBCWTCEOB7","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"pith_short_16","alias_value":"RLMBCWTCEOB7TKHV","created_at":"2026-07-02T01:17:51Z"},{"alias_kind":"pith_short_8","alias_value":"RLMBCWTC","created_at":"2026-07-02T01:17:51Z"}],"graph_snapshots":[{"event_id":"sha256:0f55b2f03641f2c2706afc28b7a9b1c2e431e16d1c7cb8dd59b8cf513d1d6085","target":"graph","created_at":"2026-07-02T01:17:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00691/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Black-box optimization is a fundamental science and engineering tool that makes it possible to optimize objectives without gradient information. Unfortunately, as it often requires many function evaluations, it can be challenging when each one is costly. This is especially true when the evaluation function is noisy or failure-prone, and when high-performing solutions are confined to thin, curved, or disconnected regions of the search space. Existing methods leveraging generative models to navigate these subspaces are built to sample from reward-aligned distributions. As a result, they require ","authors_text":"Edouard R. Dufour, Pascal Fua","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T09:41:41Z","title":"Generative Refinement for Low-Budget Black-Box Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00691","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2684f1259b68d34aba249abce59dd5ced512fbf1c875a44308b5ff60f508d130","target":"record","created_at":"2026-07-02T01:17:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4e04d63280833b92e7bed7e9e73c73ce962724a4561dfd963eb0e9d6820f5a01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T09:41:41Z","title_canon_sha256":"1d35bcc5d510794285e70e156c71c4162581fe88e2073fbe525033c97d8ea63c"},"schema_version":"1.0","source":{"id":"2607.00691","kind":"arxiv","version":1}},"canonical_sha256":"8ad8115a622383f9a8f58cd7ecd3f16a1928ca156abe1ba521cd629730f66e73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ad8115a622383f9a8f58cd7ecd3f16a1928ca156abe1ba521cd629730f66e73","first_computed_at":"2026-07-02T01:17:51.777240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:51.777240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m/r/djJbXQG1egu9gEgzTKxpbtmfp89PbxxAXQr7u4PuB6Z1NQmgY9l/efU8ukse34CUwRxJfaTA+qM0TKc6Bg==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:51.777665Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2684f1259b68d34aba249abce59dd5ced512fbf1c875a44308b5ff60f508d130","sha256:0f55b2f03641f2c2706afc28b7a9b1c2e431e16d1c7cb8dd59b8cf513d1d6085"],"state_sha256":"5a082a471350b8c8d3ba636cecb3d26da0d666dbcb4c54140416d400a8794b76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9fBBfAQRsdTbMABCXYxsivwcQ7xgDTlQHavJLGRr8I0gdRLwM0DG+VycM3vPuB2BK/MF2EYjhvCIatZ7artDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:58:04.060468Z","bundle_sha256":"678c9adf8819d13bbd7ac4299e4d84118080c550c004b0d920803be4f4804c2f"}}