{"as_of":"2026-08-09T08:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b805014cde260c5e6baef7d156fb50720245675d9f1b97060634099814bd7c9","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T23:25:19.765126Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-06-28T21:43:17.135025Z","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-01T20:06:11.724154Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"cited_work":{"arxiv_id":"2509.06676","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.06676","snapshot_observed_at":"2026-07-01T20:06:11.724154Z","title":null,"venue":null,"work_id":"6d02645a-99e8-4079-b3ce-958f66dadcac","year":2025},"citing_paper":{"arxiv_id":"2605.31386","last_updated":"2026-06-02T14:12:25Z","snapshot_observed_at":"2026-08-08T03:59:48.555396Z","submitted_at":"2026-05-29T14:51:30Z","title":"Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T21:43:17.135025Z"},"links":{"cited_paper":"/paper/2509.06676","citing_paper":"/paper/2605.31386"},"observation_digest":"sha256:87fbfda8dc6ebb24110aded30b9db71f91005cbc2add644e286b0299890ebf21","observation_id":"a9e056e5-a4ca-44c8-aeb5-07aa7447890e","resolution":{"observed_at":"2026-07-01T20:06:11.725524Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.06676/citation-record","integrity":"/paper/2509.06676/integrity","json":"/paper/2509.06676/citation-record.json","paper":"/paper/2509.06676"},"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-04T23:25:20.100561Z","title":null,"venue":null,"work_id":"cf01e73d-c86f-4138-86c2-a5dcfba49b09","year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.666524Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:42081af198c577ec78661f52c1accaa7c0a3327a5f350eb2bf82a372e4f681f7","observation_id":"5ef42373-8659-420d-bd19-e86a1fc3f773","resolution":{"observed_at":"2026-08-04T23:25:20.103723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:20.091340Z","title":null,"venue":null,"work_id":"1b9711a2-7140-4f11-9d4d-f6ce1c8aa454","year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.670814Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:b894c3085a1326a7ab95bd9ecb99978ef72c9acb207f2c803b06a1357e14ecec","observation_id":"534bf364-503f-43e3-8431-8cde969b9a46","resolution":{"observed_at":"2026-08-04T23:25:20.094552Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:20.080920Z","title":null,"venue":null,"work_id":"e0def275-7d7a-4ff9-ad5a-f2f2a8dd5ef4","year":2025},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.674644Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:5ab52d3b737576f43daf4291894a6aae12e3f5f309f97ad595e4443368031263","observation_id":"6a30f767-84ed-4ea4-9900-df218f74fb7a","resolution":{"observed_at":"2026-08-04T23:25:20.084522Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:20.070644Z","title":null,"venue":null,"work_id":"17a810fc-a3ce-49b1-8380-c47b34554267","year":2016},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.678496Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:b4008d206c0d43ba4c2048f2a5e403470009503d4a635120bd96feac1415520f","observation_id":"dfcb43da-53c7-42d2-80f3-71d156978f47","resolution":{"observed_at":"2026-08-04T23:25:20.073682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:20.060593Z","title":null,"venue":null,"work_id":"56434021-9324-412f-98e7-794e4e5304a9","year":2017},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.682374Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:5703928c8e6edc6e1b2b26103b15bd0d9e7c678a0ba6b58eb2e753a7d6ef9107","observation_id":"39eaab16-e4a6-419c-a62d-46a5383b3761","resolution":{"observed_at":"2026-08-04T23:25:20.064134Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.23756","snapshot_observed_at":"2026-08-04T23:25:19.685884Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.685884Z"},"links":{"cited_paper":"/paper/2506.23756","citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:15260a7daab3033ea744c0a5b2ef6a65153d95e6d6430ecc903aaa4d26e11aab","observation_id":"90d69565-72d2-494d-8904-e5038aefbda2","resolution":{"observed_at":"2026-08-04T23:25:19.685884Z","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-04T23:25:20.049487Z","title":null,"venue":null,"work_id":"788d1bda-34c9-474e-9c36-f4c794f1fe58","year":2018},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.690239Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:70bd0809562e7faf7a1522624b04bf9bd024c4fc88cfe82911d64457fb654d08","observation_id":"9d57e266-9cc3-4eab-aefa-73f2fcb39f0a","resolution":{"observed_at":"2026-08-04T23:25:20.052932Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:20.037887Z","title":null,"venue":null,"work_id":"3990da01-0b08-472e-8ec1-16559d2058b6","year":1956},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.693384Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:2f6dee598ee3b1c07a0e2b5a0a3c6f023ffaee5876df159c66b344908a9ccb6b","observation_id":"7a438b28-3dc4-4a0b-88a0-723daa072501","resolution":{"observed_at":"2026-08-04T23:25:20.042089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:20.026953Z","title":"Mathematical Programming145(1):451–482","venue":null,"work_id":"98049dcc-9dd5-4002-9c05-e8bd64b8100f","year":2014},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.696515Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:b1f2cee5e3285cb82a6738399d67eae0f675a9a7f6496df5cc4986d22e78d2d2","observation_id":"7013c328-eb83-461d-9bab-cc426ccd9dc7","resolution":{"observed_at":"2026-08-04T23:25:20.030468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:20.016619Z","title":null,"venue":null,"work_id":"e424487e-c8fa-42de-b4da-c1be4377512c","year":1992},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.699572Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:dd1204afd74c605715fb7e08404eb40d94925f00fe0ba4b32506b0de8f9254f5","observation_id":"80a4e86f-3f2c-4d68-92ce-aded61872f5f","resolution":{"observed_at":"2026-08-04T23:25:20.019747Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:20.005090Z","title":"16 Convergence rate of the DRS algorithm","venue":null,"work_id":"c54a1b9e-fdf3-44b4-a6bb-895cf11a98d4","year":2017},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.702789Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:a7ff237904b3a56673a017e443c092ced6b3b63f568d643b2e5532024b4c4826","observation_id":"31635df0-2132-4926-bacf-f7d5964ed244","resolution":{"observed_at":"2026-08-04T23:25:20.008474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.994731Z","title":"IEEE Transactions on Automatic Control62(2):532–544","venue":null,"work_id":"187370c7-daa1-4a57-8c04-7f3f867d668e","year":2016},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.706127Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:8605ae2c490cee0b7545e16536a90dd28dd4794a8eb5f0f3cf7e09f37cd58f04","observation_id":"589e819a-bddc-4dd9-8278-6bfa6a2fa29a","resolution":{"observed_at":"2026-08-04T23:25:19.998009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.985433Z","title":null,"venue":null,"work_id":"0da216b3-8e6f-4e81-bdd3-68b99577675b","year":2017},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.710313Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:b62a08ae87e14359dc3bdc9a9e02f51fede992ed365d13f3e8de5978ba28b23e","observation_id":"2f4cee30-66f4-4320-933f-375ec3c502c2","resolution":{"observed_at":"2026-08-04T23:25:19.988469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.976780Z","title":null,"venue":null,"work_id":"6358442e-2870-4c49-857a-ebfb4809b982","year":2014},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.713612Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:2b9b9cf1dd437b1619cdf737110e89cc57fb74af438e83fdf8e60a2d9b937450","observation_id":"9315fc60-71bb-47a4-8592-d5a8ecba7697","resolution":{"observed_at":"2026-08-04T23:25:19.979799Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.967388Z","title":null,"venue":null,"work_id":"3733871e-b4ef-4fe0-84ad-e927bed7d9eb","year":2025},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.716566Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:4b6bc011f273c2513f707312151ac2ef0d921c2257a7d4c1c80427a91582575e","observation_id":"e681ef50-43b4-45fa-a6d1-f6222693a354","resolution":{"observed_at":"2026-08-04T23:25:19.970378Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.958298Z","title":null,"venue":null,"work_id":"cc188787-ff40-40ad-8cf2-7f211e649729","year":2016},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.719703Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:13878dec8efa5893b8d55db9b8b4ffa649f191fbbc64d7c9d097f6401ccd2e0e","observation_id":"26f2851b-b5b8-438a-bbd3-c0b15170d876","resolution":{"observed_at":"2026-08-04T23:25:19.961239Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.947945Z","title":null,"venue":null,"work_id":"44fbb917-6094-4a2f-a5e6-38156daf98e3","year":2018},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.723029Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:e5833f62c803dbe3d25cc024ae3886559dac410023967ee16ef957225b94fc3e","observation_id":"926f63e5-c052-4cf8-8d2c-0736da0b0b53","resolution":{"observed_at":"2026-08-04T23:25:19.951192Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.937687Z","title":null,"venue":null,"work_id":"0d9d9b3d-fd9c-4e3d-b8ad-63f4dcb4d627","year":1979},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.726489Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:3dbf98a445b759a4047fec0696a99b5aaffb59ab4a6d378742925be333691499","observation_id":"f6bf2885-c995-4d3c-a35b-dfa322528e2c","resolution":{"observed_at":"2026-08-04T23:25:19.940931Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.926940Z","title":"SIAM Journal on Control and Optimization30(2):408–425","venue":null,"work_id":"588b6dfe-39f8-44e1-aa4b-78280dc3fc94","year":1992},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.729907Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:c6f5db503341d833270d65e29231a30bf715668d9589f335b86c9408a879a28a","observation_id":"7fae3a6f-0f68-4abe-ba24-26a446f11e26","resolution":{"observed_at":"2026-08-04T23:25:19.930114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.916001Z","title":"(2018)Lectures on convex optimization, volume 137 (Springer)","venue":null,"work_id":"1f2b08be-b9b2-48c0-aa13-dc2bc7dfc664","year":2018},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.732991Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:6a5edb8e86b90b2e5cdcc3501c663ee9bc332761cba7d88949489a57120d8887","observation_id":"1cf56bc4-a369-47ac-9afc-f6d2e60b0323","resolution":{"observed_at":"2026-08-04T23:25:19.919982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.905793Z","title":null,"venue":null,"work_id":"8d84fa92-fa81-4412-ad36-bcef1ee822f6","year":2014},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.736791Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:99e39ab103bdf846a952131c21423fa5053e378aa45447805caf85c255552f72","observation_id":"deb45954-2a67-471a-99b9-9906f64c6e73","resolution":{"observed_at":"2026-08-04T23:25:19.908869Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.06071","last_updated":"2021-11-11T06:35:52Z","snapshot_observed_at":"2026-07-06T12:07:27.297884Z","submitted_at":"2021-11-11T06:35:52Z","title":"Linear convergence of the Douglas-Rachford algorithm via a generic error bound condition","version":1},"cited_work":{"arxiv_id":"2111.06071","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.06071","snapshot_observed_at":"2026-08-04T23:25:19.821119Z","title":"Linear convergence of the Douglas-Rachford algorithm via a generic error bound condition","venue":"math.OC","work_id":"2a49748b-a942-4596-957f-f61c1fb49397","year":2021},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.739917Z"},"links":{"cited_paper":"/paper/2111.06071","citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:9d44234e618b7d803aa7b56540aff6350ab01406e6f7ec1762e58a6891a98cb4","observation_id":"387358f9-06e9-43a6-89f5-d063e17933e4","resolution":{"observed_at":"2026-08-04T23:25:19.824775Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.895101Z","title":null,"venue":null,"work_id":"eb0af25e-fa49-4ef3-b132-eb9f9d3cdcd7","year":2020},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.743255Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:57286f35e76299eb268295a89e4afe0e8c3cc9df0a8b2618b271b00deaf52ce4","observation_id":"76cbbff3-83b1-4da8-8cdf-470fc9c5d952","resolution":{"observed_at":"2026-08-04T23:25:19.898645Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.883725Z","title":null,"venue":null,"work_id":"5406e33b-934f-4333-a7c1-6cc8a097a67b","year":2022},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.746222Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:3b81b529e625cb195ed5d21ec86d3409c4a871a1dca4189614aaab6c33c7f435","observation_id":"1db00ccc-6cfd-46c5-aba3-298a731bcfb1","resolution":{"observed_at":"2026-08-04T23:25:19.887465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.872830Z","title":null,"venue":null,"work_id":"577fbb59-e5d7-47ea-a367-004abbe150de","year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.749285Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:e69e9611e999a684b767fea6bd4e14f79c650b0937c0fc26f6819163738ab446","observation_id":"7e84afc9-fad3-49d4-ba5b-2f0f8f6cdbbb","resolution":{"observed_at":"2026-08-04T23:25:19.876597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.862697Z","title":null,"venue":null,"work_id":"5e0ce031-b75a-4bd2-adfc-3e3d1549e934","year":2017},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.752327Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:a34f11fa4f4f1490820a0f2dc1678f9ae5d4c5628daca385b95d54a19816162b","observation_id":"6f2bef9c-911a-4a1d-9c00-83216443602a","resolution":{"observed_at":"2026-08-04T23:25:19.866154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08890","last_updated":"2024-10-11T15:07:32Z","snapshot_observed_at":"2026-07-06T19:31:53.397265Z","submitted_at":"2024-10-11T15:07:32Z","title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum","version":1},"cited_work":{"arxiv_id":"2410.08890","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.08890","snapshot_observed_at":"2026-08-04T23:25:19.805216Z","title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum","venue":"math.OC","work_id":"ca561319-2098-4330-a0be-c3d4239a1e77","year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.755221Z"},"links":{"cited_paper":"/paper/2410.08890","citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:5eaa651ee88533c34cb2eb23fd08999d5bb8e8cb2ac2c9d45605bffa371c3350","observation_id":"9c123e69-c5be-42d3-bba0-65c7c3ce43c4","resolution":{"observed_at":"2026-08-04T23:25:19.810648Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.852527Z","title":null,"venue":null,"work_id":"321f7fe0-e994-4c4e-8a93-8560b17e8c58","year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.758471Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:5a4ee94671545bc0f6bf75768b97b0b8c531c84a07f605f2a3db1b04e950ac8d","observation_id":"ed5091ba-e427-4352-8476-c0830828df8e","resolution":{"observed_at":"2026-08-04T23:25:19.856027Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T23:25:19.842116Z","title":null,"venue":null,"work_id":"025b4ba6-9562-4f9f-b803-759d269d5fb1","year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.762157Z"},"links":{"citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:85988fa6d06dd3fe64d6fe9ee7115bedc23e97a2461ca7194c98935e369592e5","observation_id":"33804e92-fed1-4993-944f-11af2e14922b","resolution":{"observed_at":"2026-08-04T23:25:19.845454Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15195","last_updated":"2024-07-21T15:22:55Z","snapshot_observed_at":"2026-07-06T18:49:42.663028Z","submitted_at":"2024-07-21T15:22:55Z","title":"Exact Convergence rate of the subgradient method by using Polyak step size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15195","snapshot_observed_at":"2026-08-04T23:25:19.765126Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.765126Z"},"links":{"cited_paper":"/paper/2407.15195","citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:68684bc861f06b2b9e7bd0b49c84997e180f2e716d03c6f0ef8fac2e28de5a77","observation_id":"d3059cc5-fa47-47f6-86b8-9b016d440807","resolution":{"observed_at":"2026-08-04T23:25:19.765126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":2,"verified_fuzzy":5},"total_outbound_references":30},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2509.06676."}