{"as_of":"2026-08-09T15:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dfc6e3321eb91438c4444939b028dcee071d974b3899e72c62f196e17a4c2701","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T01:24:12.412433Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2607.08035/citation-record","integrity":"/paper/2607.08035/integrity","json":"/paper/2607.08035/citation-record.json","paper":"/paper/2607.08035"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.13719","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.266720Z","title":"cuhallar: A gpu accelerated low-rank augmented lagrangian method for large-scale semidefinite programming","venue":null,"work_id":"f2e3ed1f-d6a6-4b38-b49f-a93d3f8fd16b","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:8a070bbd98a209bd9577f1d88887b2a1416cd8603a339b007afe6b8040f03271","observation_id":"6923f5e2-cad5-47b5-bcd9-e419d1ca29ee","resolution":{"observed_at":"2026-07-10T01:26:43.268170Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.705293Z","title":"Interior point methods in semidefinite programming with applications to combinatorial optimization.SIAM Journal on Optimization, 5(1):13–51, 1995","venue":null,"work_id":"71ffecbb-7e18-4f19-a81c-dce90f1d4eaa","year":1995},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:13539e015ec6543c2f313bc927dd4ccdef4294f1a24b4859533274a16f083dcb","observation_id":"6f20274c-29b0-4305-a0d6-2508b0ac7481","resolution":{"observed_at":"2026-07-10T01:26:43.706643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.728583Z","title":"Haeberly, and Michael L","venue":null,"work_id":"983f19dd-1d63-470a-ac6d-49dab88530b4","year":1997},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:5beea0cb4368e432cece1a176aeb13a486d62d60206ed4f94d266570f379a2fb","observation_id":"b188b1aa-5fdd-467c-a3d8-b0b97e109213","resolution":{"observed_at":"2026-07-10T01:26:43.729756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.773142Z","title":"Practicallarge-scalelinearprogrammingusingprimal-dualhybridgradient","venue":null,"work_id":"7299df58-92cb-483e-ab59-c5def29e0603","year":2021},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:0379feceb20ca10b89a6e28416ccf5b840b965600c3ca8c6d8f0ee5887a572cc","observation_id":"5be55ad9-61b5-4cc3-996b-6b04683302f7","resolution":{"observed_at":"2026-07-10T01:26:43.774252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.686499Z","title":"PDLP: A practical first-order method for large-scale linear programming.Mathematical Programming Computation, 2026","venue":null,"work_id":"6a83d0d8-126a-4936-9292-adc350348975","year":2026},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:75537dc22a05fc6d29a651b5c959b1d4362f1accea6f58f28179bc800fc90dbc","observation_id":"11606bf4-af46-4c58-8ccd-577c751e2dff","resolution":{"observed_at":"2026-07-10T01:26:43.687871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.684497Z","title":"Faster first-order primal-dual methods for linear programming using restarts and sharpness.Mathematical Programming, 201(1–2):133–184, 2023","venue":null,"work_id":"c17583ba-0f22-4d24-8f74-964de58dc99b","year":2023},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:3749400711c136b0c3f38d834daa470908e50668126bf2d68f8c43ab0f389a76","observation_id":"988a36cd-530d-4d52-af58-16440461a33e","resolution":{"observed_at":"2026-07-10T01:26:43.685934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.680769Z","title":"The Chambolle–Pock method converges weakly withθ >1/2andτ σ∥L∥ 2 <4/(1 + 2θ).Optimization Letters, 20(3):503–520, 2026","venue":null,"work_id":"4d711d07-fafc-42ff-b54e-696f47e4b754","year":2026},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:f2a50d92a2f85c9921f5d30f16102953702e93a5e73c49c3036c2abe269bf549","observation_id":"9f6070c0-a4d9-46a2-85b1-e3c8dce8727e","resolution":{"observed_at":"2026-07-10T01:26:43.682096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.679091Z","title":"Bauschke and Patrick L","venue":null,"work_id":"44005b3f-2fac-45b0-8fd0-d55806c23d46","year":2017},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:8a4084f2779fb7f06f0ebc79c55dce1cf90ac8eac6b32f764dc745c3729b1593","observation_id":"9221e630-ba77-48cd-8c79-434f961dd3e9","resolution":{"observed_at":"2026-07-10T01:26:43.680212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.682645Z","title":"Boyd, Laurent El Ghaoui, Eric Feron, and Venkataramanan Balakrishnan.Linear Matrix Inequalities in System and Control Theory, volume 15 ofStudies in Applied Mathematics","venue":null,"work_id":"88fc32c3-7c43-43d9-91fd-497096ed7aea","year":1994},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:00ea7a22dba4d70942ad4ef685985da00ca38d056a573b3e70090c6129a52b5f","observation_id":"cabf03a0-7395-45f9-94f2-cb4a78029c94","resolution":{"observed_at":"2026-07-10T01:26:43.683881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.688415Z","title":"Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein","venue":null,"work_id":"3e1cca85-9d8b-409b-9622-4bb918c5cd43","year":2011},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:c233f154938ec9a3f8ddb09f2c5ebf3493f43ca76648bea319d8a2fda34a9f52","observation_id":"babe2ec7-6859-4bf1-9b1c-0d0ff59eec94","resolution":{"observed_at":"2026-07-10T01:26:43.689625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.677143Z","title":"Boyd and Lieven Vandenberghe.Convex Optimization","venue":null,"work_id":"69e7b648-dae1-449b-b83b-8f5f1212c973","year":2004},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:fbaa50b1eaa6d57758930e1fe77bd437b546264744fe8cba251a80809b9e598c","observation_id":"b9b2fec5-74a8-4064-b1db-6b5a963d7f79","resolution":{"observed_at":"2026-07-10T01:26:43.678441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.690183Z","title":null,"venue":null,"work_id":"df1556db-f454-408b-92d4-c7dd39f07488","year":2003},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:3d1d6de10eadb78c4d06e56a181e01e306ab207fbd9aa199e6423e77b0e84b75","observation_id":"40760bb6-98a0-4543-9725-2ebd9b006e25","resolution":{"observed_at":"2026-07-10T01:26:43.691651Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.666433Z","title":null,"venue":null,"work_id":"8262c0db-16dd-457f-ae6c-aae9e800e274","year":2005},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:fea05d9af71b761a3fb8e5a47aee687d108c4fa527883a9b7cc2be960265b5b3","observation_id":"7840225e-1253-4559-83c0-af09e4220e81","resolution":{"observed_at":"2026-07-10T01:26:43.670727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.672113Z","title":"A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of Mathematical Imaging and Vision, 40(1):120–145, 2011","venue":null,"work_id":"ac7f3196-3c35-4ec2-9ce9-f96f9e786d72","year":2011},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:7800f5ce3a5eeb61490130d94fa463f5235f45840f7bc49f9b0d9623f276adfe","observation_id":"f1f766d4-b87f-4192-92de-0ffe24cdeb83","resolution":{"observed_at":"2026-07-10T01:26:43.673941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.697732Z","title":"On the ergodic convergence rates of a first-order primal–dual algorithm.Mathematical Programming, 159(1–2):253–287, 2016","venue":null,"work_id":"23538a41-301d-4cb9-9d9a-91727167eaf8","year":2016},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:064e3046e728eb829aaac06af2dd4b93e177c7272af74c5881bcba7cd3fd5ba3","observation_id":"fbca8b64-fe56-4268-a7cc-ddb4558481d2","resolution":{"observed_at":"2026-07-10T01:26:43.699043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.663840Z","title":"Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming.SIAM Journal on Optimization, 19(1):370–396","venue":null,"work_id":"abbe97aa-16a3-4222-88e6-9bb9e84b42c7","year":2008},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:949406f4dc7c5adcb5f4dff03ac70fb8d9e2b4358102a2302539d2292bb28ea0","observation_id":"3292913e-cabb-49ea-83d1-ecde5c907f36","resolution":{"observed_at":"2026-07-10T01:26:43.665795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.661686Z","title":"A golden ratio primal-dual algorithm for structured convex opti- mization.Journal of Scientific Computing, 87(2):47, 2021","venue":null,"work_id":"5e71fdbb-2809-44ea-87dd-5df34bf0d0ec","year":2021},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:a56b0b2205bd34ae8355b476795b7eef12720fa2ab587b50336a0680a49fbe03","observation_id":"b864ca96-7d29-42f0-bf8b-c87b8cdeb95e","resolution":{"observed_at":"2026-07-10T01:26:43.663156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.653182Z","title":"HPR-LP: An imple- mentation of an HPR method for solving linear programming.Mathematical Programming Computation, 2025","venue":null,"work_id":"005c902f-abb6-46a2-991a-ba5b62519ece","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:42a86ff837cb2b9d7bdfc142e933e6dc9effe40c55922cdbf7e4d8659e1206b7","observation_id":"89a00b90-690b-49f0-95c9-360ca17683af","resolution":{"observed_at":"2026-07-10T01:26:43.658681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.659335Z","title":"On the global and linear convergence of the generalized alternating direction method of multipliers.Journal of Scientific Computing, 66(3):889–916, 2016","venue":null,"work_id":"dfec4bbc-b876-4d43-bbd4-b522ed912508","year":2016},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:2591dbe81fe13e31a7ba7478531bc6b122e4ffe91c2b29ebda92326f3a3edb7c","observation_id":"e6aea991-35cf-427e-8d12-4bc6bd85538a","resolution":{"observed_at":"2026-07-10T01:26:43.661048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15775","last_updated":"2025-05-21T17:27:04Z","snapshot_observed_at":"2026-08-07T15:09:42.579569Z","submitted_at":"2025-05-21T17:27:04Z","title":"New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming","version":1},"cited_work":{"arxiv_id":"2505.15775","doi":"10.48550/arxiv.2505.15775","metadata_source":"pith","pith_arxiv_id":"2505.15775","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"New understandings and computation on augmented lagrangian methods for low-rank semidefinite programming","venue":"math.OC","work_id":"134b83c6-5ba8-474c-8b12-8572c60edb94","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"cited_paper":"/paper/2505.15775","citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:5ef312cef763c00e10aec2d61a21f53e556c86e684c699f70c5257da0efed281","observation_id":"7c3f83b1-4b51-4aa9-80c2-c54bbccd7513","resolution":{"observed_at":"2026-07-10T01:26:43.257681Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-05-24T04:55:23.732882+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T04:55:23.732882+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.696012Z","title":"Dontchev and R","venue":null,"work_id":"5b6f37f3-4d0b-4066-bdb9-ed7d9f09abc7","year":2004},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:59c8c38cbd59daab8e6abaf04f8faebed05a90309a65ee0dde07a8da6f51ae82","observation_id":"5356c931-4ab2-4383-a1ca-8100f1b14b4f","resolution":{"observed_at":"2026-07-10T01:26:43.697140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.674510Z","title":null,"venue":null,"work_id":"44dfd9fa-0e86-4e36-a3a8-1b06935d184d","year":2014},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:31991c7421190cbac9bf4451f325eec102a875b5452edba03b7cecc3643e2c7c","observation_id":"5df724b4-81cc-4fd5-b31f-7381add2dda9","resolution":{"observed_at":"2026-07-10T01:26:43.676502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.692232Z","title":"Bertsekas","venue":null,"work_id":"477fcea9-e5fe-4a3c-8be7-c84e7f41cb5c","year":1992},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:703d771b7e2698dfc56fc15e157e62771ac4ae097a0798fc8517da938f02df72","observation_id":"a7cd04e5-f8c3-4d52-93f5-c317fc3bab06","resolution":{"observed_at":"2026-07-10T01:26:43.693340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.774879Z","title":"Ageneralframeworkforaclassoffirstorderprimal-dual algorithms for convex optimization in imaging science.SIAM Journal on Imaging Sciences, 3(4):1015– 1046, 2010","venue":null,"work_id":"6cbaeb62-8503-4ae9-820c-c32a766ba787","year":2010},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:166aa5bb4513c95d9941cf58f762acec9d9137ad4e246f995e5ad12931110333","observation_id":"26753808-6997-4b93-8da1-3a9670d918b7","resolution":{"observed_at":"2026-07-10T01:26:43.776181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.761671Z","title":"A dual algorithm for the solution of nonlinear variational problems via finite element approximation.Computers and Mathematics with Applications, 2(1):17–40, 1976","venue":null,"work_id":"8ffa5856-44cd-48b3-a0fc-2a76d04e04d7","year":1976},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:eb1dffc1a9257c024d6d9d288f14612a027bd65af09f6641aadee47884bcd2e4","observation_id":"5ebd9ff8-d46b-4ba1-b1f1-829e3ffb093f","resolution":{"observed_at":"2026-07-10T01:26:43.762985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.763554Z","title":null,"venue":null,"work_id":"18319991-4bef-446f-a1ef-3ea68ad85c42","year":2017},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:e0920b251d45ba6cdfb805276e32c32d017ae630a41fbbe0d6d899942e79eafb","observation_id":"f6825c36-b3ae-4038-bc6b-a26e13ef973c","resolution":{"observed_at":"2026-07-10T01:26:43.764742Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.759776Z","title":"cuADMM: GPU-accelerated first-order optimiza- tion for large-scale multi-block semidefinite programs","venue":null,"work_id":"08dd3b1d-741b-4f29-8c9b-fefbe6e22f3b","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:f83ca8e14aa75df8bdf92fd1dc61e8f5d068feed58d9193e92cda2c88587a0b1","observation_id":"d44ac85a-53e4-4b59-adde-ee512cad2f40","resolution":{"observed_at":"2026-07-10T01:26:43.761066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.750463Z","title":"Linear rate convergence of the alternating direction method of multipliers for convex composite programming.Mathematics of Operations Research, 43(2):622–637","venue":null,"work_id":"4cf5df09-ce47-4c8b-b36b-ee8703fc5945","year":2018},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:3bcd6ab5f6483c5cb0818da8e9edd9b80f914b67fc4a34f03d70508a575c4dfc","observation_id":"9a696415-7ffb-47ff-b5dd-c0a585ea9363","resolution":{"observed_at":"2026-07-10T01:26:43.751769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.748502Z","title":"Building Romewith convexoptimization","venue":null,"work_id":"13147dfb-f133-4a84-bdb7-f9232f5d7a48","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:66b7a2f5b7aef11a41036ec896a6206c756973d70d6874958b1aca74cd322492","observation_id":"d34e4554-4a67-4d39-9ff0-01ba2de83d35","resolution":{"observed_at":"2026-07-10T01:26:43.749894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.752407Z","title":"A low-rank ADMM splitting approach for semidefinite programming.INFORMS Journal on Computing, 2025","venue":null,"work_id":"20218689-6699-48f5-bdda-69170d2e6b05","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:39f33457310e3f13fc9d64e9498bab2c205d9afa49fefdefb700a4fc96b8a4da","observation_id":"017730ca-7d88-42bd-ae31-f71eb05dc11c","resolution":{"observed_at":"2026-07-10T01:26:43.753708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.754304Z","title":"A generalized primal-dual algorithm with improved convergence condition for saddle point problems.SIAM Journal on Imaging Sciences, 15(3):1157–1183, 2022","venue":null,"work_id":"17042e83-630f-48ef-8128-1db6ff4d5070","year":2022},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:4201bee1a33868998a604363acd2c12ce4e73203bcaf89f5c84f382e7c5a0ad4","observation_id":"6869dfbd-6a59-4866-9d7f-3ac3c9dae823","resolution":{"observed_at":"2026-07-10T01:26:43.755990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.756574Z","title":"Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective.SIAM Journal on Imaging Sciences, 5(1):119–149, 2012","venue":null,"work_id":"7b9f8d02-e3aa-41aa-9ef3-71e6a716fd44","year":2012},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:408bd38ea50c0ad1374ddd759e4ac8d759399468909f8d7e19bd8a36027e0528","observation_id":"577d4a26-c5ed-419f-94b8-bc41973e13f4","resolution":{"observed_at":"2026-07-10T01:26:43.759166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.765354Z","title":"Bregman primal-dual first-order method and applications to sparse semidefinite programming.Computational Optimization and Applications, 81(1):127–159, 2022","venue":null,"work_id":"737da125-50b0-42aa-8fce-ed1d68c45476","year":2022},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:2182d0e161fb1573c910ed76becb3a0feff697f02d9e5d1fa1527b250dc88fdc","observation_id":"21d69f4e-ebb5-490e-93fb-2ef317a9cf17","resolution":{"observed_at":"2026-07-10T01:26:43.766771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.746656Z","title":"Bregman three-operator splitting methods.Journal of Optimiza- tion Theory and Applications, 196(3):936–972, 2023","venue":null,"work_id":"c8846ffd-8744-4385-a7f4-09c0ae3ff151","year":2023},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:8ff2e780398a43c19b18178837126acc631b7fb6851e2c3cb3d02a260ccde741","observation_id":"07edc46f-b3f4-4674-af0b-c6c604c80308","resolution":{"observed_at":"2026-07-10T01:26:43.747928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.20142","last_updated":"2026-05-16T13:28:55Z","snapshot_observed_at":"2026-08-06T23:54:41.467488Z","submitted_at":"2025-03-26T01:16:42Z","title":"Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity","version":4},"cited_work":{"arxiv_id":"2503.20142","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.20142","snapshot_observed_at":"2026-07-10T01:26:43.250459Z","title":"Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity","venue":"math.OC","work_id":"d164aed6-88d0-4d70-9755-fb20f793501c","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"cited_paper":"/paper/2503.20142","citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:ba4c48a60fd5913bb7c0fc4f4192fca7908a7d19b11e870a3c2e5144c2057284","observation_id":"aa3ecf38-6b5d-4392-ba11-8b800756e272","resolution":{"observed_at":"2026-07-10T01:26:43.251863Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.742998Z","title":"Local second-order limit dynamics of ADMM for SDP.arXiv preprint, 2026","venue":null,"work_id":"7859afc6-8de0-447c-8cb6-6c7800628081","year":2026},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:39d9552acb82638c5453b9c807ae6cfd2f710e17223960e5dd4739744dbf92dd","observation_id":"d53cbdde-d40f-41e3-974d-5d0922ebc9c6","resolution":{"observed_at":"2026-07-10T01:26:43.744198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.744812Z","title":"Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers.arXiv preprint, 2024","venue":null,"work_id":"ed67e33d-fbfe-4dbd-bd79-ee74ee649b16","year":2024},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:c2d4904a529b8ed7aa96b49fc1b896d9a68aef62f37afc2a1aee87f409e0e2f2","observation_id":"523ea1a0-fc64-48fe-b3c3-5f3a5640a2e7","resolution":{"observed_at":"2026-07-10T01:26:43.746106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.737649Z","title":"Lasserre.Moments, Positive Polynomials and Their Applications","venue":null,"work_id":"3a6dba0c-229e-4787-92b4-361efefaf6ff","year":2009},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:f9de1460f1a8189e85d98925a44bd6603c05f51cc26d75cf897f12c4c7e6001b","observation_id":"ed30ecc6-a9b4-4929-8779-6b1afce4848d","resolution":{"observed_at":"2026-07-10T01:26:43.738821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.739400Z","title":"Activesets, nonsmoothness, andsensitivity.SIAM Journal on Optimization, 13(3):702– 725, 2002","venue":null,"work_id":"b8ddc9b4-454a-4a8a-82d3-3bbcb90631c7","year":2002},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:a418bdf5b2b93fb0ab31b68086352541b6ec90b0d993947953fee56c480f85c1","observation_id":"63cca583-238c-48d3-b5b0-df68208620fb","resolution":{"observed_at":"2026-07-10T01:26:43.740634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07628","last_updated":"2026-05-08T11:07:18Z","snapshot_observed_at":"2026-07-06T22:41:29.385811Z","submitted_at":"2026-01-12T15:09:35Z","title":"D-PDLP: Scaling PDLP to Distributed Multi-GPU Systems","version":3},"cited_work":{"arxiv_id":"2601.07628","doi":null,"metadata_source":"pith","pith_arxiv_id":"2601.07628","snapshot_observed_at":"2026-07-10T01:26:43.258985Z","title":"D-PDLP: Scaling PDLP to Distributed Multi-GPU Systems","venue":"math.OC","work_id":"104e16f2-a0e2-4625-86b4-f2dcc1005533","year":2026},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"cited_paper":"/paper/2601.07628","citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:b6622248a2b0d86ed705b2f15fb53fe8ee48a6748abf672632a9404ce69f407c","observation_id":"78431cb5-5026-4fa6-bcc2-208e072acaa5","resolution":{"observed_at":"2026-07-10T01:26:43.260793Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.741166Z","title":"Local convergence properties of Douglas–Rachford and alternating direction method of multipliers.Journal of Optimization Theory and Applications, 172(3):874–913, 2017","venue":null,"work_id":"d5f18200-9375-4a7a-9131-6955bdc30925","year":2017},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:ee1896f7cc60c0821c8b1504971be5c590e265075b3b34bef4c7896c062108fe","observation_id":"af9f2bcf-7668-4ca3-bae8-a3a0d24bd290","resolution":{"observed_at":"2026-07-10T01:26:43.742449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.00311","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.253175Z","title":"A practical GPU-enhanced matrix- free primal-dual method for large-scale conic programs","venue":null,"work_id":"d48283a2-4074-4746-bd26-b50840399566","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:e287d39ed3180137be8b01d36eddc118eddc9f75387eed76273014e01a37448e","observation_id":"162d2397-d162-47ea-aaf6-176e643228d0","resolution":{"observed_at":"2026-07-10T01:26:43.254893Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.767539Z","title":"cuPDLP.jl: A GPU implementation of restarted primal-dual hybrid gradient for linear programming in Julia.Operations Research, 73(6):3440–3452, 2025","venue":null,"work_id":"fd9956f0-ba28-42d5-b495-c1199d77c351","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:1bec08ecfc3ce949c22ed73777f27b11ccab254814ad40d9ad6108a601a6507b","observation_id":"0371c2c4-4868-40ad-8242-1eb9f6eecc01","resolution":{"observed_at":"2026-07-10T01:26:43.768892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.769514Z","title":"On the geometry and refined rate of primal–dual hybrid gradient for linear programming.Mathematical Programming, 212:349–387, 2025","venue":null,"work_id":"238bd975-fa66-496e-842d-dc64635d55a0","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:7b9f4fa1d6299efa4e99c5e1a3ff9714199151f729718f624ab489e9771c5827","observation_id":"06dc7c93-9cf2-4f85-ad5e-d51d7dc2e1b0","resolution":{"observed_at":"2026-07-10T01:26:43.770830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.730416Z","title":"Understanding the convergence of the preconditioned PDHG method: A view of indefinite proximal ADMM.Journal of Scientific Computing, 94(3):60, 2023","venue":null,"work_id":"9268502b-7ff5-4b84-9568-35a0d24f513d","year":2023},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:ed06f03d1a099b0f8ac78c8f881b637600bfb4f11ab73755ee18573f694c9f54","observation_id":"0da40487-87b3-4558-9cd7-051aa2d86c02","resolution":{"observed_at":"2026-07-10T01:26:43.731777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.732377Z","title":null,"venue":null,"work_id":"edc314d5-5886-4a09-b043-d5deccea6950","year":2020},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:c9ea9b62abba50d7dcb80c61853964629b5870e7e5ce5e43b10377c52c2d2cba","observation_id":"c0401049-22b6-4a62-8af8-dcb879407069","resolution":{"observed_at":"2026-07-10T01:26:43.733502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.719377Z","title":null,"venue":null,"work_id":"c7cef6c3-1b08-4415-8eec-b91fb154a769","year":2026},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:01d49cd6b0138d166934d30c28894869d9ce19ca6ea239b538c291fe9b172527","observation_id":"779bfa35-8650-4a48-b691-702f32b80f3b","resolution":{"observed_at":"2026-07-10T01:26:43.720502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.722768Z","title":"On the equivalence of the primal-dual hybrid gradient method and Douglas–Rachford splitting.Mathematical Programming, 179(1–2):85–108, 2020","venue":null,"work_id":"c51c2dac-4103-46ec-b2fc-bad0bb864f8a","year":2020},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:da63d4c33fad5018c1966ef4db40ae10f1a6fba48648ab647c4f35d877fbf4d0","observation_id":"cc06681a-e945-48b7-983d-a00a5ea6c339","resolution":{"observed_at":"2026-07-10T01:26:43.724112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.709412Z","title":"An algorithm for minimizing the Mumford–Shah functional","venue":null,"work_id":"d9286fb5-3caf-4bcd-979a-94a0746ff522","year":2009},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:6dd87e636b0863bb7ad2b72adf3f33abaa9fbda2a91111022ecf5b91cab7851c","observation_id":"d5e46b55-a44a-4edb-ba9d-fff76f67684b","resolution":{"observed_at":"2026-07-10T01:26:43.710978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.715427Z","title":"Tyrrell Rockafellar","venue":null,"work_id":"4c07cea3-3b95-4161-8236-034b7b8704f6","year":1976},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:d7513c8fc18336819b80051c6106cd10f259ef1880648e77ee4557718eacdb6e","observation_id":"2a38e60d-280e-4e5c-bfe5-46484c24aaa1","resolution":{"observed_at":"2026-07-10T01:26:43.716647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.721056Z","title":null,"venue":null,"work_id":"945c9937-0b66-4a57-80f9-5db279cb617d","year":1999},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:d3cbce58b2b846788a074798941944347cfb953abc5129e8eedf3c9f32e366a1","observation_id":"f8371c87-7bb1-44e2-9c99-de4f08a469b1","resolution":{"observed_at":"2026-07-10T01:26:43.722133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.735703Z","title":"Semismooth matrix-valued functions.Mathematics of Operations Research, 27(1):150–169, 2002","venue":null,"work_id":"cea785c0-7065-4b34-a4ab-0ba61ba678ab","year":2002},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:c64d85239300eb31211d442bb3d800034932cb11e4e3ddb883f6f01587f18f59","observation_id":"58c09153-e1d1-4788-b46c-981f88fb0c6b","resolution":{"observed_at":"2026-07-10T01:26:43.737066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.17089","last_updated":"2026-05-16T17:13:47Z","snapshot_observed_at":"2026-08-04T22:44:22.293518Z","submitted_at":"2026-05-16T17:13:47Z","title":"A preconditioned augmented Lagrangian method for solving semidefinite programming problems","version":1},"cited_work":{"arxiv_id":"2605.17089","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.17089","snapshot_observed_at":"2026-07-10T01:26:43.262026Z","title":"A preconditioned augmented Lagrangian method for solving semidefinite programming problems","venue":"math.OC","work_id":"4cdf387a-df0f-457f-9923-b33c49e34778","year":2026},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"cited_paper":"/paper/2605.17089","citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:515e7bc487f567d309cc39d1f028066b0d6ac92184cc0d15d223eb2e1b596c06","observation_id":"6be56a52-3b46-47cc-af3e-c3152cdf9ff0","resolution":{"observed_at":"2026-07-10T01:26:43.263243Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.771415Z","title":null,"venue":null,"work_id":"0969ceb1-b39d-4496-9bb3-37ab5532eb14","year":2001},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:38cbb52be90cfb87d9a46dc6408437b489200d52c9fdd35033c761dc8de6fecd","observation_id":"8777fe1b-8e77-4334-a09f-51136f7a7b08","resolution":{"observed_at":"2026-07-10T01:26:43.772507Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.713500Z","title":"Tütüncü, and Michael J","venue":null,"work_id":"e9e4a6db-826a-4afa-af0f-b623e38b9e6e","year":2002},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:c60ee86d7434126c16274cdaba02931454b810705b4c707026d2ffc01dfe509a","observation_id":"cfba5b9a-be2a-43d0-9f02-adbb6d31712d","resolution":{"observed_at":"2026-07-10T01:26:43.714794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.717403Z","title":"The Chambolle–Pock method also converges weakly with0< θ≤1andτ σ∥L∥ 2 < 4θ(2−θ)/(1−2θ+ 9θ 2 −4θ 3).arXiv preprint, 2026","venue":null,"work_id":"8e152f97-e991-4e02-8df1-4a5cc9688b43","year":2026},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:6fada65f1d2f3f4ad18f0fe79b4db9b1619a10c6d21fb4b13444a8046f3739bc","observation_id":"2c40c5c6-3d13-4ea1-bd1d-409a7fd39f34","resolution":{"observed_at":"2026-07-10T01:26:43.718764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.711632Z","title":"Andersen","venue":null,"work_id":"59bbb860-9cf0-44a4-a4e9-1f19aff2819f","year":2015},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:26fc26c62b2d92c316e4f1da2fee02d39323728e689dd107bea825a372b89272","observation_id":"6e498302-334a-4858-bd1a-960aec746026","resolution":{"observed_at":"2026-07-10T01:26:43.712923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.726787Z","title":null,"venue":null,"work_id":"1f142dd2-df9c-46d9-bc79-639989572eb3","year":1996},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:134794e8499e1942c5935b2f2d14e4c170c902e39e7c9a1c09815c053d9a1142","observation_id":"4db5d666-0c78-49e0-8a26-7b8435b29025","resolution":{"observed_at":"2026-07-10T01:26:43.727965Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.707269Z","title":"Solving low-rank semidefinite programs via manifold optimization.Journal of Scientific Computing, 104(1):33, 2025","venue":null,"work_id":"d9750e35-40db-4429-8fc0-fb731a0b4b49","year":2025},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:c092b5087dbcf9f73626d05179b76158b5f1160366b65498650d834a93bfea7b","observation_id":"e72526dd-b652-4c72-b59c-beb9f3358d28","resolution":{"observed_at":"2026-07-10T01:26:43.708729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00311","last_updated":"2024-02-01T03:50:12Z","snapshot_observed_at":"2026-07-06T17:23:31.057358Z","submitted_at":"2024-02-01T03:50:12Z","title":"A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming","version":1},"cited_work":{"arxiv_id":"2402.00311","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.00311","snapshot_observed_at":"2026-07-10T01:26:43.264407Z","title":"A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming","venue":"math.OC","work_id":"ca95665b-c44f-4237-9f7f-700ac5aaa94d","year":2024},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"cited_paper":"/paper/2402.00311","citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:bf08f49e9f653b5928991b823fb47dea44d303673950a509b3a4f503ebaac4e4","observation_id":"bc32b8eb-9815-417b-b541-57409a0bced4","resolution":{"observed_at":"2026-07-10T01:26:43.265616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.701617Z","title":"Alternating direction augmented lagrangian methods for semidefinite programming.Mathematical Programming Computation, 2(3–4):203–230, 2010","venue":null,"work_id":"dcc66382-dbc3-4063-8b57-e38020f15f52","year":2010},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:0a2427a577e3e052dcad18246f73d44ee246ca03d10efcbc33c71cc8ede2c63f","observation_id":"73b503fe-21cf-41c1-90e7-e366b8eff50a","resolution":{"observed_at":"2026-07-10T01:26:43.702997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.724756Z","title":"Kluwer Academic Publishers, Boston, MA, 2000","venue":null,"work_id":"cda7387a-b032-4f17-b762-724424d37b6d","year":2000},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:ab0a29f5b2d7eecf72751f57d54ae663e0b782240dc89a9c7a19ed64796947e9","observation_id":"c006c5c7-ef97-4d59-a1c1-c5162755ae3a","resolution":{"observed_at":"2026-07-10T01:26:43.726108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.734074Z","title":null,"venue":null,"work_id":"d33a8060-82e8-47f2-8146-7bc8cbea1815","year":1993},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:28733604ac97c45d0b00c607c9c3077e07abfcd45fa1e8a09d5294f08239a5b9","observation_id":"7f458a44-ac9c-4048-ad79-a905ba0dcf2b","resolution":{"observed_at":"2026-07-10T01:26:43.735147Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.703609Z","title":null,"venue":null,"work_id":"15913350-8208-4860-a020-3e7845e79cf7","year":2023},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:b1d01128cba4ca52e49dbf7c9c54e187193c2f64bb721921fe04c749e414293a","observation_id":"94b6e376-7fd6-4174-92b6-f1f22abda7dc","resolution":{"observed_at":"2026-07-10T01:26:43.704740Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.699676Z","title":"SDPNAL+: A majorized semismooth Newton-CG augmentedlagrangianmethodforsemidefiniteprogrammingwithnonnegativeconstraints.Mathematical Programming Computation, 7(3):331–366, 2015","venue":null,"work_id":"c0349e1e-e89f-48b0-9099-b7054e1aa156","year":2015},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:6649db83b0482676bf2fa939780634ab2ad2a24d0d84f1d03d92e2758ac51af2","observation_id":"4328a234-6155-4ccc-84cf-9f1f6417315c","resolution":{"observed_at":"2026-07-10T01:26:43.701011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T01:26:43.694029Z","title":"A Newton-CG augmented lagrangian method for semidefinite programming.SIAM Journal on Optimization, 20(4):1737–1765, 2010","venue":null,"work_id":"1928fc1f-9ce8-425e-810d-882645f841b1","year":2010},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:c4b27c18dfeb1e38dfabc8d86e62e8397c3a9ea86dd25346a3ed53b171e64950","observation_id":"f86e138b-d464-452c-bdb1-5ea2d4695b29","resolution":{"observed_at":"2026-07-10T01:26:43.695364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":11,"verified_exact":6,"verified_fuzzy":48},"total_outbound_references":66},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 0 inbound Pith citation observations for arXiv:2607.08035."}