{"as_of":"2026-08-10T13:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:50b91f79047e958601e9acc24aef05fea7f27322676f0bebcb94f755db1b17bf","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-10T06:31:04.303077+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-09T15:28:02.625762Z","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:6e8aa269490de3d5a24fe5f0aaf8dc166ab5200c3d36ce8b9a853bbbc9f10c0f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-09T15:28:02.625762Z","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:94da85caae715a46a58bd71dbace7468fa1e4ef26d531d991d23c0ee9b77823b","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-09T15:28:02.625762Z","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-09T15:28:17.827672Z","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:62f64aaab95eebc8537ed51970d98895d65c6d5bcea6e0d2f1bf1a1e029e2046","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-09T15:28:02.625762Z","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:cff40bb23450b0e957dccc8e97eb317ce3f26606fdde96b383688dc85235ed9f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:60b5923e4c09cb91870985ccd2dcf030b95d0c708add6ea77bf7ecf0f610a221","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:4213854ed58452b49ea1da73d3a33182cf6e3baf07fbdb3c32f0ec51b74b683e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:deff4c06b17a5d58e12115c803b97ada0dcb9f621d9997b7a14d5183423f57e7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-09T15:28:02.625762Z","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:c9bdcb52be4184b3324894f24b825febbf27d0975e4d2c9355120edf7f27d5b9","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-09T15:28:02.625762Z","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:4013e4f1eed7c25d1cec965baef6e3d6ae09457ff2b4a29b8cd9b178533d6a41","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:486975a2f10bfe1b00e69a35fec390d6e3c950456d9719b54d4a251ab178ef12","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:52bd7b0065bb5baba572d0717b4da5812f3cdbfa9b9a1b7f49bb22c5a438cc61","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:a7ad2b13bb51624b213144cefcd00f6fb3d70c55294b841ab313360b43c0e995","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:cbc36e6f4bbba7f8828b5b41c565c450e94667bef5ccc6940d2dda2a6368cf49","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:9787f145576cf3342a77b24ff1fcdacf6e7babb6e04662a28aaa3815b1a39522","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:5c1c31afb1e703b9d1a96e5343c36fb7df778373d8aee12087ee754ddc44365d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:11f3aee681ba4dcfc069685f675a935226da5dea5476ea85b1ffd73f7b783cea","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:4a597fde61ad6ae9e6268379fb37e20b2c1b675f64bd259b8e37adeb04258d59","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:0683c553b8d4702e46d1e0f9b9cadc648f7dbb5b75a247d1f6698c63ec13cbba","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:220b3d20c155cb913ed41024f3749642fca2343e3aab662cc0af0b9cedf5d066","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-09T15:28:09.504732Z","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-09T15:28:02.625762Z","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:c013622a69176aa20840800a308dc450d2e95f027e66811af4e66af1221b5df8","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-09T15:28:02.625762Z","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:46d050442bc6b837b7506471060aefb2b3bcae3864ad6105a2a7488fcd9eb86b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:2384b3910f04c450967d46aabd08691883d7d422f449d2f55211309ec6fd0c98","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-09T15:28:02.625762Z","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:b571337469f67c36106a75b0fe7d0f703d2668e1438b643baf071f6539f02d58","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:f65767ef0058ab37f0b59649c90975b842ed8297b1b15909cdfbd1e6b7a09e88","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:8024eafc7292ac56a398a76f831c01d18f24ed35d17028dbc475c7644dbc0be1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:52fb551ed9f746a7cfe2d47e49c851f379e9b697041b790fa4cf80ad666fd7a6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:45cea6fb7fda9ed18a79d62f6454f178e796438e6acb85a42bd6a04af631e0c6","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-09T15:28:02.625762Z","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:7c3c7abf65d4bdd296272cf6e03c9a479edc4427e0225a84cbf60f3f0f80cedc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:3f44ae8ca356acae58e8f8b01b0e81c4b67d502b1a50501a1b03477f3ebb6a98","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:98c8c472c31fc13512a7ad537faa91da46fec64da78a131bf8580173d2663274","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:a59ed853557363dc2a8fde2cffe4d80cd9f428cf6ad1558f5f796bc10c3f0e29","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:a092537062cfdeca9c6e33768886e0e310dc36fbdd21245fd6292e32656d0b6e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:022ed914b973cbe63fb6a7857b99701309023e16d18e28dcd095052036351caf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:d0667cc352cad47c2221eb203c4d1b554303089b2e058f0189be6dcb421e48cb","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:59eb129caf8f004dbc8f8f3352be2f8bf2d5b6e9f93af850108f14ce16c781a1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:9cb3f1b987c48913d2922febe10da4e40d4cd46adfa8277d074e5cfe79cc962b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:14286d82e0caa2a7c61490f71e500737a417ff7e2c5fb3d818d2067a33f019cf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04243","last_updated":"2024-06-06T16:41:10Z","snapshot_observed_at":"2026-08-09T14:32:42.299092Z","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-09T15:28:02.625762Z","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:2a0bea7289fbbd99ce8c947b707b17cbe6f65830c865a9927dfde9f4f2f22c2e","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-09T15:28:02.625762Z","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:bfe67a70f51da1804e6bb57d79fba87f0a4f3dd698d62ceee98872919b622580","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-09T15:28:02.625762Z","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:532fe15724d958c0d3fc5ae01d6b5059997afedb5504847bb42daf6250c9a583","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-09T15:28:02.625762Z","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:c671db843b930768463b1d1eecc29d27b7d8273b244299de3aff43fa7500c0bb","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-08-10T12:20:08.175912Z","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-09T15:28:02.625762Z","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:0c8b9c888f9253b44a8498e64a4a1d5fee5e41e379ca8b21d7885d852667c2f4","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-09T15:28:02.625762Z","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:5346563c95ae2a5b298d94282aab29c6107a95483ce01654c40d17143b9ee798","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:107124c303c9a07bea458a662edb40d73b1f0f12e05f14b7dc92707c9f31fc36","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-09T15:28:02.625762Z","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:b0579a5bf39da61f45e9e8ecf4b60d4482166557519aa60861dbfb0003a44b43","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T15:28:02.625762Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 3 inbound Pith citation observations for arXiv:2509.02804."}