{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KRIOWY4J2EUXMP2MVS77JXQT3S","short_pith_number":"pith:KRIOWY4J","canonical_record":{"source":{"id":"1410.0390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-01T21:42:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"321d609c4a60cd28ac815f7a6859bb1fcd295065f8c7dc766d50c245570a63d2","abstract_canon_sha256":"a6e07b56dd3f37a037b3e497f6194485a34633dd7b21a634292f0ce020d146fb"},"schema_version":"1.0"},"canonical_sha256":"5450eb6389d129763f4cacbff4de13dca0cfe3771b64700aaa230c6e79342795","source":{"kind":"arxiv","id":"1410.0390","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0390","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0390v2","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0390","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"KRIOWY4J2EUX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KRIOWY4J2EUXMP2M","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KRIOWY4J","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KRIOWY4J2EUXMP2MVS77JXQT3S","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-01T21:42:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"321d609c4a60cd28ac815f7a6859bb1fcd295065f8c7dc766d50c245570a63d2","abstract_canon_sha256":"a6e07b56dd3f37a037b3e497f6194485a34633dd7b21a634292f0ce020d146fb"},"schema_version":"1.0"},"canonical_sha256":"5450eb6389d129763f4cacbff4de13dca0cfe3771b64700aaa230c6e79342795","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:44.241303Z","signature_b64":"q/9jkPcUPT0Nn27nTbZmWwbXp59g73tfnz+lKhlHpGgHIurutW8x4pbx1tjHYwFfEBRNSt6XiEHj9Vorx9v4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5450eb6389d129763f4cacbff4de13dca0cfe3771b64700aaa230c6e79342795","last_reissued_at":"2026-05-18T02:37:44.240842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:44.240842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0390","source_version":2,"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-18T02:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7FeFGMRKCvsPE6+R+ie+Z/pAgsbZGD+fvj6S5KVLJ1dbHEPNrX+bddZQ1t0oQmE5lWwpbHfARhB9Y848Qk68Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:54:43.300273Z"},"content_sha256":"2bab279c96ababca6aa71323c48502ad66f932a2ea96c9f8bfb70d17144bfdb6","schema_version":"1.0","event_id":"sha256:2bab279c96ababca6aa71323c48502ad66f932a2ea96c9f8bfb70d17144bfdb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KRIOWY4J2EUXMP2MVS77JXQT3S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Complexity Analysis of Simplified Direct Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik","submitted_at":"2014-10-01T21:42:04Z","abstract_excerpt":"We consider the problem of unconstrained minimization of a smooth function in the derivative-free setting using. In particular, we propose and study a simplified variant of the direct search method (of direction type), which we call simplified direct search (SDS). Unlike standard direct search methods, which depend on a large number of parameters that need to be tuned, SDS depends on a single scalar parameter only.\n  Despite relevant research activity in direct search methods spanning several decades, complexity guarantees---bounds on the number of function evaluations needed to find an approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0390","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":""},"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-18T02:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6O94FJ39wOkSm2Pmk3Ie/E0ZW/qiA0rmYfCVOvjY6PKp95kjvOdtNx4MFYiJSXZwCwEJVDj92xpnI0Cl4hlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:54:43.301052Z"},"content_sha256":"2a6bdf8214c4546d02615201beda345df7f24ffd0f088e94d70444131a7588f3","schema_version":"1.0","event_id":"sha256:2a6bdf8214c4546d02615201beda345df7f24ffd0f088e94d70444131a7588f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRIOWY4J2EUXMP2MVS77JXQT3S/bundle.json","state_url":"https://pith.science/pith/KRIOWY4J2EUXMP2MVS77JXQT3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRIOWY4J2EUXMP2MVS77JXQT3S/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-09T19:54:43Z","links":{"resolver":"https://pith.science/pith/KRIOWY4J2EUXMP2MVS77JXQT3S","bundle":"https://pith.science/pith/KRIOWY4J2EUXMP2MVS77JXQT3S/bundle.json","state":"https://pith.science/pith/KRIOWY4J2EUXMP2MVS77JXQT3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRIOWY4J2EUXMP2MVS77JXQT3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KRIOWY4J2EUXMP2MVS77JXQT3S","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":"a6e07b56dd3f37a037b3e497f6194485a34633dd7b21a634292f0ce020d146fb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-01T21:42:04Z","title_canon_sha256":"321d609c4a60cd28ac815f7a6859bb1fcd295065f8c7dc766d50c245570a63d2"},"schema_version":"1.0","source":{"id":"1410.0390","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0390","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0390v2","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0390","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"KRIOWY4J2EUX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KRIOWY4J2EUXMP2M","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KRIOWY4J","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:2a6bdf8214c4546d02615201beda345df7f24ffd0f088e94d70444131a7588f3","target":"graph","created_at":"2026-05-18T02:37:44Z","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 consider the problem of unconstrained minimization of a smooth function in the derivative-free setting using. In particular, we propose and study a simplified variant of the direct search method (of direction type), which we call simplified direct search (SDS). Unlike standard direct search methods, which depend on a large number of parameters that need to be tuned, SDS depends on a single scalar parameter only.\n  Despite relevant research activity in direct search methods spanning several decades, complexity guarantees---bounds on the number of function evaluations needed to find an approx","authors_text":"Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-01T21:42:04Z","title":"Simple Complexity Analysis of Simplified Direct Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0390","kind":"arxiv","version":2},"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:2bab279c96ababca6aa71323c48502ad66f932a2ea96c9f8bfb70d17144bfdb6","target":"record","created_at":"2026-05-18T02:37:44Z","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":"a6e07b56dd3f37a037b3e497f6194485a34633dd7b21a634292f0ce020d146fb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-01T21:42:04Z","title_canon_sha256":"321d609c4a60cd28ac815f7a6859bb1fcd295065f8c7dc766d50c245570a63d2"},"schema_version":"1.0","source":{"id":"1410.0390","kind":"arxiv","version":2}},"canonical_sha256":"5450eb6389d129763f4cacbff4de13dca0cfe3771b64700aaa230c6e79342795","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5450eb6389d129763f4cacbff4de13dca0cfe3771b64700aaa230c6e79342795","first_computed_at":"2026-05-18T02:37:44.240842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:44.240842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q/9jkPcUPT0Nn27nTbZmWwbXp59g73tfnz+lKhlHpGgHIurutW8x4pbx1tjHYwFfEBRNSt6XiEHj9Vorx9v4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:44.241303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0390","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bab279c96ababca6aa71323c48502ad66f932a2ea96c9f8bfb70d17144bfdb6","sha256:2a6bdf8214c4546d02615201beda345df7f24ffd0f088e94d70444131a7588f3"],"state_sha256":"cf53c0111cf8177fab4218e457c5b552244b40192c1f593b23a943aa164d1b05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TJRRnT/xOb7C6vhnsm24HH7Nu2E6Ysfapcr08eY0BRKMplebmVD7JlCOaRRX3xBFn1QDvYRzwskoyK84W7jCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:54:43.305296Z","bundle_sha256":"7d61c6f97b467052d5948b4abb5a458df210c172bfba5579d9d7bfb9878305a5"}}