{"as_of":"2026-08-08T13:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:79246f3b18f7200d343c631614aaca065d3d08f775b3aa3e34a99adf574fec51","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/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-07T12:21:30.603022Z","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:b65c85cfe38783bafce8864a7db6de5ac55bf496d816646a22bd798fc2f9e269","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"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-07T12:21:30.603022Z","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:f0089f9dc96b7a8a5cec10bf908906780d7b17e70e7748075eb7c835e3a037f2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"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-07T12:21:30.603022Z","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:0f5337d7e46a0aeac1b15930eaf656550652c239fcfc11f045cb1199c0db00f2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01267","last_updated":"2025-07-15T00:34:40Z","snapshot_observed_at":"2026-08-08T12:51:28.386685Z","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-07T12:21:30.603022Z","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:65630f01e71af61d25f86f209c6650c6d5b5dbde97ef1ccf1b30770787a7280f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04987","last_updated":"2023-05-29T01:06:27Z","snapshot_observed_at":"2026-08-08T00:09:27.950482Z","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-07T12:21:30.603022Z","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:71d785544f61d9f02bc57cd6f0e08ba0c6ab6f33d2df955e3abc1ff3a3de21f1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"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-07T12:21:30.603022Z","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:01f7189c06c48023623478033dfecc9862aa3099694222c402065b0b4d2208c0","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-07T12:21:30.603022Z","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:6fd8b9f9958aaddef2bbaf3700883716d2790c3034f04b5bca989b039b499a57","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-07T12:21:30.603022Z","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:0bc4fe7d359fa8ca811d5194754ecd89406e6d0f8bd1ee6df6b7ed971d0297b0","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-07T12:21:30.603022Z","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:0d5eb3115313e836ff898c3df056cf0b1c8b3b03cfd3e50a24e352e1f9ae3d59","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-07T12:21:30.603022Z","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:7fffd2ae426487916da469cd8bbc31080298693e178a6d487da261b996592b8f","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-07T12:21:30.603022Z","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:7566d4fcba55feb2350b1539050b0c6168e8476465fb280eb1c6ead6ed89f495","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"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-07T12:21:30.603022Z","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:13c46bc0e1e5d8765b8045f797f9b45cf5798e1e31fd42a04890ddb20d428f61","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"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-07T12:21:30.603022Z","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:d3fc1fcc12f4ef808be35ca9784fec5939b79dc2257f5a0f088d5b210154380d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"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-07T12:21:30.603022Z","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:b6cb5331f7e5003e106af9374e17e76f437c58a5a936217577fae03a9b756b72","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"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-07T12:21:30.603022Z","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:e958071d78efb4666308006a62bd1f597e3e76bf8e10a3f5bbb96d019c96e564","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13416","last_updated":"2025-05-19T17:50:45Z","snapshot_observed_at":"2026-08-07T15:42:59.825410Z","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-07T12:21:30.603022Z","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:ccfcddc7f3513283c805aa5bced1a3ae9c458eb389c63457ea73262c5bc48687","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-07-06T12:15:41.210310Z","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-07T12:21:30.603022Z","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:392ae71f8a21019e2af5257c635582ebbb8cd6c85cf381b2797b036436225222","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.12645","last_updated":"2025-04-08T16:47:42Z","snapshot_observed_at":"2026-08-07T17:00:09.454751Z","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-07T12:21:30.603022Z","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:bdabcd59673e6ac1159176cf00e53d0ba47f85f6d4db47ef32c73e741d8b99a2","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-07-06T12:15:10.261296Z","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-07T12:21:30.603022Z","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:65d4fef5e443fb593f35a8ac8fdb5535f9443b4aafa7329dbbc7e942e338c71d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/20m134705x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:43:57.104195Z","title":"Inexact high-order proximal-point methods with auxiliary search procedure","venue":null,"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-07T12:21:30.603022Z","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:7afa37c3dd9854ae91c29d5776ba5468a464fc7239df9385af60a37c3916cf9a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.08483","last_updated":"2017-06-26T17:10:10Z","snapshot_observed_at":"2026-07-06T05:48:30.254634Z","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-07T12:21:30.603022Z","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:5de22fee312d5b7bff637c8386854e3eca13fcd24c5ce9c115000300e5f1f201","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"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-07T12:21:30.603022Z","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:84237d9217591f675aba00a793245fad9fceee9a5b7b81833f243f797f1371f2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-07T12:21:30.603022Z","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:94fb763180bb736dba195ddc9321573ebaffb4c4f827b37bfaa1b2336a783a00","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.05782","last_updated":"2017-10-16T15:26:39Z","snapshot_observed_at":"2026-07-06T06:04:26.565016Z","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-07T12:21:30.603022Z","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:f9349837e8e149775c9197ab81dda559277f559ddace2069b7d2dd22f8e32f0a","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-03T16:06:02.288011Z","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-07T12:21:30.603022Z","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:4f8df1ffd56e6375d2df8ee31f7075727bb5604e49a549e387558ccfa148908e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.09626","last_updated":"2022-10-18T06:44:35Z","snapshot_observed_at":"2026-07-06T14:07:04.168531Z","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-07T12:21:30.603022Z","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:b06711ec6a85002cafd8441fb42b07a5524d71e33be74f223966c1c5763b1c1f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"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-07T12:21:30.603022Z","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:0beeb103e099dfd0c5a415f9c5f7ea691f831143b1f0b7aefce50bd42ea27a30","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01832","last_updated":"2022-12-12T11:34:06Z","snapshot_observed_at":"2026-07-06T14:14:02.117220Z","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-07T12:21:30.603022Z","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:15aa636dd3b107a570a22501a8cabf3a49987daf851bdf7da4940c539dcb0eb1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18926","last_updated":"2024-11-20T08:22:59Z","snapshot_observed_at":"2026-07-06T18:21:52.950440Z","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-07T12:21:30.603022Z","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:c029ec77412f676f844580ef176cca21a3f8b347ad9750bf25ffaeffeb4ddc87","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11676","last_updated":"2024-11-21T12:38:53Z","snapshot_observed_at":"2026-08-07T14:48:40.269327Z","submitted_at":"2024-10-15T15:12:52Z","title":"Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems","version":2},"cited_work":{"arxiv_id":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-07T12:21:30.603022Z","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:aaef26b9c5405305141b0974f9bcc4bc4a6102ff0e11aa6d5213caeeb329b441","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-07T12:21:30.603022Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2508.19712."}