{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EI2EIKNJVXS5A6FHELITK3T6WC","short_pith_number":"pith:EI2EIKNJ","canonical_record":{"source":{"id":"1209.2434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-11T20:37:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"54aead0c76d86831b10d9e4d93627716e3de541decc3e626aed7331d5db74c7f","abstract_canon_sha256":"b8c8df2a5b1121eef7f40c72dd7702268815ead0f894f5ba4e1b6e448e6270e0"},"schema_version":"1.0"},"canonical_sha256":"22344429a9ade5d078a722d1356e7eb08d07f8c5a8f115137961b7caac3d20ba","source":{"kind":"arxiv","id":"1209.2434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2434","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2434v1","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2434","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"EI2EIKNJVXS5","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EI2EIKNJVXS5A6FH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EI2EIKNJ","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EI2EIKNJVXS5A6FHELITK3T6WC","target":"record","payload":{"canonical_record":{"source":{"id":"1209.2434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-11T20:37:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"54aead0c76d86831b10d9e4d93627716e3de541decc3e626aed7331d5db74c7f","abstract_canon_sha256":"b8c8df2a5b1121eef7f40c72dd7702268815ead0f894f5ba4e1b6e448e6270e0"},"schema_version":"1.0"},"canonical_sha256":"22344429a9ade5d078a722d1356e7eb08d07f8c5a8f115137961b7caac3d20ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:43.179961Z","signature_b64":"+SCOd9x+tUljQZ88i6CeCic1AC2CJVZU1nuw2uKfq0Rdj44UCh485N1nhNo++9tkE3IXas3sClJFJUJ9CeOKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22344429a9ade5d078a722d1356e7eb08d07f8c5a8f115137961b7caac3d20ba","last_reissued_at":"2026-05-18T03:45:43.179402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:43.179402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.2434","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-18T03:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nrrYpw6AeCBn+jjGi0wXbaKk6w8t/x4DTkM5YVRlgS84BJ3r4GGzdt/L7JdQocDcPrTvcFcCp+JoFAXV7pZMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:40:22.072584Z"},"content_sha256":"840ebe2bfce33650f511dfc1e94fc6dfd8f9d319761cdc5c0caa2cc4a642bc54","schema_version":"1.0","event_id":"sha256:840ebe2bfce33650f511dfc1e94fc6dfd8f9d319761cdc5c0caa2cc4a642bc54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EI2EIKNJVXS5A6FHELITK3T6WC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query Complexity of Derivative-Free Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Benjamin Recht, Kevin G. Jamieson, Robert D. Nowak","submitted_at":"2012-09-11T20:37:02Z","abstract_excerpt":"This paper provides lower bounds on the convergence rate of Derivative Free Optimization (DFO) with noisy function evaluations, exposing a fundamental and unavoidable gap between the performance of algorithms with access to gradients and those with access to only function evaluations. However, there are situations in which DFO is unavoidable, and for such situations we propose a new DFO algorithm that is proved to be near optimal for the class of strongly convex objective functions. A distinctive feature of the algorithm is that it uses only Boolean-valued function comparisons, rather than fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2434","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-18T03:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjrCfj8tmiAbCJqDDJB10vg2Ol7YAvQD1ckYl6ohI+LyeyS6ehQGRhKusW/XusL8caGmzPtjM5Gz58rfyr5OBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:40:22.073331Z"},"content_sha256":"bd30ccf124a6ca5eadf9cab2e3f7a2fd6e1a8c1090625e7d78557c4503223254","schema_version":"1.0","event_id":"sha256:bd30ccf124a6ca5eadf9cab2e3f7a2fd6e1a8c1090625e7d78557c4503223254"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EI2EIKNJVXS5A6FHELITK3T6WC/bundle.json","state_url":"https://pith.science/pith/EI2EIKNJVXS5A6FHELITK3T6WC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EI2EIKNJVXS5A6FHELITK3T6WC/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-05-31T11:40:22Z","links":{"resolver":"https://pith.science/pith/EI2EIKNJVXS5A6FHELITK3T6WC","bundle":"https://pith.science/pith/EI2EIKNJVXS5A6FHELITK3T6WC/bundle.json","state":"https://pith.science/pith/EI2EIKNJVXS5A6FHELITK3T6WC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EI2EIKNJVXS5A6FHELITK3T6WC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EI2EIKNJVXS5A6FHELITK3T6WC","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":"b8c8df2a5b1121eef7f40c72dd7702268815ead0f894f5ba4e1b6e448e6270e0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-11T20:37:02Z","title_canon_sha256":"54aead0c76d86831b10d9e4d93627716e3de541decc3e626aed7331d5db74c7f"},"schema_version":"1.0","source":{"id":"1209.2434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2434","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2434v1","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2434","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"EI2EIKNJVXS5","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EI2EIKNJVXS5A6FH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EI2EIKNJ","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:bd30ccf124a6ca5eadf9cab2e3f7a2fd6e1a8c1090625e7d78557c4503223254","target":"graph","created_at":"2026-05-18T03:45:43Z","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":"This paper provides lower bounds on the convergence rate of Derivative Free Optimization (DFO) with noisy function evaluations, exposing a fundamental and unavoidable gap between the performance of algorithms with access to gradients and those with access to only function evaluations. However, there are situations in which DFO is unavoidable, and for such situations we propose a new DFO algorithm that is proved to be near optimal for the class of strongly convex objective functions. A distinctive feature of the algorithm is that it uses only Boolean-valued function comparisons, rather than fun","authors_text":"Benjamin Recht, Kevin G. Jamieson, Robert D. Nowak","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-11T20:37:02Z","title":"Query Complexity of Derivative-Free Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2434","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:840ebe2bfce33650f511dfc1e94fc6dfd8f9d319761cdc5c0caa2cc4a642bc54","target":"record","created_at":"2026-05-18T03:45:43Z","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":"b8c8df2a5b1121eef7f40c72dd7702268815ead0f894f5ba4e1b6e448e6270e0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-11T20:37:02Z","title_canon_sha256":"54aead0c76d86831b10d9e4d93627716e3de541decc3e626aed7331d5db74c7f"},"schema_version":"1.0","source":{"id":"1209.2434","kind":"arxiv","version":1}},"canonical_sha256":"22344429a9ade5d078a722d1356e7eb08d07f8c5a8f115137961b7caac3d20ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22344429a9ade5d078a722d1356e7eb08d07f8c5a8f115137961b7caac3d20ba","first_computed_at":"2026-05-18T03:45:43.179402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:43.179402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+SCOd9x+tUljQZ88i6CeCic1AC2CJVZU1nuw2uKfq0Rdj44UCh485N1nhNo++9tkE3IXas3sClJFJUJ9CeOKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:43.179961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:840ebe2bfce33650f511dfc1e94fc6dfd8f9d319761cdc5c0caa2cc4a642bc54","sha256:bd30ccf124a6ca5eadf9cab2e3f7a2fd6e1a8c1090625e7d78557c4503223254"],"state_sha256":"d7861944e974919f481f98cce644497b14b303c08917d8a560418b32a49a3452"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ga/fWylLGW7xWAfpKClv+rKw8FKK25Ps7VIDeTfgFkQbL2z7Z927k5zxV4O1u/fJ4Q3FWe+3nI951DgWrUhSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:40:22.076992Z","bundle_sha256":"6d323dc835f374179a1a40437b725db7cc57d222910b2849ce66f5c6cc6037b8"}}