{"as_of":"2026-08-13T06:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59267ed8e1af210baf1398e1d3cb239e1f1a20b77bf507ae29a57b723ea0c72c","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:36:05.435089Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2412.00059/citation-record","integrity":"/paper/2412.00059/integrity","json":"/paper/2412.00059/citation-record.json","paper":"/paper/2412.00059"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.00145","last_updated":"2022-01-31T23:17:08Z","snapshot_observed_at":"2026-07-06T12:33:08.659572Z","submitted_at":"2022-01-31T23:17:08Z","title":"Step-size Adaptation Using Exponentiated Gradient Updates","version":1},"cited_work":{"arxiv_id":"2202.00145","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.00145","snapshot_observed_at":"2026-08-12T13:36:05.478913Z","title":"Step-size Adaptation Using Exponentiated Gradient Updates","venue":"cs.LG","work_id":"16329270-c1c5-48dd-ba49-f116f1e3c8e0","year":2022},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.357647Z"},"links":{"cited_paper":"/paper/2202.00145","citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:357f4d5075c41629d2c27afa4b1e3d8f27c43cb671dae96f72dda84395e64869","observation_id":"15e53011-91e2-42ca-878d-03fe5a297fcd","resolution":{"observed_at":"2026-08-12T13:36:05.483141Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.679063Z","title":"Learning to Learn by Gradient Descent by Gradient Descent","venue":null,"work_id":"3e4f7852-8b07-4849-9f81-1e67200d2f4f","year":2016},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.361688Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:e42fbff262ff2d2ab11a21efd888c6a563e6aa57941d939acb6cf73be5c50aa0","observation_id":"1bb8c044-c254-46b0-a400-19d9c8241f1e","resolution":{"observed_at":"2026-08-12T13:36:05.682232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.669695Z","title":"Minimization of Functions Having Lipschitz Continuous First Partial Derivatives","venue":null,"work_id":"17fe6313-8f1c-41d2-b96b-31da11a07bc8","year":1966},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.365046Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:ddc9b12ec507c88a9586e8bab9122b1f69bd759a7d7f7991a48f79c8a16c5c7f","observation_id":"46ebf565-bdc0-4f39-b90a-c15698878253","resolution":{"observed_at":"2026-08-12T13:36:05.673266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.661070Z","title":"An Introduction to Numerical Analysis","venue":null,"work_id":"0826c48f-03db-4b80-9c4f-b8fba35b2d07","year":1991},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.368208Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:2bba440ab5d5e5cf9a6045c3812c48b60922c7c3009436d2b2c084140ccdc9f8","observation_id":"2ec5adc4-4547-473a-bd57-6b3e5e5c4cd9","resolution":{"observed_at":"2026-08-12T13:36:05.664256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.371542Z","title":"First-Order Methods in Optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.371542Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:b1aae665a093a25ec78d82a1816c202d8d8b53453fe12066cc57ab7ad2f357ea","observation_id":"e7b622e9-fdee-4a89-9122-d6bdabc4c392","resolution":{"observed_at":"2026-08-12T13:36:05.371542Z","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-12T13:36:05.645554Z","title":"Convex Optimization","venue":null,"work_id":"6ea75061-db32-42fb-b258-c792a8eac235","year":2004},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.375008Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:b9265fd181e224f8f34886d8d7f6b35e619529d658a8bab7d4bdcf3222148a5e","observation_id":"8bc968ac-e60f-43f1-9209-b7105f192bb7","resolution":{"observed_at":"2026-08-12T13:36:05.650504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.636282Z","title":"A Class of Methods for Solving Nonlinear Simultaneous Equations","venue":null,"work_id":"25fb1ca1-cd06-4e9b-9e12-3f458148a19a","year":1965},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.378550Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:4458bed64def8be2888c75b5487a369034be799923039fe9b036afb2b8cd7232","observation_id":"f22230e2-8ead-41e7-a1a8-c63f7b0938af","resolution":{"observed_at":"2026-08-12T13:36:05.640170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.627636Z","title":"Quasi-Newton Methods and Their Application to Function Minimisation.Mathematics of Computation, 21(99):368–381, 1967","venue":null,"work_id":"de9493b0-b194-495b-95c0-d6f75bc5dccf","year":1967},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.382658Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:f5318e17f323b2ffac339516ebda881e99d877c1a1a80a1866ccab31db3a5a64","observation_id":"6cc9634e-81c6-425c-8a64-c32f37474318","resolution":{"observed_at":"2026-08-12T13:36:05.630893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.618841Z","title":"Convergence of Quasi-Newton Matrices Generated by the Symmetric Rank One Update","venue":null,"work_id":"76365ece-3a84-46e3-b681-67783995d197","year":1991},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.385767Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:ec45dd38373bce3f403e3abaa2324f5807f29f604cee696c157abc04c60e7054","observation_id":"41751486-82f1-44b1-a749-514381c6edcb","resolution":{"observed_at":"2026-08-12T13:36:05.622039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.610138Z","title":"A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods","venue":null,"work_id":"69cb52e1-4826-496c-a885-6eb29970e450","year":1974},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.388938Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:9c90aa88e4ddc07577e368601ed0984249fd26ac2ada9994c923ed4c2b269c99","observation_id":"0c5f0ce4-88d4-4ebf-943f-5e5fec47e6e1","resolution":{"observed_at":"2026-08-12T13:36:05.613439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.601021Z","title":"Quasi-Newton Methods, Motivation and Theory","venue":null,"work_id":"d0573a5f-070d-45a0-8d84-10b2fe71e918","year":1977},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.391904Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:96ff649154f196b383c0be8b6385b87fca5f987df5e264dbfb0e2ff9be5a7868","observation_id":"f9bd5728-d9a7-48aa-8925-df4d1b3821c3","resolution":{"observed_at":"2026-08-12T13:36:05.604559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.590435Z","title":"Adaptive Subgradient Methods for Online Learning and Stochastic Optimization","venue":null,"work_id":"504e1489-791a-482f-98b4-1f8ac1ac1cb3","year":2011},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.395119Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:c2080fd306a9410b984d92ffa20a7cfae02923571b5f539256c7e486b2d46edb","observation_id":"ef666e6c-8e25-4601-a249-51487d5e0b22","resolution":{"observed_at":"2026-08-12T13:36:05.595694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.581848Z","title":"Neural Networks for Machine Learning, Lecture 6, 2012","venue":null,"work_id":"48c19786-649d-4beb-8e1e-d70ede05b457","year":2012},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.398241Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:3e62d509b835f87a92e2a59f49c132b8b50143cc04c6bbf477eec76dbbddb730","observation_id":"51245e4a-a544-41ef-b211-84e6d813fff7","resolution":{"observed_at":"2026-08-12T13:36:05.585077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.573016Z","title":"Adam: A Method for Stochastic Optimization","venue":null,"work_id":"5b3de02d-5194-46d1-9ce6-5a2b5aedb8b5","year":2015},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.401220Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:4253ea2a63e58b2978a6d8f11f48f8d5c7a7d0af35b5eda7907ae31da7d60217","observation_id":"2d2a2424-3696-4c76-acc0-b8eca82f8689","resolution":{"observed_at":"2026-08-12T13:36:05.576327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.563843Z","title":"Searching for Optimal Per-Coordinate Step-Sizes with Multidimensional Backtracking","venue":null,"work_id":"436893b3-6f6c-4379-ace7-7852f4a0b0c0","year":2023},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.404242Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:8f815eea3c75fa281d846625a347fbb16f0874f93bcff5f3a1c93f9b62e2f8bd","observation_id":"2cc4e405-b3c5-4387-91e2-93ed409f1a47","resolution":{"observed_at":"2026-08-12T13:36:05.567029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.554293Z","title":"Towards Constituting Mathe- matical Structures for Learning to Optimize","venue":null,"work_id":"db2c7a8b-8029-4990-bf4f-3c7e79539835","year":2023},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.407480Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:91add064b97d8d3569c2d4361eda5210783dad6996cce07f49874abedc34eda2","observation_id":"11a69503-bce5-46e9-9344-7679c0d37af0","resolution":{"observed_at":"2026-08-12T13:36:05.558278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.545269Z","title":"Learning Gradient Descent: Better Generalization and Longer Horizons","venue":null,"work_id":"2b0bdfa0-ead7-4cc9-a07e-67f6478d48fa","year":2017},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.410717Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:d9c48f5ae5b8bafae3598cb6b46746f3a5520036a245b3cb4b2365aced04e3db","observation_id":"1623205a-de75-4842-a64c-b66ab0e824e1","resolution":{"observed_at":"2026-08-12T13:36:05.548551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.536613Z","title":"Gradient-Based Hyperparameter Optimization through Reversible Learning","venue":null,"work_id":"d850c9fe-399e-4b23-b18e-143a6c27a1a3","year":2015},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.413605Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:741318a8a2cf4d4d30342134578f573f4a6755a84ee310882509c92fec5c02f3","observation_id":"334057ef-86aa-4a0d-a2ba-999ff0c7b469","resolution":{"observed_at":"2026-08-12T13:36:05.539865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.02540","last_updated":"2015-11-08T23:15:19Z","snapshot_observed_at":"2026-07-06T04:35:47.496684Z","submitted_at":"2015-11-08T23:15:19Z","title":"Speed learning on the fly","version":1},"cited_work":{"arxiv_id":"1511.02540","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.02540","snapshot_observed_at":"2026-08-12T13:36:05.465342Z","title":"Speed learning on the fly","venue":"math.OC","work_id":"6895f998-f102-46ce-8ef0-59a03fc33f80","year":2015},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.416357Z"},"links":{"cited_paper":"/paper/1511.02540","citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:f66f21a079a215e9a59ee5bc357ddad09f5ba968a031e28450334879bb4c58e2","observation_id":"5adbd229-4616-43cf-a47c-9fe90358d80f","resolution":{"observed_at":"2026-08-12T13:36:05.469727Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.527248Z","title":"Fast Exact Multiplication by the Hessian","venue":null,"work_id":"ed31c5ca-ce85-472f-9387-a99c7725957b","year":1994},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.419582Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:200ad17c7e9c41fa6a468367a2b3010c41a078db19d584c40ce806f971f1439f","observation_id":"386e1433-c121-4669-a026-2ba0b2b48ed0","resolution":{"observed_at":"2026-08-12T13:36:05.530859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.517354Z","title":"Greedy Quasi-Newton Methods with Explicit Superlinear Conver- gence","venue":null,"work_id":"f509e50f-8e3f-4be0-a387-ecb11eaf2645","year":2021},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.422725Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:433c33bb4fd46acaf325ec5ec2caf8b289cf2b543f3d47ba3fa300acc2773c32","observation_id":"12c17944-8169-44ca-adc8-c7cecd754ba7","resolution":{"observed_at":"2026-08-12T13:36:05.520759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.508487Z","title":"Large-Scale Convex Optimization: Algorithms & Analyses via Monotone Operators","venue":null,"work_id":"40c99a12-003e-40ec-a9be-2b04c27f1dc9","year":2022},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.425513Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:1b82d327b5121ae9387f86c3be63b293743c2b5e20ec7f841c36242bbc70e450","observation_id":"e70c279a-3034-464c-8d09-4276c043299d","resolution":{"observed_at":"2026-08-12T13:36:05.511750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:36:05.499188Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","venue":null,"work_id":"e25d9fbf-4962-49f6-9b11-8340262e3128","year":2024},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.428511Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:d885a5780fb80428cd2d0ed1c498b2ec7044e8d4276773479c6c189a9e7d3cdf","observation_id":"d48991aa-8905-4efe-8c49-075e16e6d13b","resolution":{"observed_at":"2026-08-12T13:36:05.502475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04310","last_updated":"2018-02-12T19:13:28Z","snapshot_observed_at":"2026-07-06T06:23:01.600775Z","submitted_at":"2018-02-12T19:13:28Z","title":"Stochastic quasi-Newton with adaptive step lengths for large-scale problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04310","snapshot_observed_at":"2026-08-12T13:36:05.431530Z","title":"Stochastic Quasi-Newton with Adaptive Step Lengths for Large-Scale Problems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.431530Z"},"links":{"cited_paper":"/paper/1802.04310","citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:f4c80169622a918e88e13d9d04c1e6518da8f539245f885a9e4bbc169933568e","observation_id":"646507a0-1700-4078-8f5e-cf12a3013c0b","resolution":{"observed_at":"2026-08-12T13:36:05.431530Z","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-12T13:36:05.490179Z","title":"safe operating region","venue":null,"work_id":"d8aea7e4-5e85-4804-80f8-8d0281503b3f","year":2006},"citing_paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T13:36:05.435089Z"},"links":{"citing_paper":"/paper/2412.00059"},"observation_digest":"sha256:cb961a9397aa3647fcf20489b2dd88936694221ea38db1a964f4ec11707bc96b","observation_id":"087b7a44-3498-4e71-a546-f0f41a225b85","resolution":{"observed_at":"2026-08-12T13:36:05.493280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.00059","last_updated":"2025-05-19T07:29:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T13:27:30.712023Z","submitted_at":"2024-11-25T07:13:59Z","title":"A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":21},"total_outbound_references":25},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2412.00059."}