{"as_of":"2026-08-18T09:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6ed163079b0f607b77ac8a4d01e2ecb36347b59746b0cba7a45c7146864b4da","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:18:54.871226Z","state":"measured"},{"denominator":83,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":83,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T22:38:47.715979Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T12:45:44.761993Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02155","snapshot_observed_at":"2026-08-03T22:37:55.050610Z","title":"arXiv (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.10414","last_updated":"2026-06-05T14:08:24Z","snapshot_observed_at":"2026-08-11T16:50:14.898022Z","submitted_at":"2025-11-13T15:34:17Z","title":"Minimizing Smooth Kurdyka-{\\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.050610Z"},"links":{"cited_paper":"/paper/2501.02155","citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:0d4b8897d85a7a9c449c7bcc45d9f835832b565baa337a450122e23245ee6b40","observation_id":"4d404edd-4a0b-493e-960a-71b2db5d2934","resolution":{"observed_at":"2026-08-03T22:37:55.050610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02155","snapshot_observed_at":"2026-08-03T22:38:47.715979Z","title":"arXiv URLhttps://doi.org/10.48550/arXiv.2501.02155 20 Alireza Kabgani, Masoud Ahookhosh","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.10421","last_updated":"2026-06-22T23:23:17Z","snapshot_observed_at":"2026-08-09T07:43:45.217959Z","submitted_at":"2025-11-13T15:42:55Z","title":"On fundamental properties of high-order forward-backward envelope","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T22:38:47.715979Z"},"links":{"cited_paper":"/paper/2501.02155","citing_paper":"/paper/2511.10421"},"observation_digest":"sha256:cb3ab6c9e2357c1815b8db0dacca2480068ae7943eab24a3e74a8060753842f9","observation_id":"41c70cc2-935e-46af-a160-b9204539d729","resolution":{"observed_at":"2026-08-03T22:38:47.715979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"cited_work":{"arxiv_id":"2501.02155","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.02155","snapshot_observed_at":"2026-07-01T12:45:44.761993Z","title":"Kabgani and M","venue":null,"work_id":"b33a9a95-bd22-418e-ad35-6764e4c22e14","year":2025},"citing_paper":{"arxiv_id":"2605.17306","last_updated":"2026-05-17T07:48:28Z","snapshot_observed_at":"2026-08-03T10:16:57.491058Z","submitted_at":"2026-05-17T07:48:28Z","title":"Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-19T22:51:12.440406Z"},"links":{"cited_paper":"/paper/2501.02155","citing_paper":"/paper/2605.17306"},"observation_digest":"sha256:65ee3348d47374721a035da328332b0e500cf5079af1fd3cf69e482bb3da9ebd","observation_id":"d780e03c-4d8b-4dd5-97b7-dc00bb031142","resolution":{"observed_at":"2026-05-19T22:52:50.431817Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"cited_work":{"arxiv_id":"2501.02155","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.02155","snapshot_observed_at":"2026-07-01T12:45:44.761993Z","title":"Kabgani and M","venue":null,"work_id":"b33a9a95-bd22-418e-ad35-6764e4c22e14","year":2025},"citing_paper":{"arxiv_id":"2606.30991","last_updated":"2026-06-30T00:05:35Z","snapshot_observed_at":"2026-08-09T17:12:03.642889Z","submitted_at":"2026-06-30T00:05:35Z","title":"Difference-of-Convex Optimization via Inexact Smoothing Descent Methods: Difference of High-Order Moreau Envelopes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-01T01:46:04.938241Z"},"links":{"cited_paper":"/paper/2501.02155","citing_paper":"/paper/2606.30991"},"observation_digest":"sha256:cdacf1f7585394e1bec1867c0f7abeecb212b0c376974005f6a81410553fcfec","observation_id":"edb7cbb4-766d-47bf-ab5b-a4e0fc4d57d9","resolution":{"observed_at":"2026-07-01T12:45:44.763535Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.02155/citation-record","integrity":"/paper/2501.02155/integrity","json":"/paper/2501.02155/citation-record.json","paper":"/paper/2501.02155"},"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-10T22:18:56.027975Z","title":"SIAM Journal on Optimization 16:531–547","venue":null,"work_id":"c949d027-bd9c-4d5a-8f10-ea376b17285d","year":2005},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.551175Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:efeaa2007f89a54a31c41cd90ffb52b5044fe23079e32208c3c5812bf3d5d15b","observation_id":"c63301b0-a152-4d24-8e67-0d5c116f630b","resolution":{"observed_at":"2026-08-10T22:18:56.032096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:56.015595Z","title":"Mathematical Methods of Operations Research 89(3):319–353","venue":null,"work_id":"b42075a7-0044-4b90-b604-5bc813a37f0a","year":2019},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.555251Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:149504fe8a59372fc68620132c4895319a0d43ba5d6f32e502db747ea5e45b61","observation_id":"daa4a8ec-6f57-468f-af77-30b7e5ffe49e","resolution":{"observed_at":"2026-08-10T22:18:56.020023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:56.004511Z","title":"Applied Mathe- matical Modelling 43:170–190","venue":null,"work_id":"4f8a9181-f50e-4968-99ff-79ff7c585485","year":2017},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.559561Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:2b062b5829222219e7f47b893858560fe98aafd8eedb0544d6914a922853fcc2","observation_id":"8588af4e-137c-4f0a-b5a1-870855669071","resolution":{"observed_at":"2026-08-10T22:18:56.008403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.993040Z","title":"Mathematical Programming 208:365–407","venue":null,"work_id":"6c157f97-ef3f-4545-8cdc-3eedee0177a9","year":2024},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.564218Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:968113e24b302b309bc0c73168c8a07327ba3e0ece0697680e739b47b75ed429","observation_id":"c321238a-7563-40b9-91a7-8322cb9a40d2","resolution":{"observed_at":"2026-08-10T22:18:55.996581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.982969Z","title":"SIAM Journal on Optimization 31(1):653–685","venue":null,"work_id":"4be7f307-b5ea-468d-abdf-e9d348556c6c","year":2021},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.568635Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:0952291cd687f94b10dfd0072160d5ca81d961810827eb2c1cf03749e48f937b","observation_id":"1c3e15c5-0834-4945-984e-ee92035d24c3","resolution":{"observed_at":"2026-08-10T22:18:55.986469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.970788Z","title":"SIAM Journal on Optimization 33(1):89– 115","venue":null,"work_id":"11e866d1-676d-44be-a2d9-425d727a1a64","year":2023},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.572901Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:a0427d6ef0e8780d32822ad0c5a1d356ef38d75abfb78550f05baf4b49f6e33c","observation_id":"0286ec81-8cc7-43ef-b1b9-19f03f2448ce","resolution":{"observed_at":"2026-08-10T22:18:55.974850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.959074Z","title":"Mathematics of operations research 35:438–457","venue":null,"work_id":"a5f14a23-db80-4056-b7ce-bde1e6c04c9e","year":2010},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.578028Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:b5e3216d68b7bf5f28a8e3ad9bce6a049ea6f842e1b1def9fb6a3cd5639f7f8a","observation_id":"8acf219e-e43d-48b2-bcfd-cd8046e4e901","resolution":{"observed_at":"2026-08-10T22:18:55.963204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.948097Z","title":"Mathematical Pro- gramming 137:91–129","venue":null,"work_id":"e8297dde-e0d8-47c1-b408-2db023a4d389","year":2013},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.581812Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:66b7b655d9e33faf13e1e73217299c1a5a6b6dbfded22b2bf4c03b0aa25627e4","observation_id":"345dc66e-ddb7-4b18-aed5-6de6dd32fa1d","resolution":{"observed_at":"2026-08-10T22:18:55.951983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.936098Z","title":"IMA Journal of Numerical Analysis 8:141–148","venue":null,"work_id":"202a5e1e-a7fa-4f15-9bfb-f1622083019b","year":1988},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.585670Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:88d61171694fd95b38e0994011602c6e71d110ec9d8f4d5838b81f390db52806","observation_id":"a4555794-4fc2-4608-9dc3-5fa04abb8a90","resolution":{"observed_at":"2026-08-10T22:18:55.940107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.923434Z","title":"Set-Valued and Variational Analysis 26:1009–1078","venue":null,"work_id":"34d07928-c4e5-46b9-86eb-5bb9b37dc479","year":2018},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.589807Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:4e1ef2c61e4b8c3167b7a0b9b61e8576acaa5f8dfdb3b59e648866193a9621f2","observation_id":"b7f777d2-22c9-4393-8c39-e13c85e12f14","resolution":{"observed_at":"2026-08-10T22:18:55.928513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.911518Z","title":null,"venue":null,"work_id":"4744cc8d-af46-4f31-ad65-d14dc96b665e","year":2017},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.593728Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:28c8b53bc6676394e7bba24fa26123579befa329bd59b697674559f07052bdd3","observation_id":"ed37d58a-e906-420d-926f-b28d94fe0012","resolution":{"observed_at":"2026-08-10T22:18:55.915825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.898476Z","title":"SIAM Journal on Optimization 22:557–580","venue":null,"work_id":"ff15e1a5-cc1e-40a3-8032-6c4643d64a36","year":2012},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.598091Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:31bf5731ab539428e7604f57fb50219bb565ca405c15a1019d72b2c2db34a388","observation_id":"3a512a6b-9d2c-4a71-b4fe-4afb19884988","resolution":{"observed_at":"2026-08-10T22:18:55.903211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.885832Z","title":"In: Dolecki S (ed) Optimization: Proceedings of the Fifth French-German Conference held in Castel-Novel (Varetz), France, Oct","venue":null,"work_id":"0a0577f9-b734-4058-b70a-b09eb8aeca85","year":1989},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.602072Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:705b35d3a8a283db993377eb9ab6788c8b5e8118ca13830ee094c7674ea909c7","observation_id":"e7b1d6bb-939c-4555-a448-d14a33a4825d","resolution":{"observed_at":"2026-08-10T22:18:55.890497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.873806Z","title":"In: Balinski ML, Wolfe P (eds) Nondifferentiable Optimization, Springer, pp 1–25","venue":null,"work_id":"69236c5e-8876-4355-a9f2-8bc8bc098305","year":2009},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.605786Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:7c554008837e2617be228493387b50dc22a12a14e8836f420fbd0cc5f1d57d22","observation_id":"b2fb32c6-9a83-434e-bacc-a9c70b500a8b","resolution":{"observed_at":"2026-08-10T22:18:55.878074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.862266Z","title":"SIAM Journal on Optimization 18:556–572 32 Alireza Kabgani, Masoud Ahookhosh","venue":null,"work_id":"4cede156-7938-4ef8-8b55-ae5b1a018ae6","year":2007},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.608919Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:90a7bcb66cb56ea500fc26e00a09851a144ca080d82a606ac2927035a07eca25","observation_id":"f6790ac5-2a02-4bff-b419-569c32be2af8","resolution":{"observed_at":"2026-08-10T22:18:55.866414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.851105Z","title":"SIAM Journal on Optimization 17:1205–1223","venue":null,"work_id":"5c7ee056-6a1d-4ef3-a808-31b3a185ad6e","year":2007},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.612213Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:fa117daf44d25374139a8560a4462b59d23337f3363675efb5361897dec271ba","observation_id":"15bc8557-30d9-4016-ac55-21ada7b5efa0","resolution":{"observed_at":"2026-08-10T22:18:55.854792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.840189Z","title":"Mathematical Programming 146:459–494","venue":null,"work_id":"51a2b27a-e484-470a-bc01-a707595f19e7","year":2014},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.615228Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:5f0d5f71b37c74777854f11f2a12206ee78ce782c601db18db681126ad74abfe","observation_id":"6c284a27-e004-4d4e-9dd1-cd017648657a","resolution":{"observed_at":"2026-08-10T22:18:55.844055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.828644Z","title":"Journal of Scientific Computing 85:33","venue":null,"work_id":"d2e6d2a4-4ed0-4596-8d7d-b2cf6fb6659f","year":2020},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.618591Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:e31197500f8226a0a5194956c0fe9de7ee17e0b151321fb49c755eeacabbd389","observation_id":"aec0101f-bf84-483f-97d9-9e587de38fc8","resolution":{"observed_at":"2026-08-10T22:18:55.833304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.816773Z","title":"TOP 23:124–150","venue":null,"work_id":"0ab6bc14-4488-489d-aad3-dde0901ffdf9","year":2015},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.621746Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:f505c92277228b9760a8ec64680baa715fac5711022c496e77144e2a58ed7db1","observation_id":"a8d38505-36a3-4b02-8037-a28543fc0f3b","resolution":{"observed_at":"2026-08-10T22:18:55.821001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.804703Z","title":"Mathematical Programming 134:127–155","venue":null,"work_id":"3dbf2588-6817-4580-89fe-462349a15c0e","year":2012},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.625726Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:ff13ed5ef19f2d5764a973ab831e5c1daf02e112202c2eee1d807bb91ec04ef3","observation_id":"09ddb45a-332e-4376-83ef-285a542d3aa1","resolution":{"observed_at":"2026-08-10T22:18:55.808925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.792668Z","title":"Journal of Opti- mization Theory and Applications 188:628–649","venue":null,"work_id":"1c906a69-e8e7-4a95-b7ea-7916117051ec","year":2021},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.629451Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:20267f682f29d5d25d2f927ffb876a6f3bc8f35614fbe50c05cdda5c7ea0603b","observation_id":"b11afa19-601f-443f-baf3-2f0c88cb5779","resolution":{"observed_at":"2026-08-10T22:18:55.796711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.781253Z","title":null,"venue":null,"work_id":"7b6c4a85-d3a2-42e0-92ac-3cc85eaf5290","year":2011},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.634233Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:380de8ee6a396f78c669f2be1e6d115f8018083ca7d120fbc49a9b98d2dfc16c","observation_id":"14fdeb3c-c446-4c68-a2ba-cdaaea361138","resolution":{"observed_at":"2026-08-10T22:18:55.785155Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.768316Z","title":"EURASIP Journal on Advances in Signal Processing 108","venue":null,"work_id":"1e6774f1-8820-4598-b74b-84743eea3366","year":2016},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.637753Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:64db799719a547cac86b9d0eb171cf1397c14c8100c12497bf347123da545e54","observation_id":"7ac233d6-4fc7-486e-aba6-127bf3cd3c51","resolution":{"observed_at":"2026-08-10T22:18:55.773015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.755662Z","title":"SIAM Journal on Numerical Analysis 28(1):251–265","venue":null,"work_id":"85761a98-8852-42a6-8ebf-8c516972d273","year":1991},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.641773Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:049587741d6354800ee582419ac1e5a5a7e13cb20f8c9353146baf5e6c7e8dc6","observation_id":"25bfff83-0441-4930-8898-3b47059f8752","resolution":{"observed_at":"2026-08-10T22:18:55.760109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.742661Z","title":"IEEE Transactions on Signal Processing 62:3754–3767","venue":null,"work_id":"325b75f1-9659-41d9-be37-c5315ba36b82","year":2014},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.645521Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:69aa94177e9e5e60cf6ffb92bb9502b6b46194f8787f86a42198c62cbdc9644c","observation_id":"d3ce25d0-6ab7-4d11-9176-31c236a9cffa","resolution":{"observed_at":"2026-08-10T22:18:55.747098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.730142Z","title":"IEEE Access 7:1300–1322","venue":null,"work_id":"c334507c-b068-4e5e-8d20-2778e1e93686","year":2019},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.649204Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:e8f506c7b598f741577daaf861f2ecf9091322b8384ce0eb386cf2596880df57","observation_id":"f5017f05-78ec-435f-813b-f4c8b56856d1","resolution":{"observed_at":"2026-08-10T22:18:55.734494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.717815Z","title":"Journal of Convex Analysis 12:315–329","venue":null,"work_id":"1ee6a6a5-34fe-452a-ad18-87d0f605a6a2","year":2005},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.652906Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:7a2df501add8b1c10f4907340cb9f9a408dfcbd832483dbd0b6f93e308b1dd05","observation_id":"921d3e7c-993b-4a83-a879-42e5ec44ef7f","resolution":{"observed_at":"2026-08-10T22:18:55.721942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.702847Z","title":"SIAM Journal on Optimization 29:207–239","venue":null,"work_id":"05127677-018b-4f53-8ede-f7456f83ab04","year":2019},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.656943Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:9358d880d7c4aaf5b9bc83b8affc094d85ca3f26b7c83b3fd2c1ea6dbfff31d9","observation_id":"9ae95264-73d2-466b-9dc2-22ad86d9eeb4","resolution":{"observed_at":"2026-08-10T22:18:55.708177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.689603Z","title":"SIAM Journal on Optimization 29:1908–1930","venue":null,"work_id":"dab58acf-f52b-4248-94e9-db50b296a0da","year":2019},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.660684Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:188554b81559588397947705d3451f83dcb32b9a02daf4fd6b31df2e2d576c33","observation_id":"fe90b000-eb9d-4366-9cdb-8e2cc0d77248","resolution":{"observed_at":"2026-08-10T22:18:55.694082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.675623Z","title":"Journal of Optimization Theory and Applications 179:962–982","venue":null,"work_id":"f3be0b40-e58a-4608-949d-07598c4fa215","year":2018},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.664551Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:a20e01c2a8acc3b041895ee889f398642928941d4e2a70b321a6523e921f9546","observation_id":"108878f7-5e29-442e-9d6d-3edeebc713ec","resolution":{"observed_at":"2026-08-10T22:18:55.680669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.663357Z","title":"Mathematical Programming 178:503–558","venue":null,"work_id":"89eb7078-aba1-4924-925e-892ff07c7976","year":2019},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.669455Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:1662a0ff59901c50dec46c36baba21c8d917e1c1af2c2515a25877bca45720f2","observation_id":"544169f6-6e78-4ea2-b3be-a064548a0987","resolution":{"observed_at":"2026-08-10T22:18:55.667818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.649789Z","title":"SIAM Journal on Imaging Sciences 17:91–115","venue":null,"work_id":"4ddbb7ce-c57b-47fd-be31-eaf70ae37def","year":2024},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.674199Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:37d5be94e6ad85fc0d400cc3b6aaefa223ad9c2da60dfcfc426af558ef36524f","observation_id":"2c810087-4152-443b-a0b2-35092686a58e","resolution":{"observed_at":"2026-08-10T22:18:55.654198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.636255Z","title":"Applied and Computational Harmonic Analysis 22:335–355","venue":null,"work_id":"444c4b1b-51a3-4868-bdd5-9601f54e372c","year":2007},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.679011Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:19c666060cb81d1c5e1b6c6410186a55da2ccd46873f0cf0efd1d4f543218255","observation_id":"7de3e211-19d3-464a-af53-749583f6f721","resolution":{"observed_at":"2026-08-10T22:18:55.640941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:54.683250Z","title":"SIAM journal on Numerical Analysis 23(4):707–716","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.683250Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:e523786c0dc70cb6166a0a75c743484ea3db406efd5829575ddaab6b4e5111fb","observation_id":"6772ae22-726c-4b3f-818c-67072df2650c","resolution":{"observed_at":"2026-08-10T22:18:54.683250Z","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-10T22:18:54.686987Z","title":"IEEE Transactions on Signal Processing 57(7):2640–2650, DOI 10.1109/TSP","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.686987Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:b874b4fb8e0be4aa5caa08639a8965092ed564515117417813d0cf0125c699be","observation_id":"18e91eee-29aa-432f-9fe8-e8a86750665a","resolution":{"observed_at":"2026-08-10T22:18:54.686987Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19928","last_updated":"2026-07-01T20:44:17Z","snapshot_observed_at":"2026-08-16T13:05:52.006198Z","submitted_at":"2024-10-25T18:54:35Z","title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19928","snapshot_observed_at":"2026-08-10T22:18:54.690640Z","title":"URL https://doi.org/10.48550/arXiv.2410.19928","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.690640Z"},"links":{"cited_paper":"/paper/2410.19928","citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:916b871db6042279f03827366f7b3513ba418f4f8d351724a020e8d71e99f4fa","observation_id":"b3f455f3-8b19-4ba7-be6e-ebd043b8c6c6","resolution":{"observed_at":"2026-08-10T22:18:54.690640Z","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-10T22:18:55.615986Z","title":"Manuscript to be submitted, University of Antwerp","venue":null,"work_id":"9d06ab1d-a2f9-4698-a11c-dc3defcd1c0f","year":2024},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.694224Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:2a04c61fd2ef538231b52bd5b8a84150353592af81534ad9f2f647b02f238051","observation_id":"d7ad674a-6add-4cc7-8f15-b15e7493db1c","resolution":{"observed_at":"2026-08-10T22:18:55.620465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.603006Z","title":"Nonlinear Analysis: Theory, Methods & Applications 127:157–181","venue":null,"work_id":"d798956a-ddfc-4c63-a176-b98d3dcd6978","year":2015},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.697433Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:321879bcd06aab9d8a02dd9bb8d8c27a17aaff40ff01f7429b542161e09d7d3b","observation_id":"eca6fe25-a252-4595-b833-88e75d4d2181","resolution":{"observed_at":"2026-08-10T22:18:55.608277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.590857Z","title":"arXiv:230715596","venue":null,"work_id":"54ae2ceb-2991-4226-a884-3070f6ef72cc","year":2023},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.702151Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:fe7a2802d1b5fb026073ac2d29e0de0a67e558e9d7a3e6991fdf488af99246ab","observation_id":"9e34088e-1a51-47af-8ee8-97f70a4f8167","resolution":{"observed_at":"2026-08-10T22:18:55.594759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.576874Z","title":"Optimization Methods and Software 0(0):1–29","venue":null,"work_id":"d08e4a05-14a7-4e31-9d75-9bec3a2cff11","year":2024},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.705889Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:ad7e0a64124bb415e46a981f35a6d7e8958a3d289853b7f3d2c3205b886ed199","observation_id":"a4dc4e0b-950e-42db-8080-a9eff32dde75","resolution":{"observed_at":"2026-08-10T22:18:55.581050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.563940Z","title":"Com- putational Optimization and Applications 80:731–753","venue":null,"work_id":"6e01778f-e756-48ff-9356-21ad2aad1824","year":2021},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.709962Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:a5cb82281dcb3f556bbb830a1e90b6c474ce413f912d09da3f41216799d3c3fc","observation_id":"f907e0f9-dfc5-44a8-b22c-44bd3dfd421e","resolution":{"observed_at":"2026-08-10T22:18:55.567820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.551881Z","title":"Mathematical Programming 155:511–547 ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization 33","venue":null,"work_id":"a8a6a8b6-2dd6-4257-a8c5-55b86097cc25","year":2016},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.713771Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:2873585bd464b21d696678c51068e2990cae4bc91e9bc9062eb8ff964b495d69","observation_id":"0f356dd9-9d58-4d28-a0d6-ef54f3dc7967","resolution":{"observed_at":"2026-08-10T22:18:55.556402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.539101Z","title":"Foundations of Computational Mathematics 18:1199–1232","venue":null,"work_id":"f042ecfd-d0ac-4bf3-95c5-851faef3becb","year":2018},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.717746Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:ec79cd7998fa112ea402838cb898ade4833e2ee41e8c170ed2b24a910b42744c","observation_id":"cb5efa64-bdb6-4548-9809-9055d85c3786","resolution":{"observed_at":"2026-08-10T22:18:55.543893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.525735Z","title":"IEEE Transactions on Industrial Informatics 9(4):2177–2186","venue":null,"work_id":"d4e6f75f-9f86-4ef8-8040-e3889003096e","year":2013},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.721691Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:6a22717b8e65d9b8299d036b8be37e17b6a85a0562475998500aa5337738c954","observation_id":"27cd27af-058e-42e5-9b18-586181fa2d86","resolution":{"observed_at":"2026-08-10T22:18:55.529935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.512334Z","title":"SIAM Journal on Optimization 30:660–686","venue":null,"work_id":"d34a5707-36c6-46a8-aaa8-b74287ed1515","year":2020},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.726089Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:e979991496faa4ee61a7664e6f2b947d1a833177a969fbdbb86c343965088c4a","observation_id":"2067b469-234b-4783-a805-9a53327f3689","resolution":{"observed_at":"2026-08-10T22:18:55.516567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.496779Z","title":"IEEE Transactions on Cybernetics 52:1642–1660","venue":null,"work_id":"f2b879c6-fb86-4938-bc62-fb6139808192","year":2022},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.730236Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:29d8dddb7ea09b2150b0b1bbb289a4253f271688af73a37fadeec12fd22f3a02","observation_id":"97fda267-eb74-438d-9fea-304448c0e643","resolution":{"observed_at":"2026-08-10T22:18:55.502075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.481314Z","title":"SIAM Journal on Optimization 33:1092–1120","venue":null,"work_id":"42afed03-5549-4459-88cf-44d3dd47f816","year":2023},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.734080Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:4ac551d9c66a18b7b4cb12b0bd4b15ff6314f866e53065564aab53fd6af1e42e","observation_id":"493e027f-8507-4f66-8510-1694a8e0e6a1","resolution":{"observed_at":"2026-08-10T22:18:55.486716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.466739Z","title":"In: 6th Annual Learning for Dynamics & Control Conference, PMLR, 242, pp 993–1005","venue":null,"work_id":"b4568134-d42f-413f-be47-bcfeb14482ec","year":2024},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.738024Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:97fbae96935cfee0acb9a5f84d02fc6e7162242cc4b21db1c8dcd3d31ed97493","observation_id":"bfd0abd4-9f41-4d50-a96e-d84b0aaaec6a","resolution":{"observed_at":"2026-08-10T22:18:55.471281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.453886Z","title":"Signal Processing 152:84–89","venue":null,"work_id":"93c612b3-65c0-439b-8df0-5acb546837d0","year":2018},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.741824Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:99283a592b09de143db53581806e197423165f508de32a5a6b97db8e6cb9b872","observation_id":"eb628b99-a604-457d-94f0-4fc96264f8c2","resolution":{"observed_at":"2026-08-10T22:18:55.458055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.440692Z","title":"SIAM Journal on Control and Optimization 15(6):959–972","venue":null,"work_id":"d6b4236c-0067-4042-ac65-1247376b46e4","year":1977},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.745665Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:a7a2f6283b6e85817f9936e3012f1d560b2772b15e714aef02b5e4aba35c87c1","observation_id":"cfe5b63f-894b-4aab-a2f8-54a4dabbff1a","resolution":{"observed_at":"2026-08-10T22:18:55.445276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.425942Z","title":"Signal Processing 93:2636–2647","venue":null,"work_id":"c89e55cf-02a4-4837-8447-245dde89c303","year":2013},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.749471Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:1c89c4757bc85faaa8b1043372faba99aba97a91bf81f9a6a7ee3151f18d9f4e","observation_id":"2834aeb9-6746-4e7a-8179-28b833013964","resolution":{"observed_at":"2026-08-10T22:18:55.431558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.413894Z","title":"Springer Cham","venue":null,"work_id":"153b18d9-359e-4cfc-8c88-10d43042d90b","year":2018},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.754460Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:bc83600d39966e6840ff539adf9dcfd9c627ec5a46dc7673b65569b3313e6e45","observation_id":"61073dc4-cb12-4896-bdf0-85889a4deaf9","resolution":{"observed_at":"2026-08-10T22:18:55.417940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:54.757765Z","title":"Bulletin de la Soci´ et´ e Math´ ematique de France 93:273–299","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.757765Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:e0bbb3f934080843307a7a3a033aa35b499eaea03d13f4351647cd1785d16782","observation_id":"b88116e0-737f-4e2c-974e-792d30da1642","resolution":{"observed_at":"2026-08-10T22:18:54.757765Z","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-10T22:18:55.394504Z","title":"Mathematical programming 103:127–152","venue":null,"work_id":"aaab60e2-eafd-4b50-ae3e-c3666aa8e577","year":2005},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.760890Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:b27a7212b24c468b6a5df6999ca12c3c77d67f030374422b3ce86cf0d1ebc24b","observation_id":"b15708f5-b37f-4f5f-8303-99a6b3ec004c","resolution":{"observed_at":"2026-08-10T22:18:55.398149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.383245Z","title":"Mathematical Program- ming 152:381–404","venue":null,"work_id":"700be712-da86-4eb5-8c29-5b13c4e0868c","year":2015},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.763738Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:d28a532ffe0dcf078ce44d9a891f2f3ad89b7f0067526e4d3744b5dd6a3e5454","observation_id":"f3c7f4e6-c0ba-4a47-a5d4-29fe74053c6d","resolution":{"observed_at":"2026-08-10T22:18:55.387187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:54.767123Z","title":"Springer Cham","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.767123Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:577d8b5ccba1a84d71e464593fc5618243989bdf549b028b7a72892f666853e8","observation_id":"10d53cb5-fc3e-45bd-8955-15cb55fa107e","resolution":{"observed_at":"2026-08-10T22:18:54.767123Z","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-10T22:18:55.363780Z","title":"Cybernetics 16(1):10–12","venue":null,"work_id":"62d019c4-9a81-4d05-8f5a-6729047fc775","year":1980},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.770517Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:ec3ef913f76ec3d1364d2cf14c7fc2ce1a09045b0f4b5298e0331b7e69f09e04","observation_id":"af80ecbb-8da4-4828-99a8-8e518d00e0fe","resolution":{"observed_at":"2026-08-10T22:18:55.367960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.352266Z","title":"Cybernetics 9:145–150","venue":null,"work_id":"5f4dee25-ea7b-4168-aac8-f9897799c429","year":1973},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.774910Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:908afe2edd56d5795bdd55795f24b675f19e18c689f89d3bcca8721002fbf2f2","observation_id":"385e22a8-260e-4c29-b798-1848c46b60e0","resolution":{"observed_at":"2026-08-10T22:18:55.356134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.340960Z","title":"In: 52nd IEEE Conference on Decision and Control, IEEE, pp 2358–2363","venue":null,"work_id":"6e113dee-6299-449f-87df-9ea2e364706f","year":2013},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.778632Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:40b93f2cc1c0196e8e742b6028063559177f7efbc86f90c8caf050f03ca55fa2","observation_id":"5a841747-ade3-4e12-924f-c007fa5502c9","resolution":{"observed_at":"2026-08-10T22:18:55.345298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.329247Z","title":"Transactions of the American Mathematical Society 348:1805–1838","venue":null,"work_id":"5b49996b-e617-412f-9c01-6b3ce0b1f82a","year":1996},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.782698Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:60a0cbadaf7bcb488e3077ff0e05a09924db99ca54d1c8673fca6914cffc6a2e","observation_id":"1267966d-b55d-4830-91c2-a47761e41c32","resolution":{"observed_at":"2026-08-10T22:18:55.333417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.317159Z","title":"SIAM Journal on Scientific Computing 45:A2679–A2702","venue":null,"work_id":"560149e4-5b17-4c76-9046-4ab84437ea15","year":2023},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.786533Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:64b68c00502d76826f3713d7edcfedcda80a574c09e387a5c1bbfa2b11842b6e","observation_id":"9e9c16e3-8016-4c61-998b-dc81745841bd","resolution":{"observed_at":"2026-08-10T22:18:55.321202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:54.791202Z","title":"URL https://arxiv.org/abs/2501.00427","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.791202Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:861c4a393b14350f36f7542dcfd3c9b3c6af90caf024c4460a1a1c6fad66b77c","observation_id":"9e3c744d-6936-4dc4-a7d9-ccfc50e494be","resolution":{"observed_at":"2026-08-10T22:18:54.791202Z","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-10T22:18:55.304718Z","title":"Springer Berlin, Heidelberg","venue":null,"work_id":"72adf975-898e-4a5f-ac75-5cce715a64b3","year":2009},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.797587Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:9d6cb751e719bd223f2d5cd6b5129257f392213b7c9ef1e5348706b26766e8a9","observation_id":"f150146c-1849-4bee-9348-aecd527d0bb7","resolution":{"observed_at":"2026-08-10T22:18:55.309208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.293245Z","title":"Journal of Optimiza- tion Theory and Applications 185:303–326","venue":null,"work_id":"7f8cc94e-c3cd-47f0-a6c7-f2e0d318b388","year":2020},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.801781Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:b9fe22db1e544191d32aca574b11b9b4c3bb14be5117d39faf27be83e8116b15","observation_id":"4178a88f-c575-4bb3-845d-b114d3f06095","resolution":{"observed_at":"2026-08-10T22:18:55.297091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.281869Z","title":"Journal of Convex Analysis 19(4):1167–1192","venue":null,"work_id":"a4bfc618-235c-4f6a-b77c-2e61c78ab4da","year":2012},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.807228Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:a2c792f7c7be0b9944f91dab3127dae45ed3d154019409296a3f7c2672ba74bc","observation_id":"7ea776eb-b408-4424-a08c-c5b8249cce81","resolution":{"observed_at":"2026-08-10T22:18:55.285712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.270574Z","title":"IEEE Signal Processing Letters 23:934–938","venue":null,"work_id":"a090e7fb-822a-49ac-a185-37088130e674","year":2016},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.811361Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:60a7344f2b3e268a31f953f98b0f5c9d2163c8a4f53ec3fd4842d60dc378abcf","observation_id":"6ee38a3c-88e2-4c36-ab78-4c30d6ab88eb","resolution":{"observed_at":"2026-08-10T22:18:55.274280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.258923Z","title":"Computational Optimization and Applications 67:443–487","venue":null,"work_id":"4896e087-0fe7-4e78-bba9-5b71a1e13c9e","year":2017},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.815731Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:c7c80dfab9fbfdd819cb6d7c057fa90c2011d45f40611390436b8460d980729e","observation_id":"f0946a36-dfee-4409-bf81-acce6143c042","resolution":{"observed_at":"2026-08-10T22:18:55.263234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.243408Z","title":"SIAM Journal on Optimization 30:149–181","venue":null,"work_id":"a898e50c-a33c-465b-8890-0b2e1e945539","year":2020},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.820563Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:55568d6496b3ea4436f609269aac028888e6487454f198b4c90f37df7b945ae6","observation_id":"efba7c99-c067-4451-a000-515c5cd3c48e","resolution":{"observed_at":"2026-08-10T22:18:55.250273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.228957Z","title":"SIAM Journal on Optimization 28:2274–2303","venue":null,"work_id":"60c77d60-5872-4993-866d-ddd4643570b9","year":2018},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.825426Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:6edbb4062258a5129e18e7926c1bdf6fec4c879f057f81811386b2fb87d901b3","observation_id":"581c1ffe-2b37-4972-8c4c-d492f67c0edb","resolution":{"observed_at":"2026-08-10T22:18:55.234449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.214916Z","title":"In: Bauschke HH, Burachik RS, Luke DR (eds) Splitting Algorithms, Modern Operator Theory, and Applications, Springer Cham, pp 363–412","venue":null,"work_id":"6705539a-1da7-4580-be12-d4355d29d778","year":2019},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.830066Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:0b43a623ec71d38db4b8810c090e6136b2a61c464d823429062d0648aab73cc6","observation_id":"7e24e52b-1218-4b14-abbb-216da0471277","resolution":{"observed_at":"2026-08-10T22:18:55.219855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.200672Z","title":"Pro- ceedings of the IEEE 98:948–958 34 Alireza Kabgani, Masoud Ahookhosh","venue":null,"work_id":"84781f6a-13b3-4973-9024-66e8c900a9c8","year":2010},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.834279Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:634403e422c9367974ab2f8fb86fb143de5c91cec1af974cfebcc81e951900ea","observation_id":"ed6e4db2-3bbf-430a-8cf1-e69d8040c47e","resolution":{"observed_at":"2026-08-10T22:18:55.206281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.187669Z","title":"IEEE Transactions on Signal Processing 65:105–118","venue":null,"work_id":"485f358c-19c5-4a59-94da-c7008665e008","year":2017},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.839160Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:8f0538376150cc25a29cd7158859994739ccccc092e505441227e26fc0f8952b","observation_id":"8ffe27a4-f0cb-4a27-83d9-ea4a6ba729b5","resolution":{"observed_at":"2026-08-10T22:18:55.191648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.174274Z","title":"IEEE Transactions on Computational Imaging 3:566–579","venue":null,"work_id":"e7ab2935-c4cf-4deb-bfb5-b6950236ef8e","year":2017},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.842885Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:f51f6b8cfce550609dcd077bbf71fba1f7e02f69a66a0e2eec4f33a1f12712c1","observation_id":"9863ecf2-d586-4447-ab9e-ca602fea6421","resolution":{"observed_at":"2026-08-10T22:18:55.179068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.159010Z","title":"IEEE Access 6:69883–69906","venue":null,"work_id":"5302a3ef-6c87-49af-9b69-5c4b0d93e97d","year":2018},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.848462Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:9c28b44b3d73e50ca416c7ce4280eadcc8d1a90ad998cb93831538bf66ad6f4b","observation_id":"0cb277ab-ae19-4b7c-8376-c068cbc7c057","resolution":{"observed_at":"2026-08-10T22:18:55.164423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.143637Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence 31(2):210–227","venue":null,"work_id":"aecffb9e-e642-4e0a-9508-4d097a2896a3","year":2009},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.852493Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:2d7cc90399338ac585c778487f93cb846a54c40a9db4e067f531dc821a12b2db","observation_id":"d05d4940-dbd4-4cf6-954b-4b65d9085ede","resolution":{"observed_at":"2026-08-10T22:18:55.147713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.129205Z","title":"IEEE Transactions on Signal Processing 67:5046–5061","venue":null,"work_id":"cb6b9b22-be9f-4dc5-8d0c-8314040bc8d6","year":2019},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.857811Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:0a890c78b5c87e031cd33c106bb59481be792bc24715114ed87f764c06415a46","observation_id":"ec6fa917-898b-4084-b1c2-e57302ae85ef","resolution":{"observed_at":"2026-08-10T22:18:55.134128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.115234Z","title":"Optimization letters 10:1361–1370","venue":null,"work_id":"571635f7-2247-46e7-9e14-ce0f57f98dff","year":2016},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.861911Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:b4ed3db8de91ca8f8ccf249736708b8c03c4031e2d7d0edc9d6139233234f23a","observation_id":"61045b7f-fb2f-4509-b5d3-ff7f0e08775c","resolution":{"observed_at":"2026-08-10T22:18:55.120691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.099172Z","title":"Foundations of Computa- tional Mathematics 22:1171–1217","venue":null,"work_id":"a32a8a9d-1cb8-4662-a0a1-63cd2942c9cb","year":2022},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.866226Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:d8f1d0cb024580f85fff467ee5061b5f0b6fa803f39e6b8f0d97d65443380be1","observation_id":"3059a2c6-1385-4d8d-a486-1d59bbc5af99","resolution":{"observed_at":"2026-08-10T22:18:55.105250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:18:55.078616Z","title":"Journal of the American statistical association 101(476):1418–1429","venue":null,"work_id":"c59e986a-873b-487a-8432-92c07a6eb55d","year":2006},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.871226Z"},"links":{"citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:0c554663cd5cd6241292268d2a0b804f6105c5f8909d8cd47a756a93834a494e","observation_id":"1f57b109-80e3-478b-9f89-0265cefb6c97","resolution":{"observed_at":"2026-08-10T22:18:55.087196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":71},"total_outbound_references":79},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 4 inbound Pith citation observations for arXiv:2501.02155."}