{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WZW6RGDCVRS45EHP5ZZSET64HZ","short_pith_number":"pith:WZW6RGDC","schema_version":"1.0","canonical_sha256":"b66de89862ac65ce90efee73224fdc3e48d04e46c5bc2740a535a0fae68f65a9","source":{"kind":"arxiv","id":"2606.01506","version":1},"attestation_state":"computed","paper":{"title":"An arc-search BFGS algorithm for unconstrained nonlinear optimization problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yaguang Yang","submitted_at":"2026-06-01T00:06:36Z","abstract_excerpt":"The classical BFGS algorithm performs excellently for convex optimization problems. However, for non-convex problems, the classical BFGS method may fail to converge reliably. To overcome this limitation, researchers have developed modified BFGS methods that are applicable to both convex and non-convex optimization problems. Among these methods, a robust BFGS algorithm has been shown to achieve global convergence and fast local convergence, with a superlinear convergence rate, for both convex and non-convex nonlinear optimization problems under mild assumptions. In this paper, we propose an arc"},"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":"2606.01506","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T00:06:36Z","cross_cats_sorted":[],"title_canon_sha256":"90b0a986bc7bb17358ef7d226271dcb82b32c95be854ac6c23029c4b067ddf2b","abstract_canon_sha256":"32e7cded2dc8241e61a75bfac21b3c4636a4640551867cb40a46149670df4503"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:35.007217Z","signature_b64":"8iAjvcwxd9ovl+hQGOkZP4vOvdiLiR/0IVo119b0y2UOKuMTDwotzMgRKyn/EqwjfWUjaeND1giiwe8uGEtiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b66de89862ac65ce90efee73224fdc3e48d04e46c5bc2740a535a0fae68f65a9","last_reissued_at":"2026-06-02T02:04:35.006827Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:35.006827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An arc-search BFGS algorithm for unconstrained nonlinear optimization problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yaguang Yang","submitted_at":"2026-06-01T00:06:36Z","abstract_excerpt":"The classical BFGS algorithm performs excellently for convex optimization problems. However, for non-convex problems, the classical BFGS method may fail to converge reliably. To overcome this limitation, researchers have developed modified BFGS methods that are applicable to both convex and non-convex optimization problems. Among these methods, a robust BFGS algorithm has been shown to achieve global convergence and fast local convergence, with a superlinear convergence rate, for both convex and non-convex nonlinear optimization problems under mild assumptions. In this paper, we propose an arc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01506","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01506/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.01506","created_at":"2026-06-02T02:04:35.006885+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01506v1","created_at":"2026-06-02T02:04:35.006885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01506","created_at":"2026-06-02T02:04:35.006885+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZW6RGDCVRS4","created_at":"2026-06-02T02:04:35.006885+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZW6RGDCVRS45EHP","created_at":"2026-06-02T02:04:35.006885+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZW6RGDC","created_at":"2026-06-02T02:04:35.006885+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/WZW6RGDCVRS45EHP5ZZSET64HZ","json":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ.json","graph_json":"https://pith.science/api/pith-number/WZW6RGDCVRS45EHP5ZZSET64HZ/graph.json","events_json":"https://pith.science/api/pith-number/WZW6RGDCVRS45EHP5ZZSET64HZ/events.json","paper":"https://pith.science/paper/WZW6RGDC"},"agent_actions":{"view_html":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ","download_json":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ.json","view_paper":"https://pith.science/paper/WZW6RGDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01506&json=true","fetch_graph":"https://pith.science/api/pith-number/WZW6RGDCVRS45EHP5ZZSET64HZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WZW6RGDCVRS45EHP5ZZSET64HZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/action/storage_attestation","attest_author":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/action/author_attestation","sign_citation":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/action/citation_signature","submit_replication":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/action/replication_record"}},"created_at":"2026-06-02T02:04:35.006885+00:00","updated_at":"2026-06-02T02:04:35.006885+00:00"}