{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SZGYFOHTKDVP4KWQQJKHIRA2YY","short_pith_number":"pith:SZGYFOHT","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"},"canonical_sha256":"964d82b8f350eafe2ad0825474441ac62d7407cd22a80e502b8d300a2c4fb0e2","source":{"kind":"arxiv","id":"1104.0350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0350","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0350v1","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0350","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"SZGYFOHTKDVP","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SZGYFOHTKDVP4KWQ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SZGYFOHT","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SZGYFOHTKDVP4KWQQJKHIRA2YY","target":"record","payload":{"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"},"canonical_sha256":"964d82b8f350eafe2ad0825474441ac62d7407cd22a80e502b8d300a2c4fb0e2","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"},"source_kind":"arxiv","source_id":"1104.0350","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:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJcgk8YBCGBFgpLx3iQM8+HvYEWc4b3IfTnONc3wKhrmD8UlJpv2zjfbto9ISEjZvAaFVj5Bea/s5136W36xDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:36:07.381346Z"},"content_sha256":"08bee21d848ff5c12617c1568ef8299551a65a5ae61f829a4fe052b9470187a6","schema_version":"1.0","event_id":"sha256:08bee21d848ff5c12617c1568ef8299551a65a5ae61f829a4fe052b9470187a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SZGYFOHTKDVP4KWQQJKHIRA2YY","target":"graph","payload":{"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"},"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:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"is1yOggB0xr1uZathtnPnwrgf9yYqxUO0Rfph5hN7fIv4NyX/e77vIWTBFhOCgbqtVG0EvMXsdWsqVNodqLJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:36:07.381896Z"},"content_sha256":"68c5052522592cb832241d7bd525d85822910749bb2275e09d1c7c75b3e96680","schema_version":"1.0","event_id":"sha256:68c5052522592cb832241d7bd525d85822910749bb2275e09d1c7c75b3e96680"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/bundle.json","state_url":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/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-27T07:36:07Z","links":{"resolver":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY","bundle":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/bundle.json","state":"https://pith.science/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZGYFOHTKDVP4KWQQJKHIRA2YY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SZGYFOHTKDVP4KWQQJKHIRA2YY","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":"398d8e1de2f1c19d158a5c99b56f1f49d4e7963ed48b26ee37d63adb4b33a90d","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-03T04:01:42Z","title_canon_sha256":"e081b9b6965d7c796a1d2190b898f85306f932cd9b0a95defc082f1f467628ba"},"schema_version":"1.0","source":{"id":"1104.0350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0350","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0350v1","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0350","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"SZGYFOHTKDVP","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SZGYFOHTKDVP4KWQ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SZGYFOHT","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:68c5052522592cb832241d7bd525d85822910749bb2275e09d1c7c75b3e96680","target":"graph","created_at":"2026-05-18T00:47:34Z","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":"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","authors_text":"Bjorn Poonen, Jeffrey C. Lagarias, Margaret H. Wright","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-03T04:01:42Z","title":"Convergence of the restricted Nelder-Mead algorithm in two dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0350","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:08bee21d848ff5c12617c1568ef8299551a65a5ae61f829a4fe052b9470187a6","target":"record","created_at":"2026-05-18T00:47:34Z","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":"398d8e1de2f1c19d158a5c99b56f1f49d4e7963ed48b26ee37d63adb4b33a90d","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-03T04:01:42Z","title_canon_sha256":"e081b9b6965d7c796a1d2190b898f85306f932cd9b0a95defc082f1f467628ba"},"schema_version":"1.0","source":{"id":"1104.0350","kind":"arxiv","version":1}},"canonical_sha256":"964d82b8f350eafe2ad0825474441ac62d7407cd22a80e502b8d300a2c4fb0e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"964d82b8f350eafe2ad0825474441ac62d7407cd22a80e502b8d300a2c4fb0e2","first_computed_at":"2026-05-18T00:47:34.168464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:34.168464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kXg+C6kx2+jGOnWXeFYeTmQBpwZj/PAHH6p43V4AULYLTjhYG/qMhPuq0fkxr+RBUqo1lP0qEvHPT5GhNoDTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:34.169061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08bee21d848ff5c12617c1568ef8299551a65a5ae61f829a4fe052b9470187a6","sha256:68c5052522592cb832241d7bd525d85822910749bb2275e09d1c7c75b3e96680"],"state_sha256":"8525b434ccfc0754fa06255b855bfc13e173dc241227fdfb3ca09086bdcc8fe0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyZZT0Qnq+nvyWwi5lcyn0uR3EKo7z9y/RbmPo5nxzipW7jsdhfD/HcerMqZlOywp2IT2na6TjVCqQA3Q5wvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:36:07.384539Z","bundle_sha256":"1a9e872c5eff0b4ba8b99f272bff07441f1827d360b4f543f4b05df056905a19"}}