{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I663VPTPGB7WCSO55SSYEFZCJW","short_pith_number":"pith:I663VPTP","canonical_record":{"source":{"id":"1804.03761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-11T00:45:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ac1e6f2835654de2cd0170a5ee32c6a8a99ea3ee9f297f2d1e3481603e8770be","abstract_canon_sha256":"bf3249f21600f1f218c7f2d16e2e132ff01a187f20ae7c70ac0dd5722b509399"},"schema_version":"1.0"},"canonical_sha256":"47bdbabe6f307f6149ddeca58217224d946b1cd3f97fffa989efb98927f7ae39","source":{"kind":"arxiv","id":"1804.03761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03761","created_at":"2026-05-18T00:18:43Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03761v1","created_at":"2026-05-18T00:18:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03761","created_at":"2026-05-18T00:18:43Z"},{"alias_kind":"pith_short_12","alias_value":"I663VPTPGB7W","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I663VPTPGB7WCSO5","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I663VPTP","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I663VPTPGB7WCSO55SSYEFZCJW","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-11T00:45:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ac1e6f2835654de2cd0170a5ee32c6a8a99ea3ee9f297f2d1e3481603e8770be","abstract_canon_sha256":"bf3249f21600f1f218c7f2d16e2e132ff01a187f20ae7c70ac0dd5722b509399"},"schema_version":"1.0"},"canonical_sha256":"47bdbabe6f307f6149ddeca58217224d946b1cd3f97fffa989efb98927f7ae39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:43.128278Z","signature_b64":"uRJVjgrrsIfyV2lWnbU4ioTccpeS8IUu3X+8HM3wK3Ur9r1cUQUvzK3IM2yg1MVBOGpC5j2BWUoTWa3kco/YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47bdbabe6f307f6149ddeca58217224d946b1cd3f97fffa989efb98927f7ae39","last_reissued_at":"2026-05-18T00:18:43.127626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:43.127626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03761","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-18T00:18:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1wgsg0SvamB027nC8zPi2FY8kRlyZIl8b8uQQRwiKObHWknZUyviogK8ASwcSQLYbnFUDHK5SJpzR1uQeYOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:36:36.633779Z"},"content_sha256":"410878fa3ebd61f9e931649c719379a4cb0e69123ed013a6b013b90cd5e5e824","schema_version":"1.0","event_id":"sha256:410878fa3ebd61f9e931649c719379a4cb0e69123ed013a6b013b90cd5e5e824"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I663VPTPGB7WCSO55SSYEFZCJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Derivative free optimization via repeated classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"John C. Duchi, Steve Yadlowsky, Tatsunori B. Hashimoto","submitted_at":"2018-04-11T00:45:39Z","abstract_excerpt":"We develop an algorithm for minimizing a function using $n$ batched function value measurements at each of $T$ rounds by using classifiers to identify a function's sublevel set. We show that sufficiently accurate classifiers can achieve linear convergence rates, and show that the convergence rate is tied to the difficulty of active learning sublevel sets. Further, we show that the bootstrap is a computationally efficient approximation to the necessary classification scheme.\n  The end result is a computationally efficient derivative-free algorithm requiring no tuning that consistently outperfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03761","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-18T00:18:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6fck7fv8nnauvViP6BAYFvc5ELEWPCiyF+5rA1R2Vb8lsmMViuTldxiWHJaIuLhOpFHFzGGgMcZKtW9XWINBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:36:36.634546Z"},"content_sha256":"5ba324922940deae41c31bcd3b57ec0d751b25ab7984e4bbb4a6317278386859","schema_version":"1.0","event_id":"sha256:5ba324922940deae41c31bcd3b57ec0d751b25ab7984e4bbb4a6317278386859"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I663VPTPGB7WCSO55SSYEFZCJW/bundle.json","state_url":"https://pith.science/pith/I663VPTPGB7WCSO55SSYEFZCJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I663VPTPGB7WCSO55SSYEFZCJW/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-10T21:36:36Z","links":{"resolver":"https://pith.science/pith/I663VPTPGB7WCSO55SSYEFZCJW","bundle":"https://pith.science/pith/I663VPTPGB7WCSO55SSYEFZCJW/bundle.json","state":"https://pith.science/pith/I663VPTPGB7WCSO55SSYEFZCJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I663VPTPGB7WCSO55SSYEFZCJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I663VPTPGB7WCSO55SSYEFZCJW","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":"bf3249f21600f1f218c7f2d16e2e132ff01a187f20ae7c70ac0dd5722b509399","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-11T00:45:39Z","title_canon_sha256":"ac1e6f2835654de2cd0170a5ee32c6a8a99ea3ee9f297f2d1e3481603e8770be"},"schema_version":"1.0","source":{"id":"1804.03761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03761","created_at":"2026-05-18T00:18:43Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03761v1","created_at":"2026-05-18T00:18:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03761","created_at":"2026-05-18T00:18:43Z"},{"alias_kind":"pith_short_12","alias_value":"I663VPTPGB7W","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I663VPTPGB7WCSO5","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I663VPTP","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:5ba324922940deae41c31bcd3b57ec0d751b25ab7984e4bbb4a6317278386859","target":"graph","created_at":"2026-05-18T00:18: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":"We develop an algorithm for minimizing a function using $n$ batched function value measurements at each of $T$ rounds by using classifiers to identify a function's sublevel set. We show that sufficiently accurate classifiers can achieve linear convergence rates, and show that the convergence rate is tied to the difficulty of active learning sublevel sets. Further, we show that the bootstrap is a computationally efficient approximation to the necessary classification scheme.\n  The end result is a computationally efficient derivative-free algorithm requiring no tuning that consistently outperfor","authors_text":"John C. Duchi, Steve Yadlowsky, Tatsunori B. Hashimoto","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-11T00:45:39Z","title":"Derivative free optimization via repeated classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03761","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:410878fa3ebd61f9e931649c719379a4cb0e69123ed013a6b013b90cd5e5e824","target":"record","created_at":"2026-05-18T00:18: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":"bf3249f21600f1f218c7f2d16e2e132ff01a187f20ae7c70ac0dd5722b509399","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-11T00:45:39Z","title_canon_sha256":"ac1e6f2835654de2cd0170a5ee32c6a8a99ea3ee9f297f2d1e3481603e8770be"},"schema_version":"1.0","source":{"id":"1804.03761","kind":"arxiv","version":1}},"canonical_sha256":"47bdbabe6f307f6149ddeca58217224d946b1cd3f97fffa989efb98927f7ae39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47bdbabe6f307f6149ddeca58217224d946b1cd3f97fffa989efb98927f7ae39","first_computed_at":"2026-05-18T00:18:43.127626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:43.127626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uRJVjgrrsIfyV2lWnbU4ioTccpeS8IUu3X+8HM3wK3Ur9r1cUQUvzK3IM2yg1MVBOGpC5j2BWUoTWa3kco/YAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:43.128278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:410878fa3ebd61f9e931649c719379a4cb0e69123ed013a6b013b90cd5e5e824","sha256:5ba324922940deae41c31bcd3b57ec0d751b25ab7984e4bbb4a6317278386859"],"state_sha256":"8115fbb9c289fed64abfe4c2500184cb88b5d53efa26aa27fb4565087aacaa52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"28iojBu0X4G9mEJ7Hpv6vJLopzlI5lNIgNgi2kxaq3VY1XA5KXRodRAPxCpOOigxZXUfHTGq5+GTojuw+t9SAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:36:36.638704Z","bundle_sha256":"5713244b5be19d4f34fdf7be85710ead72ff9c48b0d524412fc1cc57195a5ad1"}}