{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WZW6RGDCVRS45EHP5ZZSET64HZ","short_pith_number":"pith:WZW6RGDC","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"},"canonical_sha256":"b66de89862ac65ce90efee73224fdc3e48d04e46c5bc2740a535a0fae68f65a9","source":{"kind":"arxiv","id":"2606.01506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01506","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01506v1","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01506","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"WZW6RGDCVRS4","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"WZW6RGDCVRS45EHP","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"WZW6RGDC","created_at":"2026-06-02T02:04:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WZW6RGDCVRS45EHP5ZZSET64HZ","target":"record","payload":{"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"},"canonical_sha256":"b66de89862ac65ce90efee73224fdc3e48d04e46c5bc2740a535a0fae68f65a9","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"},"source_kind":"arxiv","source_id":"2606.01506","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-06-02T02:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WACi94xoq/lxpNAdeXKmM9csRigcrsmDbCT38PF+5sGXbohjknb4SYNyd5iMpz3HtJFlmJpTJWaUrWjRGtPxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:13:47.283149Z"},"content_sha256":"c517d0e1a22e0a1086e4576d556e516bacd9b5d37e38e96b279623066e037e8b","schema_version":"1.0","event_id":"sha256:c517d0e1a22e0a1086e4576d556e516bacd9b5d37e38e96b279623066e037e8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WZW6RGDCVRS45EHP5ZZSET64HZ","target":"graph","payload":{"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"},"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-06-02T02:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBT9R4sAxKSKYu2WlaFxQrg5dLV1+BGYnM7yTntMYejUp0KpQr8euPlenYqsPl7q4ErLTJeweVREGLZI0dpEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:13:47.283543Z"},"content_sha256":"3e398d571589740569c8b5e15030b4ea61e1529bc91c91b6a850fd966a6810e7","schema_version":"1.0","event_id":"sha256:3e398d571589740569c8b5e15030b4ea61e1529bc91c91b6a850fd966a6810e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/bundle.json","state_url":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/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-30T13:13:47Z","links":{"resolver":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ","bundle":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/bundle.json","state":"https://pith.science/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZW6RGDCVRS45EHP5ZZSET64HZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WZW6RGDCVRS45EHP5ZZSET64HZ","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":"32e7cded2dc8241e61a75bfac21b3c4636a4640551867cb40a46149670df4503","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T00:06:36Z","title_canon_sha256":"90b0a986bc7bb17358ef7d226271dcb82b32c95be854ac6c23029c4b067ddf2b"},"schema_version":"1.0","source":{"id":"2606.01506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01506","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01506v1","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01506","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"WZW6RGDCVRS4","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"WZW6RGDCVRS45EHP","created_at":"2026-06-02T02:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"WZW6RGDC","created_at":"2026-06-02T02:04:35Z"}],"graph_snapshots":[{"event_id":"sha256:3e398d571589740569c8b5e15030b4ea61e1529bc91c91b6a850fd966a6810e7","target":"graph","created_at":"2026-06-02T02:04:35Z","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/2606.01506/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Yaguang Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T00:06:36Z","title":"An arc-search BFGS algorithm for unconstrained nonlinear optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01506","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:c517d0e1a22e0a1086e4576d556e516bacd9b5d37e38e96b279623066e037e8b","target":"record","created_at":"2026-06-02T02:04:35Z","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":"32e7cded2dc8241e61a75bfac21b3c4636a4640551867cb40a46149670df4503","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-01T00:06:36Z","title_canon_sha256":"90b0a986bc7bb17358ef7d226271dcb82b32c95be854ac6c23029c4b067ddf2b"},"schema_version":"1.0","source":{"id":"2606.01506","kind":"arxiv","version":1}},"canonical_sha256":"b66de89862ac65ce90efee73224fdc3e48d04e46c5bc2740a535a0fae68f65a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b66de89862ac65ce90efee73224fdc3e48d04e46c5bc2740a535a0fae68f65a9","first_computed_at":"2026-06-02T02:04:35.006827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:35.006827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8iAjvcwxd9ovl+hQGOkZP4vOvdiLiR/0IVo119b0y2UOKuMTDwotzMgRKyn/EqwjfWUjaeND1giiwe8uGEtiBg==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:35.007217Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c517d0e1a22e0a1086e4576d556e516bacd9b5d37e38e96b279623066e037e8b","sha256:3e398d571589740569c8b5e15030b4ea61e1529bc91c91b6a850fd966a6810e7"],"state_sha256":"e2d326a536d2e51c3ca5782325d261436e00c747f0814cd331fc1a12fee023a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dMwiN6+Q3oHIfi2+4XgczjpYQ26vpD75Wti+oiGJGs/qRhBTOxijqiMsRrZEoUT3VxWkiQs+S4gNBl7hJIUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T13:13:47.285538Z","bundle_sha256":"f5d19caa5c648f669b5cc7a38e4e0b0a87c4becad5b454c1738356411fdceb7f"}}