{"as_of":"2026-08-10T20:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2652efccdfb32d3932ae1fc8fe0bf874c5c7cd8fe45958b3bab0c6b9d7e46272","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:09:52.237733Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T12:00:38.160589Z","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-08-08T11:35:12.874589Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2608.05035","snapshot_observed_at":"2026-08-10T12:00:38.160589Z","title":"On the iterate convergence of Bregman projected gradient method.arXiv preprint arXiv:2608.05035, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.07248","last_updated":"2026-08-07T14:06:54Z","snapshot_observed_at":"2026-08-10T20:11:56.038680Z","submitted_at":"2026-08-07T14:06:54Z","title":"Establishing Boundary KKT Convergence of Mirror Descent through Reparameterization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T12:00:38.160589Z"},"links":{"cited_paper":"/paper/2608.05035","citing_paper":"/paper/2608.07248"},"observation_digest":"sha256:7ce589a51d32b6b2a1a230ac2155b7834c4fd246e4a470972c4ede906c7712d1","observation_id":"e231797e-e820-4884-91fc-9a36679ca328","resolution":{"observed_at":"2026-08-10T12:00:38.160589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2608.05035/citation-record","integrity":"/paper/2608.05035/integrity","json":"/paper/2608.05035/citation-record.json","paper":"/paper/2608.05035"},"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-06T11:09:54.227835Z","title":"Hessian Riemannian gradient flows in convex programming.SIAM journal on control and optimization, 43(2):477–501, 2004","venue":null,"work_id":"50d31bb0-6f50-4ecf-9ddc-d5cf781cd12b","year":2004},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.043252Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:85d98d83547765570b96acd19b8e832c7f6a685588d1b04b39e7e29f09f5bbe6","observation_id":"fdf86273-6ad0-4aa8-a9eb-268e9403b9de","resolution":{"observed_at":"2026-08-06T11:09:54.327055Z","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-06T11:09:53.944613Z","title":"On the convergence of the proximal algorithm for nonsmooth functions involving analytic features.Mathematical Programming, Series B, 116:5–16, 2009","venue":null,"work_id":"81c40709-4bb3-4c9d-b2df-0d62e80ca56b","year":2009},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.048069Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:0bb1aee999fd8b27f0672603c11b173487789888b6611686aa2da1811fb011d6","observation_id":"def7beaa-93b8-4324-b873-506b771c0903","resolution":{"observed_at":"2026-08-06T11:09:54.091963Z","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-06T11:09:53.704046Z","title":null,"venue":null,"work_id":"322acbd5-6f17-44a2-9ac7-658ed7e3825f","year":2013},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.052424Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:a388368847adf828d018c4d192d4a0a636dd22fbedbd89885af257fcf8f40159","observation_id":"98ccd995-9bab-42bb-91e9-aec246cb51e1","resolution":{"observed_at":"2026-08-06T11:09:53.851066Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T11:09:53.377346Z","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":"b36e5470-ecf9-41f5-97c5-96f5b91bc62d","year":2024},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.056977Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:b506821909c8e0f2fefdd8af8842f69fbdb1590d13e0becac8af4a6fc750f3c5","observation_id":"b945dc4c-a59b-4923-8fd9-9c2485171427","resolution":{"observed_at":"2026-08-06T11:09:53.538306Z","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-06T11:09:52.962176Z","title":"A descent lemma beyond Lipschitz gradient continuity: First-order methods revisited and applications.Mathematics of Operations Research, 42(2):330–348, 2017","venue":null,"work_id":"505ff035-80a2-43d1-a1ac-567307585587","year":2017},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.062203Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:a4875a628c988f4f8ae90a795686a690380cd83c2dea68faba161e0646d14e3a","observation_id":"c3f2657b-ff45-462a-bb8f-83007fed11dc","resolution":{"observed_at":"2026-08-06T11:09:53.140953Z","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-06T11:09:52.803071Z","title":null,"venue":null,"work_id":"4286336e-c670-401f-9956-81742e3c1cae","year":2019},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.066718Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:ec0c9daa40791a090e525e7d059f0431fa239462fc4539f80125cb82caec7f46","observation_id":"1c77e344-e9d3-43f2-8d65-8c2602b58b7f","resolution":{"observed_at":"2026-08-06T11:09:52.817425Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T11:09:52.775101Z","title":"MOS-SIAM Series on Optimization","venue":null,"work_id":"d07cff8c-17b5-491e-ac96-63d4fcce9416","year":2017},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.072431Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:c32673b56c1a258e16edbe5be055304f6d39f9bfa815481c7145d9a4cbbd59af","observation_id":"aaf4e895-d063-415d-aead-4aef92698c36","resolution":{"observed_at":"2026-08-06T11:09:52.782769Z","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-06T11:09:52.748688Z","title":"Image deblurring with Poisson data: From cells to galaxies.Inverse Problems, 25(12):123006, 2009","venue":null,"work_id":"47916409-d735-46e9-a399-e3f4f0b50a9a","year":2009},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.076307Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:b1626c61a1468201d4cfb4c688de94802ce1ed57fca459996b8b995cf51dae08","observation_id":"94c3974f-1447-4cc9-931b-42c7986b064e","resolution":{"observed_at":"2026-08-06T11:09:52.758762Z","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-06T11:09:52.726481Z","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":"90ac76df-54e3-46b8-a265-95a2361d385c","year":2003},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.081008Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:9e689783a2e0143df0c382c0bd3492af831f0c02ba83ea890c80d19dd110db80","observation_id":"e5014b09-1ad9-48a2-b26f-90d5e337a599","resolution":{"observed_at":"2026-08-06T11:09:52.736446Z","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-06T11:09:52.699979Z","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":"9fcdfc3a-f07b-41aa-9bac-29eb69b593f9","year":2007},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.085232Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:7d0c4991a382e418c6cdcd748269df72aae7cab2bc25db3a9ae5580c27dac366","observation_id":"b70cf760-7bd1-44ca-a42b-96be268c476d","resolution":{"observed_at":"2026-08-06T11:09:52.712252Z","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-06T11:09:52.671231Z","title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems.Mathematical Programming, Series A, 146(1):459–494, 2014","venue":null,"work_id":"fb353667-9187-4b74-b7aa-74d9e03b39b7","year":2014},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.090548Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:0a0b1618a2a5d88b43150714f4f6a154b7efee777195a6522476f0225fdbd5ce","observation_id":"3f47ff8a-e774-4a9e-a1c6-593b46209977","resolution":{"observed_at":"2026-08-06T11:09:52.684438Z","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-06T11:09:52.655276Z","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":"d4cdb7b0-3f01-412b-b20f-8e4063bd0c6e","year":2018},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.094419Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:6985f4e05c6bfbb39f49cb723791fbf22ce7238febc1a2130dcbf6e9b855e81b","observation_id":"2d57df21-53cc-493e-9e61-f663e83b0343","resolution":{"observed_at":"2026-08-06T11:09:52.660148Z","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":"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":"2404.08073","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.08073","snapshot_observed_at":"2026-08-06T11:09:52.268388Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","venue":"math.OC","work_id":"d737541d-65e1-4c39-b4de-4804890d6946","year":2024},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.099467Z"},"links":{"cited_paper":"/paper/2404.08073","citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:10a4d8fe461b423de7186ddcd0ae8b8dc7dd8c4afa0031b347f44185d7864b43","observation_id":"93662a4d-e565-48d8-9048-500ead2dc3c4","resolution":{"observed_at":"2026-08-06T11:09:52.275456Z","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-06T11:09:52.642424Z","title":"Springer, New York, 2003","venue":null,"work_id":"2cc93b57-89ab-4748-a543-5ccc175d32b5","year":2003},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.104424Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:0c3c9bb1ea9978c221d9c526beed54497790ca5f4fcd021f3ef5898ee5a4224b","observation_id":"ab357237-805b-4804-90d5-aa154a78e1eb","resolution":{"observed_at":"2026-08-06T11:09:52.646141Z","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-06T11:09:52.629471Z","title":"On approximate solutions of systems of linear inequalities","venue":null,"work_id":"5a5bcb82-90ea-43cb-8bf8-a21085e09163","year":2003},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.109512Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:07108a0d6cda607998a4bccb5fa6d7af207a5096d4eba79a0ba0fdcbf7f80004","observation_id":"f17aba71-64cd-422f-915f-9b1a3897374a","resolution":{"observed_at":"2026-08-06T11:09:52.633939Z","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-06T11:09:52.615036Z","title":"Riemannian proximal gradient methods.Mathematical Programming, 194(1):371–413, 2022","venue":null,"work_id":"12be61e2-42e8-47d3-9876-81c27cae68a4","year":2022},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.113847Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:b8c451b2b9072758a1bb623289edf767df6623b4598f11ed1bebcfa3c13af917","observation_id":"70cf0422-915a-413d-add8-7e3b9b7e55a0","resolution":{"observed_at":"2026-08-06T11:09:52.621194Z","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-06T11:09:52.602091Z","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":"ee09c2e1-f6ec-4f13-a88e-597713b7ef07","year":1999},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.117879Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:09ca125a4fcb9a0e8adcd0a782130999eae58a09be35681321e5a0f3e1298d9a","observation_id":"cf9ef305-c212-43a6-9ac8-008934a46120","resolution":{"observed_at":"2026-08-06T11:09:52.606904Z","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-06T11:09:52.588023Z","title":"Non-Convex Optimization for Machine Learning","venue":null,"work_id":"17dd2c53-f93a-4aed-8fe5-0bd38d9f7d0c","year":2017},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.122631Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:3ed6025588a9ed1f4071c5f59fa6bc063c9d27c41317f98d5480a1653a4e1843","observation_id":"26e57d11-b31a-48f7-9334-901790388770","resolution":{"observed_at":"2026-08-06T11:09:52.592457Z","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-06T11:09:52.574768Z","title":"Unifying mirror descent and dual averaging.Mathematical Programming, Series A, 199(1-2):793–830, 2023","venue":null,"work_id":"1bda9174-4b1c-42f3-aa73-73185f080dab","year":2023},"citing_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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.127232Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:20f700c14336fb96380ac472b6c5a751b92e4d6c1f12dbd852ddd78cc97dbd4f","observation_id":"40ef6477-58da-4a64-b51b-185659252b05","resolution":{"observed_at":"2026-08-06T11:09:52.579611Z","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-06T11:09:52.559720Z","title":"Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity.SIAM Journal on Optimization, 32(3):2230–2262, 2022","venue":null,"work_id":"d7c6e156-273d-4e0b-823c-cf663562c5af","year":2022},"citing_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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.131579Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:ee770cba2364331fde8b199659383bd4860a97ba33e5041e1002693e7a816f20","observation_id":"95d223f3-4f29-4329-941d-fe487f9b9982","resolution":{"observed_at":"2026-08-06T11:09:52.564954Z","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-06T11:09:52.546612Z","title":null,"venue":null,"work_id":"229a6448-a132-4b45-8a85-602aa9268087","year":2018},"citing_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},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.136501Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:6a47f185399fad3f110d6828b645cc6c92b1768cb8d9c3f0856fe3bddedcb7f3","observation_id":"f536cf5b-b192-4cfc-8c0e-24fb9dbabcb8","resolution":{"observed_at":"2026-08-06T11:09:52.551550Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T11:09:52.532739Z","title":"A convergent single-loop algorithm for relaxation of Gromov-Wasserstein in graph data","venue":null,"work_id":"8e495491-031b-448c-b94b-4621a0b7ecd6","year":2023},"citing_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},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.141061Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:2e1d6ccabc0d941286c038d91cff01f0f39a789bb33d341005e848e29769d546","observation_id":"73f086e6-5108-4893-8c73-4f65b46c7e63","resolution":{"observed_at":"2026-08-06T11:09:52.538432Z","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-06T11:09:52.144761Z","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.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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.144761Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:0f9a958a9ceb0209e1d84a8943487d511296a3ae71f860435b760291791e1246","observation_id":"1a34e581-1864-4aa2-ba89-b74a7405e536","resolution":{"observed_at":"2026-08-06T11:09:52.144761Z","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-06T11:09:52.514125Z","title":"Errorbounds forquadraticsystems","venue":null,"work_id":"0a362413-c9dc-4366-8c99-3c883bdd3872","year":2000},"citing_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},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.149002Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:20cc510a2417e4c13ac9067d707b9b1c6544f32b902a0fdfe420a2e68cda4906","observation_id":"a528a1c6-62b2-47e1-8481-8ab97a06c150","resolution":{"observed_at":"2026-08-06T11:09:52.518814Z","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-06T11:09:52.503903Z","title":"Error bounds and convergence analysis of feasible descent methods: A general approach.Annals of Operations Research, 46(1):157–178, 1993","venue":null,"work_id":"4613501f-8c0a-4f22-87b9-7a15f532063e","year":1993},"citing_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},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.153409Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:9ceaf456d6a6eadc910428f10971453c48f2a726dbca7483519bcb3e9019401c","observation_id":"6eade96c-c0d0-4d0e-a573-14bfd7840960","resolution":{"observed_at":"2026-08-06T11:09:52.507487Z","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-06T11:09:52.489818Z","title":"Pearson, South Carolina, 1999","venue":null,"work_id":"6fb83e79-471f-4cfb-9555-25e4c0775b82","year":1999},"citing_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},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.157241Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:3583360ac5da5c047744fb62a25c7939ccd12dade8584626974ade74b7d22eaa","observation_id":"535cf092-f762-4fc8-8710-409cc52a456c","resolution":{"observed_at":"2026-08-06T11:09:52.495155Z","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-06T11:09:52.478550Z","title":"Self-scaled barriers and interior-point methods for convex programming.Mathematics of Operations research, 22(1):1–42, 1997","venue":null,"work_id":"0b0f72ed-0a4d-469d-8454-80432fbd2e3c","year":1997},"citing_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},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.161628Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:60b477b547ad52ef952f9ad20a0a07b6692befa7717c06dd47411598929dc16a","observation_id":"1c7c36e6-051f-4698-a783-ab8d4147fdaf","resolution":{"observed_at":"2026-08-06T11:09:52.482752Z","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-06T11:09:52.465918Z","title":"Springer, Berlin, Heidelberg, 2018","venue":null,"work_id":"4999e4a5-88d8-4f47-8ca1-329bce10268c","year":2018},"citing_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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.166298Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:602a754cf06dbb211b764bcc7b46419679fbc59599065efb6b4f2756552c529a","observation_id":"9512fcf6-8244-4537-a140-c36e4e8aca5b","resolution":{"observed_at":"2026-08-06T11:09:52.471938Z","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-06T11:09:52.453424Z","title":"Springer Series in Operations Re- search and Financial Engineering, 2nd edn","venue":null,"work_id":"d2df5f34-93fa-4f34-9d40-aca9e939300d","year":2006},"citing_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},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.171026Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:9cf4527aa1976678785916c975b26b2eb09d1a66d4752c10c840bdbb37909d34","observation_id":"5e9ca172-d839-4b80-a75d-ea351a93d14c","resolution":{"observed_at":"2026-08-06T11:09:52.459020Z","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-06T11:09:52.442144Z","title":"Computational Optimal Transport: With Applica- tions to Data Science.Foundations and Trends®in Machine Learning, 11(5-6):355–607, 2019","venue":null,"work_id":"1f91c9e4-04aa-401b-a8bc-6f3d12b32310","year":2019},"citing_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},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.175462Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:f492098c76f441f2a8e6859ee1b05c322e28565ebddbbcde460e55a260466e6d","observation_id":"b5df7a29-8704-4696-a49a-2d51d77d0bcd","resolution":{"observed_at":"2026-08-06T11:09:52.446057Z","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-06T11:09:52.432340Z","title":"Springer Science & Business Media, Berlin, Heidelberg, 2009","venue":null,"work_id":"cf1cfecc-7ec5-4de0-9f7f-1fc41d6b02aa","year":2009},"citing_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},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.179934Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:415dd678650aaed377a8f015c6ae30300d8489fda46e04ecdcf5293c10ce1de9","observation_id":"ded61a90-9a0f-4433-aa0a-8f6268709b79","resolution":{"observed_at":"2026-08-06T11:09:52.436025Z","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-06T11:09:52.421647Z","title":"Nonconvex optimization for signal processing and machine learning [from the guest editors].IEEE Signal Processing Magazine, 37(5):15–17, 2020","venue":null,"work_id":"4e11670c-d764-4f96-aab4-4e69b13feb00","year":2020},"citing_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},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.183937Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:9adfa6b429c87aaf315f9731b39e4f33ca55546a53a5cb74809a53094b2d990b","observation_id":"de38fb08-e681-400c-8999-995d6dcc547c","resolution":{"observed_at":"2026-08-06T11:09:52.425591Z","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-06T11:09:52.409481Z","title":"A new non- monotonic algorithm for pet image reconstruction","venue":null,"work_id":"89921250-b811-437f-add4-9bc2f7d725f5","year":2009},"citing_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},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.188187Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:99d86d1d436a2ce92e325b5340df3cbfef5d86a93d352ec042ee523cdde188e7","observation_id":"5e9e98d3-5725-49ba-8c7e-c77c799b7eae","resolution":{"observed_at":"2026-08-06T11:09:52.415369Z","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-06T11:09:52.395392Z","title":"Neural Information Processing Series","venue":null,"work_id":"34f6b2ff-3779-410f-aca0-1aa84d38d2fa","year":2012},"citing_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},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.193623Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:cd693bb37f445e81dea3894d25b1d33865791d08cb6938c5fb0675f5dc5da2d5","observation_id":"4e8a6d3c-dfcf-4c93-b191-35a176da2772","resolution":{"observed_at":"2026-08-06T11:09:52.400871Z","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-06T11:09:52.381333Z","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":"850b0ffb-3715-4c9e-9057-f8405bb043d9","year":2025},"citing_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},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.199229Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:d976a69c93e5f2aa79c5e7fa7548341243bc2bd9d1223b32e4dbbdcb3fe2c0a0","observation_id":"c3682586-d7b5-46d9-8b63-5edf837e0c9c","resolution":{"observed_at":"2026-08-06T11:09:52.387702Z","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-06T11:09:52.370306Z","title":"New Bregman proximal type algorithms for solving DC optimization problems.Computational Optimization and Applications, 83(3):893–931, 2022","venue":null,"work_id":"fa7ff55c-dddd-46a0-82e5-6e685174c3ba","year":2022},"citing_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},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.203771Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:4c1339d3780ff9b92b4654beb0072c6160aa4b8d79170b9e77b2f967fde048ec","observation_id":"f448c369-99a8-4763-b78c-a48b728b190d","resolution":{"observed_at":"2026-08-06T11:09:52.374287Z","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-06T11:09:52.358394Z","title":"A simplified view of first order methods for optimization.Mathematical Programming, Series B, 170(1):67–96, 2018","venue":null,"work_id":"1a7ff924-a13c-4e4d-a60e-e4f27df9f202","year":2018},"citing_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},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.210147Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:747e453c2b6aa8000e5203f08e26a820c340fd21a5ed184017065a3461ad4444","observation_id":"0cdd2092-f5c0-4b54-9721-6a87c12594db","resolution":{"observed_at":"2026-08-06T11:09:52.363465Z","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-06T11:09:52.346474Z","title":"Approximation accuracy, gradient methods, and error bound for structured convex optimization.Mathematical Programming, Series B, 125(2):263–295, 2010","venue":null,"work_id":"05c61d4a-17fa-4499-a133-ed0a4e867716","year":2010},"citing_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},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.214717Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:a267d7dd8906963eaaa6367ed90b2ddf3070335d4d7a378e8988bd24f039452c","observation_id":"75b27dee-6168-4ca0-89e4-20baa1f1782e","resolution":{"observed_at":"2026-08-06T11:09:52.350839Z","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-06T11:09:52.334337Z","title":"Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems","venue":null,"work_id":"e8f5393f-ef50-4f04-86b7-6423c775ab82","year":2021},"citing_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},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.220362Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:f67eef334fa77cac1ce2709c4ec7a93551aebd56722a3055b69172a011d35213","observation_id":"d0005dc7-3f1e-4055-bf75-a5cdb091b13f","resolution":{"observed_at":"2026-08-06T11:09:52.339236Z","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-06T11:09:52.319395Z","title":"Gromov-Wasserstein learning for graph matching and node embedding","venue":null,"work_id":"06ada372-b22b-4d80-9b92-4bb247c55770","year":2019},"citing_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},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.224771Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:92a457c0a8a51a8a3b170b3b4f88dd7ff29361ca9638986d65c27d57aeec343f","observation_id":"db1cf73d-5489-40f4-a6d0-9ed34ed82e03","resolution":{"observed_at":"2026-08-06T11:09:52.325825Z","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-06T11:09:52.307830Z","title":"Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions","venue":null,"work_id":"1f8d01a2-9303-422c-955c-6041e75be55d","year":2021},"citing_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},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.229098Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:642eccabdaec0e1b3c9ef96a4e71b2c182a34aa7ca938968f96b735b10b6fd0e","observation_id":"e639f5d7-24d1-477a-ab34-d1922cf74e6d","resolution":{"observed_at":"2026-08-06T11:09:52.312275Z","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-06T11:09:52.295467Z","title":"A unified approach to error bounds for structured convex optimization problems.Mathematical Programming, Series A, 165(2):689–728, 2017","venue":null,"work_id":"294651c2-fd0d-439f-8c42-9ab9249e9660","year":2017},"citing_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},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.233605Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:3191af907444cc5f5c2cc4f42ee8b0f7bb446203f8480bfb4c086c08aea15736","observation_id":"f410231d-972b-4780-b0ae-bb78e158d912","resolution":{"observed_at":"2026-08-06T11:09:52.300702Z","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-06T11:09:52.283102Z","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":"b5f638bc-5d7d-4fc4-8132-7bb682bb0adf","year":2021},"citing_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},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.237733Z"},"links":{"citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:6e596f5865f44073c79ac194a8e0b946aef2385e5b83bdd445c2a6d632098b4a","observation_id":"328d08b7-afac-416f-992b-21523d5c8fee","resolution":{"observed_at":"2026-08-06T11:09:52.287955Z","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.05035","last_updated":"2026-08-05T16:41:18Z","latest_version":1,"primary_category":"math.OC","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"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":38},"total_outbound_references":43},"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 43 of 43 outbound references and 2 inbound Pith citation observations for arXiv:2608.05035."}