{"as_of":"2026-08-08T20:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc6eca2f89b7741896b4fd15b30d3212cf6c369c3b82eb40af36ec6d20fee203","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:04:15.163267Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.12397/citation-record","integrity":"/paper/2506.12397/integrity","json":"/paper/2506.12397/citation-record.json","paper":"/paper/2506.12397"},"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-07T01:04:22.017915Z","title":"Beck and M","venue":null,"work_id":"94804f28-84c2-4317-ae1e-fb38d4cd43c0","year":2009},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:11.898654Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:33acbd7fbbfdf3bd69bf331456f3d69e27b0d8f969d885e7a0a0a41d36726044","observation_id":"04152123-ff5b-4cd9-919d-ec84ade8d578","resolution":{"observed_at":"2026-08-07T01:04:22.064501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:21.798834Z","title":null,"venue":null,"work_id":"a3e5eae5-cd46-4fed-b20d-82be9db50b60","year":2022},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.035231Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:667b26708cbf6bb54039b090122f59219d28c1dc027150ec9cfc7a7a727ec710","observation_id":"31083037-7fd8-41d5-8087-1470f50cfa1f","resolution":{"observed_at":"2026-08-07T01:04:21.918038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:12.087079Z","title":"Bodard, K","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.087079Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:5425c8f9139e84847e09ef534ad4dc2e4022729ee6ce420842e089862a1bb125","observation_id":"a4696d00-f5ca-470b-86c8-92d417955b0a","resolution":{"observed_at":"2026-08-07T01:04:12.087079Z","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-07T01:04:21.578655Z","title":"Bottou, F","venue":null,"work_id":"bb6496b8-0d81-4033-bedb-b4c2ee422847","year":2018},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.159582Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:97bcdaadf6cf3efcffd8bb02d0e80bbcf303dd74b164048f6790e2c87244f4b3","observation_id":"8d570313-e947-49c1-88a7-4c682c5b39bf","resolution":{"observed_at":"2026-08-07T01:04:21.685449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:21.362713Z","title":null,"venue":null,"work_id":"d58cfb75-36b1-4c0c-bd3d-e1b575d409ce","year":2024},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.246126Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:db160dbab577ed1e0deb5ccf65d4d736aff7cac6a4b4d1dbafbb7fc81b98c239","observation_id":"dee8590f-2d0f-4fba-b872-b7e5d4e2cde9","resolution":{"observed_at":"2026-08-07T01:04:21.465698Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01056","last_updated":"2025-03-02T23:33:44Z","snapshot_observed_at":"2026-08-07T17:35:17.370573Z","submitted_at":"2025-03-02T23:33:44Z","title":"Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints","version":1},"cited_work":{"arxiv_id":"2503.01056","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.01056","snapshot_observed_at":"2026-08-07T01:04:15.817658Z","title":"Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints","venue":"math.OC","work_id":"9bf52a78-f3da-436f-9d55-3be927a1e1ba","year":2025},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.329889Z"},"links":{"cited_paper":"/paper/2503.01056","citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:5e7cba4569866b5bc21545ecf213caa2025d698d099c14fd1227251adbc5b549","observation_id":"bbb1afd3-4501-4184-b652-2c2cc1a1375a","resolution":{"observed_at":"2026-08-07T01:04:15.899641Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.05727","last_updated":"2022-11-10T17:51:08Z","snapshot_observed_at":"2026-08-06T01:03:18.712727Z","submitted_at":"2022-11-10T17:51:08Z","title":"A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.05727","snapshot_observed_at":"2026-08-07T01:04:12.451746Z","title":"Cartis, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.451746Z"},"links":{"cited_paper":"/paper/2211.05727","citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:f6565c456d2ec48990a7f93d68940038633c30991350bd5aa3d31f6c7375154c","observation_id":"d03e4d1b-5296-4ac9-a869-c6a00531338d","resolution":{"observed_at":"2026-08-07T01:04:12.451746Z","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-07T01:04:21.126497Z","title":"Cartis, N","venue":null,"work_id":"c7e31669-47b2-4fcf-a9d8-47c6021167aa","year":2011},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.538604Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:4a784814fb2a9be3ab69b9b67fdb169b7bd0dcabcc874a79e39d18bc84dbb411","observation_id":"24115c7e-1815-418c-b58a-fc7f4d6974ed","resolution":{"observed_at":"2026-08-07T01:04:21.234254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:20.902008Z","title":null,"venue":null,"work_id":"cf14b703-0d48-4064-b1cc-d44ead75d380","year":2011},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.629827Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:9669bec83c1b20c7d21b435db1f9328a3c2c92d762347b8a3154ac1ffe9348db","observation_id":"a23e19cc-a35a-4820-b42d-6e1dccd48703","resolution":{"observed_at":"2026-08-07T01:04:20.994299Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.00216","last_updated":"2026-04-16T14:03:29Z","snapshot_observed_at":"2026-07-06T08:48:02.438492Z","submitted_at":"2020-01-01T14:54:15Z","title":"Introduction to Nonsmooth Analysis and Optimization","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.00216","snapshot_observed_at":"2026-08-07T01:04:12.700745Z","title":"Clason and T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.700745Z"},"links":{"cited_paper":"/paper/2001.00216","citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:64eb4cc140b8b393b1d14296410b21bd7a17dbbbda2de2543c9eec10b411ba99","observation_id":"e5dac1a4-2185-4b2f-85c0-d137f2e5e9ac","resolution":{"observed_at":"2026-08-07T01:04:12.700745Z","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-07T01:04:20.682751Z","title":"De Marchi, Proximal gradient methods beyond monotony, Journal of Nonsmooth Analysis and Optimization 4 (2023)","venue":null,"work_id":"e4eb0079-d7d2-4329-93b6-253712ad7071","year":2023},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.801983Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:00e2fafa403cc75e20842f7a40b26b6edba6f316ca24fc38ca33fe3411ac2a6a","observation_id":"c0ad2028-1070-4dbd-a1a0-d82e82d7ce28","resolution":{"observed_at":"2026-08-07T01:04:20.790986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:20.441061Z","title":"Deng and C","venue":null,"work_id":"2b3c9f63-58a6-4c63-bf2a-4566829e3875","year":2020},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.882890Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:19c2c814d6bf7fe38595ff79930ab1c426e486ae4bdd4889eb0c4f397f06d5ba","observation_id":"e467515b-275c-4858-a0f2-e661b3be1151","resolution":{"observed_at":"2026-08-07T01:04:20.540417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:20.239076Z","title":null,"venue":null,"work_id":"6a896ac1-76e7-434f-b89c-e5aa7d5d4276","year":2019},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:12.985799Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:32d9fed08c8811c28641b67eb446ffaee25f3031fa26059d6f86de8897fef072","observation_id":"a6d6ed7a-7e81-4fcb-9fb1-28e3deddd635","resolution":{"observed_at":"2026-08-07T01:04:20.335105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:20.032120Z","title":"Dutter and P","venue":null,"work_id":"70edf6c6-c4c1-4a82-8126-b7d5204ad0d2","year":1981},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.074069Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:c41ed58c70d451643ebcc78e57fb7fec229ba70f62de081286e796496f899b1f","observation_id":"32093c77-421f-415c-b35d-002ee03c5ac0","resolution":{"observed_at":"2026-08-07T01:04:20.138143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:19.793024Z","title":null,"venue":null,"work_id":"32c3d383-64f0-4748-a479-a1615a72fd9f","year":2020},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.183821Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:d26414370a9c6116b3e334e167203d00a7aa2dc335d603582ed25b4108426867","observation_id":"1a81f6a7-0974-4ba3-8d14-d6c1a74a9e74","resolution":{"observed_at":"2026-08-07T01:04:19.893069Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:19.578349Z","title":null,"venue":null,"work_id":"59c28c89-1203-4630-9df8-c1d6b10eb3eb","year":2014},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.283318Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:1e059d41390a542b28f79b7f1c52ef1067d3b7d07b970f5254cadee8f507950c","observation_id":"a5fb0005-afae-4f6e-a050-00f4e7ce232f","resolution":{"observed_at":"2026-08-07T01:04:19.678566Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08044","last_updated":"2020-05-12T14:26:23Z","snapshot_observed_at":"2026-07-06T08:58:23.740497Z","submitted_at":"2020-02-19T08:10:18Z","title":"Relaxed Gauss-Newton methods with applications to electrical impedance tomography","version":4},"cited_work":{"arxiv_id":"2002.08044","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.08044","snapshot_observed_at":"2026-08-07T01:04:15.623056Z","title":"Relaxed Gauss-Newton methods with applications to electrical impedance tomography","venue":"math.OC","work_id":"01d49a2f-b158-4d3f-8f27-d5c2fb8496e8","year":2020},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.351905Z"},"links":{"cited_paper":"/paper/2002.08044","citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:dd7d6e37223ee825f18dfdaf3f30a7bc18dc4e49020c28648317254617c75e24","observation_id":"9392e610-70f8-405e-9563-db9c445640d0","resolution":{"observed_at":"2026-08-07T01:04:15.720080Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12376","last_updated":"2024-11-19T09:52:17Z","snapshot_observed_at":"2026-07-06T19:52:29.092683Z","submitted_at":"2024-11-19T09:52:17Z","title":"Convergence of Nonmonotone Proximal Gradient Methods under the Kurdyka-Lojasiewicz Property without a Global Lipschitz Assumption","version":1},"cited_work":{"arxiv_id":"2411.12376","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.12376","snapshot_observed_at":"2026-08-07T01:04:15.462767Z","title":"Convergence of Nonmonotone Proximal Gradient Methods under the Kurdyka-Lojasiewicz Property without a Global Lipschitz Assumption","venue":"math.OC","work_id":"897fa6da-f006-4675-b7a4-c5383156fb23","year":2024},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.444819Z"},"links":{"cited_paper":"/paper/2411.12376","citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:fee50e8580ec1abfa83f9edeeea019ff3915458ebf7e93ee86f6cc2f044dbb28","observation_id":"c19670db-4a0b-4186-a9a5-052c5c3e2a21","resolution":{"observed_at":"2026-08-07T01:04:15.558644Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:19.375849Z","title":"Kanzow and P","venue":null,"work_id":"4c22c634-cec6-4c16-a8b5-ee7c038e0f39","year":2022},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.540241Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:122d5c83ebc26de633a86e286b63cdb7fa2ed8005a596beec32fe8c5d4a21526","observation_id":"0ae0f9d6-b0b3-41b9-852c-628f53b89e31","resolution":{"observed_at":"2026-08-07T01:04:19.498110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:19.213206Z","title":"Maillard, T","venue":null,"work_id":"871ed0ce-19e8-4f78-a304-f48f3eae7b0c","year":2010},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.625035Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:1929d10edecde9e32cfbbd2bd017d8c1a37b45b357c5341f0fc4fc0329674113","observation_id":"593ec6d3-dc55-4fc3-bc79-05acfd15eb0f","resolution":{"observed_at":"2026-08-07T01:04:19.308275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:19.020150Z","title":"Marumo, T","venue":null,"work_id":"8e98abb2-02a6-44f0-9270-7b7ea3ab6538","year":2024},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.699401Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:7d56bb8a180e6a4bb2e30ff241fd8133c59c3aedf8fc98499a54840b5bad8dfd","observation_id":"ec138130-ee5d-4a4f-aded-455552c2fd37","resolution":{"observed_at":"2026-08-07T01:04:19.109654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02370","last_updated":"2025-03-04T07:51:34Z","snapshot_observed_at":"2026-08-07T17:31:14.851404Z","submitted_at":"2025-03-04T07:51:34Z","title":"Regularized higher-order Taylor approximation methods for nonlinear least-squares","version":1},"cited_work":{"arxiv_id":"2503.02370","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.02370","snapshot_observed_at":"2026-08-07T01:04:15.286043Z","title":"Regularized higher-order Taylor approximation methods for nonlinear least-squares","venue":"math.OC","work_id":"0e15b8ca-5b1f-44b3-b86f-7ee54ee75cda","year":2025},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.749165Z"},"links":{"cited_paper":"/paper/2503.02370","citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:ad8c6e3f3283be33ae3175318b88159b6cf60b7ccdfc0e24bc3c6c9db3ce4040","observation_id":"f18d706f-9f3d-47e2-abc8-347f9cc90583","resolution":{"observed_at":"2026-08-07T01:04:15.373459Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:18.824041Z","title":"Nesterov, Modified Gauss–Newton scheme with worst case guarantees for global performance, Optimisation methods and software 22 (2007), 469–483","venue":null,"work_id":"b24ef9cb-a512-4ff8-bd60-bf871a827b3d","year":2007},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.818491Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:739ef4dfbeea355e58133643b3167d1c253c7667aadfcfe2854265479a4e0fc7","observation_id":"7b6ddb3c-0472-4614-a8fe-fcff478073a8","resolution":{"observed_at":"2026-08-07T01:04:18.916122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:18.664935Z","title":"Nesterov, Efficiency of coordinate descent methods on huge-scale optimization prob- lems, SIAM Journal on Optimization 22 (2012), 341–362","venue":null,"work_id":"f791ca04-5bc7-4920-9411-e037706a8daf","year":2012},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:13.891236Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:fc4efec19e65d20a4717f8cedf068cf690d33c215daa8fe7000055c6433137cb","observation_id":"f313ae5b-c966-40c3-849b-4c1fcb64a72e","resolution":{"observed_at":"2026-08-07T01:04:18.746146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:18.467229Z","title":"Nesterov, Gradient methods for minimizing composite functions, Mathematical pro- gramming 140 (2013), 125–161","venue":null,"work_id":"75da01a8-c1a2-499f-bb7c-70f92a50e1a1","year":2013},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.000421Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:fdc35601aa4b955fb78ccbbab0ae2fadc2e339a3628d52cccb7889749d7ee331","observation_id":"26839268-435c-4e29-a2a1-eba76432eccf","resolution":{"observed_at":"2026-08-07T01:04:18.559692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:18.304299Z","title":"Nesterov, Lectures on convex optimization , volume 137, Springer, 2018","venue":null,"work_id":"bc036d83-134a-4840-ab52-67b8ffe381e9","year":2018},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.084649Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:00e0298de2590948b3436f46f8593466c538c6d5476d527f8651ecc785fc7fad","observation_id":"8ddcce83-02a8-4f0b-81f7-ad9fc0521bda","resolution":{"observed_at":"2026-08-07T01:04:18.387427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:14.133941Z","title":"Nocedal and S","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.133941Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:deaea3361a1407857473fcdb76f3f893de97332eca2d875bb8de4b01442ae7f9","observation_id":"e9f79b87-f220-4312-94fe-c69302bc08bf","resolution":{"observed_at":"2026-08-07T01:04:14.133941Z","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-07T01:04:18.157202Z","title":"Patrascu and I","venue":null,"work_id":"d523e478-c4bd-48e7-935a-6aaaf33b9559","year":2015},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.195841Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:6cf4797bea771f8ae22f3c800ae57675e29b5d4e05cdcd30ca667630ef6dbc1a","observation_id":"0954e56c-5fd6-4910-ab5b-130b4221fbee","resolution":{"observed_at":"2026-08-07T01:04:18.232326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:17.990730Z","title":null,"venue":null,"work_id":"660ffae8-bc6a-4662-9936-2e09bb99f3f2","year":2017},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.282096Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:35e0d0feb81b5416178b3db0d6b5388658562c8dfadcd9422e6ad1220de33784","observation_id":"320a776b-35f4-4048-8631-31ad15ea092a","resolution":{"observed_at":"2026-08-07T01:04:18.072094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:17.826443Z","title":"Richt´ arik and M","venue":null,"work_id":"77e5b7c8-789f-4f2f-9924-e79e95580da2","year":2014},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.336233Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:cf95f4535883b6b85edb7fec1e40d076477f92065b3ef6200edbf048146e596d","observation_id":"029adf9a-d514-49aa-a4cd-7ecb3124f224","resolution":{"observed_at":"2026-08-07T01:04:17.892065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:17.681600Z","title":null,"venue":null,"work_id":"1db3de5c-f87f-4d36-b41c-788e2e6afafd","year":2009},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.451382Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:8e9927b58904a1f1195481dc82e466532005c921cdff0ff94d71f33ace85f196","observation_id":"203ff3a8-6091-4e33-8e4f-ad084fc5389a","resolution":{"observed_at":"2026-08-07T01:04:17.774332Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:17.511297Z","title":"Roosta-Khorasani, K","venue":null,"work_id":"702b3353-14f3-40f8-8239-eff329142ddb","year":2014},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.524755Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:e488837ffeb6977dbe62610a9bb71355ba60eff9491cad195d0007e1fd0f6173","observation_id":"660a4abf-7c90-445a-855b-bf20a6a66b7b","resolution":{"observed_at":"2026-08-07T01:04:17.597035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:17.332047Z","title":null,"venue":null,"work_id":"460e58c2-369c-4b6b-aebb-11ffb0be143f","year":2019},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.659434Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:3853b0909b7061e7b94f0b51f2c4583b3b4fb00f1110272d72a341f32e595f15","observation_id":"dd7d066f-9b45-4583-8823-1219992e728f","resolution":{"observed_at":"2026-08-07T01:04:17.428058Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:17.170443Z","title":"Salzo and S","venue":null,"work_id":"0e89df99-1d11-4b42-998e-ad45342ba45e","year":2012},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.780977Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:33ac09fd192f0f302a081dc1d875e7980b6889c5f98ff2400ecaf13cf1b65106","observation_id":"281a48dd-747b-410c-8108-d5f83ef31b3d","resolution":{"observed_at":"2026-08-07T01:04:17.250278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:16.992314Z","title":"Tepper, A","venue":null,"work_id":"5a706687-2446-4d48-8418-300cc2de5f5a","year":2018},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.862270Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:ac311dcf0ce685f15cbb5e3512f9c03b680f4bd8c1f129d5a3af9a2b504eda7e","observation_id":"887ac9c3-c994-4e2c-bc37-2969090fc16a","resolution":{"observed_at":"2026-08-07T01:04:17.076483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:16.778163Z","title":"Tran-Dinh, N","venue":null,"work_id":"a522ddc7-59ef-442d-84dc-da0e0d422091","year":2020},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:14.943013Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:e28692a2bb9bbdf56f76240f82554c02e5cb732cda89f773985d9147d65f5619","observation_id":"3f796edc-a9a5-4ca6-b2e8-9bc2dae5f47f","resolution":{"observed_at":"2026-08-07T01:04:16.893341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:16.547651Z","title":null,"venue":null,"work_id":"5f0f2c3c-a96d-4212-81dc-c7a6542187c5","year":2015},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:15.026512Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:720162b799fc5444b72d550c8fffdba53f9ba06857fda20bdb5e1648038b8153","observation_id":"95aff90e-bbf2-494e-a1f5-894452b208dc","resolution":{"observed_at":"2026-08-07T01:04:16.652568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:16.311690Z","title":"Xie and S","venue":null,"work_id":"4076744b-3f13-4155-b808-46f745917989","year":2021},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:15.092578Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:1e90f571bee637b3e05121f2344990f2c55ca79a3ac4a8fb9b846b10247ce727","observation_id":"f51eaad5-30cd-4778-b363-e21c41387286","resolution":{"observed_at":"2026-08-07T01:04:16.428913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:04:16.097654Z","title":null,"venue":null,"work_id":"da8308e9-5530-411f-af7f-990da2689400","year":2010},"citing_paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T01:04:15.163267Z"},"links":{"citing_paper":"/paper/2506.12397"},"observation_digest":"sha256:8a760551c7a8af40b462ba263197460c6b9f2d6e8d2bd5b2a7321854a080b872","observation_id":"0bc02fe6-9d67-40b6-94d8-2b7717a28199","resolution":{"observed_at":"2026-08-07T01:04:16.192514Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.12397","last_updated":"2025-06-14T08:21:48Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T12:38:41.507278Z","submitted_at":"2025-06-14T08:21:48Z","title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":4,"verified_fuzzy":20},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2506.12397."}