{"as_of":"2026-08-19T13:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:82cb67f88390145b136610890ab0803079f0cc030d74f2982fe2504014ecd6d8","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T12:17:40.208101Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2607.19647/citation-record","integrity":"/paper/2607.19647/integrity","json":"/paper/2607.19647/citation-record.json","paper":"/paper/2607.19647"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T12:17:34.888012Z","title":null,"venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:34.888012Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:79f3a333fba1933796463fd88bb6bf6be4a2654b4ee55c71c74f69431e91cded","observation_id":"cbbad8a2-1a9c-4a84-95d3-5265faa867c4","resolution":{"observed_at":"2026-08-01T12:17:34.888012Z","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-01T12:17:34.968303Z","title":", title =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:34.968303Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:aaa9fb7de16cbc73b0f3ff53064e39e9d1ce1c100cec31aa7b92ba709bf7ec89","observation_id":"dd4c350a-7c38-41cb-b4e9-855a2a180631","resolution":{"observed_at":"2026-08-01T12:17:34.968303Z","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-01T12:17:35.071468Z","title":"SIAM Journal on Optimization , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:35.071468Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:171c47a78726d24197ed36a9e716f4eb920f2d5716ec5d0a9c277f137a219f93","observation_id":"89edcbc3-7a7d-4b71-b711-645c65fe886e","resolution":{"observed_at":"2026-08-01T12:17:35.071468Z","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-01T12:17:35.190438Z","title":"SIAM Journal on Optimization , volume =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:35.190438Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:d033dcbfe25cfb62771fa4941f40de6a4d9ce34fceb6713dddf7b38578c1d5d0","observation_id":"49d8fe2d-9152-4836-a126-7499f52bc92a","resolution":{"observed_at":"2026-08-01T12:17:35.190438Z","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-01T12:17:35.296905Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:35.296905Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:25ea855d20aa04e4badb649051ecde31079458bfac9a5f62ff25b649e30c72b7","observation_id":"91e04cb2-cf9d-4786-87ad-ad0aa7e41903","resolution":{"observed_at":"2026-08-01T12:17:35.296905Z","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-01T12:17:35.418903Z","title":"SIAM Journal on Imaging Sciences , volume =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:35.418903Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:f3897e828f9c8de6ac48bf79b5ebf726cb0e0d09ddec6c344e7b40dc17a6eee0","observation_id":"79a913be-d2fc-4e72-863e-2a234c03ecdf","resolution":{"observed_at":"2026-08-01T12:17:35.418903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11676","last_updated":"2024-11-21T12:38:53Z","snapshot_observed_at":"2026-08-16T13:09:08.826563Z","submitted_at":"2024-10-15T15:12:52Z","title":"Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems","version":2},"cited_work":{"arxiv_id":"2410.11676","doi":"10.48550/arxiv.2410.11676","metadata_source":"pith","pith_arxiv_id":"2410.11676","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems","venue":"math.OC","work_id":"3fef7267-ac28-4294-a219-6fe5a77ccdc5","year":2024},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:35.584672Z"},"links":{"cited_paper":"/paper/2410.11676","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:1b95fedd6776b3f0da1ba8236fab285709571e4e5bf1412ff1f7c6c4967bd2ac","observation_id":"4e1c34cb-b936-4b83-9fd7-bf6aa15f9608","resolution":{"observed_at":"2026-08-01T12:18:26.546365Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-01T12:17:35.752827Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:35.752827Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:42ee7c50ede9203e10d9aa73de05dc04938a248623bc03095d73fb21b4c19217","observation_id":"9f6c39eb-d34e-45d9-9db4-296fb0e6f6ee","resolution":{"observed_at":"2026-08-01T12:17:35.752827Z","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-01T12:17:35.918400Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:35.918400Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:36306e4173b42100e9cff1a94e6e1731b2f90f9c8cc13e705165762817fbb0a7","observation_id":"38194c35-6c45-41f9-a7aa-078f1c3b2e30","resolution":{"observed_at":"2026-08-01T12:17:35.918400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00521","last_updated":"2025-08-19T12:46:09Z","snapshot_observed_at":"2026-08-16T22:37:27.179585Z","submitted_at":"2025-05-31T11:48:12Z","title":"Convergence rates of regularized quasi-Newton methods without strong convexity","version":6},"cited_work":{"arxiv_id":"2506.00521","doi":"10.48550/arxiv.2506.00521","metadata_source":"pith","pith_arxiv_id":"2506.00521","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Convergence rates of regularized quasi-Newton methods without strong convexity","venue":"math.OC","work_id":"dd1d6d82-f3ee-4531-8e1e-f388ce9e6855","year":2025},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:36.029992Z"},"links":{"cited_paper":"/paper/2506.00521","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:73552349ae7a8c18c0d17f3b7935880f1ae19af13ed94b28ae6efba72c96ca6e","observation_id":"9d3bb992-c8d3-453d-b4af-76c4dbaff872","resolution":{"observed_at":"2026-08-01T12:18:26.321764Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-01T12:17:36.197690Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:36.197690Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:3b51bc6cc3ad680473ef7914e7c52c5400508bfacc235fe809ac56122aa0e49a","observation_id":"b6bcd3b9-87d3-4ef9-b6fa-cff1ade8a192","resolution":{"observed_at":"2026-08-01T12:17:36.197690Z","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-01T12:17:36.357663Z","title":"Mathematical Programming , volume =","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:36.357663Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:9e53b7e0f010ffc6269282a438765b5e2f012dcb289501bff975e9a02131258f","observation_id":"e1b63f66-4065-421f-bab0-92fb8ee3438b","resolution":{"observed_at":"2026-08-01T12:17:36.357663Z","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-01T12:17:36.524701Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:36.524701Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:d7a62e2e17a38c35bfff81b8336ccf62e21ce3063a8652a25e586999306d1f19","observation_id":"a68e1764-3061-4be5-b438-a25fa790aaf1","resolution":{"observed_at":"2026-08-01T12:17:36.524701Z","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-01T12:17:36.690699Z","title":"SIAM Journal on Optimization , volume =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:36.690699Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:ad5868064a0f54d2327e5e11c41c162aeca6237cbc6ff3952a4caabe29c25db8","observation_id":"aacf81d3-70e8-41cb-bed9-845be4a2fc88","resolution":{"observed_at":"2026-08-01T12:17:36.690699Z","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-01T12:17:36.858822Z","title":"Mathematical Programming , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:36.858822Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:755245c807a8a1a46ffdf0369f2a92226ba32e89a3244a7d35cd393b27f29efb","observation_id":"7dedbc06-b6af-4382-816e-7d0bc7e0059b","resolution":{"observed_at":"2026-08-01T12:17:36.858822Z","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-01T12:17:37.026759Z","title":"2021 , isbn =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:37.026759Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:b91cdf02985b5b55c305f75f58ab76fe70c5e68a0de36483474d46d0cd8c5afe","observation_id":"b9b6a0fe-b982-4eaf-a029-2b15ef4787e6","resolution":{"observed_at":"2026-08-01T12:17:37.026759Z","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-01T12:17:37.152762Z","title":"Mathematical Programming , volume =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:37.152762Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:37088dc1161d7bc81f56e4701144fd995dfb3a10af8f22a2e82a0faeea2aa3a6","observation_id":"ad952501-2742-4aac-9412-3c0fe834b449","resolution":{"observed_at":"2026-08-01T12:17:37.152762Z","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-01T12:17:37.292763Z","title":"Mathematical Programming , volume =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:37.292763Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:7af1b323d793997bfe16f1f94427eab780b3ab177b73ef389fbf8d7b2ecf7e1e","observation_id":"23151479-67e1-4140-84f2-56a3f537da88","resolution":{"observed_at":"2026-08-01T12:17:37.292763Z","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-01T12:17:37.448730Z","title":"Journal of Scientific Computing , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:37.448730Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:0f16f74f5b350b389611878855c7030b175198fdf2bc90eeb2edff6b45c518d8","observation_id":"1622f501-b88c-4fec-bdbf-0b841575b635","resolution":{"observed_at":"2026-08-01T12:17:37.448730Z","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-01T12:17:37.602928Z","title":"Journal of Optimization Theory and Applications , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:37.602928Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:03296ed7be537a1eeeb6719901e92430e6699ac1538162b27545b80f008dd9be","observation_id":"8f508f35-b573-41df-9556-5da88277b719","resolution":{"observed_at":"2026-08-01T12:17:37.602928Z","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-01T12:17:37.748348Z","title":"SIAM Journal on Optimization , volume =","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:37.748348Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:06c29c8a77dfa00efc105091f7e27b3235db8926338209e607c5956b6f880bbc","observation_id":"83ae1eb5-c57a-4081-836d-459fa4ba337b","resolution":{"observed_at":"2026-08-01T12:17:37.748348Z","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-01T12:17:37.922372Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:37.922372Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:8f3d4cc282a8ff7743d1e2ddc334c13d1f200a869fb8ca6944e0a314296c4ebb","observation_id":"8d9c5bd9-381d-4f3a-b1b9-85d5e40ee508","resolution":{"observed_at":"2026-08-01T12:17:37.922372Z","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-01T12:17:38.104863Z","title":"and Gould, Nicholas I","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.104863Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:47e24dd10f7c2391ec9f1521faa62ce3eb210a43ff6d485920d055dcf940af94","observation_id":"53efc4b3-5b30-4a1f-9b53-0f0f68a09f9e","resolution":{"observed_at":"2026-08-01T12:17:38.104863Z","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-01T12:17:38.266633Z","title":"and Kouri, Drew P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.266633Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:17b185d137027e8ec77cd40e221178e1d6c996c58915db1118dfbb30c9f688f4","observation_id":"4537e20e-3dc6-47b9-a0f4-5c347cdaa23e","resolution":{"observed_at":"2026-08-01T12:17:38.266633Z","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-01T12:17:38.436469Z","title":"and Kouri, Drew P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.436469Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:2757bc056080b96119f095f90504f3afaf9f4b88b2cc615c0f56169b80e35014","observation_id":"6b898e76-d1dc-4869-bad9-9b7b49fe3b85","resolution":{"observed_at":"2026-08-01T12:17:38.436469Z","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-01T12:17:38.628950Z","title":"and Funke, Simon W","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.628950Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:75986e868aea649eddfd80399e8cbd1d8e4451f9c6255bd3773ef23c02020b46","observation_id":"2221872d-ea1b-4be6-bd58-938c0ec35465","resolution":{"observed_at":"2026-08-01T12:17:38.628950Z","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-01T12:17:38.690444Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.690444Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:b73165acc88ccca499edb423213761091cc56c12517ae527babb05b29e31cf00","observation_id":"04a4dc67-105d-4544-90ca-fbf4eb07b52e","resolution":{"observed_at":"2026-08-01T12:17:38.690444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07644","last_updated":"2022-10-14T08:53:48Z","snapshot_observed_at":"2026-08-16T16:24:11.820510Z","submitted_at":"2022-10-14T08:53:48Z","title":"Efficient Regularized Proximal Quasi-Newton Methods for Large-Scale Nonconvex Composite Optimization Problems","version":1},"cited_work":{"arxiv_id":"2210.07644","doi":"10.48550/arxiv.2210.07644","metadata_source":"pith","pith_arxiv_id":"2210.07644","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Efficient Regularized Proximal Quasi-Newton Methods for Large-Scale Nonconvex Composite Optimization Problems","venue":"math.OC","work_id":"3067300c-5268-42ff-af30-581799a591d7","year":2022},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.762875Z"},"links":{"cited_paper":"/paper/2210.07644","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:ba15ef2f1e4e70ece783474bf2e64e943fbdd88c9f0557726ef530de57d9e61a","observation_id":"abb1c6c4-cd0c-4b78-8bbc-53ed2ba7bfeb","resolution":{"observed_at":"2026-08-01T12:18:25.906448Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-01T12:17:38.824813Z","title":"Computational Optimization and Applications , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.824813Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:95d534ba9be74985bcab762be5338489958674c038a3b61f8f81cb4006dd0b74","observation_id":"f260ec73-ffd5-47c6-8e94-73567816f59d","resolution":{"observed_at":"2026-08-01T12:17:38.824813Z","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-01T12:17:38.888117Z","title":"Computational Optimization and Applications , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.888117Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:59f76afc03e61bad932476c902222082eb2312d0a275490f6d9377962d65b71a","observation_id":"88769318-e58e-4ebe-a1f8-b03955ad6e0e","resolution":{"observed_at":"2026-08-01T12:17:38.888117Z","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-01T12:17:38.966298Z","title":"and Kouri, Drew P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:38.966298Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:9174e7b242c7fcbb8883e9cd17b1f11330c67ba7b41c0d1cccaec2724f82de86","observation_id":"4db14bc7-d9a8-4b63-bf82-7e385306be18","resolution":{"observed_at":"2026-08-01T12:17:38.966298Z","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-01T12:17:39.021288Z","title":"and Yuan, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.021288Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:d302ef5eced6195678d74253c03e274c9e0abd841d3312a4dc19b00d78cbcd6b","observation_id":"aebe6bbf-cab1-4be7-bfcf-c0134601b284","resolution":{"observed_at":"2026-08-01T12:17:39.021288Z","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-01T12:17:39.078884Z","title":"Journal of Scientific Computing , volume =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.078884Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:8e5e49b5250c34758fdaa736bebc2174c78d2ba1dd2a88f9d90112a5083d3899","observation_id":"3ae24e50-3c1e-47d1-aba8-be175283c48d","resolution":{"observed_at":"2026-08-01T12:17:39.078884Z","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-01T12:17:39.146950Z","title":"and Kouri, Drew P","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.146950Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:3dbc9ecadcd869ac58de0dd0b7dcd6418fbab484abc5b67d116bfe98e5cb5090","observation_id":"fc8ba029-890e-4863-bcb2-67cdade3bd29","resolution":{"observed_at":"2026-08-01T12:17:39.146950Z","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-01T12:17:39.204816Z","title":"and Lubberts, Zachary and Robinson, Daniel P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.204816Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:d1faae7286867bfbc228f4f631d4c0b3475cd7642faa8571541c201d4f4fc975","observation_id":"063c3947-d12b-4a3b-9959-e657e27410af","resolution":{"observed_at":"2026-08-01T12:17:39.204816Z","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-01T12:17:39.257781Z","title":"and Robinson, Daniel P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.257781Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:c449813850c256d533bb68c293ac265bb24ffaebb37f03ab9e57dcd4a8fb43c1","observation_id":"8ce3e1e2-ac69-4f83-94b7-39e4dbe15e2f","resolution":{"observed_at":"2026-08-01T12:17:39.257781Z","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":"2512.00538","doi":"10.48550/arxiv.2512.00538","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T12:18:25.349403Z","title":"A multilevel proximal trust-region method for nonsmooth optimization with applications , year =","venue":null,"work_id":"fc7c3394-c6b0-4460-b3a5-bc0b2201048b","year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.287653Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:1a04eceacc77ca2b93ccdf1b9a6c51baa6a514349963d0a792a4842352f6e15d","observation_id":"20a1ee72-ac1b-458c-8e14-188529eb9fe9","resolution":{"observed_at":"2026-08-01T12:18:25.499398Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-01T12:17:39.314861Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.314861Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:a7e989abf296ef520f40ca785eb20e3b8980954c8f21949ea5defd8dddbc3f2e","observation_id":"a2408436-36c7-4ce8-9d86-7aa11c23c5a3","resolution":{"observed_at":"2026-08-01T12:17:39.314861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.16468","last_updated":"2025-08-22T15:36:42Z","snapshot_observed_at":"2026-08-07T02:47:33.900616Z","submitted_at":"2025-08-22T15:36:42Z","title":"LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates","version":1},"cited_work":{"arxiv_id":"2508.16468","doi":"10.48550/arxiv.2508.16468","metadata_source":"pith","pith_arxiv_id":"2508.16468","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates","venue":"math.OC","work_id":"4a375c11-5af8-41f4-805f-c410dd5e4bae","year":2025},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.395388Z"},"links":{"cited_paper":"/paper/2508.16468","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:94ce2f41e057a7e566da5aaf157374d123053bc9c67b19b58de3e6dfbcec31fa","observation_id":"37d03ae8-a662-4c96-bef8-35e7fb7f936c","resolution":{"observed_at":"2026-08-01T12:18:25.243766Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.08069","doi":"10.48550/arxiv.2602.08069","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2026 , eprint =","venue":"Open MIND","work_id":"78633c97-c535-4784-bbb8-3e4f36423fe4","year":2026},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.541450Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:e7844990a827a4ec516943217e18d0194e8d64734b39233840e50a7662084102","observation_id":"7bb70184-fb94-4a1c-9867-e3c7fbe8a3ed","resolution":{"observed_at":"2026-08-01T12:18:24.977773Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.02079","last_updated":"2025-08-26T01:33:52Z","snapshot_observed_at":"2026-08-11T23:48:49.222291Z","submitted_at":"2024-12-03T01:48:27Z","title":"A simple and practical adaptive trust-region method","version":3},"cited_work":{"arxiv_id":"2412.02079","doi":"10.48550/arxiv.2412.02079","metadata_source":"pith","pith_arxiv_id":"2412.02079","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A simple and practical adaptive trust-region method","venue":"math.OC","work_id":"dd36f62e-252a-410a-8e86-87d856a41f6c","year":2024},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.710343Z"},"links":{"cited_paper":"/paper/2412.02079","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:a12ee16f564760aa6c87a98b18920e78f470dbcf0bcb2cf6472301e7d7b05681","observation_id":"951e849b-d239-4216-b553-1fa6029a6a2f","resolution":{"observed_at":"2026-08-01T12:18:24.746253Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-01T12:17:39.850261Z","title":"INFORMS Journal on Optimization , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.850261Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:e3032692fd2f7481d1baa249c239480345f6f735e62008cb5f96f75dc22b54be","observation_id":"796c9427-23f0-4625-8c9a-e4ac6ca6815d","resolution":{"observed_at":"2026-08-01T12:17:39.850261Z","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-01T12:17:39.964817Z","title":"Mathematical Programming , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:39.964817Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:437ab58fa94bea6ba14f57e9b35ea622c164ba43cb073bfe166d3d04844d4920","observation_id":"3bf60006-8d58-4b75-aff6-1351c232c8f3","resolution":{"observed_at":"2026-08-01T12:17:39.964817Z","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-01T12:17:40.004758Z","title":"Neural Networks , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.004758Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:d44b034c229d56582029fbd68da3da615bd901e8f763e8b7f31a3267cfe93790","observation_id":"3ed4aeb2-9d3a-46cd-aba5-1e4fa054b9f3","resolution":{"observed_at":"2026-08-01T12:17:40.004758Z","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-01T12:17:40.064681Z","title":"Computing a Trust-Region Step , journal =","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.064681Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:18e83e3a689f953e7c6ad6163c0b91585f287de6dfebdd01bdcff4f9b71cabdb","observation_id":"37a9eaa2-403a-4556-947d-abf43dffd894","resolution":{"observed_at":"2026-08-01T12:17:40.064681Z","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-01T12:17:40.090878Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.090878Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:e690c8dee15aa64bdaef6a90417cf7d2748928bc5674ffff6d7f57f78b2509f2","observation_id":"eb97cd64-c2ad-448a-a1e1-223ea00f94f6","resolution":{"observed_at":"2026-08-01T12:17:40.090878Z","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-01T12:17:40.112300Z","title":"Optimization Methods and Software , volume =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.112300Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:57e9ed665ae9449fea0ac95eb0d4c676343673727826df36043daebb3bb6a5a5","observation_id":"5425ccd2-db2d-4a9b-a789-f2016ddf9cd4","resolution":{"observed_at":"2026-08-01T12:17:40.112300Z","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-01T12:17:40.127539Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.127539Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:7709cd040aa030b5b315e044449ff9453313f12b5ac9081ea789d024e5abcda4","observation_id":"9260dfa4-e771-4757-aa3a-bfd8df047ff1","resolution":{"observed_at":"2026-08-01T12:17:40.127539Z","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-01T12:17:40.133324Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.133324Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:2f92c64b5b8184944a64a40fa2f739b0dcea63bdcbff4fe932bf09059308fc1d","observation_id":"0edc12bd-ddbe-46c4-a106-845b03d6549f","resolution":{"observed_at":"2026-08-01T12:17:40.133324Z","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-01T12:17:40.138556Z","title":"Mathematical Programming , volume =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.138556Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:8b45e4172a6dac24306e85dd08ead5bcb519d53b32e7e7340e4fb3800dc577b3","observation_id":"0a16cea3-c989-4b1f-8c65-9292335e7a97","resolution":{"observed_at":"2026-08-01T12:17:40.138556Z","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-01T12:17:40.143206Z","title":"Mathematical Programming , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.143206Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:7234a4f9139707c8b8c16fcf2d5335259c97d58e03f088c2237660eacf2d7eed","observation_id":"93630b5a-5c5b-4408-ad91-1738e6984d7d","resolution":{"observed_at":"2026-08-01T12:17:40.143206Z","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-01T12:17:40.147486Z","title":"Mathematical Programming , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.147486Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:3752e223572b85019b82fdaf97968f29a41ead3014f9a61796797a969a59ecce","observation_id":"2492d264-7a76-4f8f-a1d1-9e1b0cf146cc","resolution":{"observed_at":"2026-08-01T12:17:40.147486Z","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-01T12:17:40.151959Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.151959Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:79dc501137f11772e2f1806974de893ac0e05a96aac72dd8b33f47eff53edb76","observation_id":"e429b80b-68f7-4162-9754-a90030cf57da","resolution":{"observed_at":"2026-08-01T12:17:40.151959Z","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-01T12:17:40.156386Z","title":"SIAM Journal on Numerical Analysis , volume =","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.156386Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:0e376683d3a708c0a3dfb0aeb51de17f955077effef4281a51b32b4268800e7d","observation_id":"1d25bd39-a119-4aa0-a3ac-5633ad32bbe6","resolution":{"observed_at":"2026-08-01T12:17:40.156386Z","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-01T12:17:40.161655Z","title":"Mathematical Programming , volume =","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.161655Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:5c9ff6a27ebb5c6a4b564ed0f626a2148670559183cd6ef279161d0adb10c103","observation_id":"07da79a1-d88b-4ce5-808e-66335ab03ec0","resolution":{"observed_at":"2026-08-01T12:17:40.161655Z","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-01T12:17:40.166118Z","title":"and Robinson, Daniel P","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.166118Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:e745ec9d38d830cfaa2384af89df351cfe40869820ad6a6d3ecdf844e5899913","observation_id":"28c01c0d-ee33-4522-b171-0c0aeb602993","resolution":{"observed_at":"2026-08-01T12:17:40.166118Z","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-01T12:17:40.170653Z","title":"2018 , isbn =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.170653Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:d403851a0192eeb8728fd1b205c2980847904f61e4be09c064727e8f2662b18b","observation_id":"72f2cd96-95de-4728-b4af-b8bb2fa6c350","resolution":{"observed_at":"2026-08-01T12:17:40.170653Z","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-01T12:17:40.175453Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.175453Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:4be7c3d6fd9851fb33c566bd229775ba02b6ad01bb29fa0de7aa1a647754d121","observation_id":"4acb4ec1-44a5-4187-a10a-ff7b384417a6","resolution":{"observed_at":"2026-08-01T12:17:40.175453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.02763","last_updated":"2026-04-29T08:51:48Z","snapshot_observed_at":"2026-08-18T07:02:43.147367Z","submitted_at":"2026-04-03T06:15:10Z","title":"Adaptive Newton-CG methods with global and local analysis for unconstrained optimization with H\\\"older continuous Hessian","version":2},"cited_work":{"arxiv_id":"2604.02763","doi":"10.48550/arxiv.2604.02763","metadata_source":"pith","pith_arxiv_id":"2604.02763","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Adaptive Newton-CG methods with global and local analysis for unconstrained optimization with H\\\"older continuous Hessian","venue":"math.OC","work_id":"b5f0a300-3855-4cdf-9ac6-dfeefb075e52","year":2026},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.180075Z"},"links":{"cited_paper":"/paper/2604.02763","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:6fcebfbc1327c9e9560888c0a119d41fcf86cf629a51a393f08f3bdbb94af247","observation_id":"30dc9422-836e-4a3e-9650-1448eb75b545","resolution":{"observed_at":"2026-08-01T12:18:24.241986Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-01T12:17:40.185107Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.185107Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:860d372a50e534803b636b5b0032938d258905edb3a06cd9faa0f547b06d861d","observation_id":"64ccb216-920c-40cf-904e-eb62b3293516","resolution":{"observed_at":"2026-08-01T12:17:40.185107Z","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-01T12:17:40.189491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.189491Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:e40b24ce6d1c73b8808c8e45cabf02daee9f07e1426f9aa57ec4a41021f1d4ce","observation_id":"53e156e9-15bc-4fa2-ae4f-1fa4252c8ba9","resolution":{"observed_at":"2026-08-01T12:17:40.189491Z","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-01T12:17:40.194416Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.194416Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:bad7c605a02b714acf6eff519a0a132bde8d2bb21b64a8cfb1875fc059006d01","observation_id":"27d26ca8-3fcb-4481-8eec-e93ddb6fc2ab","resolution":{"observed_at":"2026-08-01T12:17:40.194416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.00680","last_updated":"2026-07-07T03:07:53Z","snapshot_observed_at":"2026-08-13T10:14:00.289977Z","submitted_at":"2025-11-01T19:48:08Z","title":"Accelerating Trust-Region Methods: An Attempt to Balance Global and Local Efficiency","version":3},"cited_work":{"arxiv_id":"2511.00680","doi":"10.48550/arxiv.2511.00680","metadata_source":"pith","pith_arxiv_id":"2511.00680","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Accelerating Trust-Region Methods: An Attempt to Balance Global and Local Efficiency","venue":"math.OC","work_id":"4582cf42-c74c-434d-b41f-669469a66e47","year":2025},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.198927Z"},"links":{"cited_paper":"/paper/2511.00680","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:82d5d27e0f277dc420de9fd28b7a4311746f0139472dc67e98adcfe11fe58566","observation_id":"5019e203-c9ce-476b-b3f7-b99ce5373620","resolution":{"observed_at":"2026-08-01T12:18:23.970809Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-01T12:17:40.203720Z","title":"SIAM Journal on Optimization , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.203720Z"},"links":{"citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:8b55390601cc9812b94bcbb443f6931533d1f531cb500eb5feabb5e3079a07e9","observation_id":"db04d525-842f-4557-9ee7-82444313dba8","resolution":{"observed_at":"2026-08-01T12:17:40.203720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.07180","last_updated":"2017-09-21T07:06:26Z","snapshot_observed_at":"2026-08-14T20:31:09.240279Z","submitted_at":"2017-09-21T07:06:26Z","title":"Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.07180","snapshot_observed_at":"2026-08-01T12:17:40.208101Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T12:17:40.208101Z"},"links":{"cited_paper":"/paper/1709.07180","citing_paper":"/paper/2607.19647"},"observation_digest":"sha256:8f337598d8dc1f1c40fbd7e3b37da2b2fd29dbaaad7d8c787857a6e1326dfa20","observation_id":"548a188a-c952-4e32-90e5-9a33434942e3","resolution":{"observed_at":"2026-08-01T12:17:40.208101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.19647","last_updated":"2026-07-22T01:06:15Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T02:46:48.962382Z","submitted_at":"2026-07-22T01:06:15Z","title":"On the Universality of Simple Trust-Region Algorithms"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":56,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":65},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2607.19647."}