{"as_of":"2026-08-10T15:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9db3413afcead1bb3a15722925294ad3d4ca6390456ff55f8b69eb17ce81553b","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:17:59.046050Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T00:56:13.855741Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T09:21:25.556906Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"cited_work":{"arxiv_id":"2506.22332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22332","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodard, M","venue":null,"work_id":"1864610a-0642-431f-a9db-3b2c111f107e","year":2025},"citing_paper":{"arxiv_id":"2604.14503","last_updated":"2026-04-16T00:34:58Z","snapshot_observed_at":"2026-07-06T23:02:18.425249Z","submitted_at":"2026-04-16T00:34:58Z","title":"PANOC-lite: A simpler and more efficient algorithm for composite minimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T11:26:20.231350Z"},"links":{"cited_paper":"/paper/2506.22332","citing_paper":"/paper/2604.14503"},"observation_digest":"sha256:756f60c6675b306cc9eb779dcad32fbe1b9b011eeb4e737d9dc2ba31b230d828","observation_id":"dd1670b6-e1a3-4d59-9c67-b7bc2f08bebb","resolution":{"observed_at":"2026-05-10T11:30:18.989208Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"cited_work":{"arxiv_id":"2506.22332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22332","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodard, M","venue":null,"work_id":"1864610a-0642-431f-a9db-3b2c111f107e","year":2025},"citing_paper":{"arxiv_id":"2604.26735","last_updated":"2026-04-29T14:36:49Z","snapshot_observed_at":"2026-08-09T09:23:31.768832Z","submitted_at":"2026-04-29T14:36:49Z","title":"Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T11:25:15.156063Z"},"links":{"cited_paper":"/paper/2506.22332","citing_paper":"/paper/2604.26735"},"observation_digest":"sha256:2c69ae867e43b77e97e9638a0aeef5c281c5aa69ed30b8973d2fc25b2144a922","observation_id":"67b93aeb-cf1b-43e6-a74a-4403d15c45be","resolution":{"observed_at":"2026-05-12T09:21:25.558821Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"cited_work":{"arxiv_id":"2506.22332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22332","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodard, M","venue":null,"work_id":"1864610a-0642-431f-a9db-3b2c111f107e","year":2025},"citing_paper":{"arxiv_id":"2605.08474","last_updated":"2026-05-08T20:50:40Z","snapshot_observed_at":"2026-07-06T23:20:43.010758Z","submitted_at":"2026-05-08T20:50:40Z","title":"Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-12T00:56:13.855741Z"},"links":{"cited_paper":"/paper/2506.22332","citing_paper":"/paper/2605.08474"},"observation_digest":"sha256:43ab051c6b6c1bbd64838c5a2446f089f254a684e4b2c019cbdbb00b82357153","observation_id":"4c4143a2-53e9-4e45-975d-a562fb7b7201","resolution":{"observed_at":"2026-05-12T08:36:25.862037Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.22332/citation-record","integrity":"/paper/2506.22332/integrity","json":"/paper/2506.22332/citation-record.json","paper":"/paper/2506.22332"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.740967Z","title":"Trust-Region Methods on Riemannian Mani- folds","venue":null,"work_id":"0dba3b61-07b6-468e-b313-2463720ef604","year":2007},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.206848Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:65167a642de7ca34bef956b94116179b7a2b3ea95698fe69f50bbe574bb34bdd","observation_id":"6283fa3c-9a11-4208-83a8-0c2b2c851546","resolution":{"observed_at":"2026-08-06T22:18:07.813817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.637312Z","title":"A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization","venue":null,"work_id":"a8d4359f-ef1f-4eca-abb7-79a8704a3f01","year":2022},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.258236Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:6833cb09dd16659ae35aafe46d7381d1ec3fa85ef83669afc889f07fedb797c5","observation_id":"bade81b3-b407-49a9-92fd-ea85a07ce6e0","resolution":{"observed_at":"2026-08-06T22:18:07.701264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.510400Z","title":"A proximal trust-region method for nonsmooth opti- mization with inexact function and gradient evaluations","venue":null,"work_id":"226ee8e8-da9e-4133-8f69-366e96d0e860","year":2023},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.321195Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:d162e3451ecabfc6b862fb7dce7ff9b04f035b28c64db7dc652522c959c4d19e","observation_id":"4c5f896e-ae9f-44c6-a4da-b02a56aa1362","resolution":{"observed_at":"2026-08-06T22:18:07.589488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.419228Z","title":"A Fast Iterative Shrinkage-Thresholding Algorithm for Lin- ear Inverse Problems","venue":null,"work_id":"f0909abc-a0d6-4158-8fe0-45cc2701450d","year":2009},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.361972Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:0613d49dfd5634b87470f324c75871f491f04975a673254fe2f62888dcede5a4","observation_id":"76004b88-6d89-4f42-a63d-122c18b4d2d6","resolution":{"observed_at":"2026-08-06T22:18:07.465779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.317992Z","title":"Global Optimality of Local Search for Low Rank Matrix Recovery","venue":null,"work_id":"415e63f7-5821-4788-9893-69c53cdb5c48","year":2016},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.430010Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:26aaea89ec85abc4e568ba2b9e7a54ddbadc6a5421c17fc472043ab2536105cb","observation_id":"9701cfec-83a2-4acb-88ac-37c71483099e","resolution":{"observed_at":"2026-08-06T22:18:07.358428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.198861Z","title":"PANTR: A Proximal Algorithm With Trust- Region Updates for Nonconvex Constrained Optimization","venue":null,"work_id":"e429091b-c0be-4de4-8b48-4204b2d43f40","year":2023},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.478891Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:2a2c8fff7d599edf2ff97d9f0c6682b17b80940fb1147504d63de5029d62ba89","observation_id":"315e5f9a-5564-4d5d-b289-57cad882a3b2","resolution":{"observed_at":"2026-08-06T22:18:07.255010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.098148Z","title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","venue":null,"work_id":"2f38aea7-964c-4cbe-9558-0fa06dc5c1ab","year":2014},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.530303Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:f35f3bfc9827c6b73221bd04df5a4b7c3319fc657c8c5e20f8f6a4fb290f332e","observation_id":"d495826a-4244-49e7-97d0-ca181f0c353e","resolution":{"observed_at":"2026-08-06T22:18:07.157591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.983062Z","title":"Bonnans and A","venue":null,"work_id":"479fe56b-f4b0-4ca3-96c5-bf1d73db619e","year":2000},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.606905Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:bf97586edf6c4ce9d0e478630b69c07cbaa7b2ce127e1f36be1b8398c2051242","observation_id":"1d5a4bd8-d3fd-47bd-a3e8-8fa37bcc094c","resolution":{"observed_at":"2026-08-06T22:18:07.042874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.887831Z","title":"Gradient Descent Provably Escapes Saddle Points in the Training of Shallow ReLU Networks","venue":null,"work_id":"873fbe66-9012-48e0-b28b-fd2843702d06","year":2024},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.654528Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:8fc478bf7d47c5252b3b8cb8f5536de7d26a17e178a59c051cd710a806c6642f","observation_id":"20ce7c56-b1d8-4f99-89a3-77a36b1316c6","resolution":{"observed_at":"2026-08-06T22:18:06.935346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.779915Z","title":null,"venue":null,"work_id":"6e500096-8416-490b-8ef3-cd694edea841","year":2000},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.720566Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:a796022c6b8af19d69fcced3a045a6a1804d9b10e588acdb6ddfd87d55f7ad33","observation_id":"bec9a706-51da-45c6-bace-8f6d4a25e6dd","resolution":{"observed_at":"2026-08-06T22:18:06.829576Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.664315Z","title":"Orthogonal Invariance and Identi- fiability","venue":null,"work_id":"42022391-a488-4340-88ec-a82e1768b987","year":2014},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.762334Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:2ff5d7a9eeed4b94a82298e9c08a638a39af6ff13f21c9c7c298957b1db16920","observation_id":"de51bee6-cf7d-4218-8a9c-3a076432fc2b","resolution":{"observed_at":"2026-08-06T22:18:06.729614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.543340Z","title":"Geometrical interpretation of the predictor- corrector type algorithms in structured optimization problems","venue":null,"work_id":"deab9a15-b83f-407d-a13f-af622d79e79e","year":2006},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.805271Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:16d7414e1f7956e9bfbc72e0de022e36da224b3a2ba0e655548a80f93d49ce43","observation_id":"93297b93-b003-4085-85dd-ee168d863560","resolution":{"observed_at":"2026-08-06T22:18:06.625336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.400131Z","title":"Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization","venue":null,"work_id":"6700de87-029e-4010-913f-4eb905b69669","year":2022},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.869474Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:fb24c9df6ae740c15cd099584d1e535016f1bd7bdc24698ac94d283e4334eff5","observation_id":"9c560bc6-3f33-46f0-af38-3aab8d532a15","resolution":{"observed_at":"2026-08-06T22:18:06.475970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.245096Z","title":"Proximal Methods Avoid Active Strict Saddles of Weakly Convex Functions","venue":null,"work_id":"27afd381-603a-43d6-8553-aef9ac9e5d9e","year":2022},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.908096Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:f459c09c282a2c2bd13b7675ebb4d6d059487143413cfb831db9b4fc0f332e5c","observation_id":"4085bef4-f1c7-4e54-a932-dcde226598fa","resolution":{"observed_at":"2026-08-06T22:18:06.329278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.092969Z","title":"Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity","venue":null,"work_id":"cc53bb93-ee17-49bd-b341-509aa3e7163f","year":2022},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.933674Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:33a8aa0811a57d831348c1d56252f45d9fa543a3deab48878b45c936941ddace","observation_id":"96de577c-bcf4-43b9-b4c4-8663c3f09318","resolution":{"observed_at":"2026-08-06T22:18:06.160354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.914068Z","title":"Optimality, identifiability, and sensitivity","venue":null,"work_id":"5075716a-d6e4-4a34-8b24-ad08e685bbb8","year":2014},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:55.999270Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:4c921419e5325cc082cdbd43fc9c29ac56c4576ae492c2dc1238d2539c5a61ce","observation_id":"03fb758c-7b40-4ad5-a432-7e92316528c9","resolution":{"observed_at":"2026-08-06T22:18:06.000253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.733256Z","title":"Nonmonotone curvilinear line search methods for unconstrained optimization","venue":null,"work_id":"3f20e0e6-c61d-4468-9966-c904c953c5ec","year":1996},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.054403Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:f946ca6f8d65fc4ff4a09e4ddd20ab19a41fdedb763a50a31ddce09c0f0244ef","observation_id":"ba9d932e-a2f1-4c3b-b45b-a1a356a9f1ea","resolution":{"observed_at":"2026-08-06T22:18:05.819725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.543511Z","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis","venue":null,"work_id":"85575d7f-b2f9-433f-a94c-3f81e785cf98","year":2017},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.099954Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:724c3e213b867d968a365092004c3c12b4a614c8c51ae5ed2b5bc5408ee417aa","observation_id":"06b81ff3-be3a-4b9b-802c-95be181de112","resolution":{"observed_at":"2026-08-06T22:18:05.637692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.392063Z","title":"Matrix Completion has No Spurious Local Minimum","venue":null,"work_id":"7a8e57f4-f18b-4404-a35d-91a964479eba","year":2016},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.165924Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:3403780b4c94f8f1a286d594783f9e9ca09c5739a727ffbbcc1c58606c0a583d","observation_id":"1a4ae9ab-9c88-4ad8-88ef-fbf5ce82cc81","resolution":{"observed_at":"2026-08-06T22:18:05.461197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.212458Z","title":"Exploiting negative curva- ture directions in linesearch methods for unconstrained optimization","venue":null,"work_id":"67e04c85-9dc3-4c0c-ae2a-2362f14611ab","year":2000},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.213399Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:28adcd1b170627bae91ebba3393f33a547f55fe2b1eddc84fd1f30277bf0027f","observation_id":"e89aee8d-f2f2-4e8d-b50b-111fc4b7a1b3","resolution":{"observed_at":"2026-08-06T22:18:05.301463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.032865Z","title":"Riemannian trust-region methods for strict saddle func- tions with complexity guarantees","venue":null,"work_id":"5ce37ec4-c8a5-497a-b0a4-59df3cbc524b","year":2024},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.269630Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:3e3b08fe35292d94b86afbe89e34d561887cae2b7326dd102524f849c742d922","observation_id":"f62ee447-72ed-4406-baa1-801d14054c99","resolution":{"observed_at":"2026-08-06T22:18:05.097005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2411.00655","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:59.363016Z","title":null,"venue":null,"work_id":"1818abb1-8923-4518-96e0-dc4fd2817e76","year":2024},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.335309Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:fc6190136b79eadec7a21feb967e7e714e3b6214bbe720c12d0768896abc53b9","observation_id":"27229d41-5df5-4df5-93f2-8e522ac5c3b2","resolution":{"observed_at":"2026-08-06T22:17:59.452266Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.06026","last_updated":"2024-10-29T03:11:36Z","snapshot_observed_at":"2026-08-10T00:29:08.100502Z","submitted_at":"2023-11-10T12:32:07Z","title":"Smoothness of Subgradient Mappings and Its Applications in Parametric Optimization","version":3},"cited_work":{"arxiv_id":"2311.06026","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.06026","snapshot_observed_at":"2026-08-06T22:17:59.164408Z","title":"Smoothness of Subgradient Mappings and Its Applications in Parametric Optimization","venue":"math.OC","work_id":"73eb47f0-e7b5-411f-ae51-b6db34289522","year":2023},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.372351Z"},"links":{"cited_paper":"/paper/2311.06026","citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:5845153a4ac75c241e2d2d37381c45103f01e0686ddc6a99ba8aa1ec22996f07","observation_id":"a1a13998-5491-4d1e-b045-024a57f35436","resolution":{"observed_at":"2026-08-06T22:17:59.213781Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.849713Z","title":"Identifying Active Constraints via Partial Smoothness and Prox-Regularity","venue":null,"work_id":"50d92dee-5eed-4cad-9bd8-d706a3f1b4f5","year":2004},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.455092Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:1592cddfef567463123d93cc27e43f683ad11dc2c4608ee9130e1f066b6e8d01","observation_id":"2fb2c1aa-2349-47b5-9b4c-cea3ece749be","resolution":{"observed_at":"2026-08-06T22:18:04.959206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.711701Z","title":"Functions and Sets of Smooth Substructure: Relationships and Examples","venue":null,"work_id":"17ba4145-6405-4cdb-a3d0-71f608c8ca99","year":2006},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.521887Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:de0b4565f0d4f630861713864beef55bc01b140b375c08274e4ee3a6685044ff","observation_id":"ae556829-5993-4140-bec0-14050b7babc3","resolution":{"observed_at":"2026-08-06T22:18:04.784586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.525648Z","title":"Nonsmooth Optimization with Smooth Substructure","venue":null,"work_id":"50872b73-6e44-4494-ab27-22923ac44a26","year":2004},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.581809Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:c76e421fff78f8810f925d3d5a56944c4c670bd48b21013d426e0a0bed26e8bf","observation_id":"6e463155-5223-42a7-9e6f-50b660a3252f","resolution":{"observed_at":"2026-08-06T22:18:04.630623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.413635Z","title":"Generalized Power Method for Sparse Principal Component Analysis","venue":null,"work_id":"3a2b78cd-7fb5-4392-abf1-d0e0b6107855","year":2010},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.652505Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:ec0a9b8cb13b92d5e4a8ab22938c23afe75eaa5529a92416ba538dd92c7cd373","observation_id":"7ff10e3a-04a9-464d-80db-740d86ed9ee3","resolution":{"observed_at":"2026-08-06T22:18:04.463378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.300322Z","title":"First- order methods almost always avoid strict saddle points","venue":null,"work_id":"193992f4-1c9f-4f5f-b5e9-05570a12b4ae","year":2019},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.711337Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:cced4456ca094a5a63ea4bede8bc1f8564018069543c431affe96fa50c6ad831","observation_id":"22cda36b-5cf2-4fd2-acca-6a6542ff75f5","resolution":{"observed_at":"2026-08-06T22:18:04.338219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.168830Z","title":"Active Sets, Nonsmoothness, and Sensitivity","venue":null,"work_id":"3bb1ff9b-a68f-44b4-9e0e-05d8f312c581","year":2002},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.747667Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:dce825e9ec1e8676aa4175b2ab6480bdbfcff607a96c8fb8bd56c3cd62c0ab57","observation_id":"ada898cc-785a-4245-90e6-824c570a22f5","resolution":{"observed_at":"2026-08-06T22:18:04.246133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.999984Z","title":"Partial Smoothness, Tilt Stability, and Generalized Hes- sians","venue":null,"work_id":"4d7a55b9-764b-46b2-8088-e2dbea91c43a","year":2013},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.781932Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:da6cdfc9073f5f268a34c923a776d6be8d737d5e9752dba649829952af0dc2a6","observation_id":"f8d0dc90-f232-4092-8334-e8d3ca6f5e28","resolution":{"observed_at":"2026-08-06T22:18:04.110333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.838252Z","title":"Convergence Rates of First-Order Operator Splitting Methods","venue":null,"work_id":"ff30e053-c258-447c-8e76-cdc439ea836f","year":2016},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.862515Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:4eb3264eebe162dd02524cc3d55b0447f3c2760e63e1e84e0827037a0a8dec08","observation_id":"94e85e27-1af5-4bda-8d97-ee42a113eae3","resolution":{"observed_at":"2026-08-06T22:18:03.932307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.684512Z","title":"An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization","venue":null,"work_id":"d8d6ba91-cb71-4192-a1f3-9e9db041b985","year":2024},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.906860Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:c521713aaa2dcafb70f5db80ed81a3b26708b90fb52f2a1a7c173518e4bee2e9","observation_id":"6102db4b-2c99-47cb-b838-1a5370114489","resolution":{"observed_at":"2026-08-06T22:18:03.748506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.541881Z","title":"An Envelope for Davis–Yin Splitting and Strict Saddle-Point Avoidance","venue":null,"work_id":"3d71cf3e-0e43-43f9-ba0a-3ba122220b5c","year":2019},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:56.979677Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:465a44d6ae1d440b05a08b07dfca10b8b62755440d60520b653a6592af7d76a6","observation_id":"77051d75-9b6e-4de9-b0ee-702c778a7d94","resolution":{"observed_at":"2026-08-06T22:18:03.622287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.357749Z","title":"Curvilinear Stabilization Techniques for Trun- cated Newton Methods in Large Scale Unconstrained Optimization","venue":null,"work_id":"29763ddf-7905-49c9-9cb7-ec31d56af27e","year":1998},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.050788Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:0cc3517a322cf82e9a53cc5d47fc5bf0476160ecd2ec4eb544da70ebf6061cf0","observation_id":"82c9250a-f88b-41f9-85b8-691d0243d5e4","resolution":{"observed_at":"2026-08-06T22:18:03.447554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.221244Z","title":"A modification of Armijo’s step-size rule for negative curvature","venue":null,"work_id":"7e41251b-9339-4d8f-94a5-7a168f5a4fd5","year":1977},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.063544Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:2a329db36251970b1288983af40a2814723e55af89e5bf0e76a1df6621966dbc","observation_id":"f8bab8b5-4930-4054-b902-9020b944501b","resolution":{"observed_at":"2026-08-06T22:18:03.272517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.064717Z","title":"Primal-Dual Gradient Structured Functions: Second- Order Results; Links to Epi-Derivatives and Partly Smooth Functions","venue":null,"work_id":"d9dd62ae-e7c1-4888-8e8f-859be5365f74","year":2003},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.182824Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:fb56f757ba87cd08dae6762144756f2d99b13430db1c07d405f4b070d31ec74d","observation_id":"9a3ca3fc-34f4-432d-9e6e-633e941b21e1","resolution":{"observed_at":"2026-08-06T22:18:03.152204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.910506Z","title":"On the use of directions of negative curvature in a modified newton method","venue":null,"work_id":"e7174a5b-7d38-4a3e-acd8-8261e9ccb610","year":1979},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.225111Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:bcc4c14e01b3ab57d48735ebff4b247994aaa853f566b382febc053fa69e3eef","observation_id":"929b17db-cbf0-417f-8c30-863fba2f29df","resolution":{"observed_at":"2026-08-06T22:18:02.998352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.778556Z","title":"Nocedal and S","venue":null,"work_id":"f12e20d2-0791-4a2d-9e95-f133a3864574","year":2006},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.302068Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:d58457f34fc886ed846926880128addc7c1c31690d222b77fdaf0745fb5e4b9b","observation_id":"fa5d71fc-e861-4dc3-9388-d6f924f918a6","resolution":{"observed_at":"2026-08-06T22:18:02.843376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.645648Z","title":"A trust region-type normal map-based semismooth New- ton method for nonsmooth nonconvex composite optimization","venue":null,"work_id":"19eb2f70-087c-4011-8022-4e27d04287b3","year":2024},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.395123Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:da0487dca558d4b4539462b42aa244e342464ec0e060e894d0e7bd0821f76ce5","observation_id":"b7ab57c4-09c0-45aa-a42c-ea02e4982294","resolution":{"observed_at":"2026-08-06T22:18:02.707920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.502623Z","title":"Proximal Newton methods for convex composite op- timization","venue":null,"work_id":"a860c031-fe3f-4e2a-ae8a-5f00af7abfc3","year":2013},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.416544Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:0dcb45a2647cb6a00d2edfc7ea4c84e8bd8444198094f7f99259de2edd5185f7","observation_id":"f007c00d-1f2d-4917-84a6-c73f34298c71","resolution":{"observed_at":"2026-08-06T22:18:02.571610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.326381Z","title":"Generalized Hessian Properties of Regularized Nonsmooth Functions","venue":null,"work_id":"6923fb75-520d-4589-aa50-9d915b257f2b","year":1996},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.514997Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:b7eb5add707842112beaec91282e4d90987d776b46fffc57a868f2c8160c7d72","observation_id":"f8b43161-3208-4c9c-9a27-310477fcf651","resolution":{"observed_at":"2026-08-06T22:18:02.394577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.190999Z","title":"Prox-regular functions in variational analysis","venue":null,"work_id":"811c71a7-dabb-4a12-886e-6fc3fc68b39b","year":1996},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.597813Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:99c2d9dfc75bfc44a74f727e4656e8d8d0f860da42ed8bc83678076a7b4ce11f","observation_id":"c571b8eb-5dc0-4b83-b667-9fb30c40e86a","resolution":{"observed_at":"2026-08-06T22:18:02.260972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.003899Z","title":"First- and Second-Order Epi-Differentiability in Nonlinear Program- ming","venue":null,"work_id":"7a6607e5-747f-4962-b42f-b17718f7f1ff","year":1988},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.684660Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:581c3317f632e1b22ae9cf7b0ddb2c2959bbafec9671fc640f35ef304c2f0f7a","observation_id":"6b172d2e-653b-4bbe-b90d-7e235ce1ffef","resolution":{"observed_at":"2026-08-06T22:18:02.063865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:01.837939Z","title":null,"venue":null,"work_id":"8145bf81-a7e9-409c-9c99-f8b579c47012","year":1998},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.793596Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:5ed824b65a95972f7da23688006d7859ae81dc69debd76cf702999a6a3255a81","observation_id":"35b9ffa3-4d78-4430-b50e-d8a7a555e020","resolution":{"observed_at":"2026-08-06T22:18:01.895881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:01.683128Z","title":"On a Class of Nonsmooth Composite Functions","venue":null,"work_id":"f21df9a3-1567-4cdb-8501-fa98feab219e","year":2003},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.831723Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:291ff28d739300aa2d617131dbef3f724f08f994bd8bce7051288241219a22c5","observation_id":"c435a1bf-15d6-4c21-85db-ae4e0fae5e51","resolution":{"observed_at":"2026-08-06T22:18:01.751702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:01.465288Z","title":"A Family of Trust-Region-Based Algo- rithms for Unconstrained Minimization with Strong Global Convergence Properties","venue":null,"work_id":"207ac2de-4b2e-4b58-82bd-d5fd3dfb4e77","year":1985},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.950349Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:58b2803684465952a9f55ae3a19ed3ebae7228b4bf6336ff4f42140d424377db","observation_id":"cc9cc3b4-14aa-4bf2-9598-3d246c400547","resolution":{"observed_at":"2026-08-06T22:18:01.581430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:01.235565Z","title":"Theoretical Insights Into the Opti- mization Landscape of Over-Parameterized Shallow Neural Networks","venue":null,"work_id":"7dcb96c8-d2cc-4c7e-8aa8-fbf566f2a5f9","year":2019},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.031156Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:07de582125dc01ea07143f9227ee2b3e88bc81a59080f4302a6f208ccaea3f38","observation_id":"b2e557c6-964d-4b43-8922-7e88a244904b","resolution":{"observed_at":"2026-08-06T22:18:01.339748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:01.068438Z","title":"The Conjugate Gradient Method and Trust Regions in Large Scale Op- timization","venue":null,"work_id":"0f7fd7f6-1129-4915-9ee7-5907d05d5f43","year":1983},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.149904Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:3c6c2ab9f2797b920c5915f8fb31a303fa6acce96750b88ac60cac12fd7ee617","observation_id":"13910ac4-38bd-4e9d-a2ab-16fbb278614c","resolution":{"observed_at":"2026-08-06T22:18:01.163795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:00.925816Z","title":"Forward–backward quasi-Newton methods for nonsmooth optimization problems","venue":null,"work_id":"4c3a4aab-3843-46c1-8534-620e2991c538","year":2017},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.209364Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:a89e107885aa8e1d5bb9f10da300512ab6d7142000acd8c5348ba0a643b0e51e","observation_id":"199bc42b-8a5b-46c2-ad4f-6972cac68f47","resolution":{"observed_at":"2026-08-06T22:18:00.966170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:00.682735Z","title":"A simple and efficient algorithm for nonlinear model predictive control","venue":null,"work_id":"a0591b49-aaa7-4bc5-b65f-258ad332fa71","year":2017},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.353383Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:5599c72cd4c98ddfe201a343122b4be285d8737255ae15b243139d239506c97a","observation_id":"998b62ea-fa9a-4f41-a0c6-43e0a831d61c","resolution":{"observed_at":"2026-08-06T22:18:00.808551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:00.535363Z","title":"A Geometric Analysis of Phase Retrieval","venue":null,"work_id":"fcdd0c76-8c35-45fe-bfa5-9996fbae2115","year":2018},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.406047Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:21dcb6b29917a96989e36fd37291d1347747450221cddf7e032572929e0d17e8","observation_id":"9f9d0143-fc1c-4869-925f-65e90739c8d1","resolution":{"observed_at":"2026-08-06T22:18:00.614258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.06096","last_updated":"2016-04-23T00:18:06Z","snapshot_observed_at":"2026-07-06T04:33:47.074419Z","submitted_at":"2015-10-21T00:59:23Z","title":"When Are Nonconvex Problems Not Scary?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.06096","snapshot_observed_at":"2026-08-06T22:17:58.531907Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.531907Z"},"links":{"cited_paper":"/paper/1510.06096","citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:dad12335b337174a2645d2b015a226ca0fcd4c488acb58a7d9c2503a0ec01427","observation_id":"0de661c6-0579-48f0-8cd9-7551f59e1222","resolution":{"observed_at":"2026-08-06T22:17:58.531907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:00.406534Z","title":"On the Acceleration of Forward-Backward Splitting via an Inexact Newton Method","venue":null,"work_id":"48b100b7-5d9b-4a96-ba3f-b0b79feba21a","year":2019},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.592207Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:66028b9bf69956534f6898d935f7aca0d45480b7b41ecebb1eeeb58c1872947c","observation_id":"2a45d166-6b33-4104-ae3b-83bf842fde31","resolution":{"observed_at":"2026-08-06T22:18:00.487807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:00.284744Z","title":"A new envelope function for nonsmooth DC optimization","venue":null,"work_id":"e2c92361-4ad1-49cd-9801-db607a2251b2","year":2020},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.721438Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:f32135673fe9766c4607f39cdf2446c5d43da958ef35047ebaac7e7644798d42","observation_id":"90591ff0-de9c-460e-b963-b1963a30569a","resolution":{"observed_at":"2026-08-06T22:18:00.337183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:00.096442Z","title":"Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algo- rithms","venue":null,"work_id":"4caf67b5-99ec-4faa-87a9-fbb5439e8303","year":2018},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.792555Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:ab0db209a82e74823b1036dbc06e95082be511c7c6d26aacb1a6b2adf6d83381","observation_id":"9d050042-abda-43cb-b2be-ace4d1679b98","resolution":{"observed_at":"2026-08-06T22:18:00.175680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:59.908848Z","title":"Linear Regularizers Enforce the Strict Saddle Prop- erty","venue":null,"work_id":"e1a6d10b-a459-49fa-99e6-30ae229b7448","year":2023},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.864099Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:19d96c3ba41f5bf17ec50584f945ffd5fb6fb2bdc034bb661c0e17b8cd6f1666","observation_id":"23bb0fc8-ee31-4b14-94a3-b87cfd4e2cdc","resolution":{"observed_at":"2026-08-06T22:18:00.042860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:59.693722Z","title":"Zhang, ed","venue":null,"work_id":"67f6050a-1b9a-4aff-8a4f-4671a34e902b","year":2005},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.917536Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:bdf79e45c25116cc33018a95adb6d2fca483fe1065203cd25d0f6ab4c0d6c736","observation_id":"0e6e40e1-d6fe-4f31-b313-75a93b3fb841","resolution":{"observed_at":"2026-08-06T22:17:59.763990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:59.532855Z","title":"Proximal gradient algorithm with trust region scheme on Riemannian manifold","venue":null,"work_id":"83cdfa92-0e38-4d0c-afcd-4cc6807ea6da","year":2024},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.966620Z"},"links":{"citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:dc1dc1a552949532713340fed1db0035cb2d118ccac07840cb8f9380be7b87dc","observation_id":"46815fb9-d5df-4be1-b4d9-a8d8feab55b6","resolution":{"observed_at":"2026-08-06T22:17:59.602631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04001","last_updated":"2024-06-06T12:20:54Z","snapshot_observed_at":"2026-07-06T18:26:28.988101Z","submitted_at":"2024-06-06T12:20:54Z","title":"Benign Nonconvex Landscapes in Optimal and Robust Control, Part II: Extended Convex Lifting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04001","snapshot_observed_at":"2026-08-06T22:17:59.046050Z","title":"Zheng, C.-F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.046050Z"},"links":{"cited_paper":"/paper/2406.04001","citing_paper":"/paper/2506.22332"},"observation_digest":"sha256:524231601611b2117a52ac3ae6bc7b5593adedf5a01d7926d759aaab8fe1f91b","observation_id":"3b6b81d9-fead-4fb4-8433-a51b64403a78","resolution":{"observed_at":"2026-08-06T22:17:59.046050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.22332","last_updated":"2025-06-27T15:40:03Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T16:45:01.878740Z","submitted_at":"2025-06-27T15:40:03Z","title":"Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":53},"total_outbound_references":59},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 3 inbound Pith citation observations for arXiv:2506.22332."}