{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YD2OMMHDLVHVA4SGGER4R6YUJI","short_pith_number":"pith:YD2OMMHD","canonical_record":{"source":{"id":"1604.08459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-28T15:18:07Z","cross_cats_sorted":[],"title_canon_sha256":"ba5df6c0a94334aaaa34ef4f10e90d6a1d9b6135a79ad369cddd2494cec34791","abstract_canon_sha256":"092d69d495efb9bce60f64b40e843a6bd0c97016183ce74182c093121e0421bd"},"schema_version":"1.0"},"canonical_sha256":"c0f4e630e35d4f5072463123c8fb144a1fa7fc6acfe9adf9fa14c43c1d6e835a","source":{"kind":"arxiv","id":"1604.08459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08459","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08459v1","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08459","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"YD2OMMHDLVHV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YD2OMMHDLVHVA4SG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YD2OMMHD","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YD2OMMHDLVHVA4SGGER4R6YUJI","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-28T15:18:07Z","cross_cats_sorted":[],"title_canon_sha256":"ba5df6c0a94334aaaa34ef4f10e90d6a1d9b6135a79ad369cddd2494cec34791","abstract_canon_sha256":"092d69d495efb9bce60f64b40e843a6bd0c97016183ce74182c093121e0421bd"},"schema_version":"1.0"},"canonical_sha256":"c0f4e630e35d4f5072463123c8fb144a1fa7fc6acfe9adf9fa14c43c1d6e835a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:03.915906Z","signature_b64":"qV96fek8KtdIkgSRylTRM4SgkOG9m1Tg1pxZvIQuR7P+WChMJ53dJJuZdz4d7EC7+w/hCZxSgrlVoh1EZYlXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0f4e630e35d4f5072463123c8fb144a1fa7fc6acfe9adf9fa14c43c1d6e835a","last_reissued_at":"2026-05-18T01:16:03.915250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:03.915250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08459","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-05-18T01:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1IGkAZhb50N5CQRZMtH1ReUcpSTYzWyonfekScfTsLli85+e7ejo0kt7CFawQVf5DRD8FOCplfrwuNbEC50Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:18:49.267030Z"},"content_sha256":"c67f2ed433235c61e73c9381e92da163e4fb4ea151dfcbf526dc3d8598944237","schema_version":"1.0","event_id":"sha256:c67f2ed433235c61e73c9381e92da163e4fb4ea151dfcbf526dc3d8598944237"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YD2OMMHDLVHVA4SGGER4R6YUJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy Optimization: Fast Convergence Rates with Comparison-Based Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"LRI, Marie-Liesse Cauwet (INRIA, Olivier Teytaud (LRI, TAO)","submitted_at":"2016-04-28T15:18:07Z","abstract_excerpt":"Derivative Free Optimization is known to be an efficient and robust method to tackle the black-box optimization problem. When it comes to noisy functions, classical comparison-based algorithms are slower than gradient-based algorithms. For quadratic functions, Evolutionary Algorithms without large mutations have a simple regret at best $O(1/ \\sqrt{N})$ when $N$ is the number of function evaluations, whereas stochastic gradient descent can reach (tightly) a simple regret in $O(1/N)$. It has been conjectured that gradient approximation by finite differences (hence, not a comparison-based method)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08459","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":""},"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-05-18T01:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRdBzKjXpnW+JF6VRGWncxqFMM1n3yQevXiJcNMxkU8Icwn68LGBK+Tr0qeIqzds4AqSC8LSd+rahkP9eMAeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:18:49.267740Z"},"content_sha256":"12b56bfe16249db56609b11046f45f4aef2accdc8c0ce720f6bbfa9189a73dd9","schema_version":"1.0","event_id":"sha256:12b56bfe16249db56609b11046f45f4aef2accdc8c0ce720f6bbfa9189a73dd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YD2OMMHDLVHVA4SGGER4R6YUJI/bundle.json","state_url":"https://pith.science/pith/YD2OMMHDLVHVA4SGGER4R6YUJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YD2OMMHDLVHVA4SGGER4R6YUJI/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-06-08T16:18:49Z","links":{"resolver":"https://pith.science/pith/YD2OMMHDLVHVA4SGGER4R6YUJI","bundle":"https://pith.science/pith/YD2OMMHDLVHVA4SGGER4R6YUJI/bundle.json","state":"https://pith.science/pith/YD2OMMHDLVHVA4SGGER4R6YUJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YD2OMMHDLVHVA4SGGER4R6YUJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YD2OMMHDLVHVA4SGGER4R6YUJI","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":"092d69d495efb9bce60f64b40e843a6bd0c97016183ce74182c093121e0421bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-28T15:18:07Z","title_canon_sha256":"ba5df6c0a94334aaaa34ef4f10e90d6a1d9b6135a79ad369cddd2494cec34791"},"schema_version":"1.0","source":{"id":"1604.08459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08459","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08459v1","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08459","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"YD2OMMHDLVHV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YD2OMMHDLVHVA4SG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YD2OMMHD","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:12b56bfe16249db56609b11046f45f4aef2accdc8c0ce720f6bbfa9189a73dd9","target":"graph","created_at":"2026-05-18T01:16:03Z","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"},"paper":{"abstract_excerpt":"Derivative Free Optimization is known to be an efficient and robust method to tackle the black-box optimization problem. When it comes to noisy functions, classical comparison-based algorithms are slower than gradient-based algorithms. For quadratic functions, Evolutionary Algorithms without large mutations have a simple regret at best $O(1/ \\sqrt{N})$ when $N$ is the number of function evaluations, whereas stochastic gradient descent can reach (tightly) a simple regret in $O(1/N)$. It has been conjectured that gradient approximation by finite differences (hence, not a comparison-based method)","authors_text":"LRI, Marie-Liesse Cauwet (INRIA, Olivier Teytaud (LRI, TAO)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-28T15:18:07Z","title":"Noisy Optimization: Fast Convergence Rates with Comparison-Based Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08459","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:c67f2ed433235c61e73c9381e92da163e4fb4ea151dfcbf526dc3d8598944237","target":"record","created_at":"2026-05-18T01:16:03Z","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":"092d69d495efb9bce60f64b40e843a6bd0c97016183ce74182c093121e0421bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-28T15:18:07Z","title_canon_sha256":"ba5df6c0a94334aaaa34ef4f10e90d6a1d9b6135a79ad369cddd2494cec34791"},"schema_version":"1.0","source":{"id":"1604.08459","kind":"arxiv","version":1}},"canonical_sha256":"c0f4e630e35d4f5072463123c8fb144a1fa7fc6acfe9adf9fa14c43c1d6e835a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0f4e630e35d4f5072463123c8fb144a1fa7fc6acfe9adf9fa14c43c1d6e835a","first_computed_at":"2026-05-18T01:16:03.915250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:03.915250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qV96fek8KtdIkgSRylTRM4SgkOG9m1Tg1pxZvIQuR7P+WChMJ53dJJuZdz4d7EC7+w/hCZxSgrlVoh1EZYlXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:03.915906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c67f2ed433235c61e73c9381e92da163e4fb4ea151dfcbf526dc3d8598944237","sha256:12b56bfe16249db56609b11046f45f4aef2accdc8c0ce720f6bbfa9189a73dd9"],"state_sha256":"5c451ae15e293637909442b2676378cd4242374287be46f017aefa5bfaa19e4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6M8TsQ18kRrAZAtDwy7EFkhzNRafJ2er0POE1IvhxyaCyTmkYNHlxj4mYoHvAFYzQlPQjwZnJ/923nfiFsbNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:18:49.272199Z","bundle_sha256":"46c4d75093335a6a8a69bda884fe1aa5bf7b8b1a152d65480d32f30019272e6c"}}