{"as_of":"2026-08-18T08:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1b6ddb513862abb10a09d71bea918bd09b62ec511771971418b57a325b37444","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T22:37:55.138341Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2511.10414/citation-record","integrity":"/paper/2511.10414/integrity","json":"/paper/2511.10414/citation-record.json","paper":"/paper/2511.10414"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T22:37:54.967042Z","title":"SIAM Journal on Optimization16(2), 531–547 (2005)","venue":null,"work_id":null,"year":2005},"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":1,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.967042Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:f6166e09c040e01bf2ffc62d3360e3dd51ebc81056b439b5450562191d125878","observation_id":"d4c59512-82d0-49bc-8e72-78c41eee37bb","resolution":{"observed_at":"2026-08-03T22:37:54.967042Z","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-03T22:37:54.971661Z","title":"Journal of Machine Learning Research22(98), 1–76 (2021)","venue":null,"work_id":null,"year":2021},"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":2,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.971661Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:78c502a12a58793cdfe330f1c1f86b05bee1a7cb4e4f095a391a0a5042fb9e55","observation_id":"b041f2d5-611e-4cc9-a590-17eecbece195","resolution":{"observed_at":"2026-08-03T22:37:54.971661Z","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-03T22:37:54.975516Z","title":"Mathematical Methods of Operations Research89(3), 319–353 (2019)","venue":null,"work_id":null,"year":2019},"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":3,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.975516Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:7a0163760db644643c5e519f0af90be83b335feab2b54cd1050e1f97b5584f3a","observation_id":"5277eabe-a374-4d6d-8551-e0d4e0cd3c2d","resolution":{"observed_at":"2026-08-03T22:37:54.975516Z","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-03T22:37:54.979500Z","title":"SIAM Journal on Optimization31(1), 653–685 (2021)","venue":null,"work_id":null,"year":2021},"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":4,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.979500Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:a9fa35ee782c20c318f2d6003440fa1c2dbcc3b35ede4cce740a9674b4d3e875","observation_id":"cb583b60-f08a-4d45-9775-5a418fa4788d","resolution":{"observed_at":"2026-08-03T22:37:54.979500Z","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-03T22:37:54.983619Z","title":"In: International conference on machine learning, pp","venue":null,"work_id":null,"year":2019},"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":5,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.983619Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:d81bc4b8a72adf8824ffa4cf2e94d8fd6ba0ed50b90c1574b6341a80db0c1b5c","observation_id":"6c1ea93a-0e71-46c7-82ec-cde20c45aefe","resolution":{"observed_at":"2026-08-03T22:37:54.983619Z","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-03T22:37:54.987719Z","title":"Journal of Global Optimization84(3), 563–589 (2022)","venue":null,"work_id":null,"year":2022},"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":6,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.987719Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:888dc67e243d6a00b17b954d125fd422c184c737a23a13b80da1b848d0de15ba","observation_id":"43e64e9d-9009-402b-b52d-818711b2b98a","resolution":{"observed_at":"2026-08-03T22:37:54.987719Z","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-03T22:37:54.991989Z","title":"Mathematical programming169, 95–118 (2018)","venue":null,"work_id":null,"year":2018},"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":7,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.991989Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:5e67ee1dba0f5b3ca942caaed2b48faadbbfbcd25fa0b54e643e94ed71048996","observation_id":"4db018ed-9918-464e-9635-b598b10e7e9c","resolution":{"observed_at":"2026-08-03T22:37:54.991989Z","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-03T22:37:54.995587Z","title":"Mathematics of Operations Research35(2), 438–457 (2010)","venue":null,"work_id":null,"year":2010},"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":8,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.995587Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:c1f367df09558e09e61c492517328b9c8ecbf7c55a5ef82864307f06c7be2744","observation_id":"69c9c2b8-155e-4c94-8200-6abcd29142a1","resolution":{"observed_at":"2026-08-03T22:37:54.995587Z","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-03T22:37:54.999583Z","title":"Mathematical Programming137(1), 91–129 (2013)","venue":null,"work_id":null,"year":2013},"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":9,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:54.999583Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:88e828da21ae43b4d47853485bd2516bbe337756ec169c554c5b28c2185f9133","observation_id":"8b3efd7e-9111-4ad8-af26-9fc68957009e","resolution":{"observed_at":"2026-08-03T22:37:54.999583Z","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-03T22:37:55.003774Z","title":"CMS Books in Mathematics","venue":null,"work_id":null,"year":2017},"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":10,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.003774Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:193e8bc5b50d13120fcd7a462e2eb9919c79d45ab004c9a1c236a03be3966975","observation_id":"ac08978a-ca8e-441f-bec3-6ffa05e6eefc","resolution":{"observed_at":"2026-08-03T22:37:55.003774Z","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-03T22:37:55.007560Z","title":"Journal of Optimization Theory and Applications207(3), 41 (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":11,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.007560Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:f6629dc143e839cef99651d52218896c9f99246ba7a5c64b68167ac41c140bcf","observation_id":"819639dc-6307-48ea-a76b-1e404b3405fa","resolution":{"observed_at":"2026-08-03T22:37:55.007560Z","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-03T22:37:55.011299Z","title":"Journal of mathematical analysis and applications321(2), 729–740 (2006)","venue":null,"work_id":null,"year":2006},"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":12,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.011299Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:2fd8601371399c9f258fe23214f22857d2f9558cc4bbf266b19ea159ef60d215","observation_id":"b110b468-4147-4bee-a21a-032d5adb7470","resolution":{"observed_at":"2026-08-03T22:37:55.011299Z","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-03T22:37:55.015448Z","title":"SIAM Journal on Optimization17(4), 1205–1223 (2007)","venue":null,"work_id":null,"year":2007},"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":13,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.015448Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:cbe65693d08c0c8420bd256b6fbb46a9b5abf88cef5da1ea0418beb121a14ed6","observation_id":"5af4bb34-478c-40df-9445-5fa17526c231","resolution":{"observed_at":"2026-08-03T22:37:55.015448Z","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-03T22:37:55.019275Z","title":"SIAM Journal on Optimization 18(2), 556–572 (2007)","venue":null,"work_id":null,"year":2007},"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":14,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.019275Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:aeba8fe92fcf6af33ccdbf0aeb107880f6d59c2d5a156682330fa2b9ccce3cba","observation_id":"4feaae16-2953-479a-923d-49be874e3336","resolution":{"observed_at":"2026-08-03T22:37:55.019275Z","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-03T22:37:55.023046Z","title":"Mathematical Programming165(2), 471–507 (2017)","venue":null,"work_id":null,"year":2017},"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":15,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.023046Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:711f1f4e75af2afbed4dcbc02a026e2babf37439c5cdeae1649b18fc0edb6405","observation_id":"e83113dd-5341-4e85-8ecf-22b6e72b4667","resolution":{"observed_at":"2026-08-03T22:37:55.023046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.08921","last_updated":"2019-07-29T20:26:16Z","snapshot_observed_at":"2026-08-14T16:04:02.994968Z","submitted_at":"2019-07-21T06:36:43Z","title":"LQR through the Lens of First Order Methods: Discrete-time Case","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.08921","snapshot_observed_at":"2026-08-03T22:37:55.026916Z","title":"arXiv preprint arXiv:1907.08921 (2019)","venue":null,"work_id":null,"year":1907},"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":16,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.026916Z"},"links":{"cited_paper":"/paper/1907.08921","citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:dad5554d0c120c9a01a82e81c69031f6a036e563853c6c75277fd2be8e35898d","observation_id":"0d6372a9-4da8-4c5b-ba40-7cb8b1669129","resolution":{"observed_at":"2026-08-03T22:37:55.026916Z","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-03T22:37:55.030973Z","title":"Advances in Neural Information Processing Systems35, 15836–15848 (2022)","venue":null,"work_id":null,"year":2022},"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":17,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.030973Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:3f456bf4fbd766785c8f8fccde73e1363bba43b6ce9c55655ab4644e9717f6b0","observation_id":"c6848972-b1fe-4cbb-a47c-a7c6616d45bd","resolution":{"observed_at":"2026-08-03T22:37:55.030973Z","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-03T22:37:55.034939Z","title":"SIAM Journal on Control and Optimization 59(5), 3887–3911 (2021)","venue":null,"work_id":null,"year":2021},"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":18,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.034939Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:5119e305d8daf4ea117fadd62bdccab75822b1c074b638cc175fe52b86b2fd8d","observation_id":"6c3f1df8-a7c9-44c4-b9e1-5f0219da7dda","resolution":{"observed_at":"2026-08-03T22:37:55.034939Z","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-03T22:37:55.038828Z","title":"Journal of Optimization Theory and Applications165, 874–900 (2015)","venue":null,"work_id":null,"year":2015},"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":19,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.038828Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:43a9440ac99e8d9326bfd6b80125f7092db02b3847396b3dc8b0139e453b4808","observation_id":"859e2f37-4ee2-4bcc-95dc-bf8362e2dc47","resolution":{"observed_at":"2026-08-03T22:37:55.038828Z","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-03T22:37:55.042622Z","title":"Mathematical Programming198(1), 937–996 (2023)","venue":null,"work_id":null,"year":2023},"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":20,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.042622Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:5c5071847e6ac5f9d6b8d3d697e1d289f9296297a16ad6f6f4f489db53c86c32","observation_id":"0ccc91a1-d546-4781-87af-83b9e22d858f","resolution":{"observed_at":"2026-08-03T22:37:55.042622Z","resolver_source":null,"status":"unresolved"},"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-03T22:37:55.046638Z","title":"arXiv (2024)","venue":null,"work_id":null,"year":2024},"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":21,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.046638Z"},"links":{"cited_paper":"/paper/2410.19928","citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:8b660508c09949896c8eba61fc986da99454dfc877a19fb2c7a8d44916ce747a","observation_id":"ed7d52af-1e50-4a5d-8021-d50cb580d511","resolution":{"observed_at":"2026-08-03T22:37:55.046638Z","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: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":null,"cited_work":{"arxiv_id":"2503.04577","doi":"10.48550/arxiv.2503.04577","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv (2025)","venue":"ArXiv.org","work_id":"ba896767-2835-4621-91d6-71ece9419525","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":23,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.054573Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:efb0f972a95e6f5d158f8a418b0c10e90b420edf3e0dbedb12c254dfc23ad7bb","observation_id":"028ee87a-6343-4c44-a0ec-d4f1df23d704","resolution":{"observed_at":"2026-08-03T22:38:38.212844Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T22:37:55.058288Z","title":"In: Joint European conference on machine learning and knowledge discovery in databases, pp","venue":null,"work_id":null,"year":2016},"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":24,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.058288Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:ebb855b5464d90ddea184fbd185debdeaa1db3d58a6c9d6286e2dd652a76ebb4","observation_id":"495a6f00-74b4-4b66-bbd2-8b3b475c4a9d","resolution":{"observed_at":"2026-08-03T22:37:55.058288Z","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-03T22:37:55.062330Z","title":"Annales de l’institut Fourier48(3), 769–783 (1998) Minimizing smooth Kurdyka- Lojasiewicz functions via generalized descent methods: Convergence rate and complexity 21","venue":null,"work_id":null,"year":1998},"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":25,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.062330Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:75c5d651fd32668a6d690aaaf1ac58906b735aca34f92e89e60fc5a954d8ea50","observation_id":"3be2db76-0d3b-4db4-91fb-1b7420de1407","resolution":{"observed_at":"2026-08-03T22:37:55.062330Z","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-03T22:37:55.066123Z","title":"Foundations of computational mathematics18(5), 1199–1232 (2018)","venue":null,"work_id":null,"year":2018},"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":26,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.066123Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:9557bd127cbae8a9afecaffde20051e501d58d87ab0cd55b8babadaae235b923","observation_id":"247f60ed-4dc2-4d0c-8616-2820dc3ef591","resolution":{"observed_at":"2026-08-03T22:37:55.066123Z","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-03T22:37:55.069901Z","title":"Les ´ equations aux d´ eriv´ ees partielles pp","venue":null,"work_id":null,"year":1963},"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":27,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.069901Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:71a1e2ada2b055f4117c29a974f74d90c8358142d5bdbd9df92d1a0fc30a55ea","observation_id":"9520f0c0-0d05-49d0-92c9-980e069ff450","resolution":{"observed_at":"2026-08-03T22:37:55.069901Z","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-03T22:37:55.073549Z","title":"Annales de l’institut Fourier43(5), 1575–1595 (1993)","venue":null,"work_id":null,"year":1993},"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":28,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.073549Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:2313ce3ffe7535dac88fbcc20e699d31eb7a82029eda75f22df40374a6703d62","observation_id":"0ceddedd-5d26-47ee-82e8-bfb3b80ca463","resolution":{"observed_at":"2026-08-03T22:37:55.073549Z","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-03T22:37:55.077376Z","title":"In: International conference on machine learning, pp","venue":null,"work_id":null,"year":2020},"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":29,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.077376Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:9fd95a0c45a61ea99071eb936decb741999df1687d8eb505e891c04b56be620a","observation_id":"6d5d7d07-e0c5-46bc-b2db-4278c21088e7","resolution":{"observed_at":"2026-08-03T22:37:55.077376Z","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-03T22:37:55.081334Z","title":"Springer Cham (2018)","venue":null,"work_id":null,"year":2018},"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":30,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.081334Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:5bb18402e3bbf2905c1cccc82504ef25c674221c5581374156adc908051fa6ce","observation_id":"61348107-6e00-4a4f-a454-e722fdbb0e8d","resolution":{"observed_at":"2026-08-03T22:37:55.081334Z","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-03T22:37:55.085020Z","title":"Bulletin de la Soci´ et´ e Math´ ematique de France93, 273–299 (1965)","venue":null,"work_id":null,"year":1965},"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":31,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.085020Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:fac3b95cbe96a4a9b8ead3dcd5acdb3cb9ecea4dc35d7fa0fc26e0d8a90e60f1","observation_id":"9254126c-6845-4779-bd92-37c686b64279","resolution":{"observed_at":"2026-08-03T22:37:55.085020Z","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-03T22:37:55.088624Z","title":"Mathematical Programming152(1-2), 381–404 (2015)","venue":null,"work_id":null,"year":2015},"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":32,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.088624Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:9d8ec25a2b18c7ed2e20682f688897b0148ee87993af756389d68895fa4918ff","observation_id":"68c8948c-188e-4571-922d-25a7c52ca036","resolution":{"observed_at":"2026-08-03T22:37:55.088624Z","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-03T22:37:55.092197Z","title":null,"venue":null,"work_id":null,"year":2018},"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":33,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.092197Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:2e4b5aef6f475075d188735440a7c545adcded376732a4c57952f4ea81fe9eb8","observation_id":"dee1b2c7-084f-4343-b614-8e896b9064a6","resolution":{"observed_at":"2026-08-03T22:37:55.092197Z","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-03T22:37:55.096171Z","title":"Springer Science & Business Media (2006)","venue":null,"work_id":null,"year":2006},"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":34,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.096171Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:24ee0a86ac2c65a68e6f4d9d87c7120f578349cfb75984f49204113afcbe2c04","observation_id":"446ca6f2-481a-4c33-8bc5-5ba8d06485b8","resolution":{"observed_at":"2026-08-03T22:37:55.096171Z","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-03T22:37:55.099870Z","title":"Cybernetics9, 145–150 (1973)","venue":null,"work_id":null,"year":1973},"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":35,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.099870Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:b7fb9eb15b2e9e9c28c9b7ec7a4291605d30630da8d5d6bb015d13082af4b99c","observation_id":"73bb8b84-b27e-4c6a-9f90-16101f26cf99","resolution":{"observed_at":"2026-08-03T22:37:55.099870Z","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-03T22:37:55.103705Z","title":"Transactions of the American Mathematical Society348(5), 1805–1838 (1996)","venue":null,"work_id":null,"year":1996},"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":36,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.103705Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:ccbc84bf617e7b039046cb0143b202e0810caa402018b940f51070857b4b6a82","observation_id":"920dd9c7-50c0-445f-a749-b9e9ce6b3c17","resolution":{"observed_at":"2026-08-03T22:37:55.103705Z","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-03T22:37:55.107585Z","title":null,"venue":null,"work_id":null,"year":2011},"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":37,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.107585Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:a988e07200869219b005941335efc70ffae72df54299a66f40efa7cc9cd62d31","observation_id":"6d8c4f5c-3324-46df-b5c7-ba98441613aa","resolution":{"observed_at":"2026-08-03T22:37:55.107585Z","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-03T22:37:55.111207Z","title":"Journal of Optimization Theory and Applications185, 303–326 (2020)","venue":null,"work_id":null,"year":2020},"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":38,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.111207Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:6c70b4af15b373511eb39b2d2e016865ae44789b23e7f8a59e02ccb6cf6560c4","observation_id":"8ae50d0f-f25f-4807-b02e-a89502eca6f7","resolution":{"observed_at":"2026-08-03T22:37:55.111207Z","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-03T22:37:55.114890Z","title":"Com- putational Optimization and Applications67(3), 443–487 (2017)","venue":null,"work_id":null,"year":2017},"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":39,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.114890Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:3adcf769b540fed611a2c49aeeab0980bb67b0df909275113de4b4c8d2087906","observation_id":"d2cd6353-7af9-47cf-ae26-4cdd0e0e6fb3","resolution":{"observed_at":"2026-08-03T22:37:55.114890Z","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-03T22:37:55.118817Z","title":null,"venue":null,"work_id":null,"year":2019},"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":40,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.118817Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:af735e82282b4a5471f51d9f2bfc97756be22451c471e65eb4fa205596f41924","observation_id":"d358ff18-e405-483f-b8af-21673c44951a","resolution":{"observed_at":"2026-08-03T22:37:55.118817Z","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-03T22:37:55.122652Z","title":"SIAM Journal on Optimization28(3), 2274–2303 (2018)","venue":null,"work_id":null,"year":2018},"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":41,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.122652Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:62dcc3436b01b40e0e203a9e2440b3a90b78dff02c8e1d0c6d746957981b5345","observation_id":"c270bb37-d098-4929-9cc5-42a9f142369f","resolution":{"observed_at":"2026-08-03T22:37:55.122652Z","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-03T22:37:55.126434Z","title":"Optimization letters10, 1361–1370 (2016)","venue":null,"work_id":null,"year":2016},"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":42,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.126434Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:8e916bb3d61b78192e8be1c4dd806e49f4f6e5772290cdf114d5e4a5aee804aa","observation_id":"fd787ef3-fe97-4b7c-b75a-1a6986e67511","resolution":{"observed_at":"2026-08-03T22:37:55.126434Z","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-03T22:37:55.130324Z","title":"Foundations of Computational Mathematics 22(4), 1171–1217 (2022)","venue":null,"work_id":null,"year":2022},"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":43,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.130324Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:10c176a0c68886226c0bb7ae2741e15cbcc826e4d581a93fb30df34fdf9baee8","observation_id":"ce2d1a27-5cf8-4745-bc15-52d3b400731d","resolution":{"observed_at":"2026-08-03T22:37:55.130324Z","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-03T22:37:55.134167Z","title":"In: International Conference on Artificial Intelligence and Statistics, pp","venue":null,"work_id":null,"year":2022},"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":44,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.134167Z"},"links":{"citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:a28b4d57cb2f7788a375d24f7b053297f679ee184e8bc0009220b8d812f90a82","observation_id":"62de023f-91bb-4d9f-b1ee-b61f7bf04ae2","resolution":{"observed_at":"2026-08-03T22:37:55.134167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00225","last_updated":"2019-05-12T12:24:53Z","snapshot_observed_at":"2026-08-16T11:19:28.305176Z","submitted_at":"2018-03-01T06:11:53Z","title":"Global Convergence of Block Coordinate Descent in Deep Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00225","snapshot_observed_at":"2026-08-03T22:37:55.138341Z","title":"arXiv preprint arXiv:1803.002259(2018)","venue":null,"work_id":null,"year":2018},"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":45,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.138341Z"},"links":{"cited_paper":"/paper/1803.00225","citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:003be2192f450eac7d42a39fbba844537f991ac8462e4433098b2e5edac01c3e","observation_id":"143b3453-a18a-4ee9-89ab-f8e35a8a93f3","resolution":{"observed_at":"2026-08-03T22:37:55.138341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.10414","last_updated":"2026-06-05T14:08:24Z","latest_version":2,"primary_category":"math.OC","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"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":45},"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 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2511.10414."}