{"as_of":"2026-08-07T21:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13b5a6c1b4b4f935a5c1f16d86f786aca28314cf623cf0af626e66faf56100a3","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:56:11.983916Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T02:28:43.704810Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-06-30T20:05:04.712024Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"cited_work":{"arxiv_id":"2508.01353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.01353","snapshot_observed_at":"2026-06-30T20:05:04.712024Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","venue":"math.OC","work_id":"5f49f184-3c68-499c-98ef-91642720e446","year":2025},"citing_paper":{"arxiv_id":"2605.15512","last_updated":"2026-05-28T00:40:19Z","snapshot_observed_at":"2026-07-06T23:26:46.595393Z","submitted_at":"2026-05-15T01:12:32Z","title":"Auto-Conditioned Frank-Wolfe Algorithms","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-19T15:34:35.086823Z"},"links":{"cited_paper":"/paper/2508.01353","citing_paper":"/paper/2605.15512"},"observation_digest":"sha256:de8feb22f8119e5588571bb591f86cb1cc1aade7ef789bf7a5bdbd85ff79e567","observation_id":"b597f158-6dd4-4db2-aec2-acb52db01ec5","resolution":{"observed_at":"2026-06-08T02:03:44.434277Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"cited_work":{"arxiv_id":"2508.01353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.01353","snapshot_observed_at":"2026-06-30T20:05:04.712024Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","venue":"math.OC","work_id":"5f49f184-3c68-499c-98ef-91642720e446","year":2025},"citing_paper":{"arxiv_id":"2605.15512","last_updated":"2026-05-28T00:40:19Z","snapshot_observed_at":"2026-07-06T23:26:46.595393Z","submitted_at":"2026-05-15T01:12:32Z","title":"Auto-Conditioned Frank-Wolfe Algorithms","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-30T20:01:43.310456Z"},"links":{"cited_paper":"/paper/2508.01353","citing_paper":"/paper/2605.15512"},"observation_digest":"sha256:424d528e7b94809a39bf9140fe2f1c319c74f2b0a90a3ee91fa8dce95de0b673","observation_id":"420edac5-87c3-42de-a5ca-64870448dd7c","resolution":{"observed_at":"2026-06-30T20:05:04.713684Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.01353","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Linesearch-free adaptive bregman proximal gradient for convex minimization without relative smoothness.arXiv preprint arXiv:2508.01353, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2508.01353","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:97eb869ff4639a4c25a0f33c3ba32a8ded07ce8010314ca89a987f326751133f","observation_id":"4897920e-2656-43a9-81e5-613a406f6ce0","resolution":{"observed_at":"2026-07-14T02:28:43.704810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.01353/citation-record","integrity":"/paper/2508.01353/integrity","json":"/paper/2508.01353/citation-record.json","paper":"/paper/2508.01353"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:56:11.657281Z","title":"A Breg- man forward-backward linesearch algorithm for nonconvex composite op- timization: Superlinear convergence to nonisolated local minima","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.657281Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:3994358956c3eb5373e0a85c668a65057520ed42fe14cccb4a13a3f3360f4988","observation_id":"1a04562d-a5e5-4ec3-878a-9c53d42bfe7e","resolution":{"observed_at":"2026-08-06T05:56:11.657281Z","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-06T05:56:13.130117Z","title":null,"venue":null,"work_id":"5e849046-255a-4da2-8a69-5b17f006ae6f","year":1988},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.671676Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:af17c5b044871d3a7db103b8baa4b06368a7ba5cf66db3aa1127332e02e9f7b4","observation_id":"5d1d235f-44b5-432f-894f-8bda49315abf","resolution":{"observed_at":"2026-08-06T05:56:13.138362Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:13.084462Z","title":"Bauschke, Jérôme Bolte, and Marc Teboulle","venue":null,"work_id":"d0844621-d5fd-4793-8539-474a29149fc2","year":2017},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.680524Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:535b6006e12769f9ad35739d684d1745d966cf79a1585e49ae6810f7ca4fea8f","observation_id":"c6f545cf-3091-4b29-aa69-53e9d0f6cc0b","resolution":{"observed_at":"2026-08-06T05:56:13.096628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:11.689700Z","title":"Bauschke and Jonathan M","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.689700Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:37a4c640f7773a0ff7cd24a1fc072451fa2d657f7e276cbddf0a793543b37f8b","observation_id":"a16006aa-400b-4ddd-b251-dab64231f4fc","resolution":{"observed_at":"2026-08-06T05:56:11.689700Z","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-06T05:56:13.022843Z","title":"Bauschke and Patrick L","venue":null,"work_id":"19818931-b817-42b7-9943-c41f381899b2","year":2017},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.700554Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:f5d87f6c9d8fd664f4083952049cc447726b8d0c0b6b874e19dcd9eba7923035","observation_id":"bd3742dc-428c-4397-890b-2991ba2e2533","resolution":{"observed_at":"2026-08-06T05:56:13.031489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.985486Z","title":"First order methods beyond convexity and Lipschitz gradient continuity with applications toquadratic inverseproblems.SIAM Journal on Optimization, 28(3):2131–2151, 2018","venue":null,"work_id":"6c6a9c00-d72f-4e63-b56d-39766f6e73f4","year":2018},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.708809Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:194c54dace2a356cff14095cfa008f26b90ccfcc92b683e5caf6d1cdd313e1bc","observation_id":"4a374ba7-5ce1-4a3a-9d0d-c61ec124faf2","resolution":{"observed_at":"2026-08-06T05:56:12.992827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.953683Z","title":"Libsvm: A library for support vector machines","venue":null,"work_id":"67893eff-eba7-49f4-ba49-d44fa6faffbb","year":2011},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.718905Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:6484b4dc8e9e4558356e983cc185c19692112095c6e014e2beb34c0060da19f2","observation_id":"c2475d2b-d7d3-4cfd-bed2-857464c0456f","resolution":{"observed_at":"2026-08-06T05:56:12.963474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:11.739026Z","title":"Convergence analysis of a proximal-like minimization algorithm using Bregman functions.SIAM Journal on Opti- mization, 3(3):538–543, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.739026Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:87e2a6a989d805b1e876f0cdf39f1264f50f06b2c97163f22b6a846d4f914426","observation_id":"c045d3e1-c25a-4083-acf9-ff61788ede33","resolution":{"observed_at":"2026-08-06T05:56:11.739026Z","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":"2410.16249","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:56:12.291577Z","title":null,"venue":null,"work_id":"4e3dc96b-ca39-402e-9023-f66623ec6b61","year":2024},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.750585Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:375245bd8ef09d66d8768552b74628d0e220b30931a6ca5e6ff6948d0f4a6819","observation_id":"b0aceaa0-3ae7-4dea-997e-bc20e0f0e2f5","resolution":{"observed_at":"2026-08-06T05:56:12.302457Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.889769Z","title":"Accelerated Bregman proxi- mal gradient methods for relatively smooth convex optimization.Compu- tational Optimization and Applications, 79(2):405–440, 2021","venue":null,"work_id":"e3f6adfc-ec47-43f0-bbe9-502d6b324fde","year":2021},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.759044Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:6c2ecb4fb4fdb57496aeefd536ac4987e31e2c8b844c0bdd2f29095032c37abb","observation_id":"2949f4f0-a783-40d5-95d6-4dedcb1ffb17","resolution":{"observed_at":"2026-08-06T05:56:12.903870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.854462Z","title":"On the conver- gence of adaptive first order methods: Proximal gradient and alternating minimization algorithms","venue":null,"work_id":"bc0f2085-32e4-40d2-b504-6124b0b17e21","year":2024},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.769639Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:ce0965d641e2f967fa17c96197fc48d8fa22c573221c5ca4f1d62e638646b5aa","observation_id":"53fc2096-210b-43e5-8cb4-b88f3551c2ac","resolution":{"observed_at":"2026-08-06T05:56:12.869144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.823600Z","title":"Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient.Mathematical Programming, 2024","venue":null,"work_id":"1a88e10a-8077-4cb7-bd2f-4902c613efe7","year":2024},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.778690Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:c90a83f442870f62e25ab68f7f319f9ab238c17d20952bc6b567478266838971","observation_id":"8624d067-3103-4559-b1de-b78dda8df8dc","resolution":{"observed_at":"2026-08-06T05:56:12.833097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.786167Z","title":"Asimpleuniformlyoptimalmethodwithout line search for convex optimization.Mathematical Programming, pages 1– 38, 2025","venue":null,"work_id":"b1f86d5b-dacf-4e88-ae33-7b3d4e2d2b05","year":2025},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.794414Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:57384683394d122f3f6f5d0ee1c7f0833de485b94ff0fa4f3a5aa7ddebe9b684","observation_id":"a96cda83-e100-4f04-8d96-d47ec8d9eb09","resolution":{"observed_at":"2026-08-06T05:56:12.804900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:11.804179Z","title":"Freund, and Yurii Nesterov","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.804179Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:dee32466941aa8e2c9bf157fa1fb373c0a89a4911f26b3ea4e2038c0bb89ab09","observation_id":"e1d1726d-af75-49fd-a686-0cf78f2a75df","resolution":{"observed_at":"2026-08-06T05:56:11.804179Z","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-06T05:56:12.737676Z","title":"Golden ratio algorithms for variational inequalities.Math- ematical Programming, 184(1):383–410, 2020","venue":null,"work_id":"303f5073-781e-48ad-83b3-e823d749672c","year":2020},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.816677Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:212f93dfe19b8ea104513dcff7107f402d5e415346a1cc597fe1356182cd26fc","observation_id":"847468b0-d098-41bd-a98e-83d0bca89e0b","resolution":{"observed_at":"2026-08-06T05:56:12.746445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.702933Z","title":"Adaptive gradient descent without descent","venue":null,"work_id":"7df01605-b2b5-42c1-88ff-e67fc0242ca1","year":2020},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.827123Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:10f4795f3181be0439937c71ff0ba0f15d62942b61a2af1508012da7e6a22d1e","observation_id":"9e733031-be2e-4c99-a018-8a871dec56d1","resolution":{"observed_at":"2026-08-06T05:56:12.711779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.660840Z","title":"Adaptive proximal gradient method for convex optimization","venue":null,"work_id":"20ba9b60-f66d-4584-967b-1c400a6fa8e4","year":2024},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.838424Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:42de74acbde621fa040fd64be50b3acbb365aeb648a23e512911b32302da14f7","observation_id":"7bbcd656-2c6c-4be7-b163-d548396b29fa","resolution":{"observed_at":"2026-08-06T05:56:12.677560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.625344Z","title":"A method of solving a convex programming problem with convergence rate o(1/k2)","venue":null,"work_id":"15571d41-68c5-495b-807e-46b8743a06c8","year":1983},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.852394Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:70764d6d2801e59055be6cfe60a8d45d87b157f8ce26417e8dc6acce8839e243","observation_id":"c2df17bf-61c7-44fc-8515-cc52cbb092ce","resolution":{"observed_at":"2026-08-06T05:56:12.636426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.587500Z","title":"The symmetry coefficient of positively homogeneous functions","venue":null,"work_id":"cfb10854-8bf1-4252-933f-8a9d4299f814","year":2025},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.862279Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:60a5bf36fe8ab67a6bb417cf9a270f16c6fd15710039cbfb7fd38d2e5a13cb28","observation_id":"1bb0bfa3-2d97-4160-b09e-6dee7395d8d8","resolution":{"observed_at":"2026-08-06T05:56:12.596307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.547689Z","title":"Adaptive proximal gradient methods are universal without approximation","venue":null,"work_id":"593f9ea4-43e4-435f-ac4b-b5220d023f06","year":2024},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.876664Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:59274b9b4eaa3b0f20b6a64f7f5b290a770a6cd8301e70c3c8ae7ef17125be57","observation_id":"ac96e70d-79d5-4087-8493-68b4ed89004a","resolution":{"observed_at":"2026-08-06T05:56:12.559324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.515214Z","title":"Safeguarding adaptive methods: Global convergence of Barzilai-Borwein and other stepsize choices","venue":null,"work_id":"6f07cbbe-d480-4a64-bea3-5cbc5abdea84","year":2024},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.884023Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:611791aeba3b5499f79dd3a7b5d827a2596edda2d6f95000dcab56324d9d4b0b","observation_id":"72c8cde1-6ab0-4728-b8f1-ddb7f3d88c44","resolution":{"observed_at":"2026-08-06T05:56:12.522378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.491913Z","title":"Rockafellar.Convex Analysis","venue":null,"work_id":"d9db7961-4af9-403c-b80b-6ac26cdaf9d1","year":1970},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.895274Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:f870d5d77ced8dedaa7959cd6159eafe159a437f448dd371412f866b4d216615","observation_id":"ca06b6cd-f36f-407a-80be-23f461350b43","resolution":{"observed_at":"2026-08-06T05:56:12.499973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.464168Z","title":"Solodov and Benar F","venue":null,"work_id":"91ca88f0-dafb-4325-a854-c2f813e32646","year":2000},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.904362Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:7a0b81fa65313fa322a1f1479da7c650613e0a06c06e4bc4dfc6dd2f963167f7","observation_id":"eecd4cc3-eae9-4459-a839-b97dd894b518","resolution":{"observed_at":"2026-08-06T05:56:12.470555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-08-07T15:44:31.705808Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-08-06T05:56:11.926307Z","title":"Suh and Shiqian Ma","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.926307Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:8a5bf90ef60f87557abc9cf846944185978649c8cd66da0254fcb0ce0ef8f3d1","observation_id":"2892f6ac-b865-4f2d-b095-dc44e74f3252","resolution":{"observed_at":"2026-08-06T05:56:11.926307Z","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-06T05:56:12.413284Z","title":"Bregman-goldenratioalgorithmsfor variational inequalities.Journal of Optimization Theory and Applications, 199(3):993–1021, 2023","venue":null,"work_id":"af0c1d7e-d8c2-4f06-8e0c-08fb6aa0262c","year":2023},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.942055Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:398449897adbccd72fb35811a2bffa3aee60311f7f87e7d2ee6811ae4b59d101","observation_id":"0d0b3168-0a01-429b-9913-775fc09af71d","resolution":{"observed_at":"2026-08-06T05:56:12.428858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:11.953716Z","title":"Bauschke","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.953716Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:2b51bc9bd644c803f49f6bb69b1bfc7c0fc1818fdabf04baedc32f8cac528cd6","observation_id":"b60fcf26-bf5e-4eee-983a-d35da1a96eac","resolution":{"observed_at":"2026-08-06T05:56:11.953716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07333","last_updated":"2026-04-13T02:18:57Z","snapshot_observed_at":"2026-07-06T21:38:49.668502Z","submitted_at":"2025-06-09T00:25:54Z","title":"Bregman level proximal subdifferentials and new characterizations of Bregman proximal operators","version":3},"cited_work":{"arxiv_id":"2506.07333","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.07333","snapshot_observed_at":"2026-08-06T05:56:12.066390Z","title":"Bregman level proximal subdifferentials and new characterizations of Bregman proximal operators","venue":"math.OC","work_id":"e72142b3-dd72-4077-8580-3e69ec25c05e","year":2025},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.963306Z"},"links":{"cited_paper":"/paper/2506.07333","citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:ae1a780c02172b4bb8f43883198a2c0dc996985cb270b640ad15289fd45efe9a","observation_id":"b8dcd9dd-471b-4045-917c-c6b7b3645d3c","resolution":{"observed_at":"2026-08-06T05:56:12.079917Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.351680Z","title":null,"venue":null,"work_id":"cab4cbbf-728f-4954-896c-18dceb31e637","year":2024},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.972916Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:0a441b82fa914636021b10974d58147ba7115efeba149f6a924e901422f5b7b4","observation_id":"8312ebb2-1a84-4056-948e-bb3b085943db","resolution":{"observed_at":"2026-08-06T05:56:12.360031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T05:56:12.320198Z","title":"Adabb: Adaptive Barzilai- Borwein method for convex optimization.Mathematics of Operations Re- search, 2025","venue":null,"work_id":"e4f543d4-e34c-4dc4-9387-1343fdab108f","year":2025},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.983916Z"},"links":{"citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:6c30ad6a1b55ec25418ac9dea18bf6c0f3bb294b971442564e16ac8c1d310576","observation_id":"f01d00f1-a44d-48d7-8fdf-b69235969c4e","resolution":{"observed_at":"2026-08-06T05:56:12.329581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":19},"total_outbound_references":29},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 3 inbound Pith citation observations for arXiv:2508.01353."}