{"as_of":"2026-08-10T06:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06d75188f76909162720f6071155f7c2ac9c9226e388c3e603db23b14c94ed85","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:58:33.547265Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.12246/citation-record","integrity":"/paper/2507.12246/integrity","json":"/paper/2507.12246/citation-record.json","paper":"/paper/2507.12246"},"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-06T16:58:43.014195Z","title":"Near-linear time approximation algorithms for optimal transport via S inkhorn iteration","venue":null,"work_id":"23c32f70-5737-446d-ac0f-a6a71168dc34","year":2017},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:28.755774Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:50af2367bb60fea655f74953de53928f0ac0df01d382c6fb13459e6be93fe000","observation_id":"5e79fe8a-8359-4b31-b233-09e234a6716e","resolution":{"observed_at":"2026-08-06T16:58:43.122495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:42.853171Z","title":"urich. Birkh\\","venue":null,"work_id":"a810e67f-7380-4f0e-a296-bc116f000fed","year":2008},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:28.854181Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:c56347ec17863e4e278d3c8a5f8ea852aeb5423a1cf26803703333904478b158","observation_id":"a6f1773a-09d3-42b4-acf4-4b6b9844c90b","resolution":{"observed_at":"2026-08-06T16:58:42.942149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:42.656820Z","title":"Mirror D escent with R elative S moothness in M easure S paces, with application to S inkhorn and EM","venue":null,"work_id":"33cb734c-fbae-4a54-9df4-449a8b48a1e5","year":2022},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:28.935915Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:0e3e2bfd289823965cc18e20ed9ee012ac7d3ba9c6515c10527c49c06267efdb","observation_id":"9b9450a8-4f06-4307-82f6-6727735e445b","resolution":{"observed_at":"2026-08-06T16:58:42.711653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:29.031307Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.031307Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:5f769944815626798cdab95fc128bdcb2d08c1100b7fdbebfd082b5c396711c6","observation_id":"3271b578-15a1-48ac-b623-4ef134e30e71","resolution":{"observed_at":"2026-08-06T16:58:29.031307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13170","last_updated":"2019-12-31T04:49:30Z","snapshot_observed_at":"2026-07-06T08:47:45.187408Z","submitted_at":"2019-12-31T04:49:30Z","title":"Schr\\\"odinger Bridge Samplers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13170","snapshot_observed_at":"2026-08-06T16:58:29.112889Z","title":"Schr\\\" o dinger Bridge Samplers","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.112889Z"},"links":{"cited_paper":"/paper/1912.13170","citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:ce5d7d87e8b3f5aa678a631bca215ffe7bfb2eeacd8a6107cf87d3b7ce403188","observation_id":"827deb3c-a2a9-4891-9b09-d51d90130a41","resolution":{"observed_at":"2026-08-06T16:58:29.112889Z","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-06T16:58:42.454799Z","title":"Caluya and Abhishek Halder","venue":null,"work_id":"af1e6120-31bd-4f0f-b845-cf9d3a5c3d25","year":2022},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.213705Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:7a54f8c16b20e30f37f527e5a410bc0c304fcd1b799e7f051102f849befad79e","observation_id":"9cac4d64-df81-45a1-b313-53bdb36ab2b0","resolution":{"observed_at":"2026-08-06T16:58:42.574348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:42.169197Z","title":"On the linear convergence of the multimarginal sinkhorn algorithm","venue":null,"work_id":"b6ca98e2-d9a6-4988-abf3-39edcdb38b0a","year":2022},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.302064Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:55cfbbce4c41675e8feb22a1ada58f79497d1fe2c24fe3fb6abff36bbd700272","observation_id":"d92f2fc1-e503-44e9-987b-9d11463ce1c3","resolution":{"observed_at":"2026-08-06T16:58:42.304521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:41.862521Z","title":"Vixie, and Erik M","venue":null,"work_id":"9c44b90c-d700-4a37-a4ee-43b03f4386d1","year":2009},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.402068Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:2b728dce7e476ec0442dd8482bc19ba512675abcd8ddf5bb72ab1875146ac8a0","observation_id":"98990b04-b655-4b9b-8973-bbb6a8c83cd2","resolution":{"observed_at":"2026-08-06T16:58:42.044189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:29.479468Z","title":"A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.479468Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:30be92ae202b8f6e6dc35f11a453bc73bd6bbfee3503b872f6a60611d6017e23","observation_id":"4335c93a-3d07-4d40-b7c6-45e9a7ad7223","resolution":{"observed_at":"2026-08-06T16:58:29.479468Z","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-06T16:58:41.687128Z","title":"Faster W asserstein distance estimation with the S inkhorn divergence","venue":null,"work_id":"236533ef-e735-4b75-b1f2-720a30ec094a","year":2020},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.573817Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:5e55e3d8fac1dfb6e4a5e63833100304caf8f8de79376a9e927c645a8fbdae58","observation_id":"06a77368-abda-45dd-8161-8086eb6e3a9f","resolution":{"observed_at":"2026-08-06T16:58:41.796299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01202","last_updated":"2025-07-17T20:37:04Z","snapshot_observed_at":"2026-08-03T06:42:18.744466Z","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":"2407.01202","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.01202","snapshot_observed_at":"2026-08-06T16:58:33.911178Z","title":"Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings","venue":"math.OC","work_id":"25f229f1-de6f-4200-84b3-78488fa64fd1","year":2024},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.689446Z"},"links":{"cited_paper":"/paper/2407.01202","citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:c05bd65f8adfd9e9057cdfc50535977ad9357f7180472a3def96917d61ffb05b","observation_id":"f524642c-3d44-45b3-b175-c37775ecb0e6","resolution":{"observed_at":"2026-08-06T16:58:34.009461Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08598","last_updated":"2023-09-15T17:55:56Z","snapshot_observed_at":"2026-07-06T16:19:05.495349Z","submitted_at":"2023-09-15T17:55:56Z","title":"Projected Langevin dynamics and a gradient flow for entropic optimal transport","version":1},"cited_work":{"arxiv_id":"2309.08598","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.08598","snapshot_observed_at":"2026-08-06T16:58:33.703364Z","title":"Projected Langevin dynamics and a gradient flow for entropic optimal transport","venue":"math.PR","work_id":"6fcd2eaf-735a-47b6-8005-219fcb4f1daa","year":2023},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.803978Z"},"links":{"cited_paper":"/paper/2309.08598","citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:2649b332086897d6a5174f1fe8aee1d9e312b6adcca44315184eb2be04db1c6d","observation_id":"e480ff00-2456-441d-a5d2-2c19960e7ec6","resolution":{"observed_at":"2026-08-06T16:58:33.767030Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:41.383474Z","title":"Sinkhorn distances: L ightspeed C omputation of O ptimal T ransport","venue":null,"work_id":"eddb7881-94ca-4557-91f3-226e57555850","year":2013},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:29.916081Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:ac8fd93d991ed30bf2ebb96c3353572af26c50f59ba2c1a331fe73d496346de1","observation_id":"da232a06-c2c4-4237-b95e-0dfdb2b0b1be","resolution":{"observed_at":"2026-08-06T16:58:41.543513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:41.164271Z","title":"Semidual regularized optimal transport","venue":null,"work_id":"3dde85fd-e4c5-4e40-8527-7c9ee14cccda","year":2018},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.001883Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:271728ce44007b38032088bed1a461444ff5881a0f14c25f48f1b6648f8a0e58","observation_id":"2c19cbee-8cc7-4d35-9edc-19cb5e036397","resolution":{"observed_at":"2026-08-06T16:58:41.298703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:40.930337Z","title":"A stochastic control approach to reciprocal diffusion processes","venue":null,"work_id":"e24f91a6-f6c1-43d3-b6eb-cf93595cca36","year":1991},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.124481Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:c91df881b461a1a729f06dc47ceb1744fcdee3320a8664d421aed92ae975de8d","observation_id":"da0bc640-c7bd-4501-bc1c-4fe626326bc1","resolution":{"observed_at":"2026-08-06T16:58:41.033731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.16421","last_updated":"2025-09-02T14:55:44Z","snapshot_observed_at":"2026-07-06T16:00:29.832559Z","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-06T16:58:30.247977Z","title":"Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.247977Z"},"links":{"cited_paper":"/paper/2307.16421","citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:e1175ffb0f92c4d1f5bf6fef143e8c5fccc7b2158630b04946c2fcf033f26454","observation_id":"a14d6ed5-e45a-4782-9a5a-b1ebfc3092d7","resolution":{"observed_at":"2026-08-06T16:58:30.247977Z","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-06T16:58:40.741228Z","title":"An optimal transport approach for the S chr\\\"odinger bridge problem and convergence of S inkhorn algorithm","venue":null,"work_id":"8f7be09c-5224-4f85-b941-d394294bfde6","year":2020},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.356822Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:afe280b7ef6e7026af74697976abfa063785344174e065adf2270855d8bab76d","observation_id":"6a2df0d6-c0f7-4089-8dec-f3a999880b2a","resolution":{"observed_at":"2026-08-06T16:58:40.839339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:40.559321Z","title":"Computational O ptimal T ransport: C omplexity by A ccelerated G radient D escent I s B etter T han by S inkhorn’s A lgorithm","venue":null,"work_id":"2f31fc8e-451b-4381-8600-583990ecf4c1","year":2018},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.439304Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:eb34ef91b54832b4d57c86b6ff22ae66c48bc965a805fe1972d67fa7b0ec8258","observation_id":"7fddf570-1031-4bc0-a3fb-235826b1bc80","resolution":{"observed_at":"2026-08-06T16:58:40.631312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:40.343532Z","title":"Interpolating between O ptimal T ransport and MMD using sinkhorn divergences","venue":null,"work_id":"652d8993-6283-41ee-b497-274553356622","year":2019},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.518827Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:49f256d688dc4aa2eddb1f906205261c16718e472dd0455c7798c0081c63620b","observation_id":"73af0264-8362-4133-a39a-bbb74d218859","resolution":{"observed_at":"2026-08-06T16:58:40.449643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:40.168475Z","title":"Random fields and diffusion processes","venue":null,"work_id":"04acfce6-ee71-43cf-af49-823a81e5603c","year":1985},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.620305Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:a9a6e2c56fc2a1873e0601302515a631949006c26e58de80852188ffef20d8de","observation_id":"679d2ae0-9c74-4be0-9ec5-d088545ee097","resolution":{"observed_at":"2026-08-06T16:58:40.243092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:39.968457Z","title":"On the scaling of multidimensional matrices","venue":null,"work_id":"2dc876d5-421e-4288-aaeb-e3fbe4d8370f","year":1989},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.708510Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:57ce237334bfe464818cc44aab25dea1402969d9244c3e958a249d84c9aad708","observation_id":"8dbf21db-c00b-47e9-9b5c-4c5588c1e119","resolution":{"observed_at":"2026-08-06T16:58:40.034523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:39.792704Z","title":"Dimensionality reduction for supervised learning with reproducing kernel hilbert spaces","venue":null,"work_id":"6f8077e5-99f0-4b33-b62f-79034a26835e","year":2004},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.803186Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:e2b0303ed7f04847f2bbc9ba9feb5552cce974950bd67cdb7d4b0515868c1763","observation_id":"e048b6b8-2720-4b65-bcdc-0d0f973c84c2","resolution":{"observed_at":"2026-08-06T16:58:39.877464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:39.653910Z","title":null,"venue":null,"work_id":"79f6e0d8-e33d-437e-a0c3-dc9f139c8cd8","year":1996},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.896514Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:8196f7d13732b058f344502fa8f753569b120a47fba87ea5e7c6c8fb63ffc01e","observation_id":"41187073-f885-4970-b73b-7bc03d10baed","resolution":{"observed_at":"2026-08-06T16:58:39.731834Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:39.462007Z","title":"Stochastic O ptimization for L arge-scale O ptimal T ransport","venue":null,"work_id":"d3da6ddd-44d6-4ef6-b32d-f8af8047b68c","year":2016},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:30.978363Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:f4d7a9e8712e0928a0de168b5fddac3dd508b0017aacd00c688f7a22d219cbed","observation_id":"861852f2-8262-4961-8ffb-c43683619181","resolution":{"observed_at":"2026-08-06T16:58:39.515877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:39.299889Z","title":"Sample C omplexity of S inkhorn D ivergences","venue":null,"work_id":"f6c23876-293e-4aa4-95fb-0aae97ab3b9d","year":2019},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.062025Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:980120733f506a6155fe6c531f5546f5866fac13d55b7a75987f48999e593e8b","observation_id":"4844e65c-7dfb-40a2-8f22-3e4de88d1583","resolution":{"observed_at":"2026-08-06T16:58:39.356956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:39.133645Z","title":"A kernel method for the two-sample-problem","venue":null,"work_id":"91660d1e-794e-44ca-a2ca-d1795cde391a","year":2006},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.153272Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:cc8898190b09488cc86e025665e3250cd8cbc5da517611942642103bee6cb12f","observation_id":"a4630fab-ff83-4e22-ac6e-c475f971df91","resolution":{"observed_at":"2026-08-06T16:58:39.234661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:38.933073Z","title":"A fast approach to optimal transport: the back-and-forth method","venue":null,"work_id":"9a3cf12b-1818-450f-94b4-4f8d06ac028d","year":2020},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.250317Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:b3c53b21a50684365447617243566c13193ab2b8ef8d7506230d6b043665496a","observation_id":"1e54a435-9810-414d-86bc-141c9cc7a875","resolution":{"observed_at":"2026-08-06T16:58:38.983107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:38.760307Z","title":"Accelerated M irror D escent in C ontinuous and D iscrete T ime","venue":null,"work_id":"19094b69-e1fc-4d84-990f-9fc3bbb6cc1b","year":2015},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.353213Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:1f045e9d31a8e0bfe48c6462347ef40a8abccca351bf8885dde4ba1fae80cedb","observation_id":"7e8d4c23-733d-4f57-8d83-4c886a324cca","resolution":{"observed_at":"2026-08-06T16:58:38.820976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:38.582463Z","title":"A gradient descent perspective on S inkhorn","venue":null,"work_id":"5917c086-7593-46e6-8789-580413c2b261","year":2021},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.474087Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:92cfb2b7683f1571e3fc908cc6938b4bb3e924447194cf4f4e52551384fb3ec4","observation_id":"b05400f8-75f7-4a52-a333-5575d2a748c1","resolution":{"observed_at":"2026-08-06T16:58:38.678605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:38.427395Z","title":"A survey of the S chr\\\"odinger problem and some of its connections with optimal transport","venue":null,"work_id":"fb3589e9-4598-4049-a179-2a97a8c4acf0","year":2014},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.548082Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:5f2da57ad0b30e7d381e2ba048b557013ad1d665bb1569e049ea3495c927f824","observation_id":"c2852f77-b0ba-4387-a746-5f9639656106","resolution":{"observed_at":"2026-08-06T16:58:38.480650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:38.271179Z","title":null,"venue":null,"work_id":"4e4dfede-dbd7-4cdd-a7c8-ede42d827a0a","year":2022},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.640330Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:51458fe9ae23e995df40b1db376678f18344ca41ac980a2fe5c1a86c807d8384","observation_id":"afbfaa88-6952-4cb7-8b61-a47548fc27c7","resolution":{"observed_at":"2026-08-06T16:58:38.361164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:38.049495Z","title":"A kernelized Stein discrepancy for goodness-of-fit tests","venue":null,"work_id":"b5f4e4a7-4103-4f27-9db8-80cec2e7839f","year":2016},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.744251Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:15a70e1edc1c76da130cf177cd7944b9b58c38086b34f518bf0541704b7f655e","observation_id":"fad67cbd-aba3-4355-be88-5372fa223a59","resolution":{"observed_at":"2026-08-06T16:58:38.167303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:37.835132Z","title":"Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem","venue":null,"work_id":"4801738f-3608-4670-8c8c-6ba1999756e7","year":2019},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.857875Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:2c489c90c86575a4f378d4d955648df2533bff2a71447579a95de4f9dafad08e","observation_id":"3e1295cc-efb7-4140-8204-f1d0689eed76","resolution":{"observed_at":"2026-08-06T16:58:37.930404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:37.626129Z","title":"Online S inkhorn: O ptimal T ransport distances from sample streams","venue":null,"work_id":"c11570ca-5397-41f8-9b73-4ac87117734b","year":2020},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:31.954464Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:7d0d492d4a43fac7b98c6c2935bd70894207c61f502cf38b614fdbddd130d13e","observation_id":"c387490f-9273-44e3-98d2-4f93c0e101e8","resolution":{"observed_at":"2026-08-06T16:58:37.726204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.06918","last_updated":"2019-09-16T00:58:17Z","snapshot_observed_at":"2026-07-06T08:21:56.710848Z","submitted_at":"2019-09-16T00:58:17Z","title":"Sinkhorn Algorithm as a Special Case of Stochastic Mirror Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.06918","snapshot_observed_at":"2026-08-06T16:58:32.054171Z","title":"Sinkhorn algorithm as a special case of stochastic mirror descent","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.054171Z"},"links":{"cited_paper":"/paper/1909.06918","citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:c8dfd497b03acc24a835c6a31e37c06073a9c62e95ff64e8e524a4e6a65fb677","observation_id":"6262ef01-bf6c-47f8-9ad4-1aa15f4d8720","resolution":{"observed_at":"2026-08-06T16:58:32.054171Z","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-06T16:58:37.422868Z","title":"Sobolev D escent","venue":null,"work_id":"b0eeda67-7190-4985-9864-44f47003535f","year":2019},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.147915Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:9e0bc206154e48cc7881659a25dc0630d8a74d86537046a1c478c2fc6fca1cdb","observation_id":"45b47f4f-ea32-4301-8621-15d3ac93c79a","resolution":{"observed_at":"2026-08-06T16:58:37.535517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:37.233162Z","title":null,"venue":null,"work_id":"9c13eed5-8f75-43bd-bb83-71b6f753d165","year":1983},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.249453Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:7ec56d1897d94f6a0f70ace104f61c57609d10230952a4f4446ae6db071c296f","observation_id":"00de23ea-b83b-4d75-b372-1f879fd0e8a1","resolution":{"observed_at":"2026-08-06T16:58:37.329086Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:36.948552Z","title":"Lectures on C onvex O ptimization , volume 137 of Springer Optimization and Its Applications","venue":null,"work_id":"bf52f8fd-fe70-45df-82b8-ecce3194550a","year":2018},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.343874Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:a779ade156811852fd893ed76e4f05f424f64fe5b9ca5bc9a9b02b5c009f066d","observation_id":"1d40d3b1-8e44-40dd-8717-39e12583fc13","resolution":{"observed_at":"2026-08-06T16:58:37.104689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:36.716460Z","title":"Introduction to Entropic Optimal Transport","venue":null,"work_id":"dc0ac0b2-f48d-4aa5-ade3-7022b18d0cf4","year":2021},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.432397Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:bd95fd11b2d4b5c2c740f95736cf6c290016827426c3a76e37d7df2c60f704a4","observation_id":"464573b3-cde0-4f9b-94fb-7b9c37a12c2a","resolution":{"observed_at":"2026-08-06T16:58:36.830802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:36.479455Z","title":"Entropic optimal transport: convergence of potentials","venue":null,"work_id":"432abb52-df4a-442a-b95c-b2f12fdbd48d","year":2022},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.551015Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:9f72af659095ec06a69880bb3fd48141708939a97c99846e9818a2ea5f99b075","observation_id":"9ce03abc-4cb5-4a64-be4d-e82466f70b4f","resolution":{"observed_at":"2026-08-06T16:58:36.572182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:36.216184Z","title":"Pavliotis","venue":null,"work_id":"59877a08-645e-499b-a96d-2ab8bc39b39f","year":2014},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.644131Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:297ef08c8ffdebb2681413534dac3a60e32fc2d475a02022c9cc9500723d3479","observation_id":"c0beff81-160f-448b-854a-2ced0e07cbf0","resolution":{"observed_at":"2026-08-06T16:58:36.339491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:35.941432Z","title":"Computational optimal transport: With applications to data science","venue":null,"work_id":"8178ada3-986a-49d1-ad7a-3f8ddf681c51","year":2019},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.759688Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:1543e41a1dab68957379649e0b5bbfe6c94b79cc308835d5119a075b0446d6cf","observation_id":"073af9bb-ee9f-4e0c-b8a6-668d91524698","resolution":{"observed_at":"2026-08-06T16:58:36.066864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:35.713887Z","title":"Sinkhorn Flow as Mirror Flow: A Continuous-Time Framework for Generalizing the S inkhorn Algorithm","venue":null,"work_id":"7b27c007-68ba-48b1-9ee7-be55cf8ab2e4","year":2024},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.843505Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:9eef1955ae73a38934e50f5ec19a191dd59b67aa577bda9f6dc8db072c50bc37","observation_id":"4b0fe4b0-71ea-4651-a893-9b1375600564","resolution":{"observed_at":"2026-08-06T16:58:35.825554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:35.389576Z","title":"Real and complex analysis, 3rd ed","venue":null,"work_id":"8d3395e6-f79a-49ed-9ccc-bb9e3e29d8eb","year":1987},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:32.945493Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:6c275d9edb35b8050c911b1a76ff8008272b1821a25d6974816c310cdb404b70","observation_id":"9b5cad5b-12bd-4c20-8ae8-de13ae25f0c3","resolution":{"observed_at":"2026-08-06T16:58:35.554065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:35.117089Z","title":"Convergence of the iterative proportional fitting procedure","venue":null,"work_id":"b1207ad4-b48a-4b54-b657-2e5826f6c9fe","year":1995},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:33.069732Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:e1611382b42b01e406674871d59f92e212ebe5a07ae77c7ec8a358f90e96b8c3","observation_id":"9033b377-dfc1-405d-b3f5-89ac78c225fb","resolution":{"observed_at":"2026-08-06T16:58:35.254214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:34.833832Z","title":"Optimal transport for applied mathematicians, volume 87 of Progress in Nonlinear Differential Equations and their Applications","venue":null,"work_id":"7a1d791e-0670-4e21-9964-9826b59d8da3","year":2015},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:33.161761Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:0389ec6892ee96531095aa90b7ee656eed0e5862a6dfd0c9c75a9236acce5541","observation_id":"f74497f4-35bc-43d4-a46b-0ee1bf523f35","resolution":{"observed_at":"2026-08-06T16:58:35.011255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:33.279052Z","title":"Concerning nonnegative matrices and doubly stochastic matrices","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:33.279052Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:ece8f17dac99994ad62bc320641825f35f684ed619e6d9bcb8448459f5e7b2fe","observation_id":"26a8bee0-0db2-4742-9db2-8e3737bb6450","resolution":{"observed_at":"2026-08-06T16:58:33.279052Z","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-06T16:58:34.564461Z","title":"Support vector machines","venue":null,"work_id":"c143eaa2-d037-42be-82b0-41b014abf7ca","year":2008},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:33.426330Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:35e0004a83debfbad1aca743088f0bde197fb7e1eca034f7561c16bd3ef77101","observation_id":"e2c1e060-5980-4480-ba99-16b08d9c4946","resolution":{"observed_at":"2026-08-06T16:58:34.684219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:58:34.247288Z","title":"Topics in optimal transportation, volume 58 of Graduate Studies in Mathematics","venue":null,"work_id":"9bb499ff-660e-4be0-9186-cd1a02be6e4d","year":2003},"citing_paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T16:58:33.547265Z"},"links":{"citing_paper":"/paper/2507.12246"},"observation_digest":"sha256:130a01d2e13ff70d21c59f2aa172503c653d4cb808a93e721d65832bfd330301","observation_id":"6b4c861f-3095-47f8-99a3-80cd6d4be62e","resolution":{"observed_at":"2026-08-06T16:58:34.388831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.12246","last_updated":"2025-07-16T13:56:11Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T16:48:04.723404Z","submitted_at":"2025-07-16T13:56:11Z","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":38},"total_outbound_references":49},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2507.12246."}