{"as_of":"2026-08-10T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92a71ed1d73c56a7d02d8f3e1935b6d67ba62a799bcc70338848e93f8b8e413d","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:35:12.780086Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2608.05536/citation-record","integrity":"/paper/2608.05536/integrity","json":"/paper/2608.05536/citation-record.json","paper":"/paper/2608.05536"},"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-08T11:35:13.563416Z","title":"Convergence of the iterates of descent methods for analytic cost functions.SIAM Journal on Optimization, 16(2): 531–547, 2005","venue":null,"work_id":"2af5161f-d09b-487e-bd99-c6f5ffc37830","year":2005},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.535999Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:5b6265a2c2b654dedc387fac5bb1e9edc6e17ff55fb1e488cf1a84f2943c18ab","observation_id":"3cea62f9-0874-459a-b5b9-a39526980f9f","resolution":{"observed_at":"2026-08-08T11:35:13.567572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.551341Z","title":"Hessian Riemannian gradient flows in convex programming.SIAM Journal on Control and Optimization, 43(2):477–501, 2004","venue":null,"work_id":"91849d02-96ac-4f1c-bd3b-8d61ab92d14e","year":2004},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.541735Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:69c5d1451935ab80c879d650027e8ea8ab975bb6ef3a17b0990423bf75ec391c","observation_id":"4f8df227-2cd3-409e-91f9-7e7035151074","resolution":{"observed_at":"2026-08-08T11:35:13.555639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.540221Z","title":"Hessian Riemannian gradient flows in convex programming.SIAM Journal on Control and Optimization, 43:477–501, 2018","venue":null,"work_id":"45a7442d-e8e7-44e9-8dbc-ebb961da7412","year":2018},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.546586Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:a7811ef567b09d7755c5a219b41dfc2dc4cfbc2e61bd148945c058ce53caa522","observation_id":"8e8fb99f-5dfb-4483-8904-85b2a2141c1c","resolution":{"observed_at":"2026-08-08T11:35:13.544260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.528908Z","title":"Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.Journal of Optimization Theory and Applications, 121:541–570, 2004","venue":null,"work_id":"6e4548ea-559f-4e88-8f97-67764da52af6","year":2004},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.551303Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:32d21ce5d374a3b1c1eb0a48fd69add52092a99167dee3832bd607552ded611b","observation_id":"cd5a699d-0e1c-4577-91fb-b08d6158ee1a","resolution":{"observed_at":"2026-08-08T11:35:13.533166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.556206Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.556206Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:67cc64e0357ed211f768abebc53378bd8260e75381bc994ed498ff32a9847f05","observation_id":"db7a39b0-fcd3-41cf-b7d4-9b75e17b7c90","resolution":{"observed_at":"2026-08-08T11:35:12.556206Z","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-08T11:35:12.559931Z","title":"The rate of convergence of Bregman proximal methods: Local geometry versus regularity versus sharpness.SIAM Journal on Optimization, 34(3):2440–2471, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.559931Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:5ef9a3fdb5d4687a5cd09bb9f00c3f4dc5ac476be0d4447b3e5fc971c688feaa","observation_id":"ebfc114d-ecbf-40eb-bec9-82ccc588b255","resolution":{"observed_at":"2026-08-08T11:35:12.559931Z","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-08T11:35:13.504336Z","title":"Fast composite optimization and statistical recovery in federated learning","venue":null,"work_id":"7ef92ac0-d27a-45aa-ba13-cb186ff8622b","year":2022},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.563908Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:9d273eb0418f86c6ef55164cc159b1c113a4705f20c88403a64c45348dc264b1","observation_id":"f3609381-a788-4f64-b31c-cf121d78cf88","resolution":{"observed_at":"2026-08-08T11:35:13.508280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.492718Z","title":"Bauschke, Jérôme Bolte, and Marc Teboulle","venue":null,"work_id":"3ae954a8-fb44-4de2-8695-393682af7f59","year":2017},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.568148Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:590722f8034b815cfb4333194608e54bc642d88488cc1fa1f69e6cea08447068","observation_id":"363b0950-74e0-4687-98ab-4bb34d435592","resolution":{"observed_at":"2026-08-08T11:35:13.496504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.572389Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.572389Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:943cd30b88f2f28794e92258def1d19e63df452fd466086a1653ad43f4c31aea","observation_id":"13418df1-ba3b-46d2-8465-050489b14287","resolution":{"observed_at":"2026-08-08T11:35:12.572389Z","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-08T11:35:12.576700Z","title":"MOS-SIAM Series on Optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.576700Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:718ac568f1c18987b3559a296f84f2a4e1d22351d9b672533f4bb78c15882585","observation_id":"8ffdac8c-07b4-4f40-a438-7f83a576de1d","resolution":{"observed_at":"2026-08-08T11:35:12.576700Z","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-08T11:35:12.581163Z","title":"Mirror descent and nonlinear projected subgradient methods for convex optimization.Operations Research Letters, 31(3):167–175, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.581163Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:8c1e1c41ea5b41b6fb6dd73690ea6e9a2b0d886fcb1eb4a1f4ffdf817b15039f","observation_id":"b71996cc-2dac-44f6-a672-815f2a9454d7","resolution":{"observed_at":"2026-08-08T11:35:12.581163Z","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-08T11:35:13.461694Z","title":"Barrier operators and associated gradient-like dy- namical systems for constrained minimization problems.SIAM Journal on Control and Optimization, 42:1266–1292, 2003","venue":null,"work_id":"c7e043dd-24df-4d4f-a3cb-50d6367d72b6","year":2003},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.585284Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:4e95a8e718572718c960a9b5bfae0a29254d44153d35c29c7e07fb0b708717e2","observation_id":"d00a0bc6-9d98-4b89-9609-5c52d9800429","resolution":{"observed_at":"2026-08-08T11:35:13.465769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.589946Z","title":"Barrier operators and associated gradient-like dy- namical systems for constrained minimization problems.SIAM journal on control and optimization, 42(4):1266–1292, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.589946Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:6554a1b9260bca75b76e437d3ecca01d6da5e733884f3e2e245fad735f8a4ed2","observation_id":"1fa38576-1fa0-4295-8513-e0d220306958","resolution":{"observed_at":"2026-08-08T11:35:12.589946Z","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-08T11:35:13.443953Z","title":"The Łojasiewicz inequality for nons- mooth subanalytic functions with applications to subgradient dynamical systems.SIAM Journal on Optimization, 17(4):1205–1223, 2007","venue":null,"work_id":"5bf9c433-5e7c-4a4c-be4b-9b398ed8adf8","year":2007},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.594264Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:587d42170ca0d14b6c3acf978013ac0412b2eb97801795094c101edbd8b268c1","observation_id":"d92d9430-cf85-49a2-a3c8-906ddfbd592f","resolution":{"observed_at":"2026-08-08T11:35:13.447992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.432713Z","title":"Clarke subgradients of stratifiable functions.SIAM Journal on Optimization, 18(2):556–572, 2007","venue":null,"work_id":"02fe5438-b11b-494e-bdf9-4cc2e042d473","year":2007},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.598916Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:be506858bec50d34ac3768fb0a2fba316e408ae0affdb91a75fe23b0566462aa","observation_id":"e252b294-65cd-4e58-aa06-f4a7ba58f46d","resolution":{"observed_at":"2026-08-08T11:35:13.436785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.603087Z","title":"First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems.SIAM Journal on Optimization, 28(3):2131–2151, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.603087Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:e0db3eec214e948f23d8acc07c00907a6e67e94ff3af9f5769c867d470bead4c","observation_id":"147eee1e-ac43-4101-8b76-523d96ee3b44","resolution":{"observed_at":"2026-08-08T11:35:12.603087Z","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-08T11:35:13.414700Z","title":"Hessian barrier algorithms for linearly constrained optimization problems","venue":null,"work_id":"8282030d-887c-4752-ad84-7d91b44b4ab1","year":2019},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.607431Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:afc20e1cf68d268939569f6696252651fba063dfe0b9b623c37e11bff4c2dbe0","observation_id":"d15565ff-bd22-4c4f-a758-f17e63cb45eb","resolution":{"observed_at":"2026-08-08T11:35:13.418735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.611799Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.611799Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:127359b24208d923e05bc4e34b171c3e4f6b6021c2577ec8deb66cde92d992b5","observation_id":"9501e595-3cf5-4d11-899a-dcd103be8271","resolution":{"observed_at":"2026-08-08T11:35:12.611799Z","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-08T11:35:13.397305Z","title":"Sparse and stable markowitz portfolios.Proceedings of the National Academy of Sciences, 106(30):12267–12272, 2009","venue":null,"work_id":"34da7223-a869-45b1-adc8-074d874b8b15","year":2009},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.615798Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:fde4c49638fb4a98ce438a369fcd801679fbd31d1bbc4d79f66591ae6ea51293","observation_id":"dd1e3638-5efc-44b7-9643-a3d10e4f50f3","resolution":{"observed_at":"2026-08-08T11:35:13.401062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.4980","last_updated":"2015-11-16T18:52:04Z","snapshot_observed_at":"2026-08-05T03:03:31.025171Z","submitted_at":"2014-05-20T07:50:56Z","title":"Convex Optimization: Algorithms and Complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.4980","snapshot_observed_at":"2026-08-08T11:35:12.620099Z","title":"Theory of convex optimization for machine learning.arXiv preprint arXiv:1405.4980, 15:2, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.620099Z"},"links":{"cited_paper":"/paper/1405.4980","citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:ce3b221ce1f723ba8d7fc8dee2c5eb643a2154dcd6ba9136481acfb7e86b4c70","observation_id":"8ac0f33e-978f-475e-8099-f31d317ef955","resolution":{"observed_at":"2026-08-08T11:35:12.620099Z","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-08T11:35:13.386073Z","title":"The developments of proximal point algorithms.Journal of the Operations Research Society of China, 10(2):197–239, 2022","venue":null,"work_id":"12e00a4c-ab05-4089-80ef-accd77934b81","year":2022},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.625537Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:3244fce34bac7d66b688d79103d2b2c179a7d4491c436b2f51341440a88c7688","observation_id":"f065e747-a0ac-4c40-affb-06b7adebd63f","resolution":{"observed_at":"2026-08-08T11:35:13.390260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.374485Z","title":"Robust uncertainty princi- ples: Exact signal reconstruction from highly incomplete frequency information.IEEE Transactions on Information Theory, 52(2):489–509, 2006","venue":null,"work_id":"6e2836b3-35c7-4c86-ada7-64da2ef9664f","year":2006},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.629350Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:4c3c0ad20fdc3e5a4db90c41ad4d204c71512afe2b59f2fbb920fd192cbd0cc9","observation_id":"7a6aac30-7d1a-4a00-9995-0d196e3ae64e","resolution":{"observed_at":"2026-08-08T11:35:13.378521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.363229Z","title":"Proximal minimization algorithm with D- functions.Journal of Optimization Theory and Applications, 73(3):451–464, 1992","venue":null,"work_id":"1cfc0fed-fc3e-4ccc-a5ba-6f9308925442","year":1992},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.633193Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:e746bec68a9f0ac9554624b33a95d6a25374a0c8b5c8f4720d47a602ddb731d1","observation_id":"161bdd4d-3375-40ca-9bf6-c19c6cc3a3ed","resolution":{"observed_at":"2026-08-08T11:35:13.367264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.351781Z","title":"Convergence analysis of a proximal-like minimization algorithm using Bregman functions.SIAM Journal on Optimization, 3(3):538–543, 1993","venue":null,"work_id":"3b45370f-dcdc-4243-a7e5-a9c2769ec278","year":1993},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.636869Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:dd410ba263178af8787ca7159923374308a1c54a530a8bc84c4dba6a1ebb9ba1","observation_id":"8130e0e7-db62-400b-9538-b6caa99dbe1e","resolution":{"observed_at":"2026-08-08T11:35:13.355965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2608.05035","last_updated":"2026-08-05T16:41:18Z","snapshot_observed_at":"2026-08-08T23:13:49.258606Z","submitted_at":"2026-08-05T16:41:18Z","title":"On the Iterate Convergence of Bregman Projected Gradient Method","version":1},"cited_work":{"arxiv_id":"2608.05035","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.05035","snapshot_observed_at":"2026-08-08T11:35:12.874589Z","title":"On the Iterate Convergence of Bregman Projected Gradient Method","venue":"math.OC","work_id":"9c024a56-34e4-44fa-bf0e-5bff2a000e75","year":2026},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.640423Z"},"links":{"cited_paper":"/paper/2608.05035","citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:47ef0ca21fe39867cfb0058bc308520efe008d4b5aae18c2f7ec72c043ff8ee9","observation_id":"bd213bdc-957a-4571-9cfe-78f672721347","resolution":{"observed_at":"2026-08-08T11:35:12.878626Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08073","last_updated":"2026-05-25T08:13:38Z","snapshot_observed_at":"2026-07-06T17:59:04.250437Z","submitted_at":"2024-04-11T18:28:01Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08073","snapshot_observed_at":"2026-08-08T11:35:12.644372Z","title":"Spurious stationarity and hardness results for Bregman proximal-type algorithms.arXiv preprint arXiv:2404.08073, version 3, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.644372Z"},"links":{"cited_paper":"/paper/2404.08073","citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:722516d5c250ee901caf2c27159eb66cb1d7a8507e97b65d2dd97baabb570fd7","observation_id":"9ad8222a-0854-4bd9-aa22-dc8ecc2f5350","resolution":{"observed_at":"2026-08-08T11:35:12.644372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.05539","last_updated":"2026-07-06T18:19:24Z","snapshot_observed_at":"2026-08-09T14:37:29.738986Z","submitted_at":"2026-07-06T18:19:24Z","title":"On The Linear Convergence of Bregman Proximal Gradient Methods with Applications to Kullback--Leibler regression","version":1},"cited_work":{"arxiv_id":"2607.05539","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.05539","snapshot_observed_at":"2026-08-08T11:35:12.847758Z","title":"On The Linear Convergence of Bregman Proximal Gradient Methods with Applications to Kullback--Leibler regression","venue":"math.OC","work_id":"07dd617c-55fb-4c65-82d4-bbad4cf96672","year":2026},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.648333Z"},"links":{"cited_paper":"/paper/2607.05539","citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:7a53d90d81b07eb70ac11db4055698d2975051616a589291230aef05b5eccb5b","observation_id":"59dfe6fb-1c22-465b-9b94-95f055b37bb8","resolution":{"observed_at":"2026-08-08T11:35:12.852367Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.339478Z","title":"Norm preserving extension of convex Lipschitz functions","venue":null,"work_id":"20343fa7-10a1-4067-8480-39b36f9cc0e8","year":1978},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.652403Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:fe4dd478375713b68174e719155e3c9aba1c86550a4afbca673204e1c9f95407","observation_id":"77105a6c-06d0-42eb-a132-25ad19cf923b","resolution":{"observed_at":"2026-08-08T11:35:13.343999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.328220Z","title":"Institut de Recherche Mathé- matiques de Rennes, 1999","venue":null,"work_id":"32ba8346-a289-45d1-a3fa-0c356cc8b9dd","year":1999},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.656274Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:b5bec15da01821906151f642c09c9fc60af36303140ca94d797ce7f26f3a08a2","observation_id":"45befb39-22c6-481a-b46d-ed2e27a29770","resolution":{"observed_at":"2026-08-08T11:35:13.332221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.659881Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.659881Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:311629ecf914f9de95083fe423fb5d29d01e5118a0d0fb9de2fba211b81f85e3","observation_id":"6f98060b-7b93-44be-96fb-7c5c598472a4","resolution":{"observed_at":"2026-08-08T11:35:12.659881Z","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-08T11:35:13.309603Z","title":"Stochastic subgra- dient method converges on tame functions.Foundations of Computational Mathematics, 20(1):119–154, 2020","venue":null,"work_id":"6cf5db0c-3b9c-4297-8854-c4ff5d9489f8","year":2020},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.663518Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:d1a78d881049b2e3bbe51ea01074ea2a579bfff622fefa24ed9c456ecaa10322","observation_id":"6425013e-8512-48ea-aeee-849fdfbd47cf","resolution":{"observed_at":"2026-08-08T11:35:13.313337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.299176Z","title":"A gen- eralized approach to portfolio optimization: Improving performance by constraining portfolio norms.Management Science, 55(5):798–812, 2009","venue":null,"work_id":"06f95292-b77f-49ad-8a71-4e1282f0f98e","year":2009},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.666949Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:7738358600d1e7c2f417d9cd53be30cb9f698b0e40a802e628df0815a525e6b2","observation_id":"e9fd6a56-65d3-4ea8-889b-30ddc99aa4c6","resolution":{"observed_at":"2026-08-08T11:35:13.303058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15264","last_updated":"2025-07-25T05:02:24Z","snapshot_observed_at":"2026-08-09T13:13:51.158159Z","submitted_at":"2025-07-21T05:58:52Z","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","version":3},"cited_work":{"arxiv_id":"2507.15264","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.15264","snapshot_observed_at":"2026-08-08T11:35:12.832204Z","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","venue":"math.OC","work_id":"b2f530cc-3159-40eb-9278-b753c1c045ec","year":2025},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.670469Z"},"links":{"cited_paper":"/paper/2507.15264","citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:9eaa9a3e8566aaf2bef06b9e6cba3069705226f11bba0dd1b03139b0f2b9237e","observation_id":"200ae0e2-9f2b-4745-82f0-397774baa5a1","resolution":{"observed_at":"2026-08-08T11:35:12.836527Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.287886Z","title":"Stochastic Bregman subgradient methods for nonsmooth nonconvex optimization problems.Journal of Optimization Theory and Applications, 206(3):67, 2025","venue":null,"work_id":"c6001438-fb16-4f93-bd19-acdc29913a6a","year":2025},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.674330Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:3c1f8d2ef75b7588bd9e501805561f23651a8dafe0d2c1167aeacb5025f31e10","observation_id":"e42935e9-216b-413a-a355-a8e32639d8fb","resolution":{"observed_at":"2026-08-08T11:35:13.291966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2608.01658","last_updated":"2026-08-03T03:47:30Z","snapshot_observed_at":"2026-08-06T23:32:53.800828Z","submitted_at":"2026-08-03T03:47:30Z","title":"Non-KKT Accumulation in Entropic Mirror Descent","version":1},"cited_work":{"arxiv_id":"2608.01658","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.01658","snapshot_observed_at":"2026-08-08T11:35:12.812958Z","title":"Non-KKT Accumulation in Entropic Mirror Descent","venue":"math.OC","work_id":"0ecb3dfc-f9c3-4039-be48-0e6f17334ae4","year":2026},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.677971Z"},"links":{"cited_paper":"/paper/2608.01658","citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:dce60a2a0e7c622ee8954c2f6525c2734198167333a49d9ac0852360278f0d13","observation_id":"6c28f261-6c1b-44e2-80fe-6b81a4f9b7f6","resolution":{"observed_at":"2026-08-08T11:35:12.819282Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.276703Z","title":"Compressed sensing.IEEE Transactions on Information Theory, 52 (4):1289–1306, 2006","venue":null,"work_id":"a622a7eb-e47c-464e-9567-f5ae2004776e","year":2006},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.681832Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:8ffa618ec996c01bde21fabb45819a8e92441dca09d26d746da2709945987a42","observation_id":"de7cd016-4883-438e-a438-24bb656b5ae4","resolution":{"observed_at":"2026-08-08T11:35:13.280847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.265595Z","title":"Chapman and Hall/CRC, 2025","venue":null,"work_id":"5560ea3f-10e5-43a8-b539-5a4e27fcefbe","year":2025},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.685685Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:c55272609c43889d2bc0e9a8188db8d2724fe51943c800834ac067b291b23a36","observation_id":"ae6dede6-817a-4157-a402-0d58592dfa0e","resolution":{"observed_at":"2026-08-08T11:35:13.269481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.689197Z","title":"Springer, New York, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.689197Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:30e80b1216ba7cc51c31db6009b1cf7777be75c58c91dd093a388f60a5caaca7","observation_id":"a812e652-4fe3-4edf-b14b-755653bb1dab","resolution":{"observed_at":"2026-08-08T11:35:12.689197Z","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-08T11:35:13.248150Z","title":"Central paths, generalized proximal point methods, and cauchy trajectories in Riemannian manifolds.SIAM Journal on Control and Optimization, 37(2):566–588, 1999","venue":null,"work_id":"24141cb3-db12-4703-b3a4-a6fcbeb648bf","year":1999},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.692547Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:a2e3acf68a0ec1128a7084b7d6ad1c44cd6d8bff9933d517224a11702548f892","observation_id":"87227a5b-a242-41ec-bd64-b01e4f24e78a","resolution":{"observed_at":"2026-08-08T11:35:13.252039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.696223Z","title":"Non-Convex Optimization for Machine Learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.696223Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:daf56302ed6d5be7746fb1aa5779183f182faa4a83bce240e97d3fb96d5f5bcf","observation_id":"2eea8738-7497-4b67-9969-a8a8f32acdc8","resolution":{"observed_at":"2026-08-08T11:35:12.696223Z","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-08T11:35:13.231037Z","title":"Accelerated mirror descent in continuous and discrete time.Advances in Neural Information Processing Systems, 28, 2015","venue":null,"work_id":"61b1d787-71aa-4bf2-b639-c8a7c3fd4fc9","year":2015},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.699969Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:b12add0fb85aa26533514b3ddcb048345e39c91bab0b98b4834e7f0c9d482fb4","observation_id":"2e049b6f-6709-49e6-b409-0272f1b066d4","resolution":{"observed_at":"2026-08-08T11:35:13.234856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.220253Z","title":"A convergent single-loop algorithm for relaxation of gromov-wasserstein in graph data","venue":null,"work_id":"f401c5ce-8dc2-45fd-b0ef-1823e2e2228c","year":2023},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.703761Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:62fa09c6e229b02b80d2266e33254303fc89a1d3c5effc5c2b009b2cdc38aad1","observation_id":"cd1193eb-1ff4-478c-a2c6-9faa186d4a98","resolution":{"observed_at":"2026-08-08T11:35:13.224089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.209238Z","title":"Implicit bias of gradient descent on reparametrized models: On equivalence to mirror descent.Advances in Neural Information Processing Systems, 35:34626–34640, 2022","venue":null,"work_id":"1c914013-e315-495b-be46-13077c5b6bb5","year":2022},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.707351Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:4c288b6bdbbdaa7b82c07de4b5529bcb20877af8bd4f9c3bf374e3802bb0ead6","observation_id":"57366779-9df4-4c33-9722-d257500277aa","resolution":{"observed_at":"2026-08-08T11:35:13.213251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.710844Z","title":"Relatively smooth convex optimization by first-order methods, and applications.SIAM Journal on Optimization, 28(1):333–354, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.710844Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:ab491469ed33585b030c03aa5346d6fe578e998f6a00b10f58cc64eef8ee2a8d","observation_id":"3b3f1406-6f6c-4a4c-aa3a-e98a7188cae9","resolution":{"observed_at":"2026-08-08T11:35:12.710844Z","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-08T11:35:13.190042Z","title":"Pearson, 1999","venue":null,"work_id":"fd319eb2-d2a8-41dc-b24a-461456bd50a4","year":1999},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.714624Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:4c8ca62f83a5211dbd5225ee006d77ed39450817ddf8490001fab870ca6fe472","observation_id":"0b942916-bc90-4aad-b1ec-7f22f58783a4","resolution":{"observed_at":"2026-08-08T11:35:13.194071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.178249Z","title":"Problem complexity and method efficiency in optimization","venue":null,"work_id":"aceaffc4-7be8-4a37-bad8-cb310ffe3003","year":1983},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.718327Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:f857d0993b4365584501af66bc338825c8fcd5fd86aa7e1f203ba7a2741f6b0f","observation_id":"dd0fc6f4-3e09-4e87-b9b1-672c196bd54f","resolution":{"observed_at":"2026-08-08T11:35:13.182447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.166979Z","title":"Feature selection,L1 vs","venue":null,"work_id":"dfd7b2c9-5533-4c65-96a6-49b17afc33c9","year":2004},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.721603Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:de833a24173795b60d6516adc620550d427d9c0fa80c87c4060701527dea09af","observation_id":"a256337b-51ba-400c-ada8-6d502e499414","resolution":{"observed_at":"2026-08-08T11:35:13.170772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.155270Z","title":"On preparation theorems forran,exp-definable functions.Journal of Logic and Analysis, 15, 2023","venue":null,"work_id":"1decd13a-5d44-4650-9135-96f27a1b0470","year":2023},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.725050Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:a262011e3b8514c999b4fbca50d89cd81c1594f49ed2a9649721a025fc0b9391","observation_id":"f00b537c-52bd-45e0-874a-dc8cce7323eb","resolution":{"observed_at":"2026-08-08T11:35:13.159132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.143760Z","title":"On the sequential convergence of Lloyd’s algorithms.Mathematics of Operations Research, 2025","venue":null,"work_id":"9f6c35d5-4e61-44a2-8a66-dda0907cf196","year":2025},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.728527Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:cbbaeab23869e9e51c90ac8ad63edb19724d4a3f83a8f3c0fa7469e78dcadaa2","observation_id":"1e3f14f3-bc1b-40e9-b5e1-d27689fc7c91","resolution":{"observed_at":"2026-08-08T11:35:13.147749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.731910Z","title":"Springer Science & Business Media, Berlin, Heidelberg, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.731910Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:f3975f738a779dd2746540d6a190161fd0c7234016127f0cc60c931cee6e6f07","observation_id":"d671da71-2205-4569-b9e2-7e7226ff39bd","resolution":{"observed_at":"2026-08-08T11:35:12.731910Z","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-08T11:35:13.126474Z","title":"Princeton University Press, 2015","venue":null,"work_id":"1cce2594-0806-44ee-b131-ec30ce8171de","year":2015},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.735370Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:5c9e48b1520ffbc8e4677bc43d8f3033e3905bfa12098b6f7ad24eaa3bf63b2f","observation_id":"106fc739-e41a-49e9-bef7-66f1729ca1a4","resolution":{"observed_at":"2026-08-08T11:35:13.130299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.114998Z","title":"Generalized self-concordant functions: A recipe for newton-type methods.Mathematical Programming, 178:145 – 213, 2019","venue":null,"work_id":"a5aab1dd-1d57-4508-b314-ce738aa87056","year":2019},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.738621Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:a0ff04b133a6c1b35d70cf61a6f00b83f52360b03b27ede73f4b62b5966bda90","observation_id":"dae4e469-e314-4a6e-8095-5a91feac85a5","resolution":{"observed_at":"2026-08-08T11:35:13.118923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.742188Z","title":"Approximate Bregman proximal gradient algo- rithm for relatively smooth nonconvex optimization.Computational Optimization and Applications, 90(1):227–256, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.742188Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:dfb5fbfdd0d0536bf342c23bac4429e888a0717e5c19d4c2bc394a7f95acd595","observation_id":"2b887cf9-1883-4ab7-a517-6b1e7f1da27a","resolution":{"observed_at":"2026-08-08T11:35:12.742188Z","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-08T11:35:12.745636Z","title":"New Bregman proximal type algorithms for solving DC optimization problems.Computational Optimization and Applications, 83(3):893–931, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.745636Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:5362e668069a46b727542a1ba99074c82d46e73f0ef3cfeaacea1f4469f998e9","observation_id":"07b6b83a-8ff0-4d17-ad4e-9173c71deb0d","resolution":{"observed_at":"2026-08-08T11:35:12.745636Z","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-08T11:35:12.748770Z","title":"A simplified view of first order methods for optimization.Mathematical Programming, Series B, 170(1):67–96, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.748770Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:f99d70ab047909c9f6511a1811ea48044882fe740228d156653bcdf5326d311a","observation_id":"35638ac8-7275-4ac3-941a-d23dd4ca3154","resolution":{"observed_at":"2026-08-08T11:35:12.748770Z","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-08T11:35:13.084071Z","title":"A generalization of the Tarski-Seidenberg theorem, and some nondefinability results.American Mathematical Society, 15(2), 1986","venue":null,"work_id":"de3d302c-3a7a-4592-b19a-e52c7a564c93","year":1986},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.752039Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:44c97e8e93ee98624a21e3ee0c87a939270ef37139ecbf5d9fbe1ab940e5c18f","observation_id":"a5358f00-5a4a-40f1-8525-b2312b4de3e3","resolution":{"observed_at":"2026-08-08T11:35:13.088260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.072559Z","title":"Cambridge University Press, 1998","venue":null,"work_id":"d2c6a874-bf9e-450a-ad05-524566380eae","year":1998},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.755319Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:12009de0109cb16b1ad750ba3f8aec504f4b6d4473f48583cf06f85f93a8d40f","observation_id":"79a1bdb5-0604-4a22-b556-1c1c494619e2","resolution":{"observed_at":"2026-08-08T11:35:13.076425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.061498Z","title":"Geometric categories and o-minimal structures","venue":null,"work_id":"1e035d16-da54-48ec-b258-bf6e919c9521","year":1996},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.758692Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:fa26584a9cd1b6cb6226d24072b8ef31cd514cd395d07e1757972c7c8a008c91","observation_id":"b2936186-9c46-47ba-bb03-524190489591","resolution":{"observed_at":"2026-08-08T11:35:13.065334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.049195Z","title":"Linear convergence of a proximal alternating minimization method with extrapolation forℓ1-norm principal component analysis.SIAM Journal on Optimization, 33(2):684–712, 2023","venue":null,"work_id":"e96c21ad-d0d8-4c6a-8804-8880315a0d16","year":2023},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.762219Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:cb04dc252d2319ecaf8270e1739a8634c0a26ad35a82bbde702ae798bb545330","observation_id":"c7023ccc-bab1-4e6c-b99f-2bf8a6abfabb","resolution":{"observed_at":"2026-08-08T11:35:13.053741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.765722Z","title":"Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.765722Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:c533a3b3d44daa32063fc08319802d5825f89dd96e14961701267ed89ef28fc4","observation_id":"685fe92a-cce0-4512-a821-3005a4b22ba4","resolution":{"observed_at":"2026-08-08T11:35:12.765722Z","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-08T11:35:13.030820Z","title":"Bregman proximal point algorithm revisited: A new inexact version and its inertial variant.SIAM Journal on Optimization, 32(3):1523–1554, 2022","venue":null,"work_id":"85f27b31-8ea4-4295-bffe-254c99245f37","year":2022},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.769444Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:b4c4ae78d4a7653600550a0388baf239357bd6968a2ef73c2acf61f1d0e8ebc5","observation_id":"33b8eb79-377c-47f5-8b09-aa508e8d3d9b","resolution":{"observed_at":"2026-08-08T11:35:13.034957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:13.019028Z","title":"Inexact Bregman proximal gradient method and its inertial variant with absolute and partial relative stopping criteria.Mathematics of Operations Research, 2025","venue":null,"work_id":"7dd675f4-20ee-4636-a872-680c29fc5c14","year":2025},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.773009Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:6cd3cbb0f2998542ddc2c44b6750b077d19da580c8f975b2fdfb8b3ae5089de4","observation_id":"3a7ff8ac-9f19-4643-91a6-8c6bf2e416fb","resolution":{"observed_at":"2026-08-08T11:35:13.023031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T11:35:12.776570Z","title":"Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.776570Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:63ae34ee3831a796912a7a5045b23c38d9fd77f992d43444f7ab21912c01af67","observation_id":"2acdd954-fbee-4fe6-8528-2b420ca4ecf1","resolution":{"observed_at":"2026-08-08T11:35:12.776570Z","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-08T11:35:12.897964Z","title":"Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method.Journal of Optimization Theory and Applications, 189(3):889–918, 2021","venue":null,"work_id":"c2eb3d0b-7351-4115-ac88-2e31365c30f2","year":2021},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.780086Z"},"links":{"citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:01b56017430e8a994525f5174a2cb9523bb401fe0c4f6a16a3b608959c8e41f8","observation_id":"fa11772e-2101-4601-aac1-6b03a7b2d27c","resolution":{"observed_at":"2026-08-08T11:35:12.902270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":4,"verified_fuzzy":40},"total_outbound_references":64},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2608.05536."}