{"as_of":"2026-08-08T09:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc47c2928b1a5353bb0572301a15126b40bb5e974ebd4410d7d25cf28408eab4","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-08T06:32:00.761636+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-07T12:20:17.801478Z","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:09fff157ec33f11c85744791ea966654f24d5ff4b8c868eebc89af94783b29d1","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-07T12:20:17.801478Z","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:d42ee006c69a0c73e912dfeab4f7e2c9171cddd37719a50393711ec0e9c9f55e","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-07T12:20:17.801478Z","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:e738831320541e400e54ca391cfb49aabc58c44d339869efdb2172933ed97187","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-07T12:20:17.801478Z","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:b2ffa1aea850035d5c3856f77ceae46e477a73ff5000347677a745f4e998dd29","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-07T12:20:17.801478Z","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:1967c5b5f191bc38a3443742913a150d634f6bd4888dd1ea1707e0bef28456ba","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-07T12:20:17.801478Z","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:fc8298b0d50d2a3e10fc98e318ed8cbb0da38bba754959d9345639ab9ec19d4b","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-07T14:48:40.269327Z","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-07T12:20:17.801478Z","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:9f2371deeb4fe8a4c341b382640097969164164fdffe91b713763d812ec9d920","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:20:17.801478Z","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:6ac47342229a5998c074e8c39598532363546f8c50c35dcb7d70b32861f1d6c6","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-07T12:20:17.801478Z","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:b585418d4dea09b3ba6aa2616fc6ffad12fc71287c25b903a2e1f08fd70ca599","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-08T02:10:56.650654Z","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-07T12:20:17.801478Z","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:c193bb3480e8a320a5dc16fd9e01cf841214730bb5598be70ebf84fd59875041","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:20:17.801478Z","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:66310b6483b3df665eb1c7a445f654fad203f5a4003a1ef3e62ee961815344f7","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-07T12:20:17.801478Z","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:2021dd5558255a021452d42e83fbbee248d114aaf1e21af0599a72e0cc64c64a","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-07T12:20:17.801478Z","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:cb4bd6f5dde52a6efecf5db4ad8ab57ab29a7c6ee66eb204087933304441230f","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-07T12:20:17.801478Z","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:e91359b8b32a7fc24cbc7aad0e81e8e628c23bef56fb69df44ab8d54674d1971","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-07T12:20:17.801478Z","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:13d3285a6b372ccd98b9cfe6fa8b7a5caae9714d7a76237c8cf30e3be9108d2e","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-07T12:20:17.801478Z","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:f8330f90792f1413df32e85491466c933818e355de61b9cb7c880c197581d8fc","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-07T12:20:17.801478Z","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:286538c99654b9a64e271644dfa34c46e10ed972f2ceadb91ecb2c037d7445f4","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-07T12:20:17.801478Z","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:863901d553d0e568fcaf2ea8357b273d0f64a6385db69c77b8763e770e974694","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-07T12:20:17.801478Z","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:6475619e38e527d342ef57ad864feee6585894c715d1411d0a5c2288836b702e","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-07T12:20:17.801478Z","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:7884be010b55c80112493675bb3e5a4994c738b64a225c76799c22f20ea323da","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-07T12:20:17.801478Z","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:5c9abbb86fb96fb76be51c54c90323611027843edbbd3ed155e72bc3f9818e57","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-07T12:20:17.801478Z","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:44943864ffdfd45e6d79e5878615af26f74d0e9301bdd4ede1ea5307fb76097d","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-07T12:20:17.801478Z","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:2c8c54ddde6fb8b899c4776f373eda30ca4307d75260df54c91b3ce819930091","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-07T12:20:17.801478Z","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:65e85a64a2b92382f16efe1c7deed64806daae532ad2a2d1c5b8fabf948b7188","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-07T12:20:17.801478Z","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:26e7f29ea6ad5dc5948b5b6fb3bd4056018c6fd1c47cb8d00a011fe0cd807c51","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-07T12:20:17.801478Z","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:3e4c7e1725dc74e8f2530052638657c900136754aebec5b9bbf35faa75a754e8","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-07T12:20:17.801478Z","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:861b2ca466a74aa5784ff6171206921043202702ee624d83c730c1eb001539e9","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-07T03:06:09.540422Z","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-07T12:20:17.801478Z","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:9db3c0072c59042317c425c95697f16f5beca18bab03bf60c39a37908121d76e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:20:17.801478Z","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:683fa725f2901721463a92f02775f80d974c05a0512a746d76696dec7fd7ef56","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-07T12:20:17.801478Z","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:18122f9b77edd873a1ef8f99c62a7690c95de30e3fd9af1d9725820727796915","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-07T12:20:17.801478Z","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:775ab7d102a9b0184761f5eafdf8b8d9d5e8112d90417a7e725f45d3606f70bb","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-07T12:20:17.801478Z","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:1140f90fb8740bc915e92068fbcdef0ba450e0d20e8b8cc460c00fc4fd8b18cf","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-07T12:20:17.801478Z","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:c52947403123114d39ef43ede48fadc8e7772d4b1af193a946ebb043b34df709","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-07T12:20:17.801478Z","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:781378579e62ce61797c2d8a3cace791f8d1b9b7dcba4d3ca77b3a2411f8621e","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-07T12:20:17.801478Z","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:a6f19bae7b591facae531c4b86ef47327d22f6642ce4b5f51c254c01592fd262","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-07T12:20:17.801478Z","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:301405874cc80df7b5e541dcc7b273e098b48e81b42410d600fc6a5b25f50c46","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-07T12:20:17.801478Z","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:00ead56bcae5a2b1478b4557c510090bbd37d05890ff98ab08eea8e5757bf74a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:20:17.801478Z","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:31081cd4e7ec4d4586d089680d40ef17048140f987a6afad55377baf1cecd6df","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-07T12:20:17.801478Z","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:663bac3ff200e1d6833209d79acdaef922670f2712e6ca660c94dc2355f73f1d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:20:17.801478Z","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:a0d8d45aaff4850d5200bf39694ebef82adfe8ff1178aa07c251fe47b027366d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T02:28:47.522246Z","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-07T12:20:17.801478Z","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:9e4adc5b974dba2a52795bc3494c4f3850216210cb583d95cde607f3386427e9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:20:17.801478Z","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:3f7553dd2eb3b85518ee039e814e36fe4c00704c27be17a0699ce7356b196553","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-07T12:20:17.801478Z","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:b0c80ffdb114e077805ef9389d9fc58f71336599d6750353ce45cb80042d77e9","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-07T12:20:17.801478Z","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:03c271089fa07b8608c267317c81e75fc2915b3aabd0240aa38ccda71f56636c","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-07T12:20:17.801478Z","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:724f7b794a0317f9ac20bd7dbb0727e96315b909bdb9dfcf93a4c0413cd09d79","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-07T12:20:17.801478Z","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:10e134b5b4e4a99dff773c689c8531e2d1ade415aa2fca83f36e7987f139e943","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-07T12:20:17.801478Z","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:45b6d3c7bcc43089930687af4f5d34b548f89f4665ecc30e123d5d9c85be3a73","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-07T12:20:17.801478Z","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:a5fc38096f0e3424f0d30123071ef42cc8193d55b4c18d812f2e8d887b82312d","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-07T12:20:17.801478Z","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:db28dff9787485fcf022578331f6bdb85a2ac3a3329911a25e93d3489060c33c","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-07T12:20:17.801478Z","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:2b2339cc2bc241fceb9561f1c2484367a50b6c712297f58421ab437795c1168c","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-07T12:20:17.801478Z","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:46afb72c88d77ed000806ca9f23d20c8cd9861fe458acb16227d5e4bed315c44","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-07T12:20:17.801478Z","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:065cad5b8a97b3009fa002798bdda29c9b75fb1499ddf26e3eb044be9ea55327","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-07T12:20:17.801478Z","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:9d4bead6d879f40ca407bf2ea6b8843fd663d052ab313b97c095ed31ac91411a","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-07T12:20:17.801478Z","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:653566d91d90f13c5d801ef9885c08daf50f7ad4fc8fa1f8b05541811a425d69","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-07T12:20:17.801478Z","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:ecdda8c817fb980a3b89c09cf3f7006622290ca5fb5112bff0aaf4a1a7fe585b","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-07T12:20:17.801478Z","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:d4cf9fd3e56d13207ede145c8488462f4bf24220f7246d7a59b1bb33959ac764","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-07T12:20:17.801478Z","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:045d67ab6ce92011c6111840ab983e71017b84cbf5a6b6b6022989df7613c8cc","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-07T12:20:17.801478Z","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:8cedd5309d39cde43d129a6cdcdcc1adeb797c5e4de6e9ec25f54db0ab4bf47a","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-06T17:30:54.038249Z","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-07T12:20:17.801478Z","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:2b77ad9317a2a5d0ca0330a86d886d626fc8a5e6102eb3c671137b9616ac1662","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:20:17.801478Z","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:edf0e40e8f30b1876739dd47e22240c097cf8934c34b9addfd79579fb7c677a4","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-07T12:20:17.801478Z","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:dd401145d0253e44099bb701df4486e94d16009469be7ee5ad6eb2dcd59cfdfe","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-07T12:20:17.801478Z","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:679f2c91e2bdded4fbbfc5feeaaf4708fc86ccf834041290837801c1504a8c91","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-08T05:24:32.371213Z","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-07T12:20:17.801478Z","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:6ca6ffb458d11a6dab58ba1a2e8019facea9f1019db875009b5b0a6752f25b38","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:20:17.801478Z","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:bedda787fe894ca00b96f75e9900cf7d1f31476feec567d9e28252a8ed5bf867","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-07-06T06:00:38.265995Z","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-07T12:20:17.801478Z","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:921fdf76f9960896f50c1042f2da632d387b5d005fae77efb7ded9fa2fae1ec7","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-07T12:20:17.801478Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2607.19647."}