{"as_of":"2026-08-16T13:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b6a0b30fa244482896fe2b9aee3efa4ae3074972e300a3f7fb3e5ceafa1ee20","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:44:57.034203Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T17:12:47.513382Z","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-05-11T07:20:59.746446Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":"2505.12409","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.12409","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Condat, E","venue":null,"work_id":"acce1c87-ab4d-426f-8f2c-8066e45ee6af","year":2025},"citing_paper":{"arxiv_id":"2604.09245","last_updated":"2026-04-10T11:58:46Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T11:58:46Z","title":"A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-10T17:12:47.513382Z"},"links":{"cited_paper":"/paper/2505.12409","citing_paper":"/paper/2604.09245"},"observation_digest":"sha256:e4b176a36d81c0ef26e605390ec86c3d12b8d54874222b4b3321ce84c7b057b8","observation_id":"c54fc86e-c056-4641-a949-f2149f12d2ad","resolution":{"observed_at":"2026-05-11T07:20:59.756992Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.12409/citation-record","integrity":"/paper/2505.12409/integrity","json":"/paper/2505.12409/citation-record.json","paper":"/paper/2505.12409"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.03246","last_updated":"2020-10-07T07:58:59Z","snapshot_observed_at":"2026-08-15T09:44:59.397533Z","submitted_at":"2020-10-07T07:58:59Z","title":"Optimal Gradient Compression for Distributed and Federated Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.03246","snapshot_observed_at":"2026-08-15T20:44:56.930305Z","title":"Albasyoni, M","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.930305Z"},"links":{"cited_paper":"/paper/2010.03246","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:a1d5e949f6e3a41bec0e5e321faee08b41f7d294993fa091ac85b105122ad6c0","observation_id":"40fce754-9db8-43e2-b7c1-d657b6e8cd37","resolution":{"observed_at":"2026-08-15T20:44:56.930305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03240","last_updated":"2023-06-05T20:50:36Z","snapshot_observed_at":"2026-08-13T11:23:55.677422Z","submitted_at":"2023-06-05T20:50:36Z","title":"Improving Accelerated Federated Learning with Compression and Importance Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03240","snapshot_observed_at":"2026-08-15T20:44:56.961994Z","title":"Grudzień, G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.961994Z"},"links":{"cited_paper":"/paper/2306.03240","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:4cd461574caac95bfd80ab689bb6cde7f93de60482e9c0f62bf8a236931105b4","observation_id":"14025093-402e-4d22-bfca-c20462c0e79c","resolution":{"observed_at":"2026-08-15T20:44:56.961994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16297","last_updated":"2024-01-10T18:55:27Z","snapshot_observed_at":"2026-08-13T11:33:08.889304Z","submitted_at":"2023-05-25T17:51:23Z","title":"Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?","version":3},"cited_work":{"arxiv_id":"2305.16297","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.16297","snapshot_observed_at":"2026-08-15T20:44:57.167624Z","title":"Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?","venue":"cs.LG","work_id":"996d0918-9104-43d4-ab37-7b04f60bbd54","year":2023},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.970570Z"},"links":{"cited_paper":"/paper/2305.16297","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:ab6f06a4e02b5fb6eeae92751274a4a1b0d67761a7abe935fefcd7ccd3475e42","observation_id":"006cfd0a-f143-43b5-b7b3-9870133a93ae","resolution":{"observed_at":"2026-08-15T20:44:57.171987Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.11573","last_updated":"2020-06-20T13:40:27Z","snapshot_observed_at":"2026-08-14T13:11:18.782861Z","submitted_at":"2020-06-20T13:40:27Z","title":"Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.11573","snapshot_observed_at":"2026-08-15T20:44:56.974655Z","title":"Khaled, K","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.974655Z"},"links":{"cited_paper":"/paper/2006.11573","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:45a3fe868e0f6fbb94f83ab7d07e8f1e5cb3bc062b4f653cc9b446620cc493ec","observation_id":"3697669c-3a0a-432f-930b-8afefdbc7bc6","resolution":{"observed_at":"2026-08-15T20:44:56.974655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.02527","last_updated":"2016-10-08T13:25:15Z","snapshot_observed_at":"2026-08-15T22:33:08.717388Z","submitted_at":"2016-10-08T13:25:15Z","title":"Federated Optimization: Distributed Machine Learning for On-Device Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.02527","snapshot_observed_at":"2026-08-15T20:44:56.979135Z","title":"Konečný, H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.979135Z"},"links":{"cited_paper":"/paper/1610.02527","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:6321e67001e1289d0441c86e0b0db3c34891c1aae5514fa2f46ab6b0d279940e","observation_id":"197208f8-2a9f-4d2e-89ea-5e912a1fc6e0","resolution":{"observed_at":"2026-08-15T20:44:56.979135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-15T08:38:18.290821Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-08-15T20:44:56.987520Z","title":"Mishchenko, E","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.987520Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:0c00683c03e8223a26e15755e42698ba6668751194b389f3d68e388224daafea","observation_id":"93dcd450-89b3-4ddf-9e4a-4a7cabb36874","resolution":{"observed_at":"2026-08-15T20:44:56.987520Z","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-15T20:44:57.543886Z","title":"Reisizadeh, A","venue":null,"work_id":"a3622c6c-b616-473c-8f9d-97279bf504ce","year":2021},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.992169Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:e08c846cff6d11aecfa462222ab84777f33d0910281063b1117d2dba4aa6618c","observation_id":"0c90ebdb-025a-45c7-ad67-4af192206d6d","resolution":{"observed_at":"2026-08-15T20:44:57.547831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:57.530261Z","title":"Traoré, V","venue":null,"work_id":"34c8bd5a-fd34-46fc-b2b6-e4b6f1c9ae06","year":1910},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.999757Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:90a3f49ca21db3acc5daaf5649948b874898ffe2de08528701ab5f3ed483f622","observation_id":"68e3bd03-528f-453d-b009-ec109df7c30f","resolution":{"observed_at":"2026-08-15T20:44:57.535015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06917","last_updated":"2021-07-14T18:09:08Z","snapshot_observed_at":"2026-08-15T08:37:45.879007Z","submitted_at":"2021-07-14T18:09:08Z","title":"A Field Guide to Federated Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.06917","snapshot_observed_at":"2026-08-15T20:44:57.003281Z","title":"Wang et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.003281Z"},"links":{"cited_paper":"/paper/2107.06917","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:8724bc9be3e66bea7b6f354135622e2d6777a2ca73b03cc84859d3092148b723","observation_id":"18c00f18-5529-4e8c-8ca5-c0cc2117fa7c","resolution":{"observed_at":"2026-08-15T20:44:57.003281Z","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-15T20:44:57.515491Z","title":"Xiao and T","venue":null,"work_id":"f46544d1-9e82-4452-a0cc-3288863c24f5","year":null},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.007187Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:198fd55b6200a28e075b23701ed4c1939344d5304f0b1a2d306d9be45c8a57b5","observation_id":"7c9d2180-b413-4281-ac22-5a6a2509af30","resolution":{"observed_at":"2026-08-15T20:44:57.519396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:57.488362Z","title":"Almost sure convergence ofxt and theut i follows","venue":null,"work_id":"9887fa3a-d9a2-4d5e-bb5a-c9334a967ec3","year":2015},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.018973Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:b4a4e9a2e4bda8797054155c00375019a417c607c238ff632dc32a10cd8c82f4","observation_id":"3d220766-d846-4973-be50-7a2daa276954","resolution":{"observed_at":"2026-08-15T20:44:57.492482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:57.475344Z","title":"This is better than uniform sampling withp1 =··· =pn = 1 n as in Corollary C.3 withs= 1, since the complexity now depends on¯Lh instead ofmaxiLhi","venue":null,"work_id":"696ca408-aa9d-46c8-b1fb-9bf53c61a920","year":2019},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.022360Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:6ddd218758aead35f1f1bb5b7504b80dc6423d46cc2d8884c048b2f5d2de9f5f","observation_id":"82f3438d-68e2-40e1-9a81-a75fa0e9a2d8","resolution":{"observed_at":"2026-08-15T20:44:57.479809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:57.462717Z","title":"InSMPM, suppose thatγt≡γ for some0 <γ < 2 Lf (or justγ >0if f = 0), ˆp= 1−p∅ 1−p∅+γµh1 and η1 = 1 1−p∅","venue":null,"work_id":"edfed8e6-b53e-48ad-9e53-46181b564e0c","year":2023},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.026475Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:1a04e686f3d8f4a960f5057d5fa2d6d62693bfccc7579bc677fc2598b94a5c89","observation_id":"21d8dc70-08f5-4b83-94f5-08177252e7e7","resolution":{"observed_at":"2026-08-15T20:44:57.467345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:57.449820Z","title":"Almost sure convergence ofxt and theut i follows","venue":null,"work_id":"1435b769-c217-4079-bc2e-ce6a9ad09551","year":2015},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.030525Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:6c967b5ca8b41245dd669357a49ddd2d1576f845f20b9699b2565b05616d1c6f","observation_id":"a8ed61f7-591f-45f2-8bd4-17a139c34118","resolution":{"observed_at":"2026-08-15T20:44:57.454162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:57.434568Z","title":"We can compare our linear rates to known rates in the literature, keeping in mind that they are not for the same Lyapunov function","venue":null,"work_id":"1c8e25f1-58c5-4a5b-af51-9f511bae2ce7","year":2022},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.034203Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:4cbceb4d56cdbf95d281e524e804ab8878e43ed0cd8f4c0471d9f2b9d5fe4767","observation_id":"d32c0395-8ca7-4599-9c66-9bb6f0984358","resolution":{"observed_at":"2026-08-15T20:44:57.439373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:57.501914Z","title":null,"venue":null,"work_id":"058203d7-87c2-4f5f-a3f6-25025ac052f3","year":2015},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.014892Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:938914150f3138638e9797d92b91b7d0bc6bd819f65759e4f6f35a42712d8691","observation_id":"ddfdbc6a-65b3-412a-8eee-499d4416e6ef","resolution":{"observed_at":"2026-08-15T20:44:57.506445Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.15604","last_updated":"2025-08-15T19:24:53Z","snapshot_observed_at":"2026-08-13T13:33:10.931030Z","submitted_at":"2022-11-28T18:01:42Z","title":"Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs II: Convex Optimization Problems","version":2},"cited_work":{"arxiv_id":"2211.15604","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.15604","snapshot_observed_at":"2026-08-15T20:44:57.066133Z","title":"Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs II: Convex Optimization Problems","venue":"math.OC","work_id":"35b60460-413e-440b-a6d7-c22e8f0577a1","year":2022},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:57.011072Z"},"links":{"cited_paper":"/paper/2211.15604","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:fc41fcfd2299de5e694b403367433f081f5c4aed0376d9a25cbd6136c757b894","observation_id":"fd500523-33bb-45cb-8e33-47e1c1ea247a","resolution":{"observed_at":"2026-08-15T20:44:57.072984Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-08-15T20:44:56.935157Z","title":"Beznosikov, S","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.935157Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:940f529fed7a55e1d2f3bc0087c76290f19b8ddb248c90be7441e2ccef233e47","observation_id":"a8aff9a0-40f8-4ad6-ae27-57d2cccd30eb","resolution":{"observed_at":"2026-08-15T20:44:56.935157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14255","last_updated":"2024-05-23T07:34:55Z","snapshot_observed_at":"2026-08-16T13:50:20.887500Z","submitted_at":"2024-05-23T07:34:55Z","title":"Stochastic Proximal Point Methods for Monotone Inclusions under Expected Similarity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14255","snapshot_observed_at":"2026-08-15T20:44:56.995757Z","title":"Sadiev, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.995757Z"},"links":{"cited_paper":"/paper/2405.14255","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:b33d924204845e1e6ec80a2ab59fad47937a08ae3c7609b1a2298e786b01d7bd","observation_id":"39136755-0f40-4261-b61e-ef4ed62912f9","resolution":{"observed_at":"2026-08-15T20:44:56.995757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11535","last_updated":"2022-03-24T00:02:00Z","snapshot_observed_at":"2026-08-14T16:25:33.623062Z","submitted_at":"2019-05-27T23:05:30Z","title":"A Stochastic Decoupling Method for Minimizing the Sum of Smooth and Non-Smooth Functions","version":2},"cited_work":{"arxiv_id":"1905.11535","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.11535","snapshot_observed_at":"2026-08-15T20:44:57.127505Z","title":"A Stochastic Decoupling Method for Minimizing the Sum of Smooth and Non-Smooth Functions","venue":"math.OC","work_id":"8cd07514-6839-47c2-83f2-69931101eac9","year":2019},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.983467Z"},"links":{"cited_paper":"/paper/1905.11535","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:c4182e9d1a1ddf9aec431e8d3658f5f4a3b14c749090ed59dfe1108f7c63f73a","observation_id":"04d60af7-59fa-4edb-a770-8b5975eeca54","resolution":{"observed_at":"2026-08-15T20:44:57.131974Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.03294","last_updated":"2025-06-20T17:11:24Z","snapshot_observed_at":"2026-08-13T22:09:41.395394Z","submitted_at":"2021-10-07T09:29:14Z","title":"EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.03294","snapshot_observed_at":"2026-08-15T20:44:56.953883Z","title":"Fatkhullin, I","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.953883Z"},"links":{"cited_paper":"/paper/2110.03294","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:f26709c3fde57870b171d491d5c575bc14d2cd25ffaca0b5e51ad94071f3379a","observation_id":"3b4286fc-1b60-4806-9346-24634f17cae0","resolution":{"observed_at":"2026-08-15T20:44:56.953883Z","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-15T20:44:57.555862Z","title":null,"venue":null,"work_id":"5d0f5828-8451-4e41-a9eb-6ae7ff0fd052","year":1968},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.958140Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:09a3f7ec36e8a1028295cacfbf52f5bf2557ca63333a0e2507b5235bd4781bf6","observation_id":"a7682077-c2d5-4dfe-8654-a0ef1b0fd2f0","resolution":{"observed_at":"2026-08-15T20:44:57.559726Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:57.567538Z","title":"Bonawitz, V","venue":null,"work_id":"b10385f3-a7ff-4e8b-a48e-41ef962529da","year":2017},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.939962Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:b81e3a5a38d61fce566710d82e0b9cbcd78217e2759a8d42a59eaf599f793533","observation_id":"37b71a0b-6532-4845-8513-41858627f624","resolution":{"observed_at":"2026-08-15T20:44:57.571893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11266","last_updated":"2020-01-15T18:26:53Z","snapshot_observed_at":"2026-08-14T16:25:52.453497Z","submitted_at":"2019-05-27T14:31:44Z","title":"One Method to Rule Them All: Variance Reduction for Data, Parameters and Many New Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.11266","snapshot_observed_at":"2026-08-15T20:44:56.966491Z","title":"Hanzely and P","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.966491Z"},"links":{"cited_paper":"/paper/1905.11266","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:f2abdb6e7185d84081bc3aace43124068797169ce77565cbd676d82c1ee0884b","observation_id":"eafd06e4-a3e9-4a87-aabc-6a8c221b3143","resolution":{"observed_at":"2026-08-15T20:44:56.966491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19951","last_updated":"2024-05-30T11:14:16Z","snapshot_observed_at":"2026-08-16T13:47:48.245355Z","submitted_at":"2024-05-30T11:14:16Z","title":"A Simple Linear Convergence Analysis of the Point-SAGA Algorithm","version":1},"cited_work":{"arxiv_id":"2405.19951","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.19951","snapshot_observed_at":"2026-08-15T20:44:57.390432Z","title":"A Simple Linear Convergence Analysis of the Point-SAGA Algorithm","venue":"math.OC","work_id":"d0872366-b187-437e-a0c0-cd1c1cdb209e","year":2024},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.945256Z"},"links":{"cited_paper":"/paper/2405.19951","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:b40aef17855462eba5e5b6b28d7bcffa782fb683760d3daf06db284db9ff9e17","observation_id":"d0c60f1e-b00d-4e79-b7d4-1a660c338add","resolution":{"observed_at":"2026-08-15T20:44:57.395912Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T20:44:56.949604Z","title":"Condat, I","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.949604Z"},"links":{"citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:87bb64dad8595e50353263424ddb2181735764ad7ecac5f7285115079a090de0","observation_id":"6195136a-568b-4d1c-84d0-6ebf7ec8f98d","resolution":{"observed_at":"2026-08-15T20:44:56.949604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":4,"verified_fuzzy":9},"total_outbound_references":26},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 1 inbound Pith citation observation for arXiv:2505.12409."}