{"as_of":"2026-08-09T02:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:230ed34e49b8585a4c5e61d1e5c1667e6b3fec67de258a39ab23029b904228c0","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:40:46.515991Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T12:17:40.198927Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"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-08T18:22:30.753893Z","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:24900acd036e8ad3cb167ff57102accfb4ebb272e01ab1d0ca1ce08d037ac384","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"}}],"links":{"evidence":"/evidence","html":"/paper/2511.00680/citation-record","integrity":"/paper/2511.00680/integrity","json":"/paper/2511.00680/citation-record.json","paper":"/paper/2511.00680"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:40:19.215733Z","title":"Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint.Mathematical Programming, 173(1-2):79–116, 2019","venue":null,"work_id":null,"year":2019},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:19.215733Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:1dd13763cd37065228f9298222445552050aa1076929912fc0627171baeb6983","observation_id":"6407abc5-7b44-4210-85e4-e9aa34ae044b","resolution":{"observed_at":"2026-08-04T00:40:19.215733Z","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-04T00:40:19.380299Z","title":"Solving the trust- region subproblem by a generalized eigenvalue problem.SIAM Journal on Optimiza- tion, 27(1):269–291, January 2017","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:19.380299Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:709f7df8dacdfb3b6dcb7037e404867732b63ba52a6184339f781888e00859c2","observation_id":"67700226-620d-479a-ba98-11864228f1b1","resolution":{"observed_at":"2026-08-04T00:40:19.380299Z","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-04T00:40:19.532894Z","title":"Inexact tensor methods and their application to stochastic convex opti- mization.Optimization Methods and Software, pages 1–42, 2023","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:19.532894Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:c5bcff4ff668ef106fca7257a54684b1535050a6b5187cdf5876b220b3a79354","observation_id":"4c989f8c-3dea-4991-b42e-cb97e9c7acbf","resolution":{"observed_at":"2026-08-04T00:40:19.532894Z","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-04T00:40:19.740733Z","title":"Advancing the lower bounds: an ac- celerated, stochastic, second-order method with optimal adaptation to inexactness","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:19.740733Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:17a27ef5a572eb2669346d78f7cc1824c05c99eda4f62e40fd520aa5a3c9b2e3","observation_id":"4932429a-e414-4d72-95a0-401ca26d260d","resolution":{"observed_at":"2026-08-04T00:40:19.740733Z","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-04T00:40:19.893447Z","title":"Estimate sequence methods: extensions and approximations.Institute for Operations Research, ETH, Z¨ urich, Switzerland, 2(1), 2009","venue":null,"work_id":null,"year":2009},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:19.893447Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:c2ed2f773d33618c3ef164027f69e086d200c1166001e7557a898c34c5e48f0d","observation_id":"3929a316-7a99-4d89-92c0-2be2086c601f","resolution":{"observed_at":"2026-08-04T00:40:19.893447Z","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-04T00:40:19.987670Z","title":"Knitro: An integrated package for nonlinear optimization.Large-scale nonlinear optimization, pages 35–59, 2006","venue":null,"work_id":null,"year":2006},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:19.987670Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:d3c4f03847b2bd4b41a627a4cc51276066bb7c1e2d025ef54f4e5575772c969b","observation_id":"292ba960-b13f-4b02-929c-8eb00c283841","resolution":{"observed_at":"2026-08-04T00:40:19.987670Z","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-04T00:40:20.130424Z","title":"Op- timal and adaptive monteiro-svaiter acceleration.Advances in Neural Information Pro- cessing Systems, 35:20338–20350, 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:20.130424Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:151e241957c9f73e84e56f1f7f9ad55a78abad3f59943b65f0c044b3ee5b65f0","observation_id":"c9c2d0d4-51c7-4f64-8762-c46f52931cd1","resolution":{"observed_at":"2026-08-04T00:40:20.130424Z","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-04T00:40:20.226362Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:20.226362Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:a0fffd81002c79bf4a9842dfa9393d088291f0a687665404d3fc6a951428bb29","observation_id":"c2b7ebad-435c-4786-8d55-d2180535a360","resolution":{"observed_at":"2026-08-04T00:40:20.226362Z","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-04T00:40:20.415186Z","title":"Adaptive cubic regularisation methods for unconstrained optimization","venue":null,"work_id":null,"year":2011},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:20.415186Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:7efece3c9ea572c1d534fca1ed6740cf2cdac6058757eb6e908bda793e139de8","observation_id":"99f107ee-9da7-41f1-bc0a-c8f9449f7ccf","resolution":{"observed_at":"2026-08-04T00:40:20.415186Z","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-04T00:40:20.550203Z","title":"SIAM, 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:20.550203Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:f98fe7b338a8d7e0f2fc8b96a1ca4b79906249307e01f5326953c6414acb20a2","observation_id":"085466fb-a7a2-4499-9577-3b27588d09bc","resolution":{"observed_at":"2026-08-04T00:40:20.550203Z","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-04T00:40:20.640373Z","title":"Accelerating adaptive cubic regularization of newton’s method via random sampling.The Journal of Machine Learning Research, 23(1):3904–3941, 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:20.640373Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:1b9cac959a9f8bc7527e24349741a05eaee53cbd7ee222e090b482b6e456f335","observation_id":"bbe61e92-6e69-4bc1-a7d4-fbf485f0ee5b","resolution":{"observed_at":"2026-08-04T00:40:20.640373Z","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-04T00:40:20.809632Z","title":"SIAM, 2000","venue":null,"work_id":null,"year":2000},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:20.809632Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:2cae258b008e0e9b05aef51aeb0eacec5b571472a82efa94887d3fd4120b3f6c","observation_id":"54bf1207-8bdf-4203-b273-29bf72de3492","resolution":{"observed_at":"2026-08-04T00:40:20.809632Z","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-04T00:40:20.984749Z","title":"A trust region algo- rithm with a worst-case iteration complexity ofO(ϵ −3/2) for nonconvex optimization","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:20.984749Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:3fbd26527344f92af0b0f10cc4906d9772545a7a7aef959580eb8d056d3d2e09","observation_id":"00229964-deb5-486c-8ed3-6ec16c5fae17","resolution":{"observed_at":"2026-08-04T00:40:20.984749Z","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-04T00:40:21.139526Z","title":"Concise complexity analyses for trust region methods.Optimization Letters, 12:1713–1724, 2018","venue":null,"work_id":null,"year":2018},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:21.139526Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:32f395a2e039eb10308fccae888c6f100c4ecd3c70ca5a0a8d77f598b89450e4","observation_id":"618882fa-16ba-4dc8-a7e5-4d53f124f207","resolution":{"observed_at":"2026-08-04T00:40:21.139526Z","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-04T00:40:21.334752Z","title":"Trust- region newton-cg with strong second-order complexity guarantees for nonconvex opti- mization.SIAM Journal on Optimization, 31(1):518–544, 2021","venue":null,"work_id":null,"year":2021},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:21.334752Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:76b6dc5d8025dd06a75fb50691e24e8711a60d18e220ee149ade79d9de341e81","observation_id":"9034612f-46a8-41c9-a6c4-6cf6dc6dd4c0","resolution":{"observed_at":"2026-08-04T00:40:21.334752Z","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-04T00:40:21.452297Z","title":"SIAM, 1996","venue":null,"work_id":null,"year":1996},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:21.452297Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:c5082b5bd1ea3620de1beb5bcd5014e330cf71418403121e63cbf3b27a250853","observation_id":"37352762-9993-471e-ad79-7e92677ec124","resolution":{"observed_at":"2026-08-04T00:40:21.452297Z","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-04T00:40:21.547223Z","title":"Contracting proximal methods for smooth convex optimization.SIAM Journal on Optimization, 30(4):3146–3169, 2020","venue":null,"work_id":null,"year":2020},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:21.547223Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:855ab5486fa99322fcd61b4547d1b703da62d30ac69c73d87c0ca2cf7652df78","observation_id":"7aa7256b-f619-41ce-9bbc-be7f9f682d7f","resolution":{"observed_at":"2026-08-04T00:40:21.547223Z","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-04T00:40:21.672497Z","title":"Cardinal Optimizer (COPT) User Guide, October 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:21.672497Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:00ac487094a13b2e71342dd65fa3b941d740065de871edcab4f81cad94099ad0","observation_id":"a1673bb2-8750-4ddb-bba8-d791940ef6fa","resolution":{"observed_at":"2026-08-04T00:40:21.672497Z","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-04T00:40:21.776940Z","title":"Accelerated gradient methods for nonconvex non- linear and stochastic programming.Mathematical Programming, 156(1):59–99, 2016","venue":null,"work_id":null,"year":2016},"citing_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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:21.776940Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:f9c08d431a840b1e84b32c8a893b436a5776330eb352ba7b992006e07c8c0968","observation_id":"8719d8ab-6b0a-4347-8488-af31ba131250","resolution":{"observed_at":"2026-08-04T00:40:21.776940Z","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-04T00:40:21.894131Z","title":"On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization.Mathematical Programming, 152(1):491–520, 2015","venue":null,"work_id":null,"year":2015},"citing_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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:21.894131Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:9e8ad34af09e4bca95903251c33754920eb3428510bc72b193ffd47c818d7362","observation_id":"a8aff5d8-49ca-46f2-bd7d-aa3d1ac43c2e","resolution":{"observed_at":"2026-08-04T00:40:21.894131Z","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-04T00:40:21.972014Z","title":"A consistently adaptive trust-region method.Advances in Neural Information Processing Systems, 35:6640–6653, 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:21.972014Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:29c154f6b08b14cf10a50c1440c7f5e291c0876af69d95d7b882afa9552a8ba5","observation_id":"76377cbe-28f8-4485-8e30-486b9b8eb653","resolution":{"observed_at":"2026-08-04T00:40:21.972014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.02079","snapshot_observed_at":"2026-08-04T00:40:22.098755Z","title":"A simple and practical adaptive trust-region method","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:22.098755Z"},"links":{"cited_paper":"/paper/2412.02079","citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:bc4237abb1dbfb93853d1473c8de3e84c2a77d711a266b88828cc36d1fbc00b8","observation_id":"e51d5fd2-4b38-4167-96b4-67a5cc4734df","resolution":{"observed_at":"2026-08-04T00:40:22.098755Z","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-04T00:40:22.244746Z","title":"Ho- mogeneous second-order descent framework: a fast alternative to Newton-type meth- ods.Mathematical Programming, May 2025","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:22.244746Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:dd4835dc856124a66769ba100d3d87e862ff699a31614e85506dcaeeea409d85","observation_id":"2441e0d2-0933-4303-a6ce-fd356158acc4","resolution":{"observed_at":"2026-08-04T00:40:22.244746Z","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-04T00:40:22.306471Z","title":"A second-order cone based approach for solving the trust-region subproblem and its variants.SIAM Journal on Optimization, 27(3):1485–1512, 2017","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:22.306471Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:f5f61ce770e7b6ee37d87b452f284f3ffa55911ad1ba07e7a06ff12d16d6e146","observation_id":"e683473d-2032-4b23-bbdd-a8920835ed18","resolution":{"observed_at":"2026-08-04T00:40:22.306471Z","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-04T00:40:22.419715Z","title":"An approximation-based regularized extra-gradient method for monotone variational inequalities.SIAM Journal on Optimization, 35(3): 1469–1497, 2025","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:22.419715Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:8736f29cae4c4a3af4731bc7a756a34a6890b55ec2847d310ccb769c7e6a9674","observation_id":"de4f14dd-6165-4961-82fe-7a471721a3fc","resolution":{"observed_at":"2026-08-04T00:40:22.419715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11951","last_updated":"2024-02-19T08:46:28Z","snapshot_observed_at":"2026-07-06T17:32:06.610773Z","submitted_at":"2024-02-19T08:46:28Z","title":"Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11951","snapshot_observed_at":"2026-08-04T00:40:22.516877Z","title":"Inexact and implementable acceler- ated newton proximal extragradient method for convex optimization.arXiv preprint arXiv:2402.11951, 2024","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:22.516877Z"},"links":{"cited_paper":"/paper/2402.11951","citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:b9514d2325996283a259c515cf493f9b20ca0a7eb4ce4a3f84fd8f9354932abc","observation_id":"e844de6a-cf8f-4d7e-9fd3-bb3f10b63ac8","resolution":{"observed_at":"2026-08-04T00:40:22.516877Z","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-04T00:40:22.595194Z","title":"A unified adaptive tensor approximation scheme to accelerate composite convex optimization.SIAM Journal on Optimization, 30(4):2897–2926, 2020","venue":null,"work_id":null,"year":2020},"citing_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},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:22.595194Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:29c248ebfac60b4de4d25bcf923068650f6efde212a6ef2467084a0672e560fe","observation_id":"ecaecf75-08a1-4067-9d0c-26d2197416c6","resolution":{"observed_at":"2026-08-04T00:40:22.595194Z","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-04T00:40:22.651565Z","title":"An optimal high-order tensor method for convex optimization.Mathematics of Operations Research, 46(4):1390–1412, 2021","venue":null,"work_id":null,"year":2021},"citing_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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:22.651565Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:154312a95b2c87e120c936b38463054f5f2ccb6f6d16d1d7177a61a587fbdcc7","observation_id":"4168f58b-b4cd-48b4-b5fe-b22a095a1339","resolution":{"observed_at":"2026-08-04T00:40:22.651565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.09674","last_updated":"2024-01-10T05:05:20Z","snapshot_observed_at":"2026-07-06T12:39:32.422054Z","submitted_at":"2022-02-19T20:31:05Z","title":"Generalized Optimistic Methods for Convex-Concave Saddle Point Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.09674","snapshot_observed_at":"2026-08-04T00:40:46.396278Z","title":"Generalized optimistic methods for convex-concave saddle point problems.arXiv preprint arXiv:2202.09674, 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.396278Z"},"links":{"cited_paper":"/paper/2202.09674","citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:92a2fcc6eafd06bb837c8c6c88b2d62b202f4d62fff96cb235684cd2fc3510b7","observation_id":"09d2aae2-2b09-445e-8410-8a4968ef05b4","resolution":{"observed_at":"2026-08-04T00:40:46.396278Z","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-04T00:40:46.399784Z","title":"Accelerated quasi-newton proximal extragradient: Faster rate for smooth convex optimization.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.399784Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:6a1a5a5d95200b9c1c527bb890f6dc3c016d43c4253a18b853e8688f280ff356","observation_id":"3b65c684-2260-4369-bab3-169330c2d5d0","resolution":{"observed_at":"2026-08-04T00:40:46.399784Z","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-04T00:40:46.403637Z","title":"H¨ olderian Error Bounds and Kurdyka- Lojasiewicz In- equality for the Trust Region Subproblem.Mathematics of Operations Research, 47(4): 3025–3050, November 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.403637Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:29602a57181fd04ac86cb7b41e77179cc5eb51d2a8741593990d6628516f914c","observation_id":"6a82f285-12a4-4362-ad8c-6d174b112c80","resolution":{"observed_at":"2026-08-04T00:40:46.403637Z","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-04T00:40:46.407623Z","title":"Be- yond nonconvexity: A universal trust-region method with new analyses.arXiv preprint arXiv:2311.11489, 2024","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.407623Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:605ad354e5421b3a669bfb07dedc2ba598375fadfde257fc160c9cc148681ca6","observation_id":"dafb6169-c482-4583-878e-1d6136ae316b","resolution":{"observed_at":"2026-08-04T00:40:46.407623Z","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-04T00:40:46.411006Z","title":"The first optimal acceleration of high-order methods in smooth convex optimization.Advances in Neural Information Processing Systems, 35:35339–35351, 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.411006Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:2fa575aff71a2167d4690027288240637365d2ed9dfab96c7388fee3754aa53b","observation_id":"3fe96730-38e6-49d8-b141-88a11aaeae65","resolution":{"observed_at":"2026-08-04T00:40:46.411006Z","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-04T00:40:46.415275Z","title":"An optimal method for stochastic composite optimization.Mathemat- ical Programming, 133(1):365–397, 2012","venue":null,"work_id":null,"year":2012},"citing_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},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.415275Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:24a40c9894c7dcd7e8ca7926516b576ce041ea7b1df18ac1744e309defb1ebbe","observation_id":"f6662670-5a58-4160-a9c0-fea30ec7c454","resolution":{"observed_at":"2026-08-04T00:40:46.415275Z","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-04T00:40:46.419425Z","title":"Perseus: A simple and optimal high-order method for variational inequalities.Mathematical Programming, 209(1):609–650, 2025","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.419425Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:99c9e0d13360a3fea3a8efc932b465a78aa7ac65b0e70a9f1a5f2fd2bd467dc9","observation_id":"9323b78c-d0a1-45b1-915b-f6528dd483ba","resolution":{"observed_at":"2026-08-04T00:40:46.419425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12860","last_updated":"2026-06-01T16:45:39Z","snapshot_observed_at":"2026-08-07T12:22:12.311103Z","submitted_at":"2022-10-23T21:24:37Z","title":"Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.12860","snapshot_observed_at":"2026-08-04T00:40:46.423674Z","title":"Explicit second-order min-max optimization methods with optimal convergence guarantee.arXiv preprint arXiv:2210.12860, 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.423674Z"},"links":{"cited_paper":"/paper/2210.12860","citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:b2a8827dedfefe6e3a58ea34be65819fc97db9d9346b10b616523c0dde510550","observation_id":"78f22018-e2ad-481a-95b8-70318cd0e02f","resolution":{"observed_at":"2026-08-04T00:40:46.423674Z","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-04T00:40:46.427940Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_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},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.427940Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:1c47f35fb0e155bdafd2bc665b47ba98213c1ee9bbf0c34016d4c3862c0a6a1c","observation_id":"4016ae73-e6eb-49f7-801b-05d26d81e726","resolution":{"observed_at":"2026-08-04T00:40:46.427940Z","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-04T00:40:46.431518Z","title":"Regularized Newton Method with GlobalO(1/k 2) Conver- gence.SIAM Journal on Optimization, 33(3):1440–1462, 2023","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.431518Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:a5f0d16ec9d51fe3e5c65c1a6bd227e6c6b88510f42d23a51d718cc4346d291a","observation_id":"ad70ea20-cad7-418f-a66c-03865ec0624a","resolution":{"observed_at":"2026-08-04T00:40:46.431518Z","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-04T00:40:46.435772Z","title":"An accelerated hybrid proximal extra- gradient method for convex optimization and its implications to second-order methods","venue":null,"work_id":null,"year":2013},"citing_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},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.435772Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:87fa68bece6b688c0cfe474ae8aff653d165b6295bff6481a8180119e5abc675","observation_id":"be5ee65b-9984-4a2e-8a25-11d5ef93a155","resolution":{"observed_at":"2026-08-04T00:40:46.435772Z","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-04T00:40:46.439428Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_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},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.439428Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:3c87bcfce8620c9ee21914700d979c92baabe9cdcecf05c7b2aef94ad3c8384a","observation_id":"77893ecc-9ec8-4d22-8423-c387296ec070","resolution":{"observed_at":"2026-08-04T00:40:46.439428Z","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-04T00:40:46.443358Z","title":"Newton’s method","venue":null,"work_id":null,"year":1982},"citing_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},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.443358Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:ba504597d3270c56cc0c13694f75c99c3c573350dcac82d4392ef6a5c3a78deb","observation_id":"d61373fb-4568-4c67-ae88-c1481ebeb2b1","resolution":{"observed_at":"2026-08-04T00:40:46.443358Z","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-04T00:40:46.446771Z","title":"Accelerating the cubic regularization of newton’s method on convex problems.Mathematical Programming, 112(1):159–181, 2008","venue":null,"work_id":null,"year":2008},"citing_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},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.446771Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:ce7252f1e681734266977cce0379ba1bb0009b2c5b76f49552b7a3ad9b6f2281","observation_id":"01849ad1-f12c-43f1-9567-5b024aacbcf4","resolution":{"observed_at":"2026-08-04T00:40:46.446771Z","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-04T00:40:46.450147Z","title":"A method for solving the convex programming problem with conver- gence rateO(1/k 2)","venue":null,"work_id":null,"year":1983},"citing_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},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.450147Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:d1f5ff5b1c7bc70512666379875736338c28c5bfdd934a64e382718be5559524","observation_id":"9402e793-1fd5-447a-a631-0aa08ee82a8c","resolution":{"observed_at":"2026-08-04T00:40:46.450147Z","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-04T00:40:46.453273Z","title":"Springer, 2018","venue":null,"work_id":null,"year":2018},"citing_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},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.453273Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:fb71fedba4b092b52a3cb48017d262ce381c8f7262df3eb6409d0128ec3a2afe","observation_id":"6f5f6f9b-e9cc-4a96-990f-2e5436d8f96f","resolution":{"observed_at":"2026-08-04T00:40:46.453273Z","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-04T00:40:46.456620Z","title":"Implementable tensor methods in unconstrained convex optimization","venue":null,"work_id":null,"year":2021},"citing_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},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.456620Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:505b7bba51144a6eb8958e8768e43ddd8ac200cd38336849602ebb5348325d7d","observation_id":"3e3e3da8-cc0f-4258-9372-b02f329f11ad","resolution":{"observed_at":"2026-08-04T00:40:46.456620Z","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-04T00:40:46.459857Z","title":"Cubic regularization of newton method and its global performance.Mathematical Programming, 108(1):177–205, 2006","venue":null,"work_id":null,"year":2006},"citing_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},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.459857Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:79670e750cdcdd2ce8a3d1aa298ca2482dc90083dfe313e27bbbf0f1fd9cc210","observation_id":"2c48984b-c116-46a6-b89e-0e3fbc8f7e5f","resolution":{"observed_at":"2026-08-04T00:40:46.459857Z","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-04T00:40:46.462982Z","title":"Springer, 1999","venue":null,"work_id":null,"year":1999},"citing_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},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.462982Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:48bf53e44f3df5fd988a0a8ac249d42ce9e254d851c1b699356ff5c0767ee58d","observation_id":"9d2c48c3-4444-4d41-8120-be32ba0655e5","resolution":{"observed_at":"2026-08-04T00:40:46.462982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15595","last_updated":"2021-04-13T15:51:01Z","snapshot_observed_at":"2026-07-06T10:29:01.682011Z","submitted_at":"2020-12-31T13:14:26Z","title":"Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.15595","snapshot_observed_at":"2026-08-04T00:40:46.466473Z","title":"Ten- sor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities.arXiv preprint arXiv:2012.15595, 2020","venue":null,"work_id":null,"year":2012},"citing_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},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.466473Z"},"links":{"cited_paper":"/paper/2012.15595","citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:883b8aa39daf66cb16367470387beb4edf5eaf946652a71d0983327ae548b201","observation_id":"2e2eaf79-6e8b-422e-9468-9e0ef5e4e818","resolution":{"observed_at":"2026-08-04T00:40:46.466473Z","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-04T00:40:46.470388Z","title":"Newton’s method and its use in optimization.European Journal of Operational Research, 181(3):1086–1096, 2007","venue":null,"work_id":null,"year":2007},"citing_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},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.470388Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:cb1cb1c5233389970cb3b4a9439bb544e1a6b7478da71f57890f521d7f34f571","observation_id":"1baa864f-50a6-4f8d-a895-c5cebf84893e","resolution":{"observed_at":"2026-08-04T00:40:46.470388Z","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-04T00:40:46.473569Z","title":"PDFO: a cross-platform package for powell’s derivative-free optimization solvers.Mathematical Programming Computation, pages 1–25, 2024","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.473569Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:36eb98c82d2fe56a61ed13132da40e68cd0dd4403d6590bfeac08084a5bef35a","observation_id":"f7746f04-d405-4519-9ddb-c416772be4f3","resolution":{"observed_at":"2026-08-04T00:40:46.473569Z","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-04T00:40:46.476728Z","title":"Santos, and Danny C","venue":null,"work_id":null,"year":2001},"citing_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},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.476728Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:0c1f9935ac140813494aaf5c1582cff5354e77c76fa7b355cbc18c03796c96f2","observation_id":"5500dc41-16b5-43d1-be14-b35203ef675f","resolution":{"observed_at":"2026-08-04T00:40:46.476728Z","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-04T00:40:46.480112Z","title":"Trust region policy optimization","venue":null,"work_id":null,"year":2015},"citing_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},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.480112Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:f0ab15427fdbbc869fef394096831046153a301138144a2d7db33a9e4f7402a7","observation_id":"4d4822ac-de9a-4703-b289-183ae1673d0f","resolution":{"observed_at":"2026-08-04T00:40:46.480112Z","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-04T00:40:46.483213Z","title":"Unified acceleration of high-order algorithms under general H¨ older continuity.SIAM Journal on Optimization, 31(3):1797–1826, January 2021","venue":null,"work_id":null,"year":2021},"citing_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},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.483213Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:2fe3510db4d2f4b5065567808cd117500e9c46b56cf27ba036808f9729ed035c","observation_id":"b0d992ff-80d3-4996-8a7d-8092290ce3c7","resolution":{"observed_at":"2026-08-04T00:40:46.483213Z","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-04T00:40:46.485918Z","title":"Vavasis and Richard Zippel","venue":null,"work_id":null,"year":1990},"citing_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},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.485918Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:49f85153492c16172ca59e02a5b2f904cca9948b1b644ef1ce93c70e537ef209","observation_id":"908eb1da-d5f3-4ecf-a4ac-2af2069ae2e7","resolution":{"observed_at":"2026-08-04T00:40:46.485918Z","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-04T00:40:46.489027Z","title":"The generalized trust region subproblem: solution complexity and convex hull results.Mathematical Programming, 191(2):445– 486, 2022","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.489027Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:70b6da88fd44ac2ca7bb51014697e646fc2ad61ae9115b6081d885d0f8885e1a","observation_id":"26d9982c-4928-4be6-b955-ecfcbc456993","resolution":{"observed_at":"2026-08-04T00:40:46.489027Z","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-04T00:40:46.492882Z","title":"Accelerated first-order primal-dual proximal methods for linearly con- strained composite convex programming.SIAM Journal on Optimization, 27(3):1459– 1484, 2017","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.492882Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:d676d5bba161bc593c40a4cd2b4b213e1a0cab0bf463e709f077c6e82a38d659","observation_id":"74ec9abe-a1cb-4d66-8cc2-57fda3a71bec","resolution":{"observed_at":"2026-08-04T00:40:46.492882Z","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-04T00:40:46.496028Z","title":"Accelerated primal–dual proximal block coordinate updating methods for constrained convex optimization.Computational Optimization and Applications, 70(1):91–128, 2018","venue":null,"work_id":null,"year":2018},"citing_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},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.496028Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:ae128da11497bd808c7e502e8e731f5e78d5a8db29b74643974781e7bd7f3aec","observation_id":"7bf0c977-1f64-4a0d-8ce8-5a2dca3200df","resolution":{"observed_at":"2026-08-04T00:40:46.496028Z","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-04T00:40:46.498940Z","title":"Trust region based adversarial attack on neural networks","venue":null,"work_id":null,"year":2019},"citing_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},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.498940Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:f3181054c0ea9b8d46af60c3173f7074b1fc81d5cc43dfc021736483e908933c","observation_id":"da841b8c-ca8e-4b5e-ae00-b74d24b7b246","resolution":{"observed_at":"2026-08-04T00:40:46.498940Z","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-04T00:40:46.502834Z","title":"A New Complexity Result on Minimization of a Quadratic Function with a Sphere Constraint","venue":null,"work_id":null,"year":1991},"citing_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},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.502834Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:1f3937319d19a807a09c6208826b170915deac98aa6eda0739684f3e5896cacc","observation_id":"39eb7744-cc46-40ea-ab6b-379926c552c2","resolution":{"observed_at":"2026-08-04T00:40:46.502834Z","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-04T00:40:46.506315Z","title":"Second Order Optimization Algorithms I, 2005","venue":null,"work_id":null,"year":2005},"citing_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},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.506315Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:df752992a3952911fb5c191e1862cb0524510f08e43560515afaef8e889f6983","observation_id":"322b87d6-7178-4ebf-9916-1d788d990916","resolution":{"observed_at":"2026-08-04T00:40:46.506315Z","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-04T00:40:46.509267Z","title":"A review of trust region algorithms for optimization","venue":null,"work_id":null,"year":2000},"citing_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},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.509267Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:b9c035372d681549b3f23fe708d400c7bdd070bc1c54a1a3922c5bf06caf2e04","observation_id":"a8a95f65-be5f-4515-9525-7b251c81a1f3","resolution":{"observed_at":"2026-08-04T00:40:46.509267Z","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-04T00:40:46.512590Z","title":"Recent advances in trust region algorithms.Mathematical Program- ming, 151:249–281, 2015","venue":null,"work_id":null,"year":2015},"citing_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},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.512590Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:7a66c61df5d29034ccbe78288db5ff835c15d5f5badebbb6c090e324139b2578","observation_id":"6045808d-5c87-4ab2-ad03-9d6047debae6","resolution":{"observed_at":"2026-08-04T00:40:46.512590Z","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-04T00:40:46.515991Z","title":"1 σ+ ∥y(σ−)−y(σ +)∥+ M σ2 + ∥y(σ−)−y(σ +)∥2 + 2M σ+ ∥y(σ−)−y(σ +)∥ ·ψ+ # +","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.515991Z"},"links":{"citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:aed8e41e7f95b6d6c127c630a44728711fbd6a7a51ea9aa6922a95b7a2af8671","observation_id":"cd72cc7f-a0d3-48ac-b911-59dc47cf956f","resolution":{"observed_at":"2026-08-04T00:40:46.515991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.00680","last_updated":"2026-07-07T03:07:53Z","latest_version":3,"primary_category":"math.OC","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"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":63,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":63},"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 9 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 1 inbound Pith citation observation for arXiv:2511.00680."}