{"as_of":"2026-08-08T03:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d4eefce3b1129dee567ab971db0a7be347a8905e65fafeb7edd485288872b8d","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:32:37.568540Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:53:50.751787Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T19:08:49.980694Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"cited_work":{"arxiv_id":"2509.02804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.02804","snapshot_observed_at":"2026-07-03T19:08:49.980694Z","title":"Liao and Y","venue":null,"work_id":"65fb6749-4470-4cf6-86d5-3d68826c7a46","year":2025},"citing_paper":{"arxiv_id":"2606.17285","last_updated":"2026-07-03T01:47:33Z","snapshot_observed_at":"2026-08-08T02:08:51.834765Z","submitted_at":"2026-06-15T20:49:56Z","title":"An Adaptive Proximal Framework for Weakly Convex Optimization with Unknown Parameter: Deterministic and Heavy-Tailed Stochastic Guarantees","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T02:08:31.435637Z"},"links":{"cited_paper":"/paper/2509.02804","citing_paper":"/paper/2606.17285"},"observation_digest":"sha256:5947ac075e34373cedfdb9743a6981b954f5a9ac3dd6a7203a4dae199313bf40","observation_id":"da6b8536-823d-4795-a4c0-161c7517bbe2","resolution":{"observed_at":"2026-07-03T19:08:49.982255Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02804","snapshot_observed_at":"2026-07-12T13:40:44.969666Z","title":"Liao and Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.17285","last_updated":"2026-07-03T01:47:33Z","snapshot_observed_at":"2026-08-08T02:08:51.834765Z","submitted_at":"2026-06-15T20:49:56Z","title":"An Adaptive Proximal Framework for Weakly Convex Optimization with Unknown Parameter: Deterministic and Heavy-Tailed Stochastic Guarantees","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-12T13:40:44.969666Z"},"links":{"cited_paper":"/paper/2509.02804","citing_paper":"/paper/2606.17285"},"observation_digest":"sha256:d48bc4a4009998cfdc2ce755d9925a334a612311181a184b872e356132b7dd57","observation_id":"dfa54807-8b1b-4f44-8539-3983af38b65c","resolution":{"observed_at":"2026-07-12T13:40:44.969666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02804","snapshot_observed_at":"2026-08-05T22:53:50.751787Z","title":"arXiv preprint arXiv:2509.02804 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-07T23:10:47.804167Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.751787Z"},"links":{"cited_paper":"/paper/2509.02804","citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:5ad7fea0bd00b51c4cb3343b5b6a9ff1ae3d43cfc37510321fc29413c34e12c8","observation_id":"d3c44e7d-b0b7-4a88-ae97-5fe711cff741","resolution":{"observed_at":"2026-08-05T22:53:50.751787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.02804/citation-record","integrity":"/paper/2509.02804/integrity","json":"/paper/2509.02804/citation-record.json","paper":"/paper/2509.02804"},"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-05T11:32:38.035130Z","title":"The quasigradient meth od for the solving of the nonlinear programming problems","venue":null,"work_id":"8dc90bd2-a221-480f-84f2-a24741c0e682","year":1973},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.460182Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:cf720dc10b721e823f4f55b414190f7f9610e939c97956d292697552e8980444","observation_id":"fab78def-9d72-4a71-b4b5-efb53daac390","resolution":{"observed_at":"2026-08-05T11:32:38.038285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:38.025105Z","title":"Stochastic model -based minimization of weakly con- vex functions","venue":null,"work_id":"d1076217-4479-4f0d-9a2b-37e580549489","year":2019},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.463807Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:6608c7d89e5b00d6e1c078d9dbf75c2f7abd834ab59b06b6f12a30563b80b01f","observation_id":"3436b25c-f96c-404e-83af-8951ecf785cc","resolution":{"observed_at":"2026-08-05T11:32:38.028783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:38.016498Z","title":"Prox-regular functions in variational analysis","venue":null,"work_id":"327c7451-6084-4ed7-88b1-563a27d26375","year":1996},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.466871Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:94ad888b28727180e7da4eaea37c668707a4b03b6a7719234e52fc45cbcf636d","observation_id":"66d916d1-60a5-449f-85e2-b2416ed75fc4","resolution":{"observed_at":"2026-08-05T11:32:38.019540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:38.008093Z","title":"Convex analysis , volume 11","venue":null,"work_id":"e15745f3-c55a-40aa-af91-8a4c35b3fc75","year":1997},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.469916Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:3742b69302458abb793cd21d7950df84850e1ad861cfaf0392490d267fa5ad33","observation_id":"755b79c8-0913-4cbc-bd8b-724c2a3a5599","resolution":{"observed_at":"2026-08-05T11:32:38.011078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.06038","last_updated":"2017-12-17T00:54:54Z","snapshot_observed_at":"2026-07-06T06:14:42.724196Z","submitted_at":"2017-12-17T00:54:54Z","title":"The proximal point method revisited","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.06038","snapshot_observed_at":"2026-08-05T11:32:37.472811Z","title":"The proximal point method revisited","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.472811Z"},"links":{"cited_paper":"/paper/1712.06038","citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:d31b27fb2a8f43b2874adc59f82793b839859c07dcd05c64eb77c1c6bf482afd","observation_id":"b52b44a6-1e8b-421b-ac45-f0ced504a922","resolution":{"observed_at":"2026-08-05T11:32:37.472811Z","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-05T11:32:37.999370Z","title":"Convergence of some algorithms for convex minimiza- tion","venue":null,"work_id":"2d68d62b-18dd-4a58-8c8e-d53baa9fe9d1","year":1993},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.476047Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:2ffdd4f5f0e67c2f7182c0f7855c0113d59f26ab3ab4a2d9f961e1d4aecf6f2a","observation_id":"151896e7-1066-4f79-aa24-d73d87c86a8f","resolution":{"observed_at":"2026-08-05T11:32:38.002523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.990161Z","title":"A condensed introduc tion to bundle methods in non- smooth optimization","venue":null,"work_id":"1c2721c4-3b5a-431f-a321-0bf08348a822","year":1994},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.479236Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:7b05e7c538e68e602069938051bc623a1b5e272ffd48baaf27e1294d35954220","observation_id":"5b9cb32a-e570-43bf-82a7-c17e2370c784","resolution":{"observed_at":"2026-08-05T11:32:37.993296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.981373Z","title":"Computing proximal points of nonconvex functions","venue":null,"work_id":"936db6c4-aed0-4073-9ffb-c4b91d56fe52","year":2009},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.481907Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:31697408684028152771d4e2d37e23142901efdb6d20cbfa55e425b84b169190","observation_id":"536bbcdf-a63c-4889-bb15-a73fe6a0feab","resolution":{"observed_at":"2026-08-05T11:32:37.984424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.972806Z","title":"A redistributedproximal bundle method for nonconvex optimization","venue":null,"work_id":"c7d167c8-02ec-483d-a6fa-6e3d43d0373f","year":2010},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.484581Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:09bc50d89b3e4a1f46939be62777878d9aeba8c1f097e40d27aa0f8954a2063e","observation_id":"e1ea0d41-c1df-4930-94f3-7f8b0c154b53","resolution":{"observed_at":"2026-08-05T11:32:37.975895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.964175Z","title":"Lectures on convex optimization , volume 137","venue":null,"work_id":"0b658893-4dba-4fe1-90b2-e527fca05d1a","year":2018},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.487256Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:e1520d7dc1d37f7d188d08369e9f938eaed27758d9105d150757cf70af63572d","observation_id":"0387e992-714e-4489-9035-3ab6810640ad","resolution":{"observed_at":"2026-08-05T11:32:37.967354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.955272Z","title":"Monotone operators and the prox imal point algorithm","venue":null,"work_id":"047cb7e3-566d-4a37-a49f-0e9101c3a723","year":1976},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.489972Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:16489c1fa5e5b9303c97cd4a99a48c168081ed74a3808822c9d0ee444ea2476a","observation_id":"659fb29d-2f46-4055-b3be-cbe574af6585","resolution":{"observed_at":"2026-08-05T11:32:37.958388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.946448Z","title":"The multiplier method of hestene s and powell applied to convex pro- gramming","venue":null,"work_id":"f26053bc-87e4-4852-9593-9dc71dac84e4","year":1973},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.493135Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:afa49434c1a7be5518e488de4fb41b641d5b1421d9f81bc1109e7ca3d40398cc","observation_id":"259e4f3c-1b08-4ae6-8adb-2dda003c8f98","resolution":{"observed_at":"2026-08-05T11:32:37.949710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.937464Z","title":"Rate of convergence of t he bundle method","venue":null,"work_id":"37110603-4972-4bb8-9bc4-1a5ed8d59ced","year":2017},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.495679Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:6ffbb265a38b895fa820a7703e1fbbb6c485b749cfc445ede4b7437a2fd3dec1","observation_id":"1b0a1047-84b0-4a59-8917-d61c9e45ddfc","resolution":{"observed_at":"2026-08-05T11:32:37.940775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.928535Z","title":"Efficiency of proximal bundle method s","venue":null,"work_id":"0d40fb3b-8cca-4ed5-905b-bf26c07f354f","year":2000},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.498172Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:92c589732003786ab33d51a4049bd5ddaab789af73992ab520dce19b07ddbb43","observation_id":"4e4c2a5c-2cd4-42af-afab-ee2ba4e2b9af","resolution":{"observed_at":"2026-08-05T11:32:37.931828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.919001Z","title":"Optimal convergence rates for the proximal bundle method","venue":null,"work_id":"f188c352-196c-47da-b833-5183c7266660","year":2023},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.500525Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:e7aaa7204db3e6369f0d75d740c54223d5464398b08ceee0d039e0092b9cc311","observation_id":"9ecaa60b-4de8-4f80-98be-f1616a979240","resolution":{"observed_at":"2026-08-05T11:32:37.922459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.502790Z","title":"An overview an d comparison of spectral bundle methods for primal and dual semidefinite programs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.502790Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:d9b922ac419b6f8d7a75781291c817adfdef001cde1a68d179aa4ec4a13731c2","observation_id":"ed3b16b9-7d53-43b0-88d1-723c64623909","resolution":{"observed_at":"2026-08-05T11:32:37.502790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08835","last_updated":"2025-02-12T22:52:15Z","snapshot_observed_at":"2026-08-07T23:29:53.329504Z","submitted_at":"2025-02-12T22:52:15Z","title":"A Bundle-based Augmented Lagrangian Framework: Algorithm, Convergence, and Primal-dual Principles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08835","snapshot_observed_at":"2026-08-05T11:32:37.505199Z","title":"A bundle-based augmented Lagrangian framework: Algorithm, convergence, and primal-dual principles","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.505199Z"},"links":{"cited_paper":"/paper/2502.08835","citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:547515dde6c4a8a58af676184a4dd557d4bb0c86f5d210beaea6d5fd77209191","observation_id":"733b706b-f68c-4656-b2c4-15864ed35dc8","resolution":{"observed_at":"2026-08-05T11:32:37.505199Z","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-05T11:32:37.908888Z","title":"Minimizing nonconvex non- smooth functions via cutting planes and proximity control","venue":null,"work_id":"f2000eb9-b229-487d-91aa-b2a07c0b99e9","year":2004},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.508245Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:d23149d299178dd3afbd5763c1fe55db377a5dc534be5d5273da4c79928d360f","observation_id":"109308b4-499a-4f92-a27f-6b6e51f80ad0","resolution":{"observed_at":"2026-08-05T11:32:37.912506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.898587Z","title":"Proximally guided st ochastic subgradient method for nonsmooth, nonconvex problems","venue":null,"work_id":"038e7a9d-2202-42f0-8f84-061b3f7ce11f","year":1908},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.510752Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:bb06c1e17301e463acf4e728dca814aa72de938d4f7f00981f8e86fb4be30a6e","observation_id":"cf5ea66e-64b8-4c28-b780-4413fbd571ff","resolution":{"observed_at":"2026-08-05T11:32:37.902331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.14896","last_updated":"2026-05-17T06:37:18Z","snapshot_observed_at":"2026-07-06T15:08:15.836938Z","submitted_at":"2023-03-27T03:11:27Z","title":"Proximal bundle methods for hybrid weakly convex composite optimization problems","version":3},"cited_work":{"arxiv_id":"2303.14896","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.14896","snapshot_observed_at":"2026-08-05T11:32:37.634480Z","title":"Proximal bundle methods for hybrid weakly convex composite optimization problems","venue":"math.OC","work_id":"94dbd908-e993-4e2e-a6ba-b648a228f4ee","year":2023},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.513342Z"},"links":{"cited_paper":"/paper/2303.14896","citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:6684a9ebf1eb9efe1a70d74b3d4bb678d4483e5db28f2eac0d29ee196b8d1f78","observation_id":"c5d2b014-623c-4dc4-abc7-45d7376e9fa0","resolution":{"observed_at":"2026-08-05T11:32:37.637705Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.888540Z","title":"A pr oximity control algorithm to minimize 32 nonsmooth and nonconvex semi-infinite maximum eigenvalue f unctions","venue":null,"work_id":"d8f8dd72-21a0-4cc1-bd10-328202b658d4","year":2009},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.515978Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:cd13769025a810ce8c1e6fb61ff11a594adc4425886ed572cdd5cdb547944a69","observation_id":"37cee38a-968b-4bc6-8bd7-d1aee7abaa78","resolution":{"observed_at":"2026-08-05T11:32:37.892347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.878301Z","title":"A proximal bundle variant with optimal iteration- complexity for a large range of prox stepsizes.SIAM Journal on Optimization , 31(4):2955–2986, 2021","venue":null,"work_id":"8078cfb8-c0c2-4267-b688-d1ecf44dbbbb","year":2021},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.518500Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:ce12a1c1ae83c8971beacc3f459a0137b2177168d6466df0c9914e55ee009c89","observation_id":"4e142e17-071b-4485-bea9-682af6e718c2","resolution":{"observed_at":"2026-08-05T11:32:37.881946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.868601Z","title":"On fr´ echet subdifferentials.Journal of Mathematical Sciences , 116(3):3325–3358, 2003","venue":null,"work_id":"2b383617-0545-48dd-9c51-60c85b79e6d5","year":2003},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.520964Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:99af55dca46963d196e5fe847097b61bd7cb1f6e9e2e299e09f3b7777bafc326","observation_id":"4238e213-ff29-49c2-b1d2-2b4cda116e73","resolution":{"observed_at":"2026-08-05T11:32:37.871907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.523522Z","title":"Variational analysis, volume 317","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.523522Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:de4d1c0e117c0712a1ad3d464aa6e9a6545af1f59517864e1515012c01dd30ab","observation_id":"7a6fdbee-58a7-4167-8318-294078d6aeae","resolution":{"observed_at":"2026-08-05T11:32:37.523522Z","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-05T11:32:37.854231Z","title":"Asymptotic convergence analys is of the proximal point algorithm","venue":null,"work_id":"b2a17dcc-1388-4f93-b71b-d40590285460","year":1984},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.525931Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:1e0200d3190a091b406e5fdac2d0bdc41b0c9ab3ba105134f9d5b9d1e040b2c4","observation_id":"cfeeb6f5-f116-4c88-a26b-09cf8f51d351","resolution":{"observed_at":"2026-08-05T11:32:37.857346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.845549Z","title":"Augmented Lagrangians and appl ications of the proximal point algo- rithm in convex programming","venue":null,"work_id":"c80c2012-c38f-4773-8136-db8fee0e1461","year":1976},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.528384Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:4d421f49c9be584759f0775a47bd3fafdb68f45640038c260dcf8933f5b50661","observation_id":"0e95dbd0-b062-4e52-8ef7-96046478d55b","resolution":{"observed_at":"2026-08-05T11:32:37.848694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.835832Z","title":"On a bundle algorithm for nonsmooth optimization","venue":null,"work_id":"c0c2e6a3-bbfb-4311-b9de-85a740d0915b","year":1981},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.530829Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:3e6d2b37639411726a53c16268ede9f04b8602bb82f6de2461cd17f4c88f03e3","observation_id":"bbc773c3-ab3a-49af-bef6-da4408c990fb","resolution":{"observed_at":"2026-08-05T11:32:37.839081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.826600Z","title":"Proximity control in bundle method s for convex nondifferentiable mini- mization","venue":null,"work_id":"5648e8dd-f7f6-46a4-9eb9-00f3410c3b7f","year":1990},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.533414Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:bfde247ff66982b27c0e758c0eef8d466481883c39de564c59ae9e55ca230557","observation_id":"df4d9f1a-efb1-41bd-8b33-b2b8787205d7","resolution":{"observed_at":"2026-08-05T11:32:37.830024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.815342Z","title":"Complexity of finding stationary points of nonconvex nonsmooth functio ns","venue":null,"work_id":"42104589-6114-424c-8a3b-a21d1fd78009","year":2020},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.535843Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:352e882ff3c46d6fa25e6ee49878f4a4916e97e66432ff95b396fe79986e87bf","observation_id":"64a38a14-cfcd-4e4c-8bd0-094c5820b706","resolution":{"observed_at":"2026-08-05T11:32:37.819571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.806023Z","title":"A gradient sampling method with complexity guarantees for li pschitz functions in high and low dimensions","venue":null,"work_id":"548a4540-8c4e-4f2b-8656-eaf2ba8dacb0","year":2022},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.538191Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:a21c24084c766d091dfe7f9264d65536de5e16b9ed2752b8d378d48b2db4921e","observation_id":"d01f45f0-ba01-4770-8051-05efcda1a79b","resolution":{"observed_at":"2026-08-05T11:32:37.809592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.797767Z","title":"Gradient sampling methods for nonsmooth optimization","venue":null,"work_id":"90e3bd1a-0f55-4b92-a040-7cddcdedd04d","year":2020},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.540507Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:b0ebf33a363f183f2af170af204823064322f065d87c3f2489c975a58828eb42","observation_id":"b3c4ed12-3943-4671-bc3d-c0c13797a988","resolution":{"observed_at":"2026-08-05T11:32:37.800740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.789673Z","title":"Minimization of unsmooth functionals","venue":null,"work_id":"6ea16c6e-cb6e-4854-9392-379777163835","year":1969},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.543080Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:73005afaeb7c5cb7bcebc1d3856c9b5795fdefddb09a24c7feddf08e951c9008","observation_id":"2b6dcf52-7885-42c3-b64b-ce1b6e474c10","resolution":{"observed_at":"2026-08-05T11:32:37.792507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.780800Z","title":"Error bounds, pl condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods","venue":null,"work_id":"e33a4e10-2e65-40c9-8cb6-1526cadd3287","year":2024},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.545517Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:50ccd5bba95285ebbb8c575ca2bee14c6a0a3f8e354c96d3ea490aac06c32f06","observation_id":"78f1b917-f983-4279-a28f-901eba81fd6f","resolution":{"observed_at":"2026-08-05T11:32:37.784076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.772559Z","title":"Nonsmooth optimization and robust cont rol","venue":null,"work_id":"a2935083-eb68-42cd-8908-347df57987e3","year":2007},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.547822Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:8057a28678dcb46f438dda5ff57915ef07a400eb74a9e37c05ab6ed2776d1133","observation_id":"e3798a6e-5257-427e-bd9a-400f2525700f","resolution":{"observed_at":"2026-08-05T11:32:37.775274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04243","last_updated":"2024-06-06T16:41:10Z","snapshot_observed_at":"2026-07-06T18:26:37.581248Z","submitted_at":"2024-06-06T16:41:10Z","title":"Policy Optimization in Control: Geometry and Algorithmic Implications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04243","snapshot_observed_at":"2026-08-05T11:32:37.550404Z","title":"Policy optimiza- tion in control: Geometry and algorithmic implications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.550404Z"},"links":{"cited_paper":"/paper/2406.04243","citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:754ba3824caf028707d130bcafa01faef6c7ea537f58382b716a5b7718ba1baa","observation_id":"9fe542c5-0ced-4500-9198-220ddb612192","resolution":{"observed_at":"2026-08-05T11:32:37.550404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04001","last_updated":"2024-06-06T12:20:54Z","snapshot_observed_at":"2026-07-06T18:26:28.988101Z","submitted_at":"2024-06-06T12:20:54Z","title":"Benign Nonconvex Landscapes in Optimal and Robust Control, Part II: Extended Convex Lifting","version":1},"cited_work":{"arxiv_id":"2406.04001","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.04001","snapshot_observed_at":"2026-08-05T11:32:37.612807Z","title":"Benign Nonconvex Landscapes in Optimal and Robust Control, Part II: Extended Convex Lifting","venue":"math.OC","work_id":"fef9e892-06c7-49ef-b756-62ceb179155d","year":2024},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.553197Z"},"links":{"cited_paper":"/paper/2406.04001","citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:6701e4f3abc0fdb8ef87afd0353146613032f5aa82b6c704abd5aea7472157bf","observation_id":"fa2cef5b-69c1-49ae-bf39-f7d336f64111","resolution":{"observed_at":"2026-08-05T11:32:37.617802Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15332","last_updated":"2023-12-23T19:39:14Z","snapshot_observed_at":"2026-07-06T17:07:36.328068Z","submitted_at":"2023-12-23T19:39:14Z","title":"Benign Nonconvex Landscapes in Optimal and Robust Control, Part I: Global Optimality","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.15332","snapshot_observed_at":"2026-08-05T11:32:37.555746Z","title":"Benign noncon vex landscapes in optimal and robust control, part i: Global optimality","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.555746Z"},"links":{"cited_paper":"/paper/2312.15332","citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:266cefc8fc006b4f454e8aabaa67234c5c5208e321b3c90acac50e9f0d4f8578","observation_id":"cf42d9c2-ff96-4af1-9231-f4fdb8d4468a","resolution":{"observed_at":"2026-08-05T11:32:37.555746Z","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-05T11:32:37.763905Z","title":"Extended conv ex lifting for policy optimization of optimal and robust control","venue":null,"work_id":"2da31c43-15bd-4a25-83d8-beb82bbf96f5","year":2025},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.558393Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:a2ce45423ea09f51fa940665c449e95df3e3bec10b1be7c50e6902f6db8b880e","observation_id":"4f208d4c-cbd5-41b0-8b67-495ace5ac877","resolution":{"observed_at":"2026-08-05T11:32:37.766674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-08-07T15:48:01.784842Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.07143","snapshot_observed_at":"2026-08-05T11:32:37.560747Z","title":"Subgradient regularization: A descent-oriented subgradient method for nonsmooth optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.560747Z"},"links":{"cited_paper":"/paper/2505.07143","citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:ca11a0cd3e8cee9c7857ac101a939963fd8f99c7f114515ad317f8988a75c08f","observation_id":"636e0625-f8a1-468e-8415-89bfce61f1df","resolution":{"observed_at":"2026-08-05T11:32:37.560747Z","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-05T11:32:37.755881Z","title":"Gradients of convex f unctions","venue":null,"work_id":"72ba5405-a856-4e2f-9306-1c9ad53b539c","year":1969},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.563711Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:b5ab402deb2ca1cdc8b68466e8084d365175d9889f84696d4977c5c422038ee7","observation_id":"b23acc3d-30d8-48d3-89fe-f64709db8791","resolution":{"observed_at":"2026-08-05T11:32:37.758571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.747501Z","title":"Nonlinear optimization","venue":null,"work_id":"6b702689-b1df-496f-9b0a-0881bd4019b1","year":2011},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.566091Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:c26e34fb01c918af722849676cc80f85d641b8fe5206485572b5a9f3ca8f5b1f","observation_id":"865bb1b7-67fe-446a-9970-9f897828427a","resolution":{"observed_at":"2026-08-05T11:32:37.750365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T11:32:37.739279Z","title":"Efficiency of minimizing compositions of convex functions and smooth maps","venue":null,"work_id":"38151388-9ae0-40ee-a4da-53ee3984633b","year":2019},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.568540Z"},"links":{"citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:1653bf42e0a1ad85e4b322e54a9e58aa91e2da7e808e0bc2832d6107a31dfdf3","observation_id":"67ae97cf-94c6-4d6d-8e67-88372f223215","resolution":{"observed_at":"2026-08-05T11:32:37.742113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T11:32:33.363187Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":33},"total_outbound_references":42},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 3 inbound Pith citation observations for arXiv:2509.02804."}