{"as_of":"2026-08-22T17:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4a7ec3a30e7d528683e23a56582baa10faa9e2d223c807cd7001b001caa76e7c","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:00:38.057124Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2504.16876/citation-record","integrity":"/paper/2504.16876/integrity","json":"/paper/2504.16876/citation-record.json","paper":"/paper/2504.16876"},"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-16T11:00:38.637318Z","title":"Chambolle and T","venue":null,"work_id":"f9dce4ba-a573-4cfd-a638-4982ce455984","year":2011},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.896770Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:36e595f2d28644cae574deee0e26caf6761e050c4fd4490c05bf02f7709df4d5","observation_id":"3e38dadb-207e-4c58-9562-7475c5d4db66","resolution":{"observed_at":"2026-08-16T11:00:38.642441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.621134Z","title":"Chambolle and T","venue":null,"work_id":"ec242bb1-b41e-4c06-9aff-30d093e3dd9c","year":2016},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.902082Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:de49e26f08749af6df5588e2c1471a64ea246f0b61e7c5ab1a976d0104fd655e","observation_id":"d9385ec2-28c8-4985-949a-81b94b9c5e24","resolution":{"observed_at":"2026-08-16T11:00:38.626812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.605207Z","title":null,"venue":null,"work_id":"4ada8681-7836-47da-a709-5984a80e8887","year":2000},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.907233Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:2bbf167200cad3667697741591615514185e5599a5a9ea19cf75c03e662a6025","observation_id":"67723639-8f1e-4c7e-a7a4-2dd2068d0edf","resolution":{"observed_at":"2026-08-16T11:00:38.609727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.588654Z","title":null,"venue":null,"work_id":"aef548db-394c-4ac7-8f07-702b14270b3c","year":2012},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.911987Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:2e40705a2a47dc77bdc3f68e22c52c99e0918a08d06c84ea0c927eb36af3ff92","observation_id":"0fddf724-c969-403b-9ee7-551014c739f8","resolution":{"observed_at":"2026-08-16T11:00:38.593387Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.571882Z","title":null,"venue":null,"work_id":"e43c172b-7210-45ef-b7cb-c37c04da0b0e","year":2014},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.916982Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:1cd5246dba950edb47614aac5b26a9b149ad006cd97dba7c319b98e87f5f36c5","observation_id":"e7703066-1383-4642-ad13-3c2cf0c76fe3","resolution":{"observed_at":"2026-08-16T11:00:38.576748Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.553412Z","title":null,"venue":null,"work_id":"f4910c92-bbf5-4b9b-8181-a505279acf1e","year":1982},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.922076Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:a2fe0c96d8267a6031190344246c99af3e697c959e63cde80a60c4cd9435ab15","observation_id":"47689145-b015-478f-bdee-66fa8bbe00b6","resolution":{"observed_at":"2026-08-16T11:00:38.558844Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.533063Z","title":"Gabay and B","venue":null,"work_id":"82bfa963-8c6b-451b-9410-a59ba0d4834b","year":1976},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.927252Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:aaf5a739254e834b1d4cb8576a239935a885ac3317c4b6e89ff699b74cbe1ae3","observation_id":"a58f870a-137d-41df-b6c8-067db216771f","resolution":{"observed_at":"2026-08-16T11:00:38.538528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.514642Z","title":"Esser, X","venue":null,"work_id":"a1a112b5-e870-4bc3-a694-fc8b967470a1","year":2010},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.931917Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:b4d27b65a83063a48bd2e71e4bd8e1783fa469dfbfec50847086da6951ac1f6a","observation_id":"806c7000-27f2-4493-9114-4e970aa71889","resolution":{"observed_at":"2026-08-16T11:00:38.520081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.497786Z","title":"Jonathan and P","venue":null,"work_id":"ee93002b-e4de-41ef-8d1b-4c5dc5afd707","year":1992},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.936464Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:e2591300e0db3563e78e554ac8db2012ba5a9ba55ca46fd1209e5c13f6f38406","observation_id":"8e6ff27d-6e8f-4bfc-808d-46e495e193f7","resolution":{"observed_at":"2026-08-16T11:00:38.503218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.02814","last_updated":"2023-11-08T03:59:13Z","snapshot_observed_at":"2026-08-16T14:45:49.535439Z","submitted_at":"2023-11-06T01:19:27Z","title":"A Novel Catalyst Scheme for Stochastic Minimax Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.02814","snapshot_observed_at":"2026-08-16T11:00:37.940985Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.940985Z"},"links":{"cited_paper":"/paper/2311.02814","citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:445f3705f0a147587c91666b49cb8d6a2713eff4e9c81188c6bfe580a922a740","observation_id":"53a162cf-dddf-4d06-aa0d-b7fef0b3ec39","resolution":{"observed_at":"2026-08-16T11:00:37.940985Z","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-16T11:00:38.481881Z","title":null,"venue":null,"work_id":"476bcfe7-b66c-4859-9f68-14efecb66f3f","year":2011},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.951402Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:c22015853884c6428af9641afa62f230ec679aa7c4aa76af7338f87ae019d8eb","observation_id":"8f72115c-9fe5-48fd-ba2d-bcc69c59b94c","resolution":{"observed_at":"2026-08-16T11:00:38.486829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.464732Z","title":"Duchi, S","venue":null,"work_id":"17cf4caa-0764-4048-bda4-3d1f98a0dd73","year":2008},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.956304Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:6282b0d2c7bc64e0fda3412dcf265bb0a3e2eb353763c55480e7b69eb2d83c31","observation_id":"6dee879c-5ab9-43e3-a450-b20382aea1da","resolution":{"observed_at":"2026-08-16T11:00:38.469935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.449537Z","title":null,"venue":null,"work_id":"194bbda4-91a3-44f9-a3af-f5def2f13621","year":1958},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.960758Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:a56aefe700e48f6ad114baeb109f6275b832ea31f85f1397eed7634b785ce0cf","observation_id":"c1a4603a-4a11-4597-b7ba-b97056c4df45","resolution":{"observed_at":"2026-08-16T11:00:38.454200Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.429164Z","title":"Condat, A primal–dual splitting method for convex optimization involving Lipschitzian, prox- imable and linear composite terms, J","venue":null,"work_id":"6e33ab57-8266-4ee6-b5e6-9f373bcd2ff8","year":2013},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.965254Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:0e824ff415e3e29b120ee5ca486c1ab16059b7638a5902d1e8a4f26379456437","observation_id":"27f3c029-c769-4803-b958-7d41b9856afa","resolution":{"observed_at":"2026-08-16T11:00:38.435261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.413900Z","title":null,"venue":null,"work_id":"1f838377-4090-43c2-9290-4935f37238f1","year":2021},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.970220Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:79c434e5b563a1c5c24aca1e8cd58a0775a0ce0c72595f38660772430ef4233b","observation_id":"376581de-6152-467c-8de7-2b7d8953f5d5","resolution":{"observed_at":"2026-08-16T11:00:38.418645Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.397387Z","title":null,"venue":null,"work_id":"b0a2680a-4d99-4370-9f11-16949c287f72","year":2008},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.974913Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:c217a9ace3ccd56436cf378c37bda4f31a5045d4512485da19230c2fab8a57eb","observation_id":"71e276af-d1ef-4728-a176-6bdff30cbaff","resolution":{"observed_at":"2026-08-16T11:00:38.402373Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.380511Z","title":null,"venue":null,"work_id":"fae7cbd1-d132-459d-94c0-489909f83755","year":1979},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.979812Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:53f7dfc20782b80debc84440f2c341a97d6bc3b3ca4e10c03739c864fc4d208f","observation_id":"9416da89-fedd-4a42-8eb9-e8aabdd4c567","resolution":{"observed_at":"2026-08-16T11:00:38.386650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.09674","last_updated":"2024-01-10T05:05:20Z","snapshot_observed_at":"2026-08-16T17:20:05.447948Z","submitted_at":"2022-02-19T20:31:05Z","title":"Generalized Optimistic Methods for Convex-Concave Saddle Point Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.09674","snapshot_observed_at":"2026-08-16T11:00:37.984806Z","title":"Jiang, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.984806Z"},"links":{"cited_paper":"/paper/2202.09674","citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:539b3b7e5181ab33efa0b7e6ce146635adbf1e93c2506a60938ef193845d3470","observation_id":"94a803e9-3c12-4165-8dda-a174ccfd1ede","resolution":{"observed_at":"2026-08-16T11:00:37.984806Z","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-16T11:00:38.362620Z","title":"Glowinski and A","venue":null,"work_id":"aaad86cf-1b5f-45ee-8078-efb8694e761c","year":1975},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.989397Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:792f590f4ec7c2ead75b8533d10871356fb81cd1e8888ec42517c7bbf628c0b6","observation_id":"436a5fbe-bf75-497f-b909-b5f11172e72d","resolution":{"observed_at":"2026-08-16T11:00:38.369051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.346149Z","title":"Hayden and O","venue":null,"work_id":"35a866c5-7059-43c9-aea6-e0a0c00e3b14","year":2013},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.994646Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:a21310fa4d41983dda70a5fdecd5837b2f15221c9868ff33f59163040a396323","observation_id":"9a32a2b8-6174-44e1-b4f7-6787994f44b8","resolution":{"observed_at":"2026-08-16T11:00:38.351696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.330789Z","title":"Goldstein, M","venue":null,"work_id":"06939ee5-55ac-4b95-82f4-e3544216c7ec","year":2015},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:37.999790Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:5cb5569c8f3b92d83e5444a3a13ecab35648ea1b17bde970a22b3c7fdf8a7c9b","observation_id":"c0a78ab8-43fe-4d9c-8cfe-3f088d8ab78d","resolution":{"observed_at":"2026-08-16T11:00:38.335515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1305.0546","last_updated":"2015-03-24T18:39:52Z","snapshot_observed_at":"2026-08-15T00:19:07.878769Z","submitted_at":"2013-05-02T19:26:47Z","title":"Adaptive Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.0546","snapshot_observed_at":"2026-08-16T11:00:38.004938Z","title":"Goldstein, M","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.004938Z"},"links":{"cited_paper":"/paper/1305.0546","citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:e17d8a16a8fb95db3a88602cbc3cbcfe4e5638557a70270339b31cf87b55f79c","observation_id":"f762c2fe-9dab-42c6-8387-c5f1346be4e2","resolution":{"observed_at":"2026-08-16T11:00:38.004938Z","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-16T11:00:38.314651Z","title":"Pock and A","venue":null,"work_id":"d2960e56-7000-437a-b0af-b56575c7f850","year":2011},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.010501Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:49582c10b0896ddbbafa12d722064385a37282e8603b3210e2c8c8bcf9fbf347","observation_id":"ab978a29-06bc-4180-bed9-cb9195814332","resolution":{"observed_at":"2026-08-16T11:00:38.319493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.297761Z","title":"Bouwmans, N","venue":null,"work_id":"f579bc22-7324-4824-8883-fb33c796f441","year":2016},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.016503Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:ae94a1c392541e789e18ce21f823a867932711bb84ff5f3646e9301b92168298","observation_id":"c52fba92-fb0f-4a22-b1af-455c65d90614","resolution":{"observed_at":"2026-08-16T11:00:38.302862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.281371Z","title":null,"venue":null,"work_id":"736d6eb0-da9e-4d29-9a68-1070fc341527","year":2021},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.022243Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:a8c0e061edddb26c26ac48be9ea827fa29f065e0fa516c934ddb862adc7a20b3","observation_id":"2b7592ef-03b1-45bb-b8c4-78979053f45a","resolution":{"observed_at":"2026-08-16T11:00:38.286712Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.264884Z","title":null,"venue":null,"work_id":"e287ecb8-d81f-49ce-a1b1-5849c802449b","year":2022},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.027446Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:55edc9f1afb9da70789dfa961a6ab3a52f0bb7b8254321f45dce53156769d32f","observation_id":"3659abc5-f111-45aa-971d-57164d61d773","resolution":{"observed_at":"2026-08-16T11:00:38.269901Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.247459Z","title":"Ouyang, Y","venue":null,"work_id":"bf6f198a-3ad5-4666-bc03-2e4ef7e3e020","year":2021},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.032143Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:6e53d46fc5a8e552ec5cc0f5ad006b7982f666063b13dc0806a1fc9324b68302","observation_id":"c7b72b1a-2185-48f6-8199-cafca1f80c46","resolution":{"observed_at":"2026-08-16T11:00:38.252769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.228645Z","title":"Malitsky and T","venue":null,"work_id":"eea19041-19b0-45a9-bc3f-479364fbe1c5","year":2018},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.037277Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:52515ef4c60cd929dc045e8359b900050600099fdfc76b54226ad14700ae94c3","observation_id":"7e5f81df-9b81-40f3-9be7-f39f1b1033de","resolution":{"observed_at":"2026-08-16T11:00:38.234677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.212059Z","title":"Malitsky, Golden ratio algorithms for variational inequalities, Math","venue":null,"work_id":"3f5cd5d4-5500-442f-9a67-4fabca241de8","year":2020},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.042163Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:071875d6db9f4969fd5a635fd0ffb7ae5d159624bdeea378eaac2069ac56e814","observation_id":"e6fce368-b2e0-4286-a723-813f74345bbd","resolution":{"observed_at":"2026-08-16T11:00:38.217351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.195528Z","title":null,"venue":null,"work_id":"7bff239b-5ece-4301-8ee5-dbcdf6a9fd46","year":2018},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.047160Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:b4f444fbed8ec6d399c5b097f7b3eb15caf54fd3ba33f2100dcf55584d74ae00","observation_id":"0a1c346a-8068-4a84-b6d2-caa6e8a1d37e","resolution":{"observed_at":"2026-08-16T11:00:38.200476Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.175391Z","title":null,"venue":null,"work_id":"f16f9146-ee96-48c0-a31e-d37ab05d16ec","year":2015},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.052129Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:f7dc4cd6754b6e56cb5c95c7b2a646d48833b5177a68e339684233e22cbda7a5","observation_id":"477ff6f9-e8ea-4ac4-814e-b4f6afeae0bb","resolution":{"observed_at":"2026-08-16T11:00:38.182398Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T11:00:38.154958Z","title":"On lower iteration complexity bounds for the convex concave saddle point problems, Math Program., 194(2022), pp","venue":null,"work_id":"bbcf3776-8bed-46d3-a2c7-e7381a40b9e2","year":2022},"citing_paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:38.057124Z"},"links":{"citing_paper":"/paper/2504.16876"},"observation_digest":"sha256:d2a4c4fedbd0d614268847b498ab3e216c51c8d0e5e3b4e71252f76d075cd235","observation_id":"83ed231c-c3b3-4bae-bd99-586a7f270acf","resolution":{"observed_at":"2026-08-16T11:00:38.162093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.16876","last_updated":"2025-04-23T16:53:14Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T10:51:31.374911Z","submitted_at":"2025-04-23T16:53:14Z","title":"New Primal-Dual Algorithm for Convex Problems"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":32},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2504.16876."}