{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SZGYFOHTKDVP4KWQQJKHIRA2YY","short_pith_number":"pith:SZGYFOHT","schema_version":"1.0","canonical_sha256":"964d82b8f350eafe2ad0825474441ac62d7407cd22a80e502b8d300a2c4fb0e2","source":{"kind":"arxiv","id":"1104.0350","version":1},"attestation_state":"computed","paper":{"title":"Convergence of the restricted Nelder-Mead algorithm in two dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Bjorn Poonen, Jeffrey C. Lagarias, Margaret H. Wright","submitted_at":"2011-04-03T04:01:42Z","abstract_excerpt":"The Nelder-Mead algorithm, a longstanding direct search method for unconstrained optimization published in 1965, is designed to minimize a scalar-valued function f of n real variables using only function values, without any derivative information. Each Nelder-Mead iteration is associated with a nondegenerate simplex defined by n+1 vertices and their function values; a typical iteration produces a new simplex by replacing the worst vertex by a new point. Despite the method's widespread use, theoretical results have been limited: for strictly convex objective functions of one variable with bound"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1104.0350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-03T04:01:42Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"e081b9b6965d7c796a1d2190b898f85306f932cd9b0a95defc082f1f467628ba","abstract_canon_sha256":"398d8e1de2f1c19d158a5c99b56f1f49d4e7963ed48b26ee37d63adb4b33a90d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:34.169061Z","signature_b64":"kXg+C6kx2+jGOnWXeFYeTmQBpwZj/PAHH6p43V4AULYLTjhYG/qMhPuq0fkxr+RBUqo1lP0qEvHPT5GhNoDTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"964d82b8f350eafe2ad0825474441ac62d7407cd22a80e502b8d300a2c4fb0e2","last_reissued_at":"2026-05-18T00:47:34.168464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:34.168464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of the restricted Nelder-Mead algorithm in two dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Bjorn Poonen, Jeffrey C. Lagarias, Margaret H. Wright","submitted_at":"2011-04-03T04:01:42Z","abstract_excerpt":"The Nelder-Mead algorithm, a longstanding direct search method for unconstrained optimization published in 1965, is designed to minimize a scalar-valued function f of n real variables using only function values, without any derivative information. Each Nelder-Mead iteration is associated with a nondegenerate simplex defined by n+1 vertices and their function values; a typical iteration produces a new simplex by replacing the worst vertex by a new point. Despite the method's widespread use, theoretical results have been limited: for strictly convex objective functions of one variable with bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0350","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.0350","created_at":"2026-05-18T00:47:34.168543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.0350v1","created_at":"2026-05-18T00:47:34.168543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0350","created_at":"2026-05-18T00:47:34.168543+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZGYFOHTKDVP","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZGYFOHTKDVP4KWQ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZGYFOHT","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY","json":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY.json","graph_json":"https://pith.science/api/pith-number/SZGYFOHTKDVP4KWQQJKHIRA2YY/graph.json","events_json":"https://pith.science/api/pith-number/SZGYFOHTKDVP4KWQQJKHIRA2YY/events.json","paper":"https://pith.science/paper/SZGYFOHT"},"agent_actions":{"view_html":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY","download_json":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY.json","view_paper":"https://pith.science/paper/SZGYFOHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.0350&json=true","fetch_graph":"https://pith.science/api/pith-number/SZGYFOHTKDVP4KWQQJKHIRA2YY/graph.json","fetch_events":"https://pith.science/api/pith-number/SZGYFOHTKDVP4KWQQJKHIRA2YY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/action/storage_attestation","attest_author":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/action/author_attestation","sign_citation":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/action/citation_signature","submit_replication":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/action/replication_record"}},"created_at":"2026-05-18T00:47:34.168543+00:00","updated_at":"2026-05-18T00:47:34.168543+00:00"}