{"as_of":"2026-08-14T19:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e561917ae5beb3afc26db21c9758e10ff5c9119a7c596f30d9d187fd163a754c","coverage":[{"denominator":173,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:10:34.691626Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2608.09513/citation-record","integrity":"/paper/2608.09513/integrity","json":"/paper/2608.09513/citation-record.json","paper":"/paper/2608.09513"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.145188Z","title":"2017 , publisher=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.145188Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:22f2d4b201680bc13d458a6475a2d2b43b77efeb9fc332687b0519ed785a20e3","observation_id":"d6b00c36-e421-4430-860b-f496742911a2","resolution":{"observed_at":"2026-08-11T16:10:34.145188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0005055","last_updated":"2000-05-15T18:19:59Z","snapshot_observed_at":"2026-07-07T07:03:25.387553Z","submitted_at":"2000-05-15T18:19:59Z","title":"Quantum Amplitude Amplification and Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0005055","snapshot_observed_at":"2026-08-11T16:10:34.151229Z","title":"arXiv preprint quant-ph/0005055 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.151229Z"},"links":{"cited_paper":"/paper/quant-ph/0005055","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:c28f552c570400951e69c36da9f84002d4a81a2ea2250d4c72273c8a5d525e03","observation_id":"feb5e6cb-44bc-4003-b7c8-fa334075c5b1","resolution":{"observed_at":"2026-08-11T16:10:34.151229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.08675","last_updated":"2016-09-22T09:32:16Z","snapshot_observed_at":"2026-08-10T09:50:32.227065Z","submitted_at":"2016-03-29T08:25:22Z","title":"Quantum Recommendation Systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.08675","snapshot_observed_at":"2026-08-11T16:10:34.156806Z","title":"arXiv preprint arXiv:1603.08675 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.156806Z"},"links":{"cited_paper":"/paper/1603.08675","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:66ba277c64eaf8fa19055728a95dbbfb071be67e3c526bbb6cbb423c4e13074d","observation_id":"d966f8a1-ff30-4e22-8380-159ad7ea2a58","resolution":{"observed_at":"2026-08-11T16:10:34.156806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.162232Z","title":"Mathematische Annalen , volume=","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.162232Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:507862259008bfe11c1244ac9f1f5e89f77552feae9f56c16e96f1a4a60f8214","observation_id":"5d424655-02ae-451c-b292-f39704754609","resolution":{"observed_at":"2026-08-11T16:10:34.162232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.168219Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.168219Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:5ca6b82ec782eb20786d25c7e5dfd351eefa6ca3805f29da828215e8ddf787a9","observation_id":"08b75d4e-ef0a-494c-b447-2e4d94e56243","resolution":{"observed_at":"2026-08-11T16:10:34.168219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.173326Z","title":"IEEE Access , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.173326Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:96a2fd860e1912a0decd49563ef3c5abcab807469fe1618d3263070a9c9ec10f","observation_id":"2336f82c-488a-4a08-8297-a897bbc9981a","resolution":{"observed_at":"2026-08-11T16:10:34.173326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.178437Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.178437Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:a69bfbd9b47abf85e31aa89cdff8bb41cc74d4009436c5fad3f94a537c0f594f","observation_id":"621f67b9-eb5c-461a-9f52-e8dba04c2fa1","resolution":{"observed_at":"2026-08-11T16:10:34.178437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.183471Z","title":"Journal of Machine Learning Research , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.183471Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:307c4006ff99fb35ecd0d46616a02ea6f68dac7a45e241ce91a121867576130d","observation_id":"7781361d-8177-4eee-9f12-76174c4bb3b8","resolution":{"observed_at":"2026-08-11T16:10:34.183471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.189219Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.189219Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:4b0194c78104c7a61fdc0a496b31499c4898548c965b5a2218d353ba5f431869","observation_id":"80855468-6572-4645-b7c7-39f92830bd35","resolution":{"observed_at":"2026-08-11T16:10:34.189219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.12324","last_updated":"2022-01-28T18:43:41Z","snapshot_observed_at":"2026-08-14T01:42:28.541138Z","submitted_at":"2022-01-28T18:43:41Z","title":"Optimal Transport Tools (OTT): A JAX Toolbox for all things Wasserstein","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.12324","snapshot_observed_at":"2026-08-11T16:10:34.194535Z","title":"arXiv preprint arXiv:2201.12324 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.194535Z"},"links":{"cited_paper":"/paper/2201.12324","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:7f7cf7b013ad740fb95a5af87d780a582952a2a0602ac4e59b9a325c8587cb5a","observation_id":"6d620bbb-1dda-4b88-8455-ea7e9996e7b2","resolution":{"observed_at":"2026-08-11T16:10:34.194535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.200671Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.200671Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:88ebb05415fd3f8e526f5f75d8284818b0229f5f34f23ad97a006163a7c91659","observation_id":"e2bac5d1-e28b-4841-bd84-56c4dc2afeac","resolution":{"observed_at":"2026-08-11T16:10:34.200671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.205371Z","title":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.205371Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:f996daf2c17ab10074126374fba284051633a847212ac1401a75d9de8bceee13","observation_id":"3f619586-40b3-4f21-8da1-acbf7b2b2613","resolution":{"observed_at":"2026-08-11T16:10:34.205371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.210159Z","title":"1983 , publisher=","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.210159Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:2a53335c98004054df0b0ccb70a457944e9c263f63f881044e36778e8d847f44","observation_id":"007db78a-6b14-4599-be41-8ac8edddc366","resolution":{"observed_at":"2026-08-11T16:10:34.210159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9607014","last_updated":"1999-01-07T16:50:45Z","snapshot_observed_at":"2026-08-12T22:54:40.402900Z","submitted_at":"1996-07-18T19:12:42Z","title":"A Quantum Algorithm for Finding the Minimum","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9607014","snapshot_observed_at":"2026-08-11T16:10:34.215123Z","title":"arXiv preprint quant-ph/9607014 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.215123Z"},"links":{"cited_paper":"/paper/quant-ph/9607014","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:e4b24defd6d3148561835cefdc9b37fe14f3e401f1336ff7e96670c21050c4ad","observation_id":"7a840469-8126-4744-adc7-90d82d0fe7d2","resolution":{"observed_at":"2026-08-11T16:10:34.215123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.17356","last_updated":"2025-06-04T15:55:57Z","snapshot_observed_at":"2026-08-11T16:28:06.180172Z","submitted_at":"2025-03-21T17:58:12Z","title":"Fast Convex Optimization with Quantum Gradient Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.17356","snapshot_observed_at":"2026-08-11T16:10:34.220286Z","title":"arXiv preprint arXiv:2503.17356 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.220286Z"},"links":{"cited_paper":"/paper/2503.17356","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:130b3814842eeabd081d7322c3dcba5d7a6e42fef3b544f886f203b8f202154b","observation_id":"7c8ce398-e2c8-4aa2-a3bf-21ef3ebc394b","resolution":{"observed_at":"2026-08-11T16:10:34.220286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.225431Z","title":"In preparation , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.225431Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:ed229f9ad8036f230c11812ac6f894fd0ecb9a4b3295a40aa888c1eb6c217838","observation_id":"ce2a347e-3071-4172-b901-3be1c77e6ade","resolution":{"observed_at":"2026-08-11T16:10:34.225431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.231292Z","title":"and Andersen, Knud D","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.231292Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:24da7283322f234b370af5af798b10ffd219aeabe3d4033c449b11b8f088894c","observation_id":"a05a72f9-d66a-4c57-a855-8d23315068f1","resolution":{"observed_at":"2026-08-11T16:10:34.231292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.236987Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.236987Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:3c7ffd6705e87bd7af9651f437523368303e212f7bed84cf3a2d1918a4c8d452","observation_id":"94b34b7b-940a-441b-8bfe-ebd4979c5df6","resolution":{"observed_at":"2026-08-11T16:10:34.236987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.241998Z","title":"and Bernstein, Ethan and Brassard, Gilles and Vazirani, Umesh , title =","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.241998Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:99a12343899a64f27b52052da29019e311c2ff1e012c7640393faa0d31b41da8","observation_id":"d19c9f63-0aea-4770-84c5-9da7a2d995dd","resolution":{"observed_at":"2026-08-11T16:10:34.241998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.247970Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.247970Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:f1d136d8fb294d7a52a00444ed265c2cd9ba83d2008df9295cbffd02c11d349e","observation_id":"15722af8-1082-4491-82bc-3ce11f1f3245","resolution":{"observed_at":"2026-08-11T16:10:34.247970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.253053Z","title":"Physical Review A , volume=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.253053Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:96373cfbedff963b327aecd96b3fc508f991ff6f40b662644bd5c2a5ef06005e","observation_id":"a071940e-9e49-4f26-8fa8-3421f89a7438","resolution":{"observed_at":"2026-08-11T16:10:34.253053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.257873Z","title":"Matrix exponentiated gradient updates for on-line learning and","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.257873Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:65cea03120750fd23353d9b3ba37be4aefba11c45c56bed5ece80a4161438f2f","observation_id":"1fd26256-b0ef-4503-b55c-982cad86d7dc","resolution":{"observed_at":"2026-08-11T16:10:34.257873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.263490Z","title":"Quantum , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.263490Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:5fcef5c270aa3df00b4114e4faf0d295bea509e3b88b321ad4dbfff44121a6bf","observation_id":"aabcf9c5-e54f-49db-856f-27b7f821b617","resolution":{"observed_at":"2026-08-11T16:10:34.263490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.268346Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.268346Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:a2d97d9c95741f6206b2b59ed8bbabe204c0c78c452c67504d19673931c72c81","observation_id":"c7e9440b-df02-42c3-9367-27fbc4478930","resolution":{"observed_at":"2026-08-11T16:10:34.268346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.273714Z","title":"International Journal of Computer Vision , volume=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.273714Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:1ec54213e546989b0a79b014cf3c8b0a000f0fa7fbd7bc247dc60523064c5298","observation_id":"0dd2a844-1289-41a9-bf90-98e3bdb4aeb5","resolution":{"observed_at":"2026-08-11T16:10:34.273714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.279632Z","title":"Proceedings of the 29th International Conference on Neural Information Processing Systems - Volume 1 , pages =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.279632Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:5def515995067f9b68a01424eac5c20a7d4d7a01ab63f4df04baedc8cd2f2da5","observation_id":"3fad1368-759c-45ba-a5d7-899ae34956cf","resolution":{"observed_at":"2026-08-11T16:10:34.279632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.285407Z","title":"Machine Learning , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.285407Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:608dffd190dac06578ad2048266857a968db70b0ceca1bc0585cf1698479c661","observation_id":"bb37b275-f0ae-4a38-8ce1-8905aba5891a","resolution":{"observed_at":"2026-08-11T16:10:34.285407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.290438Z","title":"Panaretos and Yoav Zemel , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.290438Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:1b660ab49bf5d80723e278fdd91e546409f9209192173609d7b23975de0da674","observation_id":"a18ca0b1-4cf6-4a8b-b7e0-00a5da6e4863","resolution":{"observed_at":"2026-08-11T16:10:34.290438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.295209Z","title":"ACM Transactions on Graphics (ToG) , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.295209Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:3d673c6893e419fb6697b59155367931fd91e81bc4e7d97e37953d14429fce85","observation_id":"7b29dac2-ee89-44b8-9da4-b24fba02c839","resolution":{"observed_at":"2026-08-11T16:10:34.295209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.300215Z","title":"Proceedings of the 29th International Conference on Neural Information Processing Systems - Volume 1 , pages =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.300215Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:65c2c82ecf28e6ec7b95c0276c7b0d3563a19136269aabc487b6d26aed8fc09f","observation_id":"87b10996-f054-4630-9eed-1f48de6d6d64","resolution":{"observed_at":"2026-08-11T16:10:34.300215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.305043Z","title":"Proceedings of the 34th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.305043Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:6ad441bc14a8d70a80960b84c46b1105abf879242f98bf8da1b887dd3775f3db","observation_id":"4de6041b-7313-4a6f-8dd7-fb5323804732","resolution":{"observed_at":"2026-08-11T16:10:34.305043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.310260Z","title":"Interpretable distribution features with maximum testing power , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.310260Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:6468925a46b648e7d3651c2a9b34ffd2f09bdf2a9dc3b3ab56a2fdc8e4f39fc7","observation_id":"0ec4f79e-b618-44e2-bf21-b069994932ae","resolution":{"observed_at":"2026-08-11T16:10:34.310260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.316275Z","title":"Annales de l'Institut Henri Poincaré, Probabilités et Statistiques , doi =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.316275Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:c3cea5dd1b52a3f5cf9028b28ff67d16b26377147517d18df06c012704e3108a","observation_id":"71daccdb-cddf-4097-b611-2057466d5c02","resolution":{"observed_at":"2026-08-11T16:10:34.316275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.321067Z","title":"InterStat , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.321067Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:8ca5ddb85d7a2c45a756d2a61245210270f4ef3e52c1a285e4ec8d51f06329ab","observation_id":"8b12d776-b155-4908-893a-3ae6f2d726a8","resolution":{"observed_at":"2026-08-11T16:10:34.321067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.325765Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.325765Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:ab509867146004d582dea5e0acd8f5f69142c37881bd92cdf2dbd32bcf675ca5","observation_id":"f143798b-0f50-4698-b736-76cb4834224c","resolution":{"observed_at":"2026-08-11T16:10:34.325765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.331328Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.331328Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:eae7671b09a5f554af0651f6943725b7d1924a44c21209cee9329e990f282eb0","observation_id":"36bcc4e9-7331-4a7d-8872-f7e765626c82","resolution":{"observed_at":"2026-08-11T16:10:34.331328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.336711Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.336711Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:66f1c156b8ca248966508ef96565161300353c7927b1ff7593c3d14efa4636fe","observation_id":"cb7ac264-abc7-4965-8959-4618da8f492c","resolution":{"observed_at":"2026-08-11T16:10:34.336711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.341721Z","title":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.341721Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:860ea185598cec198c3e241362ce8dd82034fa1c74cfa178fb2965b5b1cf13e4","observation_id":"3f31d179-2df2-4e99-8b5a-9f98391ad6a7","resolution":{"observed_at":"2026-08-11T16:10:34.341721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.347039Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.347039Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:d73383dd7ef3fe8540f594c7ca1ad6c3c1cced601d0d8a949e7e9134beb05854","observation_id":"4174283e-6964-40a3-8941-bd11ed102085","resolution":{"observed_at":"2026-08-11T16:10:34.347039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.351897Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.351897Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:623d042c8c45d1b482e9bbb138a0992565b8881662bd11ae8a8b9a8a625ddddd","observation_id":"d224a633-282a-48c1-9177-5df51d4992ca","resolution":{"observed_at":"2026-08-11T16:10:34.351897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.356928Z","title":"and Madry, Aleksander and Tsipras, Dimitris and Vladu, Adrian , booktitle=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.356928Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:e596ca7fb8d7fa2b0c68d11a46f42cb04aacd898955a8f56c92171dceec39e3e","observation_id":"70517436-7e80-4df9-8a1a-d5a063ff543c","resolution":{"observed_at":"2026-08-11T16:10:34.356928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.361718Z","title":"Proceedings of the 31st International Conference on Neural Information Processing Systems , pages =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.361718Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:d4c763a6b91efbb013ecfb0728947e761be53c94ffb5f60ee72c8a39533ea96c","observation_id":"75118535-fcdc-4f47-bfe7-c50b872c38b4","resolution":{"observed_at":"2026-08-11T16:10:34.361718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.11104","last_updated":"2018-12-28T16:40:22Z","snapshot_observed_at":"2026-08-14T17:37:30.516812Z","submitted_at":"2018-12-28T16:40:22Z","title":"Entropic approximation for multi-dimensional martingale optimal transport","version":1},"cited_work":{"arxiv_id":"1812.11104","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.11104","snapshot_observed_at":"2026-08-11T16:10:35.959470Z","title":"Entropic approximation for multi-dimensional martingale optimal transport","venue":"math.PR","work_id":"0003cdfb-821a-4770-9ebd-4532d1aaaf98","year":2018},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.367729Z"},"links":{"cited_paper":"/paper/1812.11104","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:3b127e925aa2bcf7b6a819dd940e5c9e3ce564ad4518867f7ea2bf13a3b052f5","observation_id":"880e2328-82b8-4e1d-8d96-87e90e1c42e7","resolution":{"observed_at":"2026-08-11T16:10:35.965011Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T16:10:34.373321Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.373321Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:c0adca27ab685338d86bc3c247b52e4fa5b9f2030036cea611428c30d4353e61","observation_id":"5d30638c-8ff6-4b82-8544-2d79e262f561","resolution":{"observed_at":"2026-08-11T16:10:34.373321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.378440Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.378440Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:82368b71625ab1c9faf491770d24486861b7abc862e48b9aff8c80855750b558","observation_id":"a11b47f0-0d3f-4e85-90f0-789d0e54a16d","resolution":{"observed_at":"2026-08-11T16:10:34.378440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.383954Z","title":"Journal of Mathematical Imaging and Vision , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.383954Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:9a5ef2949f3f55d7801c8d00e48b2da52bd67d20c6829bb9c96f5046c7078320","observation_id":"3bdc7580-951a-4677-a4ef-fad0d233a90e","resolution":{"observed_at":"2026-08-11T16:10:34.383954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.389829Z","title":"SIAM Journal on Financial Mathematics , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.389829Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:f95b8635e29d2b30f1bf823df997cd54f970c27f2e398b217df5f2734c4b1c4d","observation_id":"5c885e0a-b9dd-4546-ab52-dfe19b9874ac","resolution":{"observed_at":"2026-08-11T16:10:34.389829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.395388Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.395388Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:aca20faf588e63b4ee2ed466fe2204636d607e54c75f4e6154b87b87d07e031d","observation_id":"8851eeda-c0f1-43f1-8244-4ec8dc2dd1b1","resolution":{"observed_at":"2026-08-11T16:10:34.395388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.401038Z","title":"Calibration of local‐stochastic volatility models by optimal transport , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.401038Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:450c9f406a8930aa1e036c27e7a9f283eb40cec0a6b7f108cdb1304f50ae886e","observation_id":"60c34371-3611-4562-ae72-494a55dbfc0d","resolution":{"observed_at":"2026-08-11T16:10:34.401038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.411940Z","title":"Mathematical Finance , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.411940Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:dbabf6f3cad6528750b0de35937fc8e260d7296258d71629e408665b9571577e","observation_id":"9655c91a-ece5-4839-8e42-963a7800fff6","resolution":{"observed_at":"2026-08-11T16:10:34.411940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.417875Z","title":"Available at SSRN 4248643 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.417875Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:50feb2cd7a5d70c918e92df98c702b24bc717555b4483c4f138337179db453e3","observation_id":"85314d96-83c2-4060-809c-f43c21b0ddfc","resolution":{"observed_at":"2026-08-11T16:10:34.417875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.423531Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.423531Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:e2bf22c40986c7b18639851447cee0a083a808020baf6667d096e2168e491cb4","observation_id":"ad1801d8-ab06-4473-88b4-4710f8970f3e","resolution":{"observed_at":"2026-08-11T16:10:34.423531Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.428196Z","title":"International Journal of Theoretical and Applied Finance , volume=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.428196Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:06bdaf3d4b7e2cd0cb9e6099fd7a9c3609341ddad48d27319b8afcb3c92bc130","observation_id":"217634bf-81d9-430a-8e37-9d473a52ae5f","resolution":{"observed_at":"2026-08-11T16:10:34.428196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.432838Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.432838Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:5baaad0503f9679253ea026202788d35c5a092e126739024b95fcf331137fde9","observation_id":"ea8e8e73-7faf-40a5-b0d4-53dabba6b3c0","resolution":{"observed_at":"2026-08-11T16:10:34.432838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.437601Z","title":"Foundations and Trends","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.437601Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:a53f78375b10d6c8a29d9f0f56b063c700a9827edfcc4ac1a35f34c5911501c6","observation_id":"d6127ebe-9c70-4776-a6d2-c7e4eb6c0471","resolution":{"observed_at":"2026-08-11T16:10:34.437601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.443687Z","title":"Bulletin de l’institut International de Statistique , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.443687Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:d0dbc920dabd063f71d4b8d0f8a0b217c6bb8de6660e56a01557cf52ff96f3e8","observation_id":"f41e6f50-08f9-47b8-b289-c4265827dda6","resolution":{"observed_at":"2026-08-11T16:10:34.443687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.16456","last_updated":"2022-10-29T01:04:19Z","snapshot_observed_at":"2026-08-13T13:54:08.882117Z","submitted_at":"2022-10-29T01:04:19Z","title":"Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.16456","snapshot_observed_at":"2026-08-11T16:10:34.449357Z","title":"arXiv preprint arXiv:2210.16456 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.449357Z"},"links":{"cited_paper":"/paper/2210.16456","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:34c3b1b906fe276c39ea17cd9d4faf7bf6e8dd7fa2e691f2d4d4ffa997591a99","observation_id":"9398eee2-039d-4d7e-8430-3cc1780bcd29","resolution":{"observed_at":"2026-08-11T16:10:34.449357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.454456Z","title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.454456Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:bb87c6a211bb8a4c20b442b6cf1ae58569b31b248bb8034c1b9d2496e0def18b","observation_id":"07133904-d254-45b9-bdf8-9eddb669b696","resolution":{"observed_at":"2026-08-11T16:10:34.454456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.459390Z","title":"2018 , editor =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.459390Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:0b922b9b7e4c31fa2070d1e14b7f2bf0fffa75ee19dd950d8103004dfbf09036","observation_id":"67a7b097-65ef-46ca-a00b-927b707c995e","resolution":{"observed_at":"2026-08-11T16:10:34.459390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.465697Z","title":"Theory of Computing, 8(6) 121-164 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.465697Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:8450576d846c650e2a093a4ebfbd06171d0f9da936df7af52695b3d734c8bd36","observation_id":"f414a0a8-a2f5-464b-8065-1a9afe827443","resolution":{"observed_at":"2026-08-11T16:10:34.465697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.473198Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.473198Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:6d45b0ce379decfcbb312352c3676f599ebe099bcd653f5e14e4177d72124bf1","observation_id":"d4cc0b11-35bc-4f06-873c-dc7113101ecd","resolution":{"observed_at":"2026-08-11T16:10:34.473198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.478262Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.478262Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:72e81b628986b6e4a5eec1b16d8c15af3a0b5458e3bf71bd7db8a1ca9f4ce17f","observation_id":"c7b6869b-6075-4471-a455-33e85e34e67e","resolution":{"observed_at":"2026-08-11T16:10:34.478262Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.484302Z","title":"2024 , publisher=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.484302Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:055fb5394b177c18a24516440f3e72424647e25cee46dd28ad3a7a9ab31c3cd0","observation_id":"6ab2d53f-f3c2-4a16-a479-845cb9ddb29f","resolution":{"observed_at":"2026-08-11T16:10:34.484302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.489662Z","title":"2006 , publisher=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.489662Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:b2479f494a7d3c67b884f2c5c3298c49bc2aaea69402daa283a07c42ba0f0f27","observation_id":"a88b392f-ab08-46aa-b5d1-475d9c7b0892","resolution":{"observed_at":"2026-08-11T16:10:34.489662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.494689Z","title":"Foundations and Trends","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.494689Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:814c6bb14b5ed4e319e3912ed48ccaa91e8b260792ef85bb0b74513e396cb792","observation_id":"dc1137d2-44e0-432e-98d6-abf52bc4eaa1","resolution":{"observed_at":"2026-08-11T16:10:34.494689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.500842Z","title":"Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.500842Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:1d7db4db098f75ca443f889491f0b0fbd0513cd53f7947a30cb02619497b9e78","observation_id":"9e163e3a-307b-49ae-aa91-989b27d1158b","resolution":{"observed_at":"2026-08-11T16:10:34.500842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.505589Z","title":"2024 , school=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.505589Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:275225e30a62bea0456f29630eee72b96f9bc83f500d3f9782f5ab5f6f5feb81","observation_id":"38d397a4-f12e-46fe-9cc9-cd8f7a7bfa07","resolution":{"observed_at":"2026-08-11T16:10:34.505589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.510273Z","title":"Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2 , pages =","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.510273Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:d38d3db5a6df6b8168663350271fdd6b37587bda9d3ad9181a9174bdaeee051f","observation_id":"97854147-f4c7-4658-9494-c89cad03d042","resolution":{"observed_at":"2026-08-11T16:10:34.510273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.514972Z","title":", title =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.514972Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:a44c9ee8ac53421c4d1650677ff60811b32d18409e47dd8bc9aa8cd16d10847b","observation_id":"730d1dc2-c663-4d4e-bae8-a37edd79b37e","resolution":{"observed_at":"2026-08-11T16:10:34.514972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09959","last_updated":"2025-03-20T10:27:40Z","snapshot_observed_at":"2026-08-12T23:42:45.973453Z","submitted_at":"2024-06-14T12:06:21Z","title":"Computation of Robust Option Prices via Structured Multi-Marginal Martingale Optimal Transport","version":2},"cited_work":{"arxiv_id":"2406.09959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.09959","snapshot_observed_at":"2026-08-11T16:10:35.917737Z","title":"Computation of Robust Option Prices via Structured Multi-Marginal Martingale Optimal Transport","venue":"q-fin.CP","work_id":"cbbf7291-c75a-4106-81fb-ea44c5b7f739","year":2024},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.520089Z"},"links":{"cited_paper":"/paper/2406.09959","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:a5003418ee1909879c6ca6b1b0c4b6c41e2bcf6403a5c58eece4a451b24c8535","observation_id":"b2536e38-2c60-467a-9476-beb30aad7852","resolution":{"observed_at":"2026-08-11T16:10:35.923824Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T16:10:34.525632Z","title":"Foundations of Modern Probability , ISBN =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.525632Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:02120700fa0e86b7e073cb2b0a7ae58445dbf04fc7a7d36e5f042b73d287bd38","observation_id":"d2e1a5ed-669c-4294-af79-e4c0bb410131","resolution":{"observed_at":"2026-08-11T16:10:34.525632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.532126Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.532126Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:515dffb514f43b57227bdb613eec87aef437435d41559e4df51a80f069b79328","observation_id":"ae1ad060-43de-4116-b249-35f96c97bd2f","resolution":{"observed_at":"2026-08-11T16:10:34.532126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.537855Z","title":"and Akritas, Evgenia K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.537855Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:786441280e2cdd5d6449c4859f077704291bc74b83a54a961a7187d25b357816","observation_id":"de751068-40da-4968-be33-e5753cb243a4","resolution":{"observed_at":"2026-08-11T16:10:34.537855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.03988","last_updated":"2024-12-30T17:52:14Z","snapshot_observed_at":"2026-08-14T17:15:25.283156Z","submitted_at":"2023-09-07T19:43:32Z","title":"Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.03988","snapshot_observed_at":"2026-08-11T16:10:34.543455Z","title":"arXiv preprint arXiv:2309.03988 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.543455Z"},"links":{"cited_paper":"/paper/2309.03988","citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:18e9767071507b0a7f8318a60c9ebc05f074d31a793eac7dd4bfbca8cd758550","observation_id":"010c7f76-b172-446f-a4f7-f96e1856eb8d","resolution":{"observed_at":"2026-08-11T16:10:34.543455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.549910Z","title":"The power of block-encoded matrix powers: improved regression techniques via faster","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.549910Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:0138e52c696d89da8a24c03ab573a346d9f5679e93742699e99f3dcb838b7430","observation_id":"a5b5b218-69f4-43ec-8bb0-f62a9f8c79d2","resolution":{"observed_at":"2026-08-11T16:10:34.549910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.555644Z","title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems , articleno =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.555644Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:0418d7798d27926ae3affceb2e58456b67c33859dfb7fbd0bb4a7ee69afd144e","observation_id":"eaa9fc73-f9a8-45bf-a01c-2a877964a4eb","resolution":{"observed_at":"2026-08-11T16:10:34.555644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.560836Z","title":"Quantum , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.560836Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:2517b24bbd0519fecaa34adf640119b446621bfab8d174b302ccf437fd94d114","observation_id":"1d740f4a-8c21-4d93-90ca-4cabf52fca61","resolution":{"observed_at":"2026-08-11T16:10:34.560836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.566405Z","title":"The annals of mathematical statistics , volume=","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.566405Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:213fef5016a6b50a6198e726cdb45bfc4c73e37073036ea4bdfb1fc7a69deae0","observation_id":"41110f64-4a94-425a-a2d2-d5a2ac4f2d0b","resolution":{"observed_at":"2026-08-11T16:10:34.566405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.572229Z","title":"Quantum , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.572229Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:0a31e4a281a971cce083e587be6ebb59501b3638f5ee195e5c05b35310a1c85d","observation_id":"8e93da0e-d381-4347-91a9-b4d2780436b9","resolution":{"observed_at":"2026-08-11T16:10:34.572229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2021.110","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:35.343248Z","title":"48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) , pages =","venue":null,"work_id":"ede32782-8df4-4a71-87fd-546f4b63cb35","year":2021},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.580077Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:9c6557b5bd0171c1e88d069606348a61c6db4f36cde4780c583af307d9cc1a2a","observation_id":"ffef6681-fd47-4219-8618-f9ee2a20e088","resolution":{"observed_at":"2026-08-11T16:10:35.348338Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2022.35","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:35.325620Z","title":"39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) , pages =","venue":null,"work_id":"e125862f-f0fe-478e-9c9c-7b494b408a62","year":2022},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.585807Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:915b1c4bdd858e976456688ff09a9dc561ff397dfff0b43fd5dd670df932f514","observation_id":"6a72b375-ac0e-47f9-ba2b-2f7aceac1f47","resolution":{"observed_at":"2026-08-11T16:10:35.331343Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T16:10:34.591525Z","title":"On the ergodic convergence rates of a first-order primal–dual algorithm , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.591525Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:49d4d986ada13de3953d42d2f697fc974ad54ae29ca5af0a9e4026629544db0a","observation_id":"7a3c7b3d-f04f-4dbb-b193-435b21f40c57","resolution":{"observed_at":"2026-08-11T16:10:34.591525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.596636Z","title":"Quantum , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.596636Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:a8a7a7b2cbccfeb562db324479ade6f8af7605f84f64208c84259cd626a27b5b","observation_id":"ba05bf4a-d977-4000-9828-1479667f5b51","resolution":{"observed_at":"2026-08-11T16:10:34.596636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0024-3795(87)90136-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:35.298786Z","title":"On the interlacing property for singular values and eigenvalues , journal =","venue":null,"work_id":"16faf090-f60b-4c67-bf81-b6bbbefea5e1","year":1987},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.601926Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:9327bbc2a042cabda754220caf8f387cb4a2c52ca065edf7c7ebc59787d886b8","observation_id":"954e6164-fcc2-4b58-865a-48f04f53ea87","resolution":{"observed_at":"2026-08-11T16:10:35.303926Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T16:10:34.607402Z","title":", volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.607402Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:442e8bb08a379b27341f03bdb3d15df494273c1b42e7ad3ed74d59d992147ecf","observation_id":"dd439bfc-17eb-41f0-864c-aae7c04d79ae","resolution":{"observed_at":"2026-08-11T16:10:34.607402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.612099Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.612099Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:e1780f9295f1a3191b505b8c6ce7c3e7d5cc6cf1b45d1e9af07075c2e4096394","observation_id":"27fe7cf1-a799-4db4-981b-87e8754bb178","resolution":{"observed_at":"2026-08-11T16:10:34.612099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.616947Z","title":"Path finding methods for linear programming: Solving linear programs in","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.616947Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:cbaa37b97616b2307936e7ce44b809a4ce5bfa94eb0edf0963230f97ca74b03b","observation_id":"77901777-d51b-4e39-a588-5ef1c8f4c3df","resolution":{"observed_at":"2026-08-11T16:10:34.616947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.622035Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.622035Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:746f5cc43a4be82c64630ef69eaf61b1a1dc99030193b0199f3efb43b22f55a4","observation_id":"13364d6a-7682-44ae-b640-b61f7448df66","resolution":{"observed_at":"2026-08-11T16:10:34.622035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.627234Z","title":", journal=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.627234Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:c11d19da9cf60a648c10c6d00a4c40af9528864891b75e9cbc08dd22819ead44","observation_id":"99633a27-3aec-4c24-8312-7cff695218f1","resolution":{"observed_at":"2026-08-11T16:10:34.627234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.632676Z","title":"2020 59th IEEE Conference on Decision and Control (CDC) , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.632676Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:77c0913bf7b3f858cbd3fb3298e8122611256233267710dd8381fd4e18f93638","observation_id":"7fb0b449-5a49-4f96-9161-4016d9694a07","resolution":{"observed_at":"2026-08-11T16:10:34.632676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.638007Z","title":"Meyer , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.638007Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:1edcca584df7b6cc404ec920c17d5297b31149ce75e17c78356ee511ed454e44","observation_id":"5a6254aa-2f30-4231-8398-c863bd33a536","resolution":{"observed_at":"2026-08-11T16:10:34.638007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.orl.2023.11.007","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:35.282421Z","title":"Towards optimal running times for optimal transport , journal =","venue":null,"work_id":"425719b6-7523-40d0-ac29-ae0fe0627894","year":2024},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.644281Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:309863023ff458c08cffc4545d3a669f95e74451e8955611b94636006cb1f5d9","observation_id":"db1ee441-732c-4294-9c8b-2f462bc541c3","resolution":{"observed_at":"2026-08-11T16:10:35.287734Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/20m1375905","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:35.382285Z","title":"SIAM Journal on Financial Mathematics , volume =","venue":null,"work_id":"1b46f48f-4d31-4e2f-936e-f715233310f1","year":2022},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.649722Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:f34f37d3d37f2e5dca267b76ecd8d5dab63e499faa40198462a45749f8ed06d8","observation_id":"13f88279-b1b0-4fc4-b9a5-f87cbaf2d664","resolution":{"observed_at":"2026-08-11T16:10:35.388888Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:35.876082Z","title":"and Spielman, Daniel A","venue":null,"work_id":"4c8b82ac-6213-40ca-bde3-83f91c8907d7","year":2008},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.656156Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:ac01d3e304d6a58099ddd5957fa5343a9f1cf6d09c830e22d152b73a934abfd0","observation_id":"1535ef4c-29f1-429f-be56-9e82069f0efb","resolution":{"observed_at":"2026-08-11T16:10:35.881819Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T16:10:34.661820Z","title":"2003 , publisher=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.661820Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:5f62f0f0b781f5783c1b61cc1f00deeb50649c3f00956858357351d00b89b5c3","observation_id":"fb35c2ea-c373-4c4d-b3da-f543b94499dd","resolution":{"observed_at":"2026-08-11T16:10:34.661820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.668038Z","title":"2019 , note=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.668038Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:d98c27cfb1c97477ea173d4c49b07997aaa2dfdb419e4eecf88d2d31636cadfb","observation_id":"31967d76-9603-4242-b47f-313bc5fd5a8a","resolution":{"observed_at":"2026-08-11T16:10:34.668038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.674241Z","title":"Proceedings of the 40th International Conference on Machine Learning , articleno =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.674241Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:bab04077399c97312fe211f7ce50bc51d7df937e9a509ffdbdbce8596414a703","observation_id":"9edf5813-51f4-4b0d-ae26-3f611d6fa83c","resolution":{"observed_at":"2026-08-11T16:10:34.674241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.679427Z","title":"Proceedings of the 37th International Conference on Neural Information Processing Systems , articleno =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.679427Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:582415078961ca131c6aa8c2bce46d3ac230d35e1d55e8581179a69221757fbb","observation_id":"1a5bb489-81df-4204-a3b3-4b15ee497207","resolution":{"observed_at":"2026-08-11T16:10:34.679427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.685134Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.685134Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:dc189afade165511095de8da9e77da68956fc7903c4fa128b613c3234ad7b9eb","observation_id":"87058b50-b18f-48f4-a797-f28ffe93e771","resolution":{"observed_at":"2026-08-11T16:10:34.685134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:10:34.691626Z","title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport","version":1},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-08-11T16:10:34.691626Z"},"links":{"citing_paper":"/paper/2608.09513"},"observation_digest":"sha256:e3ecf19a72947909a4e40e891c217b5b8800b043dba566570cc19c73010fea5a","observation_id":"2599466c-c310-4263-83b6-a81498dbad7e","resolution":{"observed_at":"2026-08-11T16:10:34.691626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.09513","last_updated":"2026-08-10T12:14:25Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T23:44:36.017224Z","submitted_at":"2026-08-10T12:14:25Z","title":"Faster Algorithms for Multimarginal Optimal Transport"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":2,"unresolved":90,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":173},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 100 of 173 outbound references and 0 inbound Pith citation observations for arXiv:2608.09513."}