{"as_of":"2026-08-10T10:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29c136718b53a2a6e4bb55a9657e0c4bc1a55e693be2fa1a237708c78942158e","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T20:31:19.031102Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T00:38:04.840316Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.18724","snapshot_observed_at":"2026-08-01T00:38:04.840316Z","title":"arXiv:2606.18724 (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26235","last_updated":"2026-07-30T09:57:03Z","snapshot_observed_at":"2026-08-09T01:27:36.629917Z","submitted_at":"2026-07-28T20:15:41Z","title":"Inertial Primal Dual Dynamics with Hessian-driven Damping for Saddle Point Problems","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T00:38:04.840316Z"},"links":{"cited_paper":"/paper/2606.18724","citing_paper":"/paper/2607.26235"},"observation_digest":"sha256:780b559ce30049db5cb1f66c594af34eaaa2ab4e5f23333fc6dd48a4d9020538","observation_id":"45436575-9870-4efb-968f-1cd03ab3c5e9","resolution":{"observed_at":"2026-08-01T00:38:04.840316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.18724/citation-record","integrity":"/paper/2606.18724/integrity","json":"/paper/2606.18724/citation-record.json","paper":"/paper/2606.18724"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Attouch and A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:e98b02fbdd65b54b09f79820927428caaf11f33429b21cd24c791e3687046af0","observation_id":"7ae829d0-8428-419d-a011-fe77032b41ad","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Attouch, Z","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:7472383d64ec90b8cf3f60ef93765bc213d91b07bcd47f02607757aeafdb7a91","observation_id":"a0815554-10ba-4d5e-b6bb-a87b64e52037","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Attouch and J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:fef466833637a3aefaabce7ddf18a0e178796250063a2404387322f287f52ba2","observation_id":"b6e4ec51-cb95-494c-a3f6-75af18af7f6b","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:d2aa36e2d74e29aa544968f5e98c16ead62abc66cbe0caa62115e99abe4667fa","observation_id":"7f447a4f-58fc-45ec-a616-c59137d6b0ac","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.22715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T01:19:20.588064Z","title":"The iterates of Nesterov's accelerated algorithm converge in the critical regimes , year =","venue":null,"work_id":"76367686-302d-4d1b-ad7d-347b0a371f8a","year":2025},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:03fbb077b89682e985e63ee7dff957bc386c3341ccbb518bc77883b17229aebe","observation_id":"c8f8dc22-41f1-4ee7-a11b-84de227d96cc","resolution":{"observed_at":"2026-07-04T01:19:20.590455Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:c2b614d8b271e15ec56af5255ffc0a394dadc26023d3f0dccdcd797b5b741bcd","observation_id":"802a5993-7f0a-40c0-9bc0-c54eab6d9a52","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:02cee422a44c23bd53c7b29f767284fb1e210376c75857b2b52fd4d521252ceb","observation_id":"3e28d295-af98-467f-a901-1ee91d0b30b1","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:910c870a7cdd5c24fa724bbfd0cd764675ddc44f228e0f1d4cd46c3a7b87198d","observation_id":"da0f4baa-3b73-46b8-98ca-7c431d834cfa","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Chambolle and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:917c9251e264b7c9f0d7266f7e5941eba7ef8bd0fdef21bd59e69a2387eff490","observation_id":"3c8f3258-1ebb-44bd-9f45-6319e38c7250","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Chambolle and T","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:a564402deb971b3588a1033e70ebbc284715d7af96ec992fe47317af4eb2d586","observation_id":"e7dcd218-9306-4ea9-a484-d7bbb8319cf3","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Chambolle and T","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:18bfbb9751a051021228c071f5cd5f745eefdcf7922d29a3cd75ef94c42f851c","observation_id":"125f5e52-8928-4115-baf0-a107375c1d4e","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Chang and J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:e882334db9348cf4ae5ab1702ea91c68ea445321fcad8e87ec0e4c2e1c9bf36d","observation_id":"abe3bbc7-aa20-40e3-b9f6-9fc84fc4d0ad","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2604.0924","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T01:19:20.583638Z","title":"Condat, A","venue":null,"work_id":"e2492038-ddd2-42c2-bc45-60c397ef9362","year":2026},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:ad691405991e2180f28a2e58b15c3111fc6e7074552c20ce8dbbe26beace8db2","observation_id":"a8f1ded3-efe8-4f4a-b93a-59e88af8adeb","resolution":{"observed_at":"2026-07-04T01:19:20.586836Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:2886658e1659ebd8701a08336216270b5ec0dd053512d7466efba63ba7acec6d","observation_id":"39f7c40b-bd68-4f9d-9ecc-6cb9e7b4b7ba","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:450f49bbd72e9c281cea5eb42f163c09dc408dd298be46d0a0c5f2b19cbfbd58","observation_id":"215e682d-c534-48ca-97ec-323563878864","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:9fe47840c5e6e903bee3b514bcd08388484c59c077244d07787f19d58bd4b78c","observation_id":"263472fb-229f-4fa7-b4b8-a4d54b2b9639","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"He, N.-J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:58dda2de9c9fa5dbf696e69ae6ae3704b505290070b3c288de19277a1f7c789d","observation_id":"a16397ac-693e-4a7c-b300-76e67e25d3d6","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:52f49666dcdd5f07c3622872d569fae25d6f518c5ab8d78c0e60b9325a482825","observation_id":"2aa88e8d-4417-4a15-8a6b-b5e559d5223b","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:ea5fdc24d08f1daacf1b368cecfaf85f1b8485d5f99bca5859114199072c9d34","observation_id":"668f2db7-6138-4f5e-b037-a34fcecfb9c8","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.19467","last_updated":"2026-05-27T15:15:54Z","snapshot_observed_at":"2026-07-06T23:30:11.337726Z","submitted_at":"2026-05-19T07:20:39Z","title":"Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization","version":2},"cited_work":{"arxiv_id":"2605.19467","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.19467","snapshot_observed_at":"2026-07-04T01:19:20.577736Z","title":"Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization","venue":"math.OC","work_id":"ebc277fb-610b-44cd-998c-6bf785f5ef46","year":2026},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"cited_paper":"/paper/2605.19467","citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:d22f4768d65d9ec2a6c77f9a968f8e0fad563d26f05918f8be933595714ed3b2","observation_id":"b5553faf-a821-4871-97fe-b03cf8708aac","resolution":{"observed_at":"2026-07-04T01:19:20.580744Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:7d36ffdae5c96cf460ff65deffbd927eb053114e313fada2e41f234a724ce3c7","observation_id":"88225e57-a671-461b-aa81-43e9c101f8cb","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.08258","last_updated":"2025-09-10T03:32:14Z","snapshot_observed_at":"2026-08-10T10:15:13.700140Z","submitted_at":"2025-09-10T03:32:14Z","title":"Nesterov acceleration for strongly convex-strongly concave bilinear saddle point problems: discrete and continuous-time approaches","version":1},"cited_work":{"arxiv_id":"2509.08258","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.08258","snapshot_observed_at":"2026-07-04T01:19:20.572652Z","title":"He and Y.-P","venue":null,"work_id":"8c304b65-6341-44d1-8fc3-4194f5a4a160","year":2025},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"cited_paper":"/paper/2509.08258","citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:5a35418311c12b789e9662e1ae1f9755b77c18b597329f02daa7af8b79e13f00","observation_id":"db1c3cd6-68cb-4228-a1ed-a2e77f7de81e","resolution":{"observed_at":"2026-07-04T01:19:20.575233Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.18236","last_updated":"2026-05-27T14:53:36Z","snapshot_observed_at":"2026-07-06T23:29:09.538843Z","submitted_at":"2026-05-18T11:31:07Z","title":"Trajectory convergence and $o(t^{-2})$ rates for Nesterov accelerated primal-dual dynamics without Lipschitz gradient assumption","version":2},"cited_work":{"arxiv_id":"2605.18236","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.18236","snapshot_observed_at":"2026-07-04T01:19:20.589084Z","title":"Trajectory convergence and $o(t^{-2})$ rates for Nesterov accelerated primal-dual dynamics without Lipschitz gradient assumption","venue":"math.OC","work_id":"2efb8c74-101c-4407-8110-d2d95d2f040e","year":2026},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"cited_paper":"/paper/2605.18236","citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:3c5944bf60c7c6dd55240e9704549f28d32d2b52dc9ca9b0beb8f9541a3fd218","observation_id":"fa907bf6-2010-42e7-98d5-1fc7c23ce1af","resolution":{"observed_at":"2026-07-04T01:19:20.592086Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.23513","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T01:19:20.594230Z","title":"Point convergence of nesterov’s accelerated gradient method: An ai-assisted proof","venue":null,"work_id":"b65158fa-8e68-46b2-96aa-0c044c4eeaed","year":2025},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:fa068ca5471f5e532f6902b19349594c205a3edbe7f1dbf388e0d93b8556ad2d","observation_id":"63858170-f621-4548-9dc4-200836955d92","resolution":{"observed_at":"2026-07-04T01:19:20.597156Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Khalafi and D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:6dcecf9ad686e915019cf3006f9e45cd629b2117403a476ce8cea35be860b098","observation_id":"1c3267ec-8fa3-4c38-85b6-feae001df5d8","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:bf346b6abeaed35d76a3708e55fea3c6ee6f8664560dc35bfcaa265237c044db","observation_id":"9d56fec3-0e6f-4785-b1ba-fe8c056d0346","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Luo, Accelerated primal-dual methods for linearly c onstrained convex optimization problems, J","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:1a5f78487474a7ae1048cc006694bb8c6a4bcd9acd5ad63219963b0a114e25d4","observation_id":"3f94a8de-f528-4ca3-852c-cb220f32d9aa","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Luo and Z","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:482f8589252eb33ecbd8a07cafcbdcc6b1b4588afd586e10a8e169c2533c3237","observation_id":"e2145031-9b0c-414f-9607-4495781098c3","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Malitsky and M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:a475a0fe43b9b0b6a88cc69491aa4ac1f80f3855cd15e4904319a42f29f53cd7","observation_id":"b9e99b20-1359-41ef-bd4b-0ffee996258c","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"May, Asymptotic for a second-order evolution equati on with convex potential and van- ishing damping term, Turk","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:075bba3f53be8f6ec75d5e0fa0593cca4855799ec37af218c43ad4ff49eb7836","observation_id":"231e8b9f-dcb5-42ff-a045-f93e99749ae0","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Mokhtari, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:7606b6ef1c530a05a4b0258ceda2a022994b75278589d322ea316af204931a8b","observation_id":"c5743790-0e23-458b-a7f7-c98df8a626ca","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:5f8803fb8003d4e7e40185a926ae2f0d45c5aae4d5f727c29e6a0a972163a813","observation_id":"f46872a6-7bec-44cb-9572-d9e292f6a890","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Nesterov, A method for solving the convex programmin g problem with convergence rate O(1/k 2), Soviet Math","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:47d80e9bc9e25a34af410d1ce2e91926c63c81c37a412364934de2cc4603a907","observation_id":"e00fc6a4-5f27-405c-9554-efe2a5ad2333","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Nesterov, Lectures on Convex Optimization , 2nd ed., Springer, Cham, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:0677dbbd16594c8f0b02427f0e699b5c070161f9760a966f37ca89be3b1529ad","observation_id":"c0593171-cad9-45b2-b90c-0de75542cdfe","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:e16ee340ea399f854b725c354866cae46d6a0265e7daa261fa8521b860414b00","observation_id":"e66f05e7-cc08-4cf3-9b5f-1e269ea4fb12","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:89efda0161396bd48dc5f316c09be15ef86c6a15888ceaf61e1b20ee14d624c4","observation_id":"8eff5366-0242-4fd6-8a35-cf3ea6398c70","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Tran-Dinh and Y","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:31760ee3165473eac652a3214906c9abd6de6f9f7bb443365e6f3e2d9ef16eb1","observation_id":"9ad9f6a0-dc4d-4e98-90f1-47864e5c8528","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Tran-Dinh, A unified convergence rate analysis of the accelerated smoothed gap reduc- tion algorithm, Optim","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:65e1f0020831521b1f47cef6b5df0696118e616cacd6c60115c1ed7a6d7a6f37","observation_id":"ffcac9ff-f6e4-4e40-ad00-cd84fd0c5d7c","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Tseng, A modified forward-backward splitting method for maximal monotone mappings, SIAM J","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:0f270197116ea3b58c6e8f85df060e436015d8209d3b7138c2e221336cf281b6","observation_id":"83b36a39-fa20-41e3-8b7b-b817a546b8b0","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Wang and J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:bed27ff72d05c5fff0ae6f608641220d9dd0d7021896fca91e8e8f7f5ea84414","observation_id":"bb941d3c-19e5-4423-a63f-a06e525984b9","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":"Wibisono, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:43e28639c77bc0690d1e0479f4b0a08b177312e89f6665ed169a90565dcb015f","observation_id":"bb8cbe13-b191-49e4-a2fb-b798739fc04e","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:e46fa5135fa27a7f252b34adc4463090a74d2b035767619b81dfa821bda9db26","observation_id":"5289a513-f0e6-48bf-8198-6910e676e2e3","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:1b74ed472d20c4c0c6996e7c2e81d71aa3f9a685c11d8f39f1acb0d5ad27c376","observation_id":"fc9961b7-855b-4c61-b157-968227a92c8d","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T20:31:19.031102Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-26T20:31:19.031102Z"},"links":{"citing_paper":"/paper/2606.18724"},"observation_digest":"sha256:37944844bdc0ddb8b6e626483bbf10e9c7b03306560727a0267556500b65f30e","observation_id":"585d9139-e193-45f2-9d4b-dc78114c3bc6","resolution":{"observed_at":"2026-06-26T20:31:19.031102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.18724","last_updated":"2026-06-17T06:03:49Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T06:27:56.994062Z","submitted_at":"2026-06-17T06:03:49Z","title":"Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":44},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 1 inbound Pith citation observation for arXiv:2606.18724."}