{"as_of":"2026-08-11T11:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6a911c3e4a5154beef4f0c05512d8182fe700a8589f2831287efc797df443974","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:35:14.154145Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.04889/citation-record","integrity":"/paper/2501.04889/integrity","json":"/paper/2501.04889/citation-record.json","paper":"/paper/2501.04889"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.02347","last_updated":"2023-01-06T01:11:14Z","snapshot_observed_at":"2026-07-06T14:37:56.945127Z","submitted_at":"2023-01-06T01:11:14Z","title":"A Levenberg-Marquardt Method for Nonsmooth Regularized Least Squares","version":1},"cited_work":{"arxiv_id":"2301.02347","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.02347","snapshot_observed_at":"2026-08-10T21:35:14.655492Z","title":"A Levenberg-Marquardt Method for Nonsmooth Regularized Least Squares","venue":"math.OC","work_id":"b6fe7e30-dbaf-48b7-957a-13720ceae83d","year":2023},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.851938Z"},"links":{"cited_paper":"/paper/2301.02347","citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:a4f79a760d372ad863a194377b68e552a0e0fd87b6d8e38f3a77a9ca4449904d","observation_id":"6a31c6cc-7ec6-4294-8ea1-e53b08c96022","resolution":{"observed_at":"2026-08-10T21:35:14.662498Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.399249Z","title":"Aravkin, Robert Baraldi, and Dominique Orban","venue":null,"work_id":"19fd8b89-178f-4540-8b84-f349c8612115","year":2022},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.858609Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:caa899009924d7227910940417ffe133880ef8bfc0fb14e6d09eaced85203149","observation_id":"a0730e08-ac9c-4f6a-9461-22bb486e1e69","resolution":{"observed_at":"2026-08-10T21:35:15.405176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05218","last_updated":"2019-09-10T15:42:38Z","snapshot_observed_at":"2026-07-06T06:44:41.329034Z","submitted_at":"2018-06-13T18:44:17Z","title":"Line Search and Trust-Region Methods for Convex-Composite Optimization","version":2},"cited_work":{"arxiv_id":"1806.05218","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.05218","snapshot_observed_at":"2026-08-10T21:35:14.525363Z","title":"Line Search and Trust-Region Methods for Convex-Composite Optimization","venue":"math.OC","work_id":"10605510-9b4e-4a81-8a3c-2f594ddc3736","year":2018},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.864280Z"},"links":{"cited_paper":"/paper/1806.05218","citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:4b7c4e433ed91f668dbabd8bb25415d8a661c21d47fc2ce351ee86ddeff44161","observation_id":"0af898c1-bf79-4672-808d-3a623a976db9","resolution":{"observed_at":"2026-08-10T21:35:14.632575Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.378386Z","title":"Burke and Abraham Engle","venue":null,"work_id":"0a50ec09-683c-4e73-a143-70cb3d594455","year":2020},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.871071Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:c65c589b30712a5be188502318c10dfa422e265a39c53e76365595e5979b34ab","observation_id":"2507e6ea-6fea-43d5-8d79-0e8260fa09f1","resolution":{"observed_at":"2026-08-10T21:35:15.384796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:35:13.877288Z","title":"First-order methods in optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.877288Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:4aeb2541895f30fefaaf3b5c36b4eae814fb0a007de9892f22c08136e2d341a9","observation_id":"beeaea31-bf27-4a4e-a9b2-badcc03eec4b","resolution":{"observed_at":"2026-08-10T21:35:13.877288Z","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-10T21:35:15.333960Z","title":"Efficient proximal subproblem solvers for a nonsmooth trust-region method","venue":null,"work_id":"555e36bf-e47f-4986-8434-559a9f5e5ed5","year":2023},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.884388Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:3da98d3d3ca41bdeb8c002c4842a7d9a54e5821c9957df67e702fe73f71a4686","observation_id":"5f9538a8-c1c3-4436-9b77-35cf8d8a27ae","resolution":{"observed_at":"2026-08-10T21:35:15.339056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.311003Z","title":"Baraldi and Drew P","venue":null,"work_id":"f4c3631c-ef80-4aa8-87d3-8030a2874745","year":2023},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.893191Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:4ebd7879a02d218702c25fd8e27e6b06253d670e319327440a3cab0f01c726e6","observation_id":"3c6533c6-f4ba-4d8d-b3f4-7fcba7e46220","resolution":{"observed_at":"2026-08-10T21:35:15.320257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.284953Z","title":"Baraldi and Drew P","venue":null,"work_id":"e1204c84-9879-4122-8871-0cf7a3225e1b","year":2024},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.901771Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:ec5bf72bc68d92653d7f41570eea4470215fb1cc3109c12cd80be5ea16356185","observation_id":"c97eef44-9829-40fa-ba6b-08b6dd39f628","resolution":{"observed_at":"2026-08-10T21:35:15.292215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.264171Z","title":null,"venue":null,"work_id":"24f213fb-bedb-41ca-ac6a-c4217e11af2b","year":1993},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.908998Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:00b07903c508adf2ff6f386382c088dee5fb81911f6512b06d4b6c1720820ac3","observation_id":"d9952467-8815-47b0-8501-ad42ee360695","resolution":{"observed_at":"2026-08-10T21:35:15.270209Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.247952Z","title":null,"venue":null,"work_id":"18597839-3e80-47b0-b52a-3dc5c75066b4","year":1988},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.927159Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:74c9710a458d85d16ce7c3b25923637cddd381a1eaa8122c598c490c58197d19","observation_id":"e221c946-3eb8-426b-b43d-636d6e858820","resolution":{"observed_at":"2026-08-10T21:35:15.253182Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.232530Z","title":"Conn, Nicholas I","venue":null,"work_id":"5c4fc996-6c90-4a9e-8ddd-b9d1ae2612c6","year":2000},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.934058Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:c485dec4b82916ff9cccd89ff72ca229ac793e3b27cddc8e8d5efb0e568b51f7","observation_id":"ccd5772e-3bbe-4ab4-84f5-20e8ed56a3b2","resolution":{"observed_at":"2026-08-10T21:35:15.237244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.207571Z","title":"Cartis, N","venue":null,"work_id":"5102c650-2938-4570-9112-faa57a0069db","year":2012},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.939930Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:e6d0cb04ccf12568e9f584628fca1e1e01e196fa3c49a3f7b8482353a3899166","observation_id":"171e1dbc-a2a3-43c0-9382-24490eda8722","resolution":{"observed_at":"2026-08-10T21:35:15.217192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.183129Z","title":null,"venue":null,"work_id":"80b4c97e-a01b-4f12-8ecb-f13b0de9eeab","year":2022},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.946087Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:ab430c5f91c01d7bc62efb0fd90121f0ed0ad1c45db2c1bef2b0de529bfd578e","observation_id":"c6b13cfb-862a-417c-af25-dd6a660064df","resolution":{"observed_at":"2026-08-10T21:35:15.188244Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.162155Z","title":"A trust-region method for nonsmooth nonconvex optimization","venue":null,"work_id":"7efc8f0f-0a74-476c-8a1a-bfb449649bf8","year":2023},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.951289Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:a7376f8b40842d7f06e64756c804158ef6290fe70cfb72556988f582ab75a90f","observation_id":"33adbf7f-c637-4c8a-87fe-47a3172c999b","resolution":{"observed_at":"2026-08-10T21:35:15.168237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.143942Z","title":"Optimality conditions and a smoothing trust region N ewton method for nonlipschitz optimization","venue":null,"work_id":"26b636c3-96d0-4884-a798-f3f953a7a5ad","year":2013},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.956304Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:03eb777f8750cafeac2952bb4c1ab544e096f15da38414756d9f77df63cbb14b","observation_id":"efa53bd1-966d-4c66-b9bc-654b849ad6dc","resolution":{"observed_at":"2026-08-10T21:35:15.150624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2408.06243","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:35:14.478296Z","title":"Complexity of trust-region methods in the presence of unbounded Hessian approximations","venue":null,"work_id":"94a200b2-618e-46f8-9893-80d73dd105cd","year":2024},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.961614Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:88d24afd1def69cd6de79a3934bc0ed37521b9585c0360237a146280676e9200","observation_id":"0df9932c-fc14-4b9a-ab4d-cb7f209bb14a","resolution":{"observed_at":"2026-08-10T21:35:14.492533Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.127170Z","title":null,"venue":null,"work_id":"27e7d246-2dde-4032-b600-11ae99b3e90b","year":1995},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.967684Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:1e95e68e052f93d8da0fb9fc128ebc8c958859975e9dc67faf82d8121747420c","observation_id":"209ff2f3-6845-4264-a661-a3234fda59b3","resolution":{"observed_at":"2026-08-10T21:35:15.131865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.110505Z","title":"Dolan and Jorge J","venue":null,"work_id":"0552fa38-ed70-46d7-93e0-f7ed01dc32ac","year":2002},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.974492Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:bf24c07503914c4f40dabac6636817568b8ab9b38d34d8a07e41083f29680ec5","observation_id":"92a0e32a-ba40-4132-8cd9-8a4ced973a5b","resolution":{"observed_at":"2026-08-10T21:35:15.115562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.091534Z","title":null,"venue":null,"work_id":"650457c6-18a9-4517-9628-c007de058cf3","year":2019},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.981321Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:2f5d5ce62513b44d3ad633bbfee72a9d5160da775b240380c18c70e8b2a1b0a6","observation_id":"00510449-34db-49fc-8d56-88e9710269fe","resolution":{"observed_at":"2026-08-10T21:35:15.096849Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08485","last_updated":"2025-06-09T11:07:19Z","snapshot_observed_at":"2026-08-11T02:29:15.387842Z","submitted_at":"2024-05-14T10:18:38Z","title":"Doubly relaxed forward-Douglas--Rachford splitting for the sum of two nonconvex and a DC function","version":2},"cited_work":{"arxiv_id":"2405.08485","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.08485","snapshot_observed_at":"2026-08-10T21:35:14.310854Z","title":"Doubly relaxed forward-Douglas--Rachford splitting for the sum of two nonconvex and a DC function","venue":"math.OC","work_id":"7de69938-2cf6-41c9-b875-51478d50854b","year":2024},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.989804Z"},"links":{"cited_paper":"/paper/2405.08485","citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:8dcee77d50eda2423e1a79158777359a3d3770a1c6a7ec133dc79cfb438e9975","observation_id":"af2c7e42-3390-4bc8-b52a-a4fb2d871cd8","resolution":{"observed_at":"2026-08-10T21:35:14.318364Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.073630Z","title":"Inexact derivative-free optimization for bilevel learning","venue":null,"work_id":"ddf25d65-433f-4cdc-b3dc-f67a0668daaf","year":2021},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.995953Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:d54a439e2c23058f2763161d62ed7daac0e0594076acf119ebce61b2177a68c7","observation_id":"63913aaa-4af6-4915-a71e-299a056e9a71","resolution":{"observed_at":"2026-08-10T21:35:15.078393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.056163Z","title":"PyCUTEst : An open source P ython package of optimization test problems","venue":null,"work_id":"88fe5b4d-6c0a-49fc-8075-8244f12dcce9","year":2022},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.002406Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:732b6fe1c15c24acaa7b17dc361d03eccddb66bad3231d79d7c381f2ce65504e","observation_id":"e6c361ad-223b-4eef-8b91-fe00d70bf56a","resolution":{"observed_at":"2026-08-10T21:35:15.061575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.037182Z","title":"Garmanjani, D","venue":null,"work_id":"46b92a5a-3658-4fdc-acb3-18dd93f8e500","year":1987},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.009861Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:dc929d9bddd7e99272335d34f1fa29698d58f1e89b06d7c7bdd26e5f8d9e9c76","observation_id":"3699f20d-91b9-48e5-a1d9-b6149f55c754","resolution":{"observed_at":"2026-08-10T21:35:15.043153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:15.016516Z","title":null,"venue":null,"work_id":"aa030aee-16a4-4fac-b545-a767f793566b","year":2015},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.017061Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:01b60004c471c3c73e25842f31cd68a787c6c7e520f5d1c949eeaffc085c6b02","observation_id":"f9c0ad90-bd5a-411b-bab9-3e0d25a900a0","resolution":{"observed_at":"2026-08-10T21:35:15.022192Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.994975Z","title":"A derivative-free trust-region algorithm for composite nonsmooth optimization","venue":null,"work_id":"1e868911-bda1-4b2f-9ee8-a650c5280e70","year":2016},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.024075Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:416a5fc3d6f249d467e5df42acecdf3e87f7b3a2e5cedee11532257ba9cb2243","observation_id":"0c8dbc40-6471-4027-819f-89538f34c6e6","resolution":{"observed_at":"2026-08-10T21:35:15.000973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.977947Z","title":"Model-based derivative-free methods for convex-constrained optimization","venue":null,"work_id":"3c8a0f22-7e15-4954-9c24-dd30c9acdf2f","year":2022},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.030393Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:a8aea5af5933faf986bc086666920af70db0b6fd55e0a8f9dc3a80070bd4e7af","observation_id":"7a5f3f21-b0a1-46cb-a6c2-c5289de944c6","resolution":{"observed_at":"2026-08-10T21:35:14.982830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.960611Z","title":"Directional sparsity in optimal control of partial differential equations","venue":null,"work_id":"e4e4100e-59e7-4436-9e45-497d4f32ebe2","year":2012},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.036327Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:f4e73ad22d83465d20ce8aacaacb19416912be562d0411e09a48b20a8ab0b4aa","observation_id":"83ae0863-d3b8-4bf6-96ce-bfedcb014923","resolution":{"observed_at":"2026-08-10T21:35:14.965832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.942571Z","title":"Globalized inexact proximal N ewton-type methods for nonconvex composite functions","venue":null,"work_id":"c9c7295b-7d21-4e3f-a98e-49f40028bdc3","year":2021},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.042302Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:43918bd193f87946cca4f147843b3aea7759f885f7182af5c61d982d7e0061d1","observation_id":"2f33eb71-85e7-4d19-9a34-cb497ab470f0","resolution":{"observed_at":"2026-08-10T21:35:14.948484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.924370Z","title":"A scalable trust-region algorithm with application to mixed-norm regression","venue":null,"work_id":"8039a6c2-3b06-4582-97cc-0b8b93433232","year":2010},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.047702Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:380c4a47b47bf02f0e2bdf35a171187867f903a209aa6178f777ab16568f82d7","observation_id":"c9919cf5-25ad-46e9-bb5f-33c170637ae8","resolution":{"observed_at":"2026-08-10T21:35:14.929973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.14915","last_updated":"2024-07-20T16:00:05Z","snapshot_observed_at":"2026-08-10T05:43:26.668690Z","submitted_at":"2024-07-20T16:00:05Z","title":"Black-box Optimization Algorithms for Regularized Least-squares Problems","version":1},"cited_work":{"arxiv_id":"2407.14915","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.14915","snapshot_observed_at":"2026-08-10T21:35:14.268957Z","title":"Black-box Optimization Algorithms for Regularized Least-squares Problems","venue":"math.OC","work_id":"ff9e6291-de06-4c59-acaf-3e42b59d9058","year":2024},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.053152Z"},"links":{"cited_paper":"/paper/2407.14915","citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:d9b0ab8c877ac2f4774fdf048225eca878e5ce823abb7c938c28f6f8664b38ef","observation_id":"a18448b1-51e5-4331-82f1-99aa56ae5112","resolution":{"observed_at":"2026-08-10T21:35:14.277201Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08433","last_updated":"2023-09-15T14:32:54Z","snapshot_observed_at":"2026-07-06T16:19:01.610586Z","submitted_at":"2023-09-15T14:32:54Z","title":"The Indefinite Proximal Gradient Method","version":1},"cited_work":{"arxiv_id":"2309.08433","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.08433","snapshot_observed_at":"2026-08-10T21:35:14.225164Z","title":"The Indefinite Proximal Gradient Method","venue":"math.OC","work_id":"476dd08d-639b-438b-862f-a897cb34ece9","year":2023},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.058962Z"},"links":{"cited_paper":"/paper/2309.08433","citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:d462b706d4409b3bbbc1c0cd430398f9bcf12530678b1bcf8394c6cd15039019","observation_id":"f596e320-8779-44e7-8eb3-044adf2aa6a7","resolution":{"observed_at":"2026-08-10T21:35:14.236656Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.903853Z","title":"Lee, Yuekai Sun, and Michael A","venue":null,"work_id":"2c8080f4-92e1-4c4f-9d67-0979342a8e85","year":2014},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.066511Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:36f9ead93e8db5a6ec529ffb17464b82f6df67c8a1918685e1b28e3a8b357e6e","observation_id":"5f8c1de1-86bf-4220-86aa-8770dd2b2150","resolution":{"observed_at":"2026-08-10T21:35:14.911836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.880952Z","title":null,"venue":null,"work_id":"cd217e30-e84d-4948-bd46-4ec59d093f41","year":2019},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.072433Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:6700c3e1cfc6307d98c59b57901b315cad1c92169c828768a9f96a9b16888929","observation_id":"5af72fa0-83ff-4207-b321-c6129bf236af","resolution":{"observed_at":"2026-08-10T21:35:14.886685Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.863141Z","title":null,"venue":null,"work_id":"a7e8034f-2292-4b8a-aaf2-df92364ee7dd","year":1970},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.079201Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:fcb2ee262df5d841a7a4e333cbec94145d869c200f50f454c67e99090616747d","observation_id":"632ff445-19b4-41c8-80d4-0b7e2b0aca1b","resolution":{"observed_at":"2026-08-10T21:35:14.868096Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.844545Z","title":null,"venue":null,"work_id":"14734328-59b3-4a05-835a-c145863ff247","year":2006},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.085320Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:2f820543d483190e53fa7d6ec94c0b7639abdb71d5ac536d9477289f1f0127cb","observation_id":"124374cc-446e-4e4c-9840-7fe3981e11e3","resolution":{"observed_at":"2026-08-10T21:35:14.851382Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:35:14.092245Z","title":"Mor \\'e and Stefan M","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.092245Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:3444ec40e863f3c9c848630f5f69d75267820d077462ff0e4c44ba7b7f9458e0","observation_id":"fe681efd-69bf-4322-8ea4-46114c91d71d","resolution":{"observed_at":"2026-08-10T21:35:14.092245Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:35:14.099568Z","title":"Numerical optimization","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.099568Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:1d23a017a58a116caeabd466b5dceb26771da4274db7dc9a8c68a38c2028a76f","observation_id":"b6b324db-d122-4306-8a43-dcd1fbe0adce","resolution":{"observed_at":"2026-08-10T21:35:14.099568Z","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-10T21:35:14.793424Z","title":"A trust region-type normal map-based semismooth N ewton method for nonsmooth nonconvex composite optimization","venue":null,"work_id":"b6bd1a99-8087-4767-bec9-c28386cfd258","year":2024},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.107561Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:c1fae1cac153178da1a5398a17be90d2dded9843f58808699ab71563ff6596e7","observation_id":"ec44a144-a194-45e6-bde9-db41daf0c54f","resolution":{"observed_at":"2026-08-10T21:35:14.799690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.772459Z","title":null,"venue":null,"work_id":"3dfbfa16-12d5-4695-a59e-b19776ccd99f","year":1984},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.115573Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:456d262a043cbab19984a6657ab88ed90f9e60978194e1a7ba9fd34365155eec","observation_id":"8df601ac-3dfa-4f2e-83cd-2023a488caf4","resolution":{"observed_at":"2026-08-10T21:35:14.778655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.751445Z","title":"A trust region algorithm for minimization of locally L ipschitzian functions","venue":null,"work_id":"19d6c621-e7a8-4969-93d2-bdb56756aa2c","year":1994},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.122935Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:4f0aec627a8dffad2ca7abfe4f6e770e780b18415491bf601695ffd14b6d5851","observation_id":"b63ab5aa-0c9e-4c39-978b-7b93e1d0ec9e","resolution":{"observed_at":"2026-08-10T21:35:14.758094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.733587Z","title":"Model-Based Derivative-Free Optimization Methods and Software","venue":null,"work_id":"d4c21ebc-8261-4af7-916c-c886b760bbda","year":2022},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.131914Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:85da4fafd82ea6f4021e46488b57dd7a565d611cc2f8cc37580009c3f30a66f8","observation_id":"89de2599-4700-488b-bf4d-3bb16dc912f8","resolution":{"observed_at":"2026-08-10T21:35:14.739232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.716409Z","title":null,"venue":null,"work_id":"fdd206f8-eee0-4cec-8f7e-7e5d9971f181","year":1988},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.139162Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:0e44c9892c887d24b732f239cec26c175e692566b33996c9be584c64548c79e8","observation_id":"4227f789-8a9c-4812-ba40-ca2a1d9c7540","resolution":{"observed_at":"2026-08-10T21:35:14.721179Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.696576Z","title":"Wright and Benjamin Recht","venue":null,"work_id":"87d0059d-5830-4a8b-bdb4-8cf1403026d4","year":2022},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.144544Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:66d7849078713d499e3f7abd91b4d601a78cdddf3769eb708f72954f074dc38f","observation_id":"d0aab56c-0381-4642-9ec3-3f60af356942","resolution":{"observed_at":"2026-08-10T21:35:14.702868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:35:14.676859Z","title":"Proximal gradient algorithm with trust region scheme on R iemannian manifold","venue":null,"work_id":"a56a25b7-4b19-4e45-b292-f9498cc4a9ed","year":2024},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:14.154145Z"},"links":{"citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:eb31b476a902700a32a54cd6d58c377d8f6dcc795b097e63997e65dc54fde4f4","observation_id":"46379fde-4d3f-4c58-a338-0be1195361c5","resolution":{"observed_at":"2026-08-10T21:35:14.682247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":14,"verified_exact":3,"verified_fuzzy":24},"total_outbound_references":44},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2501.04889."}