{"as_of":"2026-08-21T06:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:642ce15bec4e01eb2c4c0e2754690a032986b75299d51fef83dba6a606b95aeb","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:02:24.392036Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.16890/citation-record","integrity":"/paper/2504.16890/integrity","json":"/paper/2504.16890/citation-record.json","paper":"/paper/2504.16890"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.654914Z","title":"Altschuler, J","venue":null,"work_id":"3136bae3-fb95-4aa4-848f-3b3de9296858","year":2017},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.316660Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:d8de5d9e26bc340638f4a72a0916ee6e8fe721d83091091c64f1ea2dd316a142","observation_id":"945aa80f-c799-435c-b241-07f1f45ae3b1","resolution":{"observed_at":"2026-08-16T11:02:24.658474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.644679Z","title":"Ambrosio, N","venue":null,"work_id":"37b6ff51-93e8-4923-bd78-07fcce170a74","year":2008},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.320778Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:a2f9ccb3671cbd1f94e187f6b5b606019dc92015e8f5c06fa0cb1b934aa8be8b","observation_id":"1674fbd8-916d-4b95-b519-be8522e8453c","resolution":{"observed_at":"2026-08-16T11:02:24.647903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.633182Z","title":null,"venue":null,"work_id":"95768769-2f21-4b5e-bb8c-093bcadd2d09","year":2008},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.324405Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:032995cbf926d07062801e8af15d5e2ed36381882411a79b785e8e35810acfeb","observation_id":"5f21d23d-810b-4271-8225-1ed93fee884a","resolution":{"observed_at":"2026-08-16T11:02:24.637259Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.622242Z","title":null,"venue":null,"work_id":"4dc780da-5773-4e13-bdb9-48270cd6a688","year":2002},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.327852Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:bf0d62299944734d34a78c1d2c50adf3ebe318a0953223d8db232e439bb5c942","observation_id":"14afc683-0662-4f17-9a60-7ae39abb0062","resolution":{"observed_at":"2026-08-16T11:02:24.625910Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.610584Z","title":null,"venue":null,"work_id":"a26709fb-388a-49d8-9880-df3a3dded4d1","year":2022},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.331966Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:201d8eecf723b7221b252657ad00e2b708d5e2e1647d55dcfbc63f8b1105a835","observation_id":"76cb38c8-09a8-4c83-a583-17cdbe233f55","resolution":{"observed_at":"2026-08-16T11:02:24.614266Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.599269Z","title":"Cavagnari, G","venue":null,"work_id":"e65c39cc-96af-4d44-b125-b8ecda090cb8","year":2023},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.335573Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:103f723ff6560b9eb0cb4132fced18a3d3fafff3dd4330a12c6e1a5960596ca9","observation_id":"48c3c701-d03d-4383-9218-19595ba89719","resolution":{"observed_at":"2026-08-16T11:02:24.603275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01202","last_updated":"2025-07-17T20:37:04Z","snapshot_observed_at":"2026-08-16T13:38:09.450408Z","submitted_at":"2024-07-01T11:49:30Z","title":"Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01202","snapshot_observed_at":"2026-08-16T11:02:24.339976Z","title":"Chizat, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.339976Z"},"links":{"cited_paper":"/paper/2407.01202","citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:cf0a45d0d47edccc2de4013f109cce42c4c1827bfdb14a51755c77f31d5399dc","observation_id":"f313388a-2f61-4051-b7ad-6766b1723dbf","resolution":{"observed_at":"2026-08-16T11:02:24.339976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.07403","last_updated":"2025-02-10T16:46:27Z","snapshot_observed_at":"2026-08-20T02:02:31.862937Z","submitted_at":"2024-11-11T22:19:41Z","title":"Coupled Wasserstein Gradient Flows for Min-Max and Cooperative Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.07403","snapshot_observed_at":"2026-08-16T11:02:24.343706Z","title":"Conger, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.343706Z"},"links":{"cited_paper":"/paper/2411.07403","citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:0af5eb905340098592fd0bc952be3d0e0b3608ddb8db7970a1d4ad6eaf66083e","observation_id":"7afcb653-9680-49f0-bf81-cfeb42474734","resolution":{"observed_at":"2026-08-16T11:02:24.343706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.588453Z","title":null,"venue":null,"work_id":"fc83a8bf-900c-4aca-b2eb-53f9661fee12","year":2013},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.347421Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:55c1ad51d8ee1933f25caba5dc03f8a230e44ca6f01fcca7cfd287ad24fd9308","observation_id":"e09a167c-58bf-46e1-aa71-61fe2e0dd92e","resolution":{"observed_at":"2026-08-16T11:02:24.591928Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.16421","last_updated":"2025-09-02T14:55:44Z","snapshot_observed_at":"2026-08-18T01:46:47.829150Z","submitted_at":"2023-07-31T06:11:47Z","title":"Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.16421","snapshot_observed_at":"2026-08-16T11:02:24.350663Z","title":"Deb, Y.-H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.350663Z"},"links":{"cited_paper":"/paper/2307.16421","citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:e2b53df316f402af505e9818371dfcb40d356d7810b16eaafc67d160c09a8f64","observation_id":"a2255f66-f05c-4b88-b05e-86991fb1c5e6","resolution":{"observed_at":"2026-08-16T11:02:24.350663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.577621Z","title":"Feinberg, P","venue":null,"work_id":"e9c5a626-131f-47b7-b00b-c2a497209ce8","year":2020},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.354124Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:b8df9dc056e49b84c6317a123db58c14932339541608234aa626f9113cb09e35","observation_id":"2e77e7f9-96de-49d8-a20a-f4d24d224f49","resolution":{"observed_at":"2026-08-16T11:02:24.581358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.565574Z","title":null,"venue":null,"work_id":"07d6ac4b-c60f-4d67-ab02-7f19bab56253","year":2024},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.357018Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:f9f03a6794919b5fb0d1b922928cfc69c2d677abb029508029e370a86be54051","observation_id":"e78e4897-6d9b-460d-90f6-9f3e37af938f","resolution":{"observed_at":"2026-08-16T11:02:24.569277Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.555748Z","title":"Korotin, V","venue":null,"work_id":"30cc5c8d-c918-433c-9783-09a0deb92ce7","year":2020},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.360532Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:5f4112b6b5a9f9eb0e07674b3a55d2d81ad04cef35fc0af680dc5d651c8109c6","observation_id":"b06dbf51-a307-4bc4-87e2-f0f58dea2f6a","resolution":{"observed_at":"2026-08-16T11:02:24.558812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.545719Z","title":null,"venue":null,"work_id":"aea901db-5acd-42aa-bb0c-bd2dab7666cd","year":2023},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.363929Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:3a9965b3c2db203cc16940e9caa2a8cb4701e326e13d271761527d32883d8c9b","observation_id":"2cf70743-8e2f-496f-829f-ac3824ed9d93","resolution":{"observed_at":"2026-08-16T11:02:24.549013Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.532010Z","title":null,"venue":null,"work_id":"2de0d8c7-8527-4e68-a05d-4f54f397329b","year":2018},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.367440Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:dc5bf1be17a20382a64dac53129e9d4085497fd19260679deb4ef33301aad146","observation_id":"12b072a4-3a53-4fc2-8f7b-51a8d0f2e8e1","resolution":{"observed_at":"2026-08-16T11:02:24.536611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.06088","last_updated":"2021-06-01T19:39:53Z","snapshot_observed_at":"2026-08-18T01:48:07.166436Z","submitted_at":"2021-05-13T05:32:28Z","title":"Approximating the Optimal Transport Plan via Particle-Evolving Method","version":2},"cited_work":{"arxiv_id":"2105.06088","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.06088","snapshot_observed_at":"2026-08-16T11:02:24.422131Z","title":"Approximating the Optimal Transport Plan via Particle-Evolving Method","venue":"math.OC","work_id":"b100c06d-7458-4f21-8771-8495bbb2c7b3","year":2021},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.370728Z"},"links":{"cited_paper":"/paper/2105.06088","citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:97a67cc13ecc3a7d7ef947b848dd9f893e027c410be82edebbe8cad41d43094c","observation_id":"3589b455-68dc-45fb-bacf-5ba7caee8703","resolution":{"observed_at":"2026-08-16T11:02:24.428093Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.520434Z","title":"Pandolfi, L","venue":null,"work_id":"0a6e5800-5e70-442d-9ad5-3dcb12fbb634","year":2023},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.374414Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:e0ea400ea12876f5c1057062a837941bb9680cfd47af9cdc563f483b8441df59","observation_id":"4b3ce72e-5211-4a9a-9424-cdb3a5541049","resolution":{"observed_at":"2026-08-16T11:02:24.524368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.509116Z","title":"SIAM Journal on Imaging Sciences, 7(1):212–238, Jan","venue":null,"work_id":"533b058c-9f30-4246-8030-e4b3dddaf3df","year":2014},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.377716Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:f40a88605aeaf35fbca5a09f4d62cd68d1a03536858b233ea2b90220565cf325","observation_id":"9edb1b83-539d-420a-80d6-654f175acb93","resolution":{"observed_at":"2026-08-16T11:02:24.512929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.497953Z","title":"Sanz-Alonso, A","venue":null,"work_id":"c5c1ad86-bf13-430f-b36f-22590fc4445c","year":2023},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.381477Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:65105a97a067c4182419ed959c71af92eb3011b29e53c35d9a4faa647bae649a","observation_id":"09db6444-1f50-48cd-9bf1-701df4bfd682","resolution":{"observed_at":"2026-08-16T11:02:24.501677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.486796Z","title":null,"venue":null,"work_id":"3f6ca4f6-bcd5-48ab-bb6a-cf754c93cccc","year":1999},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.384857Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:5c86067bc23ba0e08d7ec17316273d667309ee9028a63d4bc7e9fcf75f724f53","observation_id":"22482745-59f8-4bc6-8014-fc11498addf5","resolution":{"observed_at":"2026-08-16T11:02:24.490326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.475980Z","title":"Seguy, B","venue":null,"work_id":"8ae80617-379f-4623-8f1a-e84dbd886e38","year":2018},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.388699Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:94fe826a866b70c9ccebf38e7a5a026f8518028d6ab547b5c697ce6aa429bf07","observation_id":"e642d11b-6005-4468-a186-2ff8a59f1918","resolution":{"observed_at":"2026-08-16T11:02:24.479307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:02:24.466351Z","title":null,"venue":null,"work_id":"c11bafca-fcfc-48d3-bbc5-a7e0352a5494","year":2005},"citing_paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T11:02:24.392036Z"},"links":{"citing_paper":"/paper/2504.16890"},"observation_digest":"sha256:ce78f4c55ccacc30c4a6c4317e446ebef5802deb4168de50e42396fee22c4d5a","observation_id":"58e2bbcf-016e-4b4e-b4d7-54e5f58c798b","resolution":{"observed_at":"2026-08-16T11:02:24.469379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.16890","last_updated":"2025-05-27T16:14:18Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T01:47:33.512215Z","submitted_at":"2025-04-23T17:11:34Z","title":"Computing Optimal Transport Plans via Min-Max Gradient Flows"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":9},"total_outbound_references":22},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2504.16890."}