{"as_of":"2026-08-22T11:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b8c05f8b7fd3c1113e2d522fa2e48b4031572ecd1593e44ed9b164f5856ed15","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T20:06:08.915256Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.16782/citation-record","integrity":"/paper/2607.16782/integrity","json":"/paper/2607.16782/citation-record.json","paper":"/paper/2607.16782"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:06:04.905612Z","title":"An in depth look at the Procrustes-Wasserstein distance: properties and barycenters","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:04.905612Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:61ea7165b4db38ecb92084922597d270346e2bb79d80b2c8cba6e390b26b5aab","observation_id":"9f4fdbfa-a956-40d9-a597-e7448f96ac0a","resolution":{"observed_at":"2026-08-01T20:06:04.905612Z","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-08-01T20:06:05.051927Z","title":"Optimal transportation under nonholonomic constraints","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.051927Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:b9e996efb3ffce4c27be56c7273f7bb77c0a2ddc9225484a9ace47b67699beb0","observation_id":"af4932ce-65c7-40bf-96a1-edec1467d84a","resolution":{"observed_at":"2026-08-01T20:06:05.051927Z","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-08-01T20:06:05.155280Z","title":"Agrachev and Yuri L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.155280Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:73329d0359ebe082890bc812ab657035e296b0a1501a26adcbf732c04de26d39","observation_id":"b7874fdc-8014-4f31-b994-fa521ce6b329","resolution":{"observed_at":"2026-08-01T20:06:05.155280Z","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-08-01T20:06:05.276430Z","title":"Towards optimal transport with global invariances","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.276430Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:41532c3302f6b053ed9c307e1c31595b845de1228e1fcb5dde304509182f9393","observation_id":"fe6edd88-264f-4042-b2aa-3721b49ffea2","resolution":{"observed_at":"2026-08-01T20:06:05.276430Z","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-08-01T20:06:05.362490Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.362490Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:c92b429a47b79dcf4da94768b4d746f863d48992aa11078cc0bdbbf8dff68940","observation_id":"ea91b7d4-0753-4645-ba78-39ccc5bd39d9","resolution":{"observed_at":"2026-08-01T20:06:05.362490Z","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-08-01T20:06:05.462655Z","title":"Wasserstein generative adversarial networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.462655Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:4d5d9358b27ce2a13b6bb9a14054a63fba36fe6dc715b86885022d677911df9d","observation_id":"2ad3d144-c8c0-4368-8689-9a2deb3e5044","resolution":{"observed_at":"2026-08-01T20:06:05.462655Z","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-08-01T20:06:05.514344Z","title":"A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.514344Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:dc0d0821467eb4897fec920545a59a64d72dd579a6296406b562e3f2a98b0968","observation_id":"93137e0e-8d74-488e-a46b-8e8a486e861d","resolution":{"observed_at":"2026-08-01T20:06:05.514344Z","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-08-01T20:06:05.578582Z","title":"Gradient convergence in gradient methods with errors","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.578582Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:31dc3599e2962a79389064d4a08633b3a42b8a81f639044f6de7bb45c7f2134e","observation_id":"c59962e8-db0f-4ea3-bcc4-c5e245ffa3e2","resolution":{"observed_at":"2026-08-01T20:06:05.578582Z","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-08-01T20:06:05.646449Z","title":"Springer Science & Business Media, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.646449Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:cd8848f6f34ddd16f5e9690a63c0a88f98d47d1def06bac3bf7a920ff0ff356b","observation_id":"03c376ab-3fba-4a40-8411-fe9745021182","resolution":{"observed_at":"2026-08-01T20:06:05.646449Z","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-08-01T20:06:05.720026Z","title":"Multi-level adaptive solutions to boundary-value problems","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.720026Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:6a2844931691e544a63fc20562e147ccc6c4142a40267d809498c45d640fcc0b","observation_id":"279bbd57-f2f6-4698-a26b-3d82b904662d","resolution":{"observed_at":"2026-08-01T20:06:05.720026Z","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":"10.1090/gsm/033.url:https://doi.org/10","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:08:50.294840Z","title":null,"venue":null,"work_id":"8af70e2e-75ac-423f-b250-da360a35647e","year":2001},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.774190Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:5bcc1c6f4005bf78a2762e102b82cceb43515ef075aaa2f61380854a04831ce6","observation_id":"1438326f-1579-47a8-a671-9af8b12c54ce","resolution":{"observed_at":"2026-08-01T20:08:50.374761Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:06:05.826749Z","title":"Covariance-modulated optimal transport and gradient flows","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.826749Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:08e4a5787e81865bfb1cfd6cae966700a0286075efbcc5eb4c9742a6925d777f","observation_id":"1eda1b3d-b112-4c46-a472-a5d1fbe6ba80","resolution":{"observed_at":"2026-08-01T20:06:05.826749Z","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-08-01T20:06:05.897352Z","title":"A first-order primal-dual algorithm for convex prob- lems with applications to imaging","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.897352Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:6fd336ee68c50e0f6c143f0466e446b04e9e4e6b775ec7c83119317c0cd13fab","observation_id":"4d87f091-cf1a-4c42-922f-2e253d7ce93f","resolution":{"observed_at":"2026-08-01T20:06:05.897352Z","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-08-01T20:06:05.964571Z","title":"On the ergodic convergence rates of a first-order primal–dual algorithm","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:05.964571Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:52cde5cbebfb367b54d145fcddbd81f4b89e34ff15ca6ecfe757cf4d0dd9ef27","observation_id":"4b02ba3c-0114-47f4-b50b-c9fc0c8c1df4","resolution":{"observed_at":"2026-08-01T20:06:05.964571Z","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-08-01T20:06:06.052433Z","title":"Optimal transport over a linear dynamical system","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.052433Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:d90200cf8b72ca86ebc4ab3cbb2637e0bb3780b49eb9cddb5eda9865554eadd2","observation_id":"3ddab8b9-b2bc-4f7f-9439-3a699d36102b","resolution":{"observed_at":"2026-08-01T20:06:06.052433Z","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-08-01T20:06:06.151520Z","title":"McGraw- Hill New York, 1955","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.151520Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:35d33e5141b290b2769732c5377f04213d09932d3bb7c71566f97d09e99764d9","observation_id":"93e566f3-9ae3-4c37-8d10-02b9da4d38e2","resolution":{"observed_at":"2026-08-01T20:06:06.151520Z","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-08-01T20:06:06.252251Z","title":"Optimal transport for domain adaptation","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.252251Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:894aad0c64d80bacbb57504d1ae3503faa3025d05aac9cb7e2520d8b594625aa","observation_id":"ee57e8a4-171a-4a07-b1c0-1332afb8ee5e","resolution":{"observed_at":"2026-08-01T20:06:06.252251Z","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-08-01T20:06:06.359060Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.359060Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:121017374db2b7aea4e2260d6ff2800aae3c78b21a7702d66667e1d59ad52d0c","observation_id":"30a5fb72-afcf-4ac4-b1bb-b1f9f72c3262","resolution":{"observed_at":"2026-08-01T20:06:06.359060Z","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-08-01T20:06:06.423169Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.423169Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:467b4f725a65e92a5c0820658bf76e90f654e63e2165dddf54f3f4077cfbfece","observation_id":"ec80549f-1924-4621-8bca-82fffd723f56","resolution":{"observed_at":"2026-08-01T20:06:06.423169Z","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-08-01T20:06:06.480289Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.480289Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:d2546f697df3b22989e1d3ebbd30c578bbe2fe25cbca8ebcfb73ca38bf20b98c","observation_id":"01fd3f30-e6df-4060-8ba3-0ab0f9909597","resolution":{"observed_at":"2026-08-01T20:06:06.480289Z","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-08-01T20:06:06.574515Z","title":"The Fr´ echet distance between multivariate normal distributions","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.574515Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:6df1b72bfd10303cf76f3478a0727aaf6c3145da9fd2269d20e9c74f7f2364d5","observation_id":"610b51a6-6150-4526-8c40-ee150441813f","resolution":{"observed_at":"2026-08-01T20:06:06.574515Z","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-08-01T20:06:06.635737Z","title":"SIAM, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.635737Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:4ccec559395fb83375f36a70dcc58c58a9e38fc4914becf6e19d8307efd554ee","observation_id":"65d498fd-0c0c-42e4-a4c1-da193fbf958b","resolution":{"observed_at":"2026-08-01T20:06:06.635737Z","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-08-01T20:06:06.693778Z","title":"Dynamical optimal trans- port of nonlinear control-affine systems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.693778Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:f2fac1872ea0a857195082d51329d599682b27c857c3581bc6fc130761736bd4","observation_id":"3a2a102d-bb79-4f0d-a8eb-7a6491b5b92d","resolution":{"observed_at":"2026-08-01T20:06:06.693778Z","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-08-01T20:06:06.787054Z","title":"Finite volume methods","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.787054Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:3bbfe5a9b863d1f7acd7ac0a761dc2d38aad41699be3b9e51d0d17aefb6eb0e7","observation_id":"bff9ce10-b8c2-4219-8b73-b67d416f6cd6","resolution":{"observed_at":"2026-08-01T20:06:06.787054Z","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-08-01T20:06:06.894165Z","title":"Differential manifolds","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.894165Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:3f64a101ca8724bfb5bcd00fd7e71e598b5d4056a445c6ef6e6e3e1b813d29b6","observation_id":"e7e546ef-4199-4ab4-9860-70211d4ea60e","resolution":{"observed_at":"2026-08-01T20:06:06.894165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.0546","last_updated":"2015-03-24T18:39:52Z","snapshot_observed_at":"2026-08-15T00:19:07.878769Z","submitted_at":"2013-05-02T19:26:47Z","title":"Adaptive Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.0546","snapshot_observed_at":"2026-08-01T20:06:06.967363Z","title":"Adaptive primal-dual hybrid gradient methods for saddle-point problems","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:06.967363Z"},"links":{"cited_paper":"/paper/1305.0546","citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:b7caa16b8819a5d4f248c062f72dbc0e774b0312d86e828d9afccfe1cba2efc7","observation_id":"fed204ef-5a72-4096-aa0d-4ccf02988868","resolution":{"observed_at":"2026-08-01T20:06:06.967363Z","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-08-01T20:06:07.049031Z","title":"Unsupervised alignment of embed- dings with Wasserstein procrustes","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.049031Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:92c1d7772c17293fd377ea9654fdf4e30653af1b87ce1389c9f339f232b1312d","observation_id":"83d6f644-a9f7-44bb-87b2-737bd72a031f","resolution":{"observed_at":"2026-08-01T20:06:07.049031Z","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-08-01T20:06:07.117964Z","title":"Cambridge University press, 1994","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.117964Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:c50124db96fe22710b510a529b8565dcc50f056e661d0cc9c644d27dc3883351","observation_id":"cb53c6e1-1e67-458b-a70f-354dfae23011","resolution":{"observed_at":"2026-08-01T20:06:07.117964Z","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-08-01T20:06:07.224228Z","title":"Solving large-scale optimization problems with a convergence rate independent of grid size","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.224228Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:a7c921712464eae52ad923fa3a71dfab181dc11ef77251e2d47d1d592b7cf4f4","observation_id":"65e88580-2fd7-4d67-8400-54f50a3e9a61","resolution":{"observed_at":"2026-08-01T20:06:07.224228Z","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-08-01T20:06:07.344411Z","title":"A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Cou- pled Constraints","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.344411Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:38ceef59a8d8b1edb337ad26e36c73c8bb77601661243f53a395852112116eb7","observation_id":"0aa3accd-4369-4021-8db5-88a522f06b62","resolution":{"observed_at":"2026-08-01T20:06:07.344411Z","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-08-01T20:06:07.430933Z","title":"A geometric study of Wasserstein spaces: Euclidean spaces","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.430933Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:9ef2575c7478e79fd7d1d388aaffa406841afb40a94fd9778a4460be9697a411","observation_id":"048a6b83-833e-473e-9d6e-d46245e936fd","resolution":{"observed_at":"2026-08-01T20:06:07.430933Z","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-08-01T20:06:07.532778Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.532778Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:ae8bb7ff01c51dab110e6386bc20a460008cca63c777e03adc597c9151900f7f","observation_id":"eebbd0b4-fbec-497d-a0a3-943c5c6f396e","resolution":{"observed_at":"2026-08-01T20:06:07.532778Z","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-08-01T20:06:07.632230Z","title":"A multigrid approach to discretized optimization problems","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.632230Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:2347710fa1dd50652c88c0e852453c546ad63a3061169ab1441a6538bde93f1f","observation_id":"416410d0-4a4e-4315-8ba6-a1f34b19bc50","resolution":{"observed_at":"2026-08-01T20:06:07.632230Z","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-08-01T20:06:07.737346Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.737346Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:60ce1b94a35b5452bb7587dbe3bedea01c0ac15753cbf97081ddfce9f5d1a67f","observation_id":"a58f3b2b-4972-43b6-82f2-be9acb9cf080","resolution":{"observed_at":"2026-08-01T20:06:07.737346Z","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-08-01T20:06:07.877375Z","title":"Springer, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.877375Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:67cadb14d10309ace95703f9cdd004b39d63e57ea76fb78bd3e83516af378bde","observation_id":"3eea17e9-f5d1-431e-8eb7-4bbb56607bf3","resolution":{"observed_at":"2026-08-01T20:06:07.877375Z","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-08-01T20:06:07.966483Z","title":"The geometry of dissipative evolution equations: The porous medium equation","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:07.966483Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:03e258cbe67dc69b125007b4635bfbce7cc888065a4b35b34610a26b60c0a24a","observation_id":"86cb5dff-0050-4fbc-9574-5b6c354638d2","resolution":{"observed_at":"2026-08-01T20:06:07.966483Z","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-08-01T20:06:08.031198Z","title":"Computational optimal transport: With applications to data science","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.031198Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:fffe5842d808d7f666a076dad8f797b27b19e08f9a0f417c1d878befa77db460","observation_id":"c2f2e465-45d2-438a-b446-6495f7c574dc","resolution":{"observed_at":"2026-08-01T20:06:08.031198Z","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-08-01T20:06:08.146967Z","title":"Diagonal preconditioning for first order primal-dual algorithms in convex optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.146967Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:30277168e8b237a8437cfe6ec641e88f9917444c652d845b37252eefcc84e68c","observation_id":"6bd906e6-ce9a-4c9a-af50-89744f9d38f5","resolution":{"observed_at":"2026-08-01T20:06:08.146967Z","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-08-01T20:06:08.218078Z","title":"A unified convergence analysis of block successive minimization methods for nonsmooth optimization","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.218078Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:dfd43433fbd6b6bb8158d5103c5fee0421b3b186eaaa84843515b92e0a2fc23a","observation_id":"4594eb34-b212-4545-9c49-48a8f2229e71","resolution":{"observed_at":"2026-08-01T20:06:08.218078Z","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-08-01T20:06:08.352313Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.352313Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:2ea2261e8e530ae2d8f9981aa63a06ffb616de4be1720f0d3d753830e3099c56","observation_id":"452ff249-6dc4-443d-be24-e0ae6101b4f4","resolution":{"observed_at":"2026-08-01T20:06:08.352313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.08006","last_updated":"2026-05-08T16:59:29Z","snapshot_observed_at":"2026-08-12T19:57:44.705686Z","submitted_at":"2026-05-08T16:59:29Z","title":"Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.08006","snapshot_observed_at":"2026-08-01T20:06:08.463740Z","title":"Penalty-Based First-Order Meth- ods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.463740Z"},"links":{"cited_paper":"/paper/2605.08006","citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:b7a60cc7adffdfe09edc8908915b4f491dc52f6f044c58394984675e212483fa","observation_id":"4d56f352-3b0f-409f-827c-f9d10fe6c13d","resolution":{"observed_at":"2026-08-01T20:06:08.463740Z","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-08-01T20:06:08.547446Z","title":"Optimistic Bilevel Optimization with Composite Lower-Level Problem","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.547446Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:b98a214f38814611e5847d2edd7a50fe3fad69e88c6d704e1c06f474e2d08e80","observation_id":"49653b8e-bfd9-4877-8621-a4fc7f40949d","resolution":{"observed_at":"2026-08-01T20:06:08.547446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16580","last_updated":"2025-03-20T12:34:22Z","snapshot_observed_at":"2026-08-16T12:48:17.599836Z","submitted_at":"2025-03-20T12:34:22Z","title":"Procrustes Wasserstein Metric: A Modified Benamou-Brenier Approach with Applications to Latent Gaussian Distributions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16580","snapshot_observed_at":"2026-08-01T20:06:08.640170Z","title":"Procrustes Wasserstein metric: A modified benamou-brenier ap- proach with applications to latent gaussian distributions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.640170Z"},"links":{"cited_paper":"/paper/2503.16580","citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:36a3f1d1065b29ba9549a2f64948ae0113bd65bdd6f76f2c484da3384acc0740","observation_id":"c69c5163-0b32-4ecb-9217-73c84bad2339","resolution":{"observed_at":"2026-08-01T20:06:08.640170Z","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-08-01T20:06:08.739970Z","title":"Convergence of a block coordinate descent method for nondifferentiable mini- mization","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.739970Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:c31553113f198fb9ea6342d6e6a7fe16b9da9910fe8017c9bc9b8c6a962d70e8","observation_id":"a34885d5-cb4f-4521-b36a-a0f3d9ad7b74","resolution":{"observed_at":"2026-08-01T20:06:08.739970Z","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-08-01T20:06:08.823673Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.823673Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:1663b2c674e820cf5d5e1ac0d754e192f1ea5ad97f0d455a0428ff58ab5ce563","observation_id":"854aa2e9-f687-4413-b9f1-05b9a79b56f2","resolution":{"observed_at":"2026-08-01T20:06:08.823673Z","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-08-01T20:06:08.915256Z","title":"Overcoming lower-level constraints in bilevel optimization: A novel approach with regularized gap functions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:08.915256Z"},"links":{"citing_paper":"/paper/2607.16782"},"observation_digest":"sha256:8a527ba3597002bec054b33164b60a8d8b16b4cbaa886834fbeda28c049ac3c5","observation_id":"65724b9e-e69f-49c7-86ed-73696f249cca","resolution":{"observed_at":"2026-08-01T20:06:08.915256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16782","last_updated":"2026-07-18T11:33:15Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T19:58:25.629698Z","submitted_at":"2026-07-18T11:33:15Z","title":"Dynamical Optimal Transport with $\\mathfrak{so}(d)$-Invariance: From Theory to Computation"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":46},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2607.16782."}