{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:A6ZXLEEC5AILVVCS42DCVGVXWY","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":"f0b858b38a8daf597d399479f33662e2908b72a7da1697964b911625bd1b2be3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-22T17:29:21Z","title_canon_sha256":"6052776a63653ae6c43cecd16f7100bdc06efc16a1196c7e1c56ea5469e67936"},"schema_version":"1.0","source":{"id":"2508.16561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.16561","created_at":"2026-07-05T11:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"2508.16561v1","created_at":"2026-07-05T11:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16561","created_at":"2026-07-05T11:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"A6ZXLEEC5AIL","created_at":"2026-07-05T11:57:50Z"},{"alias_kind":"pith_short_16","alias_value":"A6ZXLEEC5AILVVCS","created_at":"2026-07-05T11:57:50Z"},{"alias_kind":"pith_short_8","alias_value":"A6ZXLEEC","created_at":"2026-07-05T11:57:50Z"}],"graph_snapshots":[{"event_id":"sha256:ad0cc837c62b7b64870fd775cb0af3449fbe51c9e0b81fd622947d34a19a5823","target":"graph","created_at":"2026-07-05T11:57:50Z","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/2508.16561/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Simplex-type methods, such as the well-known Nelder-Mead algorithm, are widely used in derivative-free optimization (DFO), particularly in practice. Despite their popularity, the theoretical understanding of their convergence properties has been limited, and until very recently essentially no worst-case complexity bounds were available. Recently, Cao et al. provided a sharp error bound for linear interpolation and extrapolation and derived a worst-case complexity result for a basic simplex-type method. Motivated by this, we propose a practical and provable algorithm -- the regular simplicial s","authors_text":"Jinxin Wang, Liyuan Cao, Wei Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-22T17:29:21Z","title":"Complexity Analysis of the Regular Simplicial Search Method with Reflection and Shrinking Steps for Derivative-Free Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16561","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:9f5da3f45f1ee88d9a9ace1347894dd287440887cd284a563a05d252a00b7eaf","target":"record","created_at":"2026-07-05T11:57:50Z","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":"f0b858b38a8daf597d399479f33662e2908b72a7da1697964b911625bd1b2be3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-22T17:29:21Z","title_canon_sha256":"6052776a63653ae6c43cecd16f7100bdc06efc16a1196c7e1c56ea5469e67936"},"schema_version":"1.0","source":{"id":"2508.16561","kind":"arxiv","version":1}},"canonical_sha256":"07b3759082e810bad452e6862a9ab7b6282dc56626c407966047ca35638a45fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07b3759082e810bad452e6862a9ab7b6282dc56626c407966047ca35638a45fa","first_computed_at":"2026-07-05T11:57:50.889087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:57:50.889087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ptYT3RRV01YOF+1hiFqkyoh1DFZkV32s4+k0ivLZSjtY2qf2f1pWWzvDgHnpI06EqBUl6W6lo41VmOs9kvhYAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:57:50.889574Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.16561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f5da3f45f1ee88d9a9ace1347894dd287440887cd284a563a05d252a00b7eaf","sha256:ad0cc837c62b7b64870fd775cb0af3449fbe51c9e0b81fd622947d34a19a5823"],"state_sha256":"dc7677e2a103539849cae24bc4fe93acb8434b3ee5ca3838ef50c286c1608c75"}