{"as_of":"2026-08-16T15:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d6647bc7a14afd97527d0436c946df87725636eeda8df49401c33440973ae43","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-14T13:25:33.273439Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.05406/citation-record","integrity":"/paper/1908.05406/integrity","json":"/paper/1908.05406/citation-record.json","paper":"/paper/1908.05406"},"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-14T13:25:33.527332Z","title":"Banjac, P","venue":null,"work_id":"878bd309-8d32-4aa7-9f0e-c7b84bd85371","year":2019},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.192564Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:cb1f8ba7883368ca8046896cb214a8aec76781519c690fab328779739f3dc359","observation_id":"9c8afab5-2a6d-4aa5-9ee6-7acf82916615","resolution":{"observed_at":"2026-08-14T13:25:33.530570Z","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-14T13:25:33.517863Z","title":"Bauschke and J.M","venue":null,"work_id":"d81b00a4-5054-47f2-9c79-8f239769f1f5","year":1994},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.196605Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:f3b299832bfe31b3f227244afe893a3a1f4e3a76dd430c0b541ebc12437bbf13","observation_id":"e012aaff-05ee-4c47-95bd-736f2b37f616","resolution":{"observed_at":"2026-08-14T13:25:33.521512Z","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-14T13:25:33.508269Z","title":"Bauschke, J.M","venue":null,"work_id":"a78ad4c8-d5f5-4ba5-a3fb-8e2576f7f7ae","year":1997},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.200313Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:4a728d45bd7ab4cfbefff8acbfe76c168a9344ec0e2caf595fadcd3a29185d0c","observation_id":"b0b88f2c-98b2-44fa-bea3-014e9bbafb74","resolution":{"observed_at":"2026-08-14T13:25:33.511382Z","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-14T13:25:33.499730Z","title":"Bauschke, R.I","venue":null,"work_id":"2f8c0875-d9fe-4a91-91f9-1537080c7e96","year":2012},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.203738Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:3db59a49505a5679b6e8927f95cf72b597ea2afdf4ec457a9377e151359744fd","observation_id":"2dc36e5d-d036-4842-b420-8dc97085f0b8","resolution":{"observed_at":"2026-08-14T13:25:33.503048Z","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-14T13:25:33.491249Z","title":"Bauschke and P .L","venue":null,"work_id":"ab514fa9-cae1-4466-9c8e-ddd2f935f141","year":2017},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.207573Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:242e5f988566373a18f80a6c15b2067de191d47eaccb116b024d03efc2e7b62f","observation_id":"3d727326-1766-46cc-808a-24ff6ff2294c","resolution":{"observed_at":"2026-08-14T13:25:33.494295Z","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-14T13:25:33.482576Z","title":"Bauschke, P .L","venue":null,"work_id":"c32ed898-22bf-44aa-a164-901b8c79f245","year":2004},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.211270Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:a9e782c6f02a70c7f6e84515e4aa13da64f967007db22b42c766593242f3c8a2","observation_id":"fa7eb6c1-7321-4836-9ad1-b22fdad3c51a","resolution":{"observed_at":"2026-08-14T13:25:33.485646Z","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-14T13:25:33.474109Z","title":"Bauschke, M.N","venue":null,"work_id":"c2454e4a-b6cb-4ac4-b061-b862b23d1f6e","year":2016},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.215052Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:44d1282f9c346902a45d73de6258d8cf574453da059a66178c938ad292a15db3","observation_id":"ddbe6c52-dc3a-4231-b7fd-855abbac9e5e","resolution":{"observed_at":"2026-08-14T13:25:33.477165Z","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-14T13:25:33.465998Z","title":"Bauschke, W.L","venue":null,"work_id":"6fb295d9-aa3a-4394-b107-dd6cf2002c23","year":2014},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.218327Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:fe53633f44a777c29f79877e23ea48f460dec2b0f1d78fb00ac440bce53ba8f3","observation_id":"9ee95e2d-ed7b-4580-a1bb-97016c4e836e","resolution":{"observed_at":"2026-08-14T13:25:33.469168Z","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-14T13:25:33.457598Z","title":"Bauschke, W.L","venue":null,"work_id":"5915576c-5ae2-43c6-a10c-89bd83281478","year":2016},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.221334Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:13fe7a51cf75c3d48cacb4f43cf5a005cc0f9cb82db1a14aefbb19734b78f57f","observation_id":"1af5c1f6-656f-43fc-b174-ac9ed000b69e","resolution":{"observed_at":"2026-08-14T13:25:33.460583Z","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-14T13:25:33.449397Z","title":"Bauschke, S.M","venue":null,"work_id":"1ce34973-6f23-4192-831d-603dfc794eb3","year":2013},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.224490Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:9f4db61648a23572101e4dad7d5c2c282477ae5be15f867822de18c5f05a56ea","observation_id":"4be3fd3a-29f2-4845-953c-cffa920cc2ea","resolution":{"observed_at":"2026-08-14T13:25:33.452576Z","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-14T13:25:33.440644Z","title":"Bauschke and W.M","venue":null,"work_id":"00966301-94be-4817-8d3f-72498905461a","year":2016},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.227353Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:5db00fc77e583c75718604032eaa10b22df3e35327321603d11ed0f87bd84336","observation_id":"231e0479-32f3-4fa8-88a0-9a22de386bc8","resolution":{"observed_at":"2026-08-14T13:25:33.443708Z","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-14T13:25:33.431961Z","title":"Bauschke and W.M","venue":null,"work_id":"a315305f-acd8-46d7-80bf-4c183f93f0ef","year":2017},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.230360Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:1c7a99a43fc76ac9e335c68fbf29a382554163a92826fb892aaf2a69356bd407","observation_id":"d935f17e-c221-4357-b3f4-76cedb0ae289","resolution":{"observed_at":"2026-08-14T13:25:33.435073Z","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-14T13:25:33.423072Z","title":"Bauschke and W.M","venue":null,"work_id":"13fed508-8ae9-41c8-b059-448c29ab2381","year":2016},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.233799Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:1e4cf3807684c357683a355412f0f74e54821043ba09673c328e152f732005eb","observation_id":"d9de0e56-8a53-4bf8-900a-c1a7b1083135","resolution":{"observed_at":"2026-08-14T13:25:33.426324Z","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-14T13:25:33.413814Z","title":"Bauschke, M.M","venue":null,"work_id":"c39aada9-b22a-425e-bdd0-829d3248394c","year":2016},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.236961Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:06a8417e9395dc8756798801ea8a258b4278484a6a108ef9d8b44925acdfb5f7","observation_id":"07cdce66-8e3f-41b8-ae31-535dcf85ce71","resolution":{"observed_at":"2026-08-14T13:25:33.417140Z","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-14T13:25:33.404855Z","title":"Combettes, Iterative construction of the resolve nt of a sum of maximal monotone oper- ators, Journal of Convex Analysis 16 (2009), 727–748","venue":null,"work_id":"1f955ca3-bc52-422b-b52b-f6b3dbba0b8c","year":2009},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.240183Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:5887ce17e79f69a93a543a1f608ba82c4ba419ee5ce9b3235e839d7440bc746a","observation_id":"17d95306-944c-45c4-b0fe-07d2a70dece1","resolution":{"observed_at":"2026-08-14T13:25:33.408270Z","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-14T13:25:33.395500Z","title":"Douglas and H.H","venue":null,"work_id":"70f4568f-3a73-4d9b-b780-eaa65a1c9fba","year":1956},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.243363Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:10b147dee219202483cbd7c8b99f8a6337f6c1e57dbb497b366faf28c79b07e7","observation_id":"6a50746c-14a4-4750-995d-9fa82bc4f6df","resolution":{"observed_at":"2026-08-14T13:25:33.399059Z","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-14T13:25:33.386474Z","title":"Eckstein and D.P","venue":null,"work_id":"25defe38-e5c0-496f-8df3-5803c7ff3ada","year":1992},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.246638Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:99d706eccddc8902c3046df9d0db228d0985cc35329adc683305227bebb08690","observation_id":"cfe4046e-96f8-4507-8b32-075d8247708d","resolution":{"observed_at":"2026-08-14T13:25:33.389733Z","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-14T13:25:33.376708Z","title":"Iusem, On some properties of paramonotone operato rs, Journal of Convex Analysis 5 (1998), 269–278","venue":null,"work_id":"9fd8b0a3-c511-428a-b53b-f3339611e63d","year":1998},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.249870Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:8d8d79c5f68b1fa81f09c01ff16cafc70f848ff4464defdfadceb1e84217fe61","observation_id":"159ae6cf-9425-4225-8305-8ba37fd40e31","resolution":{"observed_at":"2026-08-14T13:25:33.380383Z","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-14T13:25:33.366674Z","title":"Kaczor and M.T","venue":null,"work_id":"fba02dde-28c7-4e41-8fc4-6d141f6f3ac9","year":2000},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.252729Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:2680b226efc17e2a1917962e6570e70bb6927b4149dda2790ca8cfa1ff528058","observation_id":"bac0887e-885b-4268-b5f8-909c007ebff3","resolution":{"observed_at":"2026-08-14T13:25:33.370189Z","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-14T13:25:33.357820Z","title":"Knopp, Infinite Sequences and Series , Dover, New York, 1956","venue":null,"work_id":"4adc6194-3ecd-48b9-827e-c46d9f7a0d54","year":1956},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.255749Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:782f373fd89bf24c047a04997bf6882541aabe3d63940324a6817b4183bb9db8","observation_id":"e0544356-52a5-4dd3-90fe-4f06d6fbb06a","resolution":{"observed_at":"2026-08-14T13:25:33.360907Z","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-14T13:25:33.348365Z","title":"Lions and B","venue":null,"work_id":"81d73f0a-f23a-4ad3-a19c-5c4dd167fa39","year":1979},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.258650Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:3242e89a0213e3b54b3752713f34eda46fa85ebd69479a1f3d0deb2657c5d731","observation_id":"687e047f-96e7-4354-a205-9cd350bc8209","resolution":{"observed_at":"2026-08-14T13:25:33.351734Z","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-14T13:25:33.338543Z","title":"Liu, E.K","venue":null,"work_id":"59953172-a9ea-4d90-9f52-c35d578ebd7f","year":2019},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.261543Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:f01f955cec234edfc4a10982d84b93fcef2d781b8e5895345cbdebdbb4a83247","observation_id":"4fe62703-39b6-46d2-832c-e82989db3705","resolution":{"observed_at":"2026-08-14T13:25:33.342086Z","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-14T13:25:33.329525Z","title":"Moffat, W.M","venue":null,"work_id":"2c8cf1d6-8ab5-44ee-80c1-cdff534a24be","year":2016},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.264375Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:2c0acb945e68b216194569aa9533a9684f90d285f205ca64af7394fc3f88d8a7","observation_id":"c2f54be0-7319-48e3-be53-345400c0591d","resolution":{"observed_at":"2026-08-14T13:25:33.332498Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:25:33.267185Z","title":"Rockafellar, Convex Analysis, Princeton University Press, Princeton, 1970","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.267185Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:b69c32107235fd534f1ab48e0e655002e9ec5a6602dcab2713e5b8144847152e","observation_id":"1475b60f-8518-43ea-91a9-e455f83e58fb","resolution":{"observed_at":"2026-08-14T13:25:33.267185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.06618","last_updated":"2019-09-09T22:17:46Z","snapshot_observed_at":"2026-08-14T19:53:37.411624Z","submitted_at":"2018-01-20T03:35:47Z","title":"Douglas--Rachford Splitting and ADMM for Pathological Convex Optimization","version":3},"cited_work":{"arxiv_id":"1801.06618","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.06618","snapshot_observed_at":"2026-08-14T13:25:33.300384Z","title":"Douglas--Rachford Splitting and ADMM for Pathological Convex Optimization","venue":"math.OC","work_id":"a0314d5a-38e0-48bc-8cdb-5d19632fc9cf","year":2018},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.270228Z"},"links":{"cited_paper":"/paper/1801.06618","citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:ae05b01a1c7531cf6fd36d4fc7d717ff50a415f9d63befe88fdd3c8b6f7825c8","observation_id":"034cd0b3-ad9e-4cf6-a06a-c2ab1094b618","resolution":{"observed_at":"2026-08-14T13:25:33.306285Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:25:33.313386Z","title":"Svaiter, On weak convergence of the Douglas-Rachf ord method, SIAM Journal on Control and Optimization 49 (2011), 280–287","venue":null,"work_id":"812bc92e-9810-4d8c-ae16-01e0f0608fc1","year":2011},"citing_paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:25:33.273439Z"},"links":{"citing_paper":"/paper/1908.05406"},"observation_digest":"sha256:e813837ba5319ad313ade0c4ef8ad9141526e3fadbf602f629797ee90829ffec","observation_id":"f2d2e6a7-1bf1-48a8-8d73-5ec49e4aaafa","resolution":{"observed_at":"2026-08-14T13:25:33.317045Z","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"}}],"paper":{"arxiv_id":"1908.05406","last_updated":"2020-07-09T17:45:12Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T13:12:38.677265Z","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":24},"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 0 inbound Pith citation observations for arXiv:1908.05406."}