{"as_of":"2026-08-08T07:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea32797a60ea43414d744e5a304fba6994b3c9232bb127aae9509e1cfb171437","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:50:16.687230Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.01681/citation-record","integrity":"/paper/2506.01681/integrity","json":"/paper/2506.01681/citation-record.json","paper":"/paper/2506.01681"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-73365-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:50:16.824540Z","title":null,"venue":null,"work_id":"a76784f0-a3ba-42ee-838b-cec601704fb3","year":2024},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:15.631950Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:42edf18738d7360f558373757856a9545115c59966b06555e023920d68d8b463","observation_id":"25c0b674-7508-4264-b03c-304f6a1e833c","resolution":{"observed_at":"2026-08-07T11:50:16.896446Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:19.610513Z","title":null,"venue":null,"work_id":"45aa3aba-9e3f-4292-8b8e-900a149e7855","year":1983},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:15.741635Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:32c4819beccd31ba06e453adae52c1a4561696037db9c6822a8798426fab9833","observation_id":"a42eae2e-7dc7-453d-a429-f09f2d9bc76c","resolution":{"observed_at":"2026-08-07T11:50:19.638513Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:15.816917Z","title":"Ekonomika i Matematicheskie Metody, 1979","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:15.816917Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:55801c0ff42c8410055168b3c4afe6e0e9a86c953b08f24b429248650a83e3b3","observation_id":"1f024b38-3af0-499b-ab9b-560b66d89d8c","resolution":{"observed_at":"2026-08-07T11:50:15.816917Z","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-07T11:50:19.428440Z","title":null,"venue":null,"work_id":"4c9546ca-ba87-4971-b527-d8684008b843","year":2003},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:15.905406Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:58b5cfd261f3262ba39905a3b4abe1e6d7f4e78161a874ca14ddd5182cbe56a2","observation_id":"f6d86544-00c1-4331-bc49-5e983d2ea5d0","resolution":{"observed_at":"2026-08-07T11:50:19.509471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:19.264505Z","title":"IEEE Control Systems Letters, 3(1), pp","venue":null,"work_id":"204189fa-3b9e-421e-9c42-443af5f4d6fc","year":2019},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:15.979047Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:f574c72a45a9064a588063fae1e4d16a108c6bf9c50ff83b37a3787651f222cf","observation_id":"6407a81f-ca41-4345-bd89-3454c5e4c31a","resolution":{"observed_at":"2026-08-07T11:50:19.329370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:19.062697Z","title":"Operations Research Letters, 38(6), pp","venue":null,"work_id":"615cc691-7b1f-48e9-b4ec-d94a1b1a8d8c","year":2010},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.052803Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:e0290699a38a9bbd931f976bacc21708453326bdc6b4eae5755fec59cd2300be","observation_id":"0ce74712-be4d-4e8b-abab-731b825d507b","resolution":{"observed_at":"2026-08-07T11:50:19.133116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:18.892754Z","title":"SIAM Journal on Optimization, 12(1), pp","venue":null,"work_id":"fb0abbc6-74ec-4544-80fd-020a11f0a4bc","year":2001},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.148292Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:f84cebb28fcab02896c2913963eac242af07c4bfb000b26f089e6dc9819fc6c3","observation_id":"dee28820-22d6-4d06-bfd4-b0f111da5b21","resolution":{"observed_at":"2026-08-07T11:50:18.978006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:18.530533Z","title":"European Control Conference (ECC) June, pp","venue":null,"work_id":"70a060e3-c25f-474c-ad3e-973f3bc61b27","year":2014},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.198721Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:1b00354111c32174897f994d3658594948fc302e53884b2421fa417589e04ea0","observation_id":"4ddc7a19-9ce8-4055-8a20-3de65b9a1e90","resolution":{"observed_at":"2026-08-07T11:50:18.677533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:18.123474Z","title":"Nesterov, Introductory lectures on convex optimization: A basic course, Springer Sci- ence & Business Media, 2004","venue":null,"work_id":"598e75a1-4fff-448e-87d6-e365200c5d12","year":2004},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.299703Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:8eae37f1726305c078fa863ed298e38cc3419915cbfd20de9f4b7f141b4d874d","observation_id":"38078a95-4a27-4f3e-a9da-b4ecff92da06","resolution":{"observed_at":"2026-08-07T11:50:18.317523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:17.869341Z","title":"Nesterov, Lectures on convex optimization, volume 137, Springer, 2018","venue":null,"work_id":"f5b9d699-c877-482b-9cce-614b53cb3569","year":2018},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.370597Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:f3f951048f6af906539edea0dc806bb4d3749d35ca994aad80ecc94091221121","observation_id":"b6d4ad6f-e7e0-4c88-a36c-12dc5db93061","resolution":{"observed_at":"2026-08-07T11:50:17.986905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:17.631402Z","title":"Bubeck, Convex optimization: Algorithms and complexity","venue":null,"work_id":"2705aa05-c15b-4ab3-b5a5-e4f9eedcd039","year":2015},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.432940Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:8c9eb816eb4069859d9775de9e5c5d4e562a0f82851799b08655912358d580ac","observation_id":"48e6f454-6814-4e65-b934-032d69a942ab","resolution":{"observed_at":"2026-08-07T11:50:17.710122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:16.500345Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.500345Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:ba53971e9516e65d1e582545f3824c1d9ec8c8b59635819e9ec2421b36996be3","observation_id":"dec00fab-69ba-4373-9ff3-a6732b45b32c","resolution":{"observed_at":"2026-08-07T11:50:16.500345Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.22336","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:50:17.092397Z","title":null,"venue":null,"work_id":"adf615b6-0572-4d68-a9a8-ebd4f0d2c9e3","year":2024},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.563865Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:aa306d702cb4bb0b8a0ac01d3e90bde7601d7945cb2d199dd460b480d6318336","observation_id":"a0d6656b-ce59-4a64-8d1a-f8b1b17f78a7","resolution":{"observed_at":"2026-08-07T11:50:17.159723Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:17.461153Z","title":"Society for Industrial and Applied Math- ematics, 2017","venue":null,"work_id":"369c561e-e4c7-4c4e-b4bf-2f45d101d229","year":2017},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.637988Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:ad260c77d7787d32053af66addcc3b99820342ea0d84faf770efedc99ebbf6d8","observation_id":"50c12598-f11c-444e-9f99-6bb9f945356e","resolution":{"observed_at":"2026-08-07T11:50:17.526424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:50:17.248860Z","title":"Lan, First-order and Stochastic Optimization Methods for Machine Learning, Springer-Nature, 2020","venue":null,"work_id":"8d014d5e-684f-49fa-9d7d-ae96c037b46d","year":2020},"citing_paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:50:16.687230Z"},"links":{"citing_paper":"/paper/2506.01681"},"observation_digest":"sha256:eef9b0e8202fdca38ea11ea499008af430ae91a4e6b6d563f95bd6602914f67a","observation_id":"95f5d5a7-71ed-4dfd-880b-2da38b56bd5e","resolution":{"observed_at":"2026-08-07T11:50:17.314186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01681","last_updated":"2025-06-02T13:49:02Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T11:33:28.277262Z","submitted_at":"2025-06-02T13:49:02Z","title":"Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":9},"total_outbound_references":15},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.01681."}