{"as_of":"2026-08-08T05:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a3eb1f6ccdd48cf658273b46ebd0dc1ff878cb4f7ca6e553b732231153287673","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-07T06:34:17.273281+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:34d7613b4453352093d812f293048375e0d952f698c7ee526d01f0d904b38219","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:38f3b0b1c3f32b48a947ab2b1bcbc635a97497841ef6498580120dfb2c8bb99f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:c4de85cec54519b81ca0057179da07a98c37db46605044141b2594d25a1b59a6","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:e11a954141d2a44506b5eaf3588595ec3e31a15f9a1be4f436d37aef8a8cc50f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:e32a4fc808d54491c73d5607326e308aa0d944656a9053430f7345c9963758fb","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:852de2fce5188f76c71c3cb35799b8b330fc9b5eaf4ac4489d9f4515bd40ebef","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:1bc49cc2bb033d7c64bb9b209b5d466fb9ddde0228c9f7a209816b16978c8b26","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:77551907b9361a41ae2edba5217a581fc1845c71a278974a0ed829e5dcfe5b5b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:d1037c65e47195c53b1e9cb454ae47083d21296e38a667ac78ef4ee367fe48ca","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:1d163845368c93cb55fbd6d056eb4a448e6d64183bb4ea4b7b9dc776fb2d8d01","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:9bd63d2bb0b0826ed7993426cf8fb3343383eb68dc66754c57da26d8f7cded42","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:59de3c3c28671cdb00375f3755d9cc4b28101e02ac20f6ce1a4581fdf1fd687c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:5a1b48f7ce919eabb065f1cc2c04d231b27faa3de2b8efad1812c5f9ac8d0a53","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:5347a04439690aa5100c67086961859dac896fcff91063e6906ac15ecf806e53","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:45db16d3f4f617a76923302e4799a47dc3f414c9d84b60319986e614bc28fce8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:e541a35cc549ec9f1950cb1451dbc5a4387ebab38019ba171621545d20a06732","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:c54ad152f6a2bd6fecb1da046c36e556ba4d99c7682184080e8cf43aad66a558","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:f7c1f2e437a1cc5719fc345cd752d33452314760c0c9ce228e34f2ac1b8490e0","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:00f1a767ac021644bb9e4de62db6ecc7f7e27f1898acab9f1be0d582199a7eb2","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:c7926efc794eb93beea09051be877c0517920d8acbeb41511cfc4cc51f415ba9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:136813798f81013ae3e1d28a59672ab77467332dd1010aaa1ec03eeea0af1052","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:7469317b030cb662a8e5efa822cc125560c58208a87ae6245adb29eaa70c9556","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:1d7f7b74a1612fc2a2ec282eadb7a0b69c216c1113f18d1a331d1d6430fceb7a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:053a6f60e8bde4c2cd00e174ba3b2cfc2346caea960790299e178263c9e4c6c6","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:0e17b470006548670d6127c60b1036a40620cd60ea948f8151246628af23513b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:09baf081a19e253dc6849559bcd3d6f67d20276d8416044fce04568f65dfce86","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:0afea0119950ba8132cad787665191584d72b06d397fb42782f0c11463c270c4","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:25dba48676d3dd77df4d989b29a01e061f2388838091858c7685c3d9f3273cd2","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:0b645c7a2c9f49dd8169b6a012f7bc73f4a1ca0acea30dd3b86501fe0471722b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:d14bf1ef99a59c295faff3792b2d6e7f195fd248fc3fba1975d00dbc5f3da368","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:dbd857e2039a689381f688d4c81741ed2eaf30a13810884ca2befbe9e2ed382b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:0f94f139bd0c1ff30ff93cb58213b5b63c77983b11bc261fa9d7ff85b78507f4","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:89a5426e009cae2923c1b0ee8c92b3ce8b79cba255251a75edf2610442b97501","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:52ea9a09094a35c965e8558edaa699847c4774f5b432f59789dfc967653c3c97","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:70d1bb4e01d95716df99e6bc8bdf49f6e578a13dad0e9f17b52d37a0ad587825","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:3a7212e660bf99280f62fdf484562e0fffe6865a01ee58668c14535da7c8b708","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:7d8da41bab6848500331cbc6c6726971aa47d98127a6b02a793c1e004961006f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:398699d86ba1ba2bd300693e62e837ea38b37ac80fb23388d6d4cfeada26dc91","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:bf9bcdf269493f652e96ab4872f725a5c5e7bedef57bbbce5baa151f91fabe59","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:40517a9dda2e669256d784991095a927ded37f401373959f3ba5a9c660700dd8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:c20ad694086ad6c717f8338450e549c2f53638e78dc7f54b0970e6c400bb566b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:7e17e10a703e0c7421bb4d3e813769f499fccce5848f1445a2f6f5673922db82","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:210415a63b536e5b95997e3acabe091430549c377a8988b4e5722e09d87be068","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2507.12246."}