{"as_of":"2026-08-14T20:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:103ef35b56e5fb95f4856d9f4ca5d87b0b404d52a3187d3869e66876c420fdcf","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:43:57.070924Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2508.19712/citation-record","integrity":"/paper/2508.19712/integrity","json":"/paper/2508.19712/citation-record.json","paper":"/paper/2508.19712"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.590132Z","title":"An accelerated second-order method for dis- tributed stochastic optimization","venue":null,"work_id":"6c9f2319-1532-450a-a6b2-142460185d8f","year":2021},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:56.983468Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:b45156fc6422500afb12816be09a022f35e7e230496b9975d991d2f8ac109179","observation_id":"1fa648eb-6b85-4559-a735-0b210f7d40d2","resolution":{"observed_at":"2026-08-05T15:43:57.592969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.562556Z","title":"(19) Lemma 4 (Hanzely et al","venue":null,"work_id":"cf94b1a3-68ca-4617-96d2-a2653db6dccf","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.054017Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:de56b652cfff6fc0d550167d066b3ad55b92098db07ed8e64df5f448c81580cf","observation_id":"882489be-ed8e-4efc-9eb3-58e13c2d51c9","resolution":{"observed_at":"2026-08-05T15:43:57.565502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.524895Z","title":null,"venue":null,"work_id":"4823c2fb-c3b8-4b0a-b005-d6225a3e0362","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.065358Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:a33ddd53056714cb5a5bc185104f6b599126f02beab2600293c70c49457240fe","observation_id":"ccf46b10-bb08-41d6-b6ce-bde2bcf47a73","resolution":{"observed_at":"2026-08-05T15:43:57.528062Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01267","last_updated":"2025-07-15T00:34:40Z","snapshot_observed_at":"2026-08-13T00:39:56.487209Z","submitted_at":"2024-04-01T17:44:07Z","title":"Non-asymptotic Global Convergence Rates of BFGS with Exact Line Search","version":2},"cited_work":{"arxiv_id":"2404.01267","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.01267","snapshot_observed_at":"2026-08-05T15:43:57.352174Z","title":"Non-asymptotic Global Convergence Rates of BFGS with Exact Line Search","venue":"math.OC","work_id":"cef5957c-aab3-44c2-bc93-a1fbd2c268d3","year":2024},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.009923Z"},"links":{"cited_paper":"/paper/2404.01267","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:fd1d9b35e8a508064467c605796c4f97bb77fbe175cac16c9b2d2864b2b19611","observation_id":"b91a0155-806b-485c-8d16-ffdf14f4ac9d","resolution":{"observed_at":"2026-08-05T15:43:57.355863Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04987","last_updated":"2023-05-29T01:06:27Z","snapshot_observed_at":"2026-08-13T12:47:42.906390Z","submitted_at":"2023-02-10T00:21:14Z","title":"Cubic Regularization is the Key! The First Accelerated Quasi-Newton Method with a Global Convergence Rate of $O(k^{-2})$ for Convex Functions","version":2},"cited_work":{"arxiv_id":"2302.04987","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.04987","snapshot_observed_at":"2026-08-05T15:43:57.338701Z","title":"Cubic Regularization is the Key! The First Accelerated Quasi-Newton Method with a Global Convergence Rate of $O(k^{-2})$ for Convex Functions","venue":"math.OC","work_id":"50c7aeea-1e17-49ff-ab0a-6e9576a80d3d","year":2023},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.013360Z"},"links":{"cited_paper":"/paper/2302.04987","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:5ec749963a5b80231c7aa9f10dbaedd10d7292a1b64beffdf244afab0e79f74b","observation_id":"e3cfc58b-8e3e-4384-bbbd-01f0b4c89dbd","resolution":{"observed_at":"2026-08-05T15:43:57.342255Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12860","last_updated":"2026-06-01T16:45:39Z","snapshot_observed_at":"2026-08-13T13:58:42.989260Z","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":"2210.12860","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.12860","snapshot_observed_at":"2026-08-05T15:43:57.315372Z","title":"Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis","venue":"math.OC","work_id":"530e2c55-b5bb-4d1f-8ede-e90b20568169","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.019664Z"},"links":{"cited_paper":"/paper/2210.12860","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:63c237991902ef4fdcee4e3133e216a8a20f944c48cf888c11c2c11200a77ee9","observation_id":"5734c7ec-a7f8-4cb5-b7f1-43cc2befb09d","resolution":{"observed_at":"2026-08-05T15:43:57.318881Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16982","last_updated":"2025-02-24T09:12:29Z","snapshot_observed_at":"2026-08-02T00:32:51.000665Z","submitted_at":"2025-02-24T09:12:29Z","title":"Muon is Scalable for LLM Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16982","snapshot_observed_at":"2026-08-05T15:43:57.022597Z","title":"Jingyuan Liu, Jianlin Su, Xingcheng Yao, Zhejun Jiang, Guokun Lai, Yulun Du, Yidao Qin, Weixin Xu, Enzhe Lu, Junjie Yan, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.022597Z"},"links":{"cited_paper":"/paper/2502.16982","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:d5ac3d523f2a1dbbfd613927c9a69b3617679d486b2ad0a64672751636731bb9","observation_id":"0818d104-be03-4360-98ee-1302b4413160","resolution":{"observed_at":"2026-08-05T15:43:57.022597Z","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-05T15:43:57.031108Z","title":"URL https://doi.org/10.1080/10556788.2020.1854252","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.031108Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:022c38329a71730fb154bb79237ee78deafe837e0496adcf3898ab16485ca70a","observation_id":"cc03ac43-95e7-41a7-9178-6240d9ec33cb","resolution":{"observed_at":"2026-08-05T15:43:57.031108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.581297Z","title":"doi: https://doi.org/10","venue":null,"work_id":"120b9777-e76d-41f5-a4dc-65bb816c1f23","year":2005},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.036621Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:292d56425e6cc735dd934af2afccc66ce42bffd3d7c8494392dae38ea6be0351","observation_id":"b6807173-8bb0-4f9f-934e-248eca276f79","resolution":{"observed_at":"2026-08-05T15:43:57.584299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T15:43:57.048034Z","title":"doi: 10.1007/s10107-019-01405-z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.048034Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:840d4824138e7993a330ab853da601557ec7a86215cd265731be4056d5437374","observation_id":"73ad18b1-7871-4aac-986a-bd32fdaced42","resolution":{"observed_at":"2026-08-05T15:43:57.048034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.553699Z","title":null,"venue":null,"work_id":"801b57fd-b015-4d86-a565-edfb81c390cb","year":2017},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.056743Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:d88fcf2d34cb5a64d40ec32c825566a92497992ccc71073f98873ec24e0e0a4a","observation_id":"3c4f9392-d79f-46a1-9f00-188d87fce2d9","resolution":{"observed_at":"2026-08-05T15:43:57.556596Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.544147Z","title":"Algorithm 4 with parameters θ = 1 +α ≥ 1 +αmax, L≥ (1 +α)3/2Lsemi converges with the rate f (xk+1) − f (x∗) ≤ 270(1 +α)3/2LsemiD 3 k2","venue":null,"work_id":"50950cdf-e545-4cdc-86fa-bf7ca7ba69cb","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.059661Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:4dafda65f16db4c51b5b08be0bc2b01b6ec5af6c5eceb7a1b8858d392c2d8fd9","observation_id":"256fec9d-f337-48cf-9d2d-8cffc1600178","resolution":{"observed_at":"2026-08-05T15:43:57.547364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.534897Z","title":"Furthermore, by convexity, we get f (x∗) ≥ f (xt+1) +⟨∇f (xt+1), x∗−xt+1⟩ ≥f (xt+1) − ∥∇f (xk+1)∥∗ Bk ∥x∗ − xk+1∥Bk","venue":null,"work_id":"ea40fae8-c99d-4bbf-afa9-e86ebb5cb077","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.062407Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:cb047e7a86d6a78e925ddee179fe03da85e42f76cd5c9c7b48ae7aa34a0fede6","observation_id":"beb0b82e-0840-43b6-ad9b-87bfe1ed32da","resolution":{"observed_at":"2026-08-05T15:43:57.538050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.514257Z","title":null,"venue":null,"work_id":"30924a7a-c54e-4d01-95b6-a6785fea939c","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.068249Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:3e6f47e83425344322b33c97b01cd16fe6aa8c885347a9fd2159e5d5f7cf038e","observation_id":"faba8a66-8012-4c22-8f39-4e6badfeae3d","resolution":{"observed_at":"2026-08-05T15:43:57.517810Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.504680Z","title":"(81) D Experiments Our code is available at https://anonymous.4open.science/r/ceqn-stepsizes/","venue":null,"work_id":"b40d9519-4835-4a81-9708-c233004f526a","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.070924Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:54b56e6b6ad31441185e90118b1928ae15bd11bf3cc6bec01d3b7154e9f9e078","observation_id":"af78e3a7-648a-434d-b858-aaa1acda3364","resolution":{"observed_at":"2026-08-05T15:43:57.507851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13416","last_updated":"2025-05-19T17:50:45Z","snapshot_observed_at":"2026-08-11T02:24:53.074355Z","submitted_at":"2025-05-19T17:50:45Z","title":"Gluon: Making Muon & Scion Great Again! (Bridging Theory and Practice of LMO-based Optimizers for LLMs)","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13416","snapshot_observed_at":"2026-08-05T15:43:57.042277Z","title":"Gluon: Making muon & scion great again!(bridging theory and practice of lmo-based optimizers for llms)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":1697,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.042277Z"},"links":{"cited_paper":"/paper/2505.13416","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:f147d194d92d467d800aae00e35596e6dd446e9e50e8c037c78a933fc7b1d0ca","observation_id":"343e4d9b-96f6-47c0-919a-4ff4d0c073e2","resolution":{"observed_at":"2026-08-05T15:43:57.042277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.02952","last_updated":"2021-12-06T11:52:17Z","snapshot_observed_at":"2026-08-14T03:18:18.242325Z","submitted_at":"2021-12-06T11:52:17Z","title":"Gradient Regularization of Newton Method with Bregman Distances","version":1},"cited_work":{"arxiv_id":"2112.02952","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.02952","snapshot_observed_at":"2026-08-05T15:43:57.468081Z","title":"Gradient Regularization of Newton Method with Bregman Distances","venue":"math.OC","work_id":"5df7f434-8a90-4eb0-8168-793db206c2f3","year":2021},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":1972,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:56.993596Z"},"links":{"cited_paper":"/paper/2112.02952","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:92ca8d01143233ccb4efb0373704e0d9a00b0bbb5a483e3400e6a0e0cc33bea9","observation_id":"3ff56f88-0d07-4e18-bda8-02f89db439dc","resolution":{"observed_at":"2026-08-05T15:43:57.471470Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.12645","last_updated":"2025-04-08T16:47:42Z","snapshot_observed_at":"2026-08-09T21:31:17.577486Z","submitted_at":"2025-03-16T20:49:34Z","title":"Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.12645","snapshot_observed_at":"2026-08-05T15:43:57.016425Z","title":"Understanding gradient orthogonalization for deep learning via non-euclidean trust-region optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.016425Z"},"links":{"cited_paper":"/paper/2503.12645","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:d0753cce4112d65f502bd8502f8c26ba60584945236f153801892751483b47eb","observation_id":"eee4ad59-1abc-4558-9daf-6ec7edd85f4e","resolution":{"observed_at":"2026-08-05T15:43:57.016425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.02089","last_updated":"2023-03-01T14:49:01Z","snapshot_observed_at":"2026-08-13T17:22:21.003230Z","submitted_at":"2021-12-03T18:55:50Z","title":"Regularized Newton Method with Global $O(1/k^2)$ Convergence","version":3},"cited_work":{"arxiv_id":"2112.02089","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.02089","snapshot_observed_at":"2026-08-05T15:43:57.291035Z","title":"Regularized Newton Method with Global $O(1/k^2)$ Convergence","venue":"math.OC","work_id":"b4b5b897-86a8-4e2e-9935-01e57b909ce3","year":2021},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.025458Z"},"links":{"cited_paper":"/paper/2112.02089","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:988ee675f8ac603af5d82ee9553bf0bd576d8d9ab1bc8ce88a963af231df3b85","observation_id":"8de9c2ed-0679-4176-b683-18700616ae5d","resolution":{"observed_at":"2026-08-05T15:43:57.295269Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/20m134705x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Inexact high-order proximal-point methods with auxiliary search procedure","venue":"SIAM Journal on Optimization","work_id":"5833b085-0944-42ab-822a-9bcac97adfab","year":null},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.028333Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:79c1582b8ebb5de8752fb18cf0e9dfb299400b236f64007e7a7c18ccef1fc25d","observation_id":"152dd27b-b173-4d0a-b237-f38d2720698e","resolution":{"observed_at":"2026-08-05T15:43:57.109532Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.08483","last_updated":"2017-06-26T17:10:10Z","snapshot_observed_at":"2026-08-13T06:41:22.191727Z","submitted_at":"2017-06-26T17:10:10Z","title":"Complexity of the Regularized Newton Method","version":1},"cited_work":{"arxiv_id":"1706.08483","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.08483","snapshot_observed_at":"2026-08-05T15:43:57.140219Z","title":"Complexity of the Regularized Newton Method","venue":"math.OC","work_id":"d1b5cba3-5127-4869-829c-760ab3a3cad0","year":2017},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.039315Z"},"links":{"cited_paper":"/paper/1706.08483","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:fe180b0b5ce9292997cefd804c599dba89236e8d049363f4d7939f21a2d858be","observation_id":"826f2627-e13e-4107-9b04-08b9f712dc3a","resolution":{"observed_at":"2026-08-05T15:43:57.143561Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.571228Z","title":"Research in this area typically addresses two main aspects: local convergence properties and globalization strategies","venue":null,"work_id":"714ef2f9-fac2-4958-8a05-d03e02b6f136","year":1916},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.050770Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:02da0fe29a1357b739e3e98e243c9c00febc57d8a819123473b23da233927216","observation_id":"573e5515-b365-4d72-98ee-b95f4e972971","resolution":{"observed_at":"2026-08-05T15:43:57.574845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1505.02250","last_updated":"2015-05-09T09:36:26Z","snapshot_observed_at":"2026-07-06T04:17:21.458465Z","submitted_at":"2015-05-09T09:36:26Z","title":"Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergence","version":1},"cited_work":{"arxiv_id":"1505.02250","doi":null,"metadata_source":"pith","pith_arxiv_id":"1505.02250","snapshot_observed_at":"2026-08-05T15:43:57.153405Z","title":"Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergence","venue":"math.OC","work_id":"796b7617-e02f-4f28-8d85-0733d1dbb11b","year":2015},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.033797Z"},"links":{"cited_paper":"/paper/1505.02250","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:24682716001d1b726daf70a238bb23a497eab9379a488f0b95bd2bf60a06f9d6","observation_id":"2b52e38d-9a9b-4055-be90-1a73455f09ab","resolution":{"observed_at":"2026-08-05T15:43:57.156603Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.05782","last_updated":"2017-10-16T15:26:39Z","snapshot_observed_at":"2026-08-14T20:23:23.069236Z","submitted_at":"2017-10-16T15:26:39Z","title":"Second-Order Methods with Cubic Regularization Under Inexact Information","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.05782","snapshot_observed_at":"2026-08-05T15:43:57.000024Z","title":"Saeed Ghadimi, Han Liu, and Tong Zhang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.000024Z"},"links":{"cited_paper":"/paper/1710.05782","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:a60469e052515b34fae3adb99a17efa8906bf82941efd42d55bed4cf6d99e4c7","observation_id":"0a0517f9-8b8e-4a36-b0f5-3f9bf73c6d58","resolution":{"observed_at":"2026-08-05T15:43:57.000024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13082","last_updated":"2024-05-27T10:10:06Z","snapshot_observed_at":"2026-08-13T11:37:12.961685Z","submitted_at":"2023-05-22T14:51:40Z","title":"Sketch-and-Project Meets Newton Method: Global $\\mathcal O(k^{-2})$ Convergence with Low-Rank Updates","version":4},"cited_work":{"arxiv_id":"2305.13082","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.13082","snapshot_observed_at":"2026-08-05T15:43:57.378848Z","title":"Sketch-and-Project Meets Newton Method: Global $\\mathcal O(k^{-2})$ Convergence with Low-Rank Updates","venue":"math.OC","work_id":"0b4bc600-2d4a-44d6-91c9-21fd3a89ff85","year":2023},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.003310Z"},"links":{"cited_paper":"/paper/2305.13082","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:14b1cdc5c0cd9af07f0d8cb5b20d1cc7cb58684c65dda29613347bd753cfd05a","observation_id":"24061f92-daee-4486-932f-0c4e14f8a674","resolution":{"observed_at":"2026-08-05T15:43:57.382656Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.09626","last_updated":"2022-10-18T06:44:35Z","snapshot_observed_at":"2026-08-13T14:03:06.097484Z","submitted_at":"2022-10-18T06:44:35Z","title":"FLECS-CGD: A Federated Learning Second-Order Framework via Compression and Sketching with Compressed Gradient Differences","version":1},"cited_work":{"arxiv_id":"2210.09626","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.09626","snapshot_observed_at":"2026-08-05T15:43:57.494344Z","title":"FLECS-CGD: A Federated Learning Second-Order Framework via Compression and Sketching with Compressed Gradient Differences","venue":"cs.LG","work_id":"0b709665-6c88-44c0-b432-6dda38ecd4b8","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:56.986897Z"},"links":{"cited_paper":"/paper/2210.09626","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:3dc80cf1dc042ba510b65fdccc5b74b699383187095c3a4d94f6cca097e35ce2","observation_id":"a82fe1f6-5d8d-4e6f-b6e0-6365178ce202","resolution":{"observed_at":"2026-08-05T15:43:57.498102Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.10004","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.451505Z","title":"doi: https://doi.org/10.1016/j.ejco.2022.100045","venue":null,"work_id":"e063d976-c766-477d-b5eb-d4a9bac964a1","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:56.996775Z"},"links":{"citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:da463a481f03ab71afa8f1a0494fe2ae3956c3e401970de50b5ad36efec1f332","observation_id":"93590fbb-f4f0-49df-9542-98a59aefed8d","resolution":{"observed_at":"2026-08-05T15:43:57.456387Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01832","last_updated":"2022-12-12T11:34:06Z","snapshot_observed_at":"2026-08-13T13:50:05.510664Z","submitted_at":"2022-11-03T14:12:51Z","title":"Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods","version":2},"cited_work":{"arxiv_id":"2211.01832","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.01832","snapshot_observed_at":"2026-08-05T15:43:57.481071Z","title":"Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods","venue":"math.OC","work_id":"81ea8bf1-711d-47c3-984e-fcb4047f305f","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:56.990304Z"},"links":{"cited_paper":"/paper/2211.01832","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:70069418141ac5abc38c1d6fc1f4d1182e2b215bacfbf070e2d13d989a732460","observation_id":"a20ecb4e-7dc5-4801-a7c0-2d0fd1885959","resolution":{"observed_at":"2026-08-05T15:43:57.484552Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18926","last_updated":"2024-11-20T08:22:59Z","snapshot_observed_at":"2026-08-14T09:24:33.756497Z","submitted_at":"2024-05-29T09:31:45Z","title":"Newton Method Revisited: Global Convergence Rates up to $\\mathcal {O}\\left(k^{-3} \\right)$ for Stepsize Schedules and Linesearch Procedures","version":2},"cited_work":{"arxiv_id":"2405.18926","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.18926","snapshot_observed_at":"2026-08-05T15:43:57.365542Z","title":"Newton Method Revisited: Global Convergence Rates up to $\\mathcal {O}\\left(k^{-3} \\right)$ for Stepsize Schedules and Linesearch Procedures","venue":"math.OC","work_id":"3fd4db43-f0b2-4330-a2bd-6d5a20513533","year":2024},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.006484Z"},"links":{"cited_paper":"/paper/2405.18926","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:75098cad20af50908c811d44d525e0cd27e5a4b8145542c5185f8fbabc56c08f","observation_id":"eb7e5f61-aec7-4b63-9bc4-0f30dc627b04","resolution":{"observed_at":"2026-08-05T15:43:57.368993Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11676","last_updated":"2024-11-21T12:38:53Z","snapshot_observed_at":"2026-08-12T22:22:38.371635Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11676","snapshot_observed_at":"2026-08-05T15:43:57.045262Z","title":"15 Shida Wang, Jalal Fadili, and Peter Ochs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.045262Z"},"links":{"cited_paper":"/paper/2410.11676","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:079abdbee8cd3448d24d2714ae0e66ad570828557187f5c181c4fc5a7be26148","observation_id":"81b7d96b-eb6f-448d-8fd9-32f1a03a4aa3","resolution":{"observed_at":"2026-08-05T15:43:57.045262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T11:25:29.041999Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":10,"verified_exact":8,"verified_fuzzy":7},"total_outbound_references":30},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2508.19712."}