{"as_of":"2026-08-18T10:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:81d2e734c93f2ab979ffca7a58def47b1c0c2ad7a85ab707eea3171b382d9563","coverage":[{"denominator":67,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":67,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:06:58.728090Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"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/2505.00221/citation-record","integrity":"/paper/2505.00221/integrity","json":"/paper/2505.00221/citation-record.json","paper":"/paper/2505.00221"},"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-16T05:06:59.725505Z","title":"Global maximization of a convex function with linear inequality constraints,","venue":null,"work_id":"085038ba-9f1c-4ce7-b977-d555bdf287e0","year":1974},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.442929Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:038c03ff6f85d5d6fdb6d2d606ea200df424c2362d4ba4ad42f8df7c968447ea","observation_id":"aa1cc2cd-5088-48a4-85a0-39b172bb87ad","resolution":{"observed_at":"2026-08-16T05:06:59.729743Z","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-16T05:06:59.712947Z","title":"Machine learning via polyhedral concave minimization,","venue":null,"work_id":"7389488b-768f-4269-b22a-683606d9218a","year":1996},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.450514Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:b5c6daf9cc6531eda68fef2865650fd4ae6ae3578fc5c55c23c0ab9c471913d6","observation_id":"484a8079-f110-4a1c-8c4a-5aaa75eb7399","resolution":{"observed_at":"2026-08-16T05:06:59.716925Z","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-16T05:06:59.701591Z","title":"A direct formu- lation for sparse pca using semidefinite programming,","venue":null,"work_id":"57d47073-a0f0-430c-992c-2787d8cb635b","year":2004},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.455501Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:847875d3fbd187c0832e96902dfe4cd4da28a806a08634e03ebfa4cd34381672","observation_id":"a200bbf1-8e76-4c6f-9099-5a37242a5995","resolution":{"observed_at":"2026-08-16T05:06:59.705575Z","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-16T05:06:59.689771Z","title":"Nonnegative sparse pca,","venue":null,"work_id":"db440eff-a410-423e-a1e2-5913558d5342","year":2006},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.460064Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:9e49b95ac19c0f9b7d8c104f0fa63735b36dc9aa90f099438f643dfbb9191de3","observation_id":"72ed4117-a38e-4883-8fb9-3eec06876fb0","resolution":{"observed_at":"2026-08-16T05:06:59.693748Z","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-16T05:06:59.677652Z","title":"Enhancing sparsity by reweightedℓ1 minimization,","venue":null,"work_id":"675d51aa-1e23-479c-9dea-ac332acba622","year":2008},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.464427Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:53880ca41ea1b9df004b75f136d07eaf2f7d37d656c4b7b967b10035918e3014","observation_id":"f0f2f9f5-bf03-4acc-b292-5060b324d07d","resolution":{"observed_at":"2026-08-16T05:06:59.681535Z","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-16T05:06:59.666321Z","title":"Reweighted nuclear norm minimization with application to system identification,","venue":null,"work_id":"62f3e434-b1b4-4edc-8220-ccdb99dccd6b","year":2010},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.469373Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:667afd5638f1900ce7ec11c66e70119a303d296191719190f4e348064665c0d8","observation_id":"f09aa621-9fcd-45fa-93c7-764ef8777e82","resolution":{"observed_at":"2026-08-16T05:06:59.670330Z","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-16T05:06:59.653057Z","title":"Pca sparsified,","venue":null,"work_id":"23852a81-60bb-428b-86fd-9bd8c7fc24f2","year":2023},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.474280Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:7616f548e45be6b90751bc557685baa074cd18ab165f08336324696ea6c8c743","observation_id":"dfa5f4fe-d574-4ce3-a2e0-43053d3d1c2f","resolution":{"observed_at":"2026-08-16T05:06:59.657757Z","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-16T05:06:59.639016Z","title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite program- ming,","venue":null,"work_id":"039b20cc-d6d2-4a16-b497-3a75f934d04f","year":1995},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.478386Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:b0142ad6660acd6becf225c0041f9354e605486b095f9e00ea4a18ee8710f225","observation_id":"cd1f5bf8-d8bb-4e77-b53f-fd1123d74625","resolution":{"observed_at":"2026-08-16T05:06:59.643299Z","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-16T05:06:59.626976Z","title":"Concave minimization: theory, applications and algorithms,","venue":null,"work_id":"b3f992f5-8be3-499b-9c7d-b39ebc7597ab","year":1995},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.482115Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:5fdfeae14918ae80816fcddc03c8cabc778f7bcd997b9498594b9a672bb7c0a5","observation_id":"9d0c3f65-241a-4639-a979-dc6ce977f6e6","resolution":{"observed_at":"2026-08-16T05:06:59.631265Z","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-16T05:06:59.614188Z","title":"Convex maximiza- tion via adjustable robust optimization,","venue":null,"work_id":"28338573-e9d6-422f-ae63-8db5852d0f75","year":2022},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.486707Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:c08621ba3c601581b0c867d07f3a3f3db6f606a561f2c544bb5920d7d908bb02","observation_id":"602b464a-bd04-4dcf-aaba-56e9c775bf1c","resolution":{"observed_at":"2026-08-16T05:06:59.619019Z","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-16T05:06:59.601209Z","title":"An algorithm for maximizing a convex function based on its minimum,","venue":null,"work_id":"546279aa-281e-4767-9d5f-22e7288c908a","year":2022},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.490440Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:3181bcf65a2a5dc742e19afb8a7c80cf16f42ac9e8c68f25c712de86f0827e99","observation_id":"8333be39-a270-4d30-88de-7e322dc82639","resolution":{"observed_at":"2026-08-16T05:06:59.605574Z","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-16T05:06:59.587294Z","title":"Variations and extension of the convex–concave procedure,","venue":null,"work_id":"6415299f-5617-459d-8972-ab4b3cf4541d","year":2016},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.493988Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:bb35a48717bc7bbb216a770f72745bdab85f903ae275bb09e3fa6a96261828f4","observation_id":"3248bbee-7e13-4d1a-b60d-7d8d63f4de65","resolution":{"observed_at":"2026-08-16T05:06:59.591863Z","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-16T05:06:59.573561Z","title":"Cccp is frank-wolfe in disguise,","venue":null,"work_id":"3f5861b9-b180-4342-b658-7bdfc16aea7b","year":2022},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.498035Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:7641f29056c42635ad411801da13e28795d5566f57b1d59526cc0a66aee885fe","observation_id":"dbd0473a-8ffb-4008-9f9e-735e3d16a577","resolution":{"observed_at":"2026-08-16T05:06:59.578476Z","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-16T05:06:59.556389Z","title":"Checking local optimality in constrained quadratic programming is np-hard,","venue":null,"work_id":"6de798bb-e830-45cc-a5da-85cd4e258edb","year":1988},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.501747Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:293fd07fac105dbe160079a41764a2fbec5a3a4defeba2974f1eaa907ecac283","observation_id":"0ed5bb91-cef6-4bbd-8b54-979fa0d16b27","resolution":{"observed_at":"2026-08-16T05:06:59.562616Z","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-16T05:06:59.534578Z","title":"Methods for global concave minimization: A bibliographic survey,","venue":null,"work_id":"ad5674fd-7da0-4636-8c61-c08a1e3e254f","year":1986},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.505986Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:90b54f5c4a080789fc8b0693e0f61f3b396263c56c9c92e2feaa87537d0a1727","observation_id":"34ec0db7-f449-47f2-9cb4-c0190bd58f47","resolution":{"observed_at":"2026-08-16T05:06:59.542353Z","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-16T05:06:59.518961Z","title":"Audet, P","venue":null,"work_id":"d300ae3e-7f18-4036-bf7e-a78c028cec6d","year":2005},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.509896Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:ae4e7dddd37e0b16c79ffa655931872a68425fff95cce9cde07df57f337d328b","observation_id":"7ebbdbb1-c4dc-409b-b7e8-569443a7f068","resolution":{"observed_at":"2026-08-16T05:06:59.523622Z","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-16T05:06:59.504983Z","title":"One algorithm for branch and bound method for solving concave optimization problem,","venue":null,"work_id":"28894cfc-c553-4873-a516-f64f9982334a","year":2016},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.513600Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:079705371f34f6b20267fb5b6f821e49ae23022453f294b6237e3e6402c4f7a9","observation_id":"651f5267-defb-42b1-848b-8009f84b7bc2","resolution":{"observed_at":"2026-08-16T05:06:59.509974Z","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-16T05:06:59.490742Z","title":"Conditional gradient algorithmsfor rank-one matrix approximations with a sparsity constraint,","venue":null,"work_id":"b5d4038e-d2a7-4ab7-b15f-2a81634c36e2","year":2013},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.518354Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:4b9adfcfaebd78076719a0cca3f8fefa493add2b13f1db6167c0b8d36a1d4c22","observation_id":"29e7dd82-7120-4167-bc2c-c73ce3bd542a","resolution":{"observed_at":"2026-08-16T05:06:59.496763Z","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-16T05:06:59.475326Z","title":"Nonlinear programming,","venue":null,"work_id":"a0f38c9a-3e2c-4cc3-bd6d-ee61ca874186","year":1997},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.522341Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:d55b1d4671cf30751d0f8e642a39dddfe17042fb076874537e01dc3abc0b5137","observation_id":"83f1ebfa-f59c-4095-b778-87e2a3a19a61","resolution":{"observed_at":"2026-08-16T05:06:59.480169Z","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-16T05:06:59.455029Z","title":"An algorithm for quadratic programming,","venue":null,"work_id":"26f10c38-604e-4b3c-818c-b81d95f14b9b","year":1956},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.526726Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:545d072a45a20bc90b2a3eb6b76d0b6e7503a8384eda273ab5578219829e8fe7","observation_id":"70212646-437b-4db1-b44f-046fddfe5310","resolution":{"observed_at":"2026-08-16T05:06:59.459846Z","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-16T05:06:59.434790Z","title":"Constrained minimization methods,","venue":null,"work_id":"060c22a9-a6b0-4c74-b384-40f2c7eb16fd","year":1966},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.531365Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:b4bacecddda0d3593865895278455ed1942dfeca9378101dd1d4c6eec5f479c3","observation_id":"65b0bca6-5d58-4245-9a8c-cfe6905b323c","resolution":{"observed_at":"2026-08-16T05:06:59.443052Z","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-16T05:06:59.421862Z","title":"Convergence rates for conditional gradient sequences generated by implicit step length rules,","venue":null,"work_id":"eb294143-0ade-45bc-9293-85b8ee32e970","year":1980},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.535064Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:94b7942e6edaf6845569c004029d46e03cc3be4d20443642af479afc401784d1","observation_id":"b8bfccce-c237-42f2-8cde-f2a0d326c902","resolution":{"observed_at":"2026-08-16T05:06:59.426106Z","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":{"arxiv_id":"1206.4657","last_updated":"2012-06-18T15:26:34Z","snapshot_observed_at":"2026-08-15T00:56:29.649916Z","submitted_at":"2012-06-18T15:26:34Z","title":"Projection-free Online Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.4657","snapshot_observed_at":"2026-08-16T05:06:58.546168Z","title":"Projection-free online learning,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.546168Z"},"links":{"cited_paper":"/paper/1206.4657","citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:a20e4e8df8640b6a713a5aedfd7abbf4c5798e2c60cdd962a32934af0bc3ba02","observation_id":"7906df74-6a02-47dc-b59d-602a43d41fd6","resolution":{"observed_at":"2026-08-16T05:06:58.546168Z","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-16T05:06:59.407550Z","title":"Revisiting frank-wolfe: Projection-free sparse convex optimiza- tion,","venue":null,"work_id":"ab006593-a4ed-434d-a416-f61dd7a9f75d","year":2013},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.551565Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:3636ed97b540fb4bbd143e9a53dbf070396647ccc951beec6df69aa078a4b5db","observation_id":"7a6460ec-f3f4-4107-9715-d74ab6a5a838","resolution":{"observed_at":"2026-08-16T05:06:59.412930Z","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-16T05:06:59.392678Z","title":"A conditional gradient framework for composite convex minimization with applications to semidefinite programming,","venue":null,"work_id":"04baddc2-3c1d-4ccf-b009-5c3b86b008f6","year":2018},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.556333Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:8a4154f2ffa02c3c4b8441318fbf0af8689a0eb59a95224d22f36fe71ca86b86","observation_id":"40f7acfc-f96b-4e00-9be3-48dafb62a2b9","resolution":{"observed_at":"2026-08-16T05:06:59.397115Z","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-16T05:06:59.379731Z","title":"A conditional-gradient-based augmented lagrangian framework,","venue":null,"work_id":"65411b37-8f63-4752-a1aa-8bc72c9c6c42","year":2019},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.561648Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:e41bc7f24c5c2dd7bf093938c89129f562723ceed46fb33273e8eb82ec1ada86","observation_id":"c99e8048-acde-48a9-9677-364151af0fc4","resolution":{"observed_at":"2026-08-16T05:06:59.383785Z","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-16T05:06:59.365244Z","title":"Kerdreux,Accelerating conditional gradient methods","venue":null,"work_id":"2faa7351-3610-4192-9954-3b69157a24b8","year":2020},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.565911Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:0e79e02f77f6b6cb7d79162994d83710a4898e0711869b4784e245deaf096f60","observation_id":"9a76c935-a7a0-402f-a846-0977c6cd2160","resolution":{"observed_at":"2026-08-16T05:06:59.370636Z","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-16T05:06:59.348844Z","title":"Generalized power method for sparse principal component analysis,","venue":null,"work_id":"1a1db05f-0993-4db1-b143-d2fa82e6f7f2","year":2010},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.570801Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:b15b12c8c9e8ae603eb2245312c7382dfec7f99b07228a68c2d816e2cc41b372","observation_id":"d320d863-fa2a-4308-b017-f2c104b6f74a","resolution":{"observed_at":"2026-08-16T05:06:59.353339Z","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-16T05:06:59.334011Z","title":"Competitive equilibrium for chores: from dual eisenberg-gale to a fast, greedy, lp-based algorithm,","venue":null,"work_id":"f30f2c78-fe02-46e7-be1f-7e7e89207a84","year":2024},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.574988Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:b5f124db4b136113ab599872dc4db65fe45a371ac0b1efdb0256b52b8d41c670","observation_id":"96988917-2a26-4399-837f-1e5d1e231fff","resolution":{"observed_at":"2026-08-16T05:06:59.338743Z","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-16T05:06:59.319174Z","title":"First order methods beyond convexity and lipschitz gradient continuity with applications to quadratic inverse problems,","venue":null,"work_id":"f7c19b50-5135-4abd-be34-a8c11ce9e283","year":2018},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.578638Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:08e8adb97acf1fe3864513c63b3342125bcc6a972760553c8f55f0dafe164942","observation_id":"cc0fa17b-bba3-4694-b6c9-bd3a56263312","resolution":{"observed_at":"2026-08-16T05:06:59.323709Z","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-16T05:06:59.305852Z","title":"Novel proximal gradient methods for non- negative matrix factorization with sparsity constraints,","venue":null,"work_id":"d5daf645-786f-43de-b485-0256f980cb3d","year":2020},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.582422Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:102c4b0007df1d461cd7c2684c9278987f0ac808456f80ce1978a82530e1b486","observation_id":"cbec3704-f565-4046-9e03-beed92176fa9","resolution":{"observed_at":"2026-08-16T05:06:59.309794Z","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-16T05:06:59.291657Z","title":"Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the kurdyka-łojasiewicz inequality,","venue":null,"work_id":"0170936f-8173-4ba7-aeb4-32a9860389e9","year":2010},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.586625Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:a3f402b26a3bc6db0e2c907930ff273f6215755dc14b85f98346f6905ca52015","observation_id":"ca703cd5-f4c8-4e56-b6fa-fb47b03f3ee3","resolution":{"observed_at":"2026-08-16T05:06:59.297186Z","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-16T05:06:59.277161Z","title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems,","venue":null,"work_id":"32963291-fc68-413a-aeb1-8ea0c0f6bc48","year":2014},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.590742Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:09088735495bb7d7988a3aefe550ef420fcf232dbfe7ebf29d13c32f1d721ba5","observation_id":"067ccd5c-d975-4dac-a052-45508e669a2e","resolution":{"observed_at":"2026-08-16T05:06:59.281511Z","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":{"arxiv_id":"1607.00345","last_updated":"2016-07-01T18:37:33Z","snapshot_observed_at":"2026-08-14T21:50:11.201365Z","submitted_at":"2016-07-01T18:37:33Z","title":"Convergence Rate of Frank-Wolfe for Non-Convex Objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.00345","snapshot_observed_at":"2026-08-16T05:06:58.594759Z","title":"Convergence rate of frank-wolfe for non-convex objec- tives,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.594759Z"},"links":{"cited_paper":"/paper/1607.00345","citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:689b602556d77224c7eda53e06b12054fe23c1b4d18abec33e3a8237d40e079b","observation_id":"0ce6b7a2-1157-4d8e-8286-8d9c688fea03","resolution":{"observed_at":"2026-08-16T05:06:58.594759Z","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-16T05:06:59.262323Z","title":"Sketchy decisions: Convex low-rank matrix optimization with optimal storage,","venue":null,"work_id":"d759ab5c-8e35-4a03-9243-0dbb9a0adf33","year":2017},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.599279Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:fd5a4bc1a16abeaab90571b1e83f6e9c14295dc8eee97e8d6887f61108c56e5d","observation_id":"1d425649-b4d0-4431-9c33-350f51c29fcb","resolution":{"observed_at":"2026-08-16T05:06:59.267199Z","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-16T05:06:58.603640Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.603640Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:0b6baa12f2cd995dbc63e94cf5c06f75e61d1f2a1e68dd4330b0b5c62b7552cb","observation_id":"e1a796ba-49c5-44e5-bf65-b2f7373b27dd","resolution":{"observed_at":"2026-08-16T05:06:58.603640Z","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-16T05:06:59.233587Z","title":"Conic optimization-based algorithms for nonnegative matrix factorization,","venue":null,"work_id":"42f789d8-8f2b-4ee8-b242-7eccf83695fa","year":2023},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.607904Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:ab9dd995a31a10b22e79b0d0d81ddbb8826da43eefc1c7f59bba8a89bc0d170e","observation_id":"a4d53115-67ec-42b3-9e70-ec5ccde1a7de","resolution":{"observed_at":"2026-08-16T05:06:59.238422Z","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-16T05:06:59.218911Z","title":"Low-rank optimization on the cone of positive semidefinite matrices,","venue":null,"work_id":"a24dcf6c-7937-408e-99f0-2318f6ca2703","year":2010},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.611530Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:900bb363d6384d9063589a65b64ac9ba89052a96f2395fa5b0f538423a2c700e","observation_id":"19279490-ab6d-4807-92d6-673e9f00ca1f","resolution":{"observed_at":"2026-08-16T05:06:59.223795Z","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-16T05:06:59.206366Z","title":null,"venue":null,"work_id":"3ab2196e-dc8e-4430-8fb0-f8ef16033308","year":2009},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.615044Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:3d517fc462c68c5d34e0d441d266a8b9082a4c1fb0935a0e307116a52e82e43b","observation_id":"f534f7d6-3e5f-4c86-a22a-137c87212c09","resolution":{"observed_at":"2026-08-16T05:06:59.210870Z","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-16T05:06:59.191638Z","title":"On the convergence of the proximal algorithm for nonsmooth functions involving analytic features,","venue":null,"work_id":"6ff9b051-cd1c-44c2-bfcc-756ff81dafbd","year":2009},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.618585Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:fe24f6f7360cfff86c84f354c39058de7f7e512fd3a6a1f9d95de333ae41a836","observation_id":"dd41efc5-7acc-4088-a11b-fe4e4b2a42f5","resolution":{"observed_at":"2026-08-16T05:06:59.197626Z","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-16T05:06:59.177937Z","title":"A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications,","venue":null,"work_id":"54fe060b-f276-4ed5-aa2b-4dce44429a20","year":2017},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.622423Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:d3d6f535811567e8478a4bac00dd3dcebbb2ffd96a43cfa7bd3af68fc5f3c4e9","observation_id":"063210f4-27f9-4fcb-b682-a6e6542e3dae","resolution":{"observed_at":"2026-08-16T05:06:59.183283Z","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-16T05:06:59.160412Z","title":"The łojasiewicz inequality for nons- mooth subanalytic functions with applications to subgradient dynamical systems,","venue":null,"work_id":"f47a43ca-9b6b-4333-a8d8-96e085af934d","year":2007},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.626997Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:cea69edc0f3128faf234ae9805130594f87d4771c7d14515fc27a177f2396a59","observation_id":"28384d9c-d508-445b-ab73-9446ccdde6e9","resolution":{"observed_at":"2026-08-16T05:06:59.166127Z","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-16T05:06:59.146177Z","title":"Clarke subgradients of stratifiable functions,","venue":null,"work_id":"612c7ded-1625-45a8-ae90-371901c27f5a","year":2007},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.630906Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:0b6db5f4f9e20c0bcfda3cb67f2c5030681c39eca234abbc92226f0c396eb03a","observation_id":"78507d2e-45ad-4592-9af5-886e25f44ee7","resolution":{"observed_at":"2026-08-16T05:06:59.150913Z","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-16T05:06:59.130595Z","title":"Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized gauss–seidel methods,","venue":null,"work_id":"45ffe1c8-2654-4b5e-84d9-c5b8a56b5abe","year":2013},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.634700Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:d6ea6fc210b3addb282310528558d41f8431fd54c1e0a90f9d8e6dc0682fd109","observation_id":"adb68ce1-c351-463b-9b36-f8c1fff1cb5a","resolution":{"observed_at":"2026-08-16T05:06:59.135778Z","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-16T05:06:59.115069Z","title":"Compressed sensing,","venue":null,"work_id":"9d17b847-8927-4834-bcc8-cc50fba9e782","year":2006},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.638785Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:5585b7a74c38359a5a498cf800e5e762ca688bf3617d53d57644b471e842d027","observation_id":"7d0e029d-df85-40bc-9652-cb93ea0d3a1a","resolution":{"observed_at":"2026-08-16T05:06:59.120703Z","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-16T05:06:59.102080Z","title":"From sparse solutions of systems of equations to sparse modeling of signals and images,","venue":null,"work_id":"f8d9ac1a-0866-40a5-854e-3630091b903a","year":2009},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.642337Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:2a7d87c989648cb5ad574ab13e5236c7bb98ea49444483191a841065453a97ec","observation_id":"792f3e1d-7252-43f4-8125-aff1b877844d","resolution":{"observed_at":"2026-08-16T05:06:59.106380Z","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-16T05:06:59.088075Z","title":"ApS,MOSEK Optimizer API for Python 11.0.12, 2025","venue":null,"work_id":"4bf82c54-db3d-4b05-8d2b-69b75bf5ba3e","year":2025},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.646436Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:ff0b78a613dba83aab3cf72f9932abeca739174b7dd06f289a3a2d917c0d8fe6","observation_id":"9c2ab548-fe18-45c2-92f8-92311ddcb6ab","resolution":{"observed_at":"2026-08-16T05:06:59.091900Z","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-16T05:06:58.650640Z","title":"CVXPY: A Python-embedded modeling language for convex optimization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.650640Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:0c3276958c72ddb5096abc6fbbfa92d13e4f0669ba051ef66c6ea1e0a2b841f4","observation_id":"c4c3a755-7933-49d8-9a7d-2f4a3fa70501","resolution":{"observed_at":"2026-08-16T05:06:58.650640Z","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-16T05:06:59.062058Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives,","venue":null,"work_id":"38521be9-d5fb-4832-b617-0bf1c3eb60d8","year":2024},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.654416Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:c8aed8d50d8a21efd0657e458b170357d2b7dd11cdaf1bb601fbe06dd82ba958","observation_id":"a7de9c5e-db20-4efe-a408-03022fcb1d60","resolution":{"observed_at":"2026-08-16T05:06:59.066939Z","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-16T05:06:59.047162Z","title":"Interior point methods in semidefinite programming with applications to combinatorial optimization,","venue":null,"work_id":"873f1afb-263c-4294-a052-06e428f0c377","year":1995},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.658960Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:1201b304c07a6301ff69cd2c0ba066e715c3bcd91cf408a7da3b7e51ab7bb89b","observation_id":"d1d38f34-c4de-4c77-a663-f65c499a8b15","resolution":{"observed_at":"2026-08-16T05:06:59.052828Z","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-16T05:06:59.034561Z","title":"Cones of matrices and set-functions and 0–1 optimization,","venue":null,"work_id":"2e97ee4f-3f1e-4988-ad99-94c4e40deaf6","year":1991},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.663058Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:83ed398ad9d299041f321e8473fa5e23e6b95f5db5a586d8fef78745a967a877","observation_id":"3841e77c-b8a6-4494-80d5-d40c680e3315","resolution":{"observed_at":"2026-08-16T05:06:59.038742Z","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-16T05:06:59.021401Z","title":"Inference in graphical models via semidefinite programming hierarchies,","venue":null,"work_id":"8a6d2fc7-5223-4053-96ac-6358bffd4db0","year":2017},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.667595Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:6d01333c9ead6e019e4761c385a90fe0de066b536c5ff48285a88f8eb8252cc5","observation_id":"5e9e37c9-0a07-4f2e-b237-38b9b1cef7b6","resolution":{"observed_at":"2026-08-16T05:06:59.026433Z","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-16T05:06:59.005804Z","title":"Onthelow-rankapproachfor semidefinite programs arising in synchronization and community detection,","venue":null,"work_id":"f1c873a8-94eb-48ce-b525-3a0833ac2e49","year":2016},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.672122Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:7e4848956df120832310870a9666746d84b06b20005bb154c0c3e2a7ab8e9bbe","observation_id":"f2dc6bf6-7034-426a-85c3-4171c6519ef1","resolution":{"observed_at":"2026-08-16T05:06:59.010368Z","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-16T05:06:58.989272Z","title":"Solving sdps for synchronization and maxcut problems via the grothendieck inequality,","venue":null,"work_id":"63262905-2dc7-4b0f-8e63-ae692ef530d5","year":2017},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.676311Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:9e42f2104c51458921cc81a56f75448eb82ffe2f8eff2e8b1c2e8c04c14a798b","observation_id":"cb875a18-4fdf-414f-9033-91fe4a5d8471","resolution":{"observed_at":"2026-08-16T05:06:58.995328Z","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-16T05:06:58.972709Z","title":"A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,","venue":null,"work_id":"85565b0c-d8db-45dd-af7e-68abc32a751c","year":2003},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.680275Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:352aa0af4753607cf5ae281333581c8c24546045f1426b752bb38a6ce307c568","observation_id":"0bd703cc-272a-4698-9828-f1c470aef2e4","resolution":{"observed_at":"2026-08-16T05:06:58.977609Z","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-16T05:06:58.957254Z","title":"Phase transitions in semidefinite relaxations,","venue":null,"work_id":"4d6911ef-7cfd-4b1d-9455-ffdc1cc997c7","year":2016},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.684497Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:209959e892494b2e4b4c0830cc5ae38e02199ff78c16b2e2c998b8c20dbdf068","observation_id":"5c682e09-bad4-4ac9-ac90-a57edb7be575","resolution":{"observed_at":"2026-08-16T05:06:58.962222Z","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":{"arxiv_id":"1706.00476","last_updated":"2026-05-10T19:56:23Z","snapshot_observed_at":"2026-08-14T20:56:35.449274Z","submitted_at":"2017-06-01T19:58:38Z","title":"The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.00476","snapshot_observed_at":"2026-08-16T05:06:58.688403Z","title":"The mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.688403Z"},"links":{"cited_paper":"/paper/1706.00476","citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:8ecc0a885fe7e650099104fbd94b84c15608115e3ae654863a6b563cd49d20a8","observation_id":"ae503df0-58df-4cea-ba82-4fbabeaf4da7","resolution":{"observed_at":"2026-08-16T05:06:58.688403Z","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-16T05:06:58.939371Z","title":"Convergence rate of block-coordinate maximization burer–monteiro method for solving large sdps,","venue":null,"work_id":"b647924c-b05e-4839-80c6-1190bc0a58dc","year":2022},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.692839Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:4467dc9bfaed20a2735bda0bc07c5542e6face0904e4eef5a6f245de641c88d3","observation_id":"c539c3d8-a196-4a3f-957f-745e3e4a1f07","resolution":{"observed_at":"2026-08-16T05:06:58.944662Z","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-16T05:06:58.926164Z","title":"Trust-region methods on riemannian manifolds,","venue":null,"work_id":"e2198b4b-0c23-4a8a-b515-b8574cde160c","year":2007},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.697053Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:5f0b953db457899ede4a8b3d80496c964c702ef99d75f9f3993f64117112089d","observation_id":"cad7a77a-d625-4dfd-a624-04e39493a94e","resolution":{"observed_at":"2026-08-16T05:06:58.930486Z","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-16T05:06:58.911596Z","title":"Thenon-convexburer-monteiro approach works on smooth semidefinite programs,","venue":null,"work_id":"82344002-0392-452f-b4f8-703d6d0cd049","year":2016},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.701307Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:07860243c575647d4eb935fe7fe8db883caeff6a103ec253d70dfdc88415ed6a","observation_id":"677d10d9-841e-40c5-b117-41b25a0d39ba","resolution":{"observed_at":"2026-08-16T05:06:58.916193Z","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-16T05:06:58.705486Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.705486Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:e43282d08171d0943a4a9520dd02c574d41057e7e7e796113ec4668ac761d38b","observation_id":"a77853b8-2754-4012-acb0-01fc8225a2d2","resolution":{"observed_at":"2026-08-16T05:06:58.705486Z","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-16T05:06:58.889215Z","title":"Local minima and convergence in low-rank semidefinite programming,","venue":null,"work_id":"cf848b84-8a36-4ef5-9f74-2f1f46c88c10","year":2005},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.709160Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:84adf75a891d15f1fd0ab7614c22893ade133d30673b05e21ffaa1e6089732cc","observation_id":"44c211fc-d9ea-431f-b42b-f41acb4c359c","resolution":{"observed_at":"2026-08-16T05:06:58.893522Z","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-16T05:06:58.876165Z","title":"Manopt, a matlab toolbox for optimization on manifolds,","venue":null,"work_id":"4491a144-2c01-47c8-a533-63ccb0737adb","year":2014},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.712795Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:08693688595db0de74de7297913fb5f081d9b8426d1f16fda280ab2df939fa30","observation_id":"c7221d4e-b775-4419-a99a-7e58e2bd1367","resolution":{"observed_at":"2026-08-16T05:06:58.880364Z","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-16T05:06:58.854097Z","title":"Cupy: A numpy- compatible library for nvidia gpu calculations,","venue":null,"work_id":"eb4ecf6f-7f57-4013-b87e-3bf56d65bbe4","year":2017},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.716173Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:5c6c03d8e721f6a9db026a9e1cc5ae04b9ccda7dd7583fb1683430657a73fef6","observation_id":"463471a3-10d9-4764-b6f0-208988f7e2cf","resolution":{"observed_at":"2026-08-16T05:06:58.861625Z","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-16T05:06:58.719843Z","title":"JAX: composable transformations of Python+NumPy programs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.719843Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:25cc8523dba4f68ef349b3dfe9db99fd0f84924a925627ae33fdb1c4d2efc54f","observation_id":"05ff07ff-9bbf-4e40-8e2b-00bcd5918c6e","resolution":{"observed_at":"2026-08-16T05:06:58.719843Z","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-16T05:06:58.818639Z","title":"Pymanopt: A python toolbox for optimization on manifolds using automatic differentiation,","venue":null,"work_id":"37cff162-08ef-496f-8a12-5d194aa9bbb1","year":2016},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.724008Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:3ce2c456dd1b3eedbe8545b4063a70e0cce5bbcfbe935ad55966f3937728f9bf","observation_id":"8f86d798-e87e-4ac5-9872-667607441939","resolution":{"observed_at":"2026-08-16T05:06:58.823562Z","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-16T05:06:58.803858Z","title":"First and second-order necessary and sufficient optimalityconditionsforinfinite-dimensionalprogrammingproblems,","venue":null,"work_id":"fa01ff1e-48ad-4862-b902-03c4016c615f","year":1979},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.728090Z"},"links":{"citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:d2794e517cdc0f09c319eb791a4c8d1e21f72906fc940b5a748b1e043f7ac800","observation_id":"4ccb5f96-0ba3-4ff4-b495-3031925abadd","resolution":{"observed_at":"2026-08-16T05:06:58.810038Z","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":"2505.00221","last_updated":"2025-04-30T23:54:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality"},"reference_resolution":{"displayed":67,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":59},"total_outbound_references":67},"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 67 of 67 outbound references and 0 inbound Pith citation observations for arXiv:2505.00221."}