{"as_of":"2026-08-12T19:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f044259cc85549482e07d3a9d228e4768e2ed630c63dfaabac125f696d54984","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-12T06:34:41.77262+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-12T18:17:33.358519Z","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:e3be7498793a326ee6dd4f7a16956257aaa43769dca02dc7b1227473b1144ba5","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-12T18:17:33.358519Z","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:b1e388aa88bea98146b3858819a2874fa7ccc4500554bb88d2479aef869991fe","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-12T18:17:33.358519Z","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:372a568eaeca70e138ed01d42d7ebc1fb7ec28a2d3f7ea5bcfdb68577de8c5fb","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-12T18:17:33.358519Z","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:a595b327a911baa1e0f279f8dfd1eb131b92b2770f888302b08477b35ebaeb44","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-12T18:17:33.358519Z","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:4618be001691159b10d0bb0d14a8149b98f7cdc441167ce94d10c03caca00294","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-12T18:17:33.358519Z","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:309259bcf623a59a297cd6fe4b29f73d2579fe01aedb222a27bf0b665eea47bd","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-12T18:17:33.358519Z","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:bd9ae13225290aec42b7d35b323de48aa011cd8d329962618704674632e95477","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-12T18:17:33.358519Z","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:e8a3c110489f7afb968a1f698285ff6b5a33d5ed3f1c58ccf73a36b079d45e9a","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-12T18:17:33.358519Z","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:a99e392fe32775278af839972af4059e558d6bb748789a82caaed4dd6b4b8667","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-09T00:29:12.885708Z","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-12T18:17:33.358519Z","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:10da2c1a4b4cd163e7242539d9dd4c479562859d454da457019ea30def3a845b","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-12T18:17:33.358519Z","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:231e43d98fb447a71b8247bbe12ec6f6e7ae63faaadf16bf9f54ef8e79831dfd","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-12T18:17:33.358519Z","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:4c8851ab3bcfe5a332bbb75acc6b1862b308b48d008d4943f64957db4c036112","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-12T18:17:33.358519Z","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:ddd0e45a037dc8527da499c61c669af0591fd54437abcd975157755410522c27","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-10T23:37:29.450602Z","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-12T18:17:33.358519Z","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:5f0ef76443fa803c2bfa602358c0061b387b82abc0a06bc254d83a602a1d65e3","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-12T18:17:33.358519Z","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:5176cb89f289d3b86b3e26e1a5408b4303a3f4ef75aea583725ec7ac4e38fbcd","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-12T18:17:33.358519Z","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:cceec9629a72b5142a4c7853adb299ad090455d88ceeb1c0187471311ca22a16","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-12T18:17:33.358519Z","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:72a572dd814f4896026cfe3107f96d1c12a8da0ac701ccbb793841e575062700","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-12T18:17:33.358519Z","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:69fc31f4d2ac45aaccf875413da724a928e8b7bc7e2a5532222da885ecd7eef3","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-12T18:17:33.358519Z","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:c10c648ea61dba7f9128da357978b755a822045ecf972e5f485c5786b516f8ed","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-12T18:17:33.358519Z","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:5e52ef083c5b8438b954abada94b94873107fca4e07517b62684c41867dd5556","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-12T18:17:33.358519Z","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:db07d11142797b71cce8963ac4e737dcd7783e74c55a380594f110be8a69033e","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-12T18:17:33.358519Z","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:c275e78c8df7fd7ce401f3803357470dbd9bcab54da1b68b8098b7bfb33b60dc","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-12T18:17:33.358519Z","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:909020730289b67287898228ba90c16f50062226be2aa82184fa6d19439774f2","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-12T18:17:33.358519Z","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:896c24e1e8ab6e81d06ed0e2226dc23031a480ec15cf38498d9bc12aa674020b","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-12T18:17:33.358519Z","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:1a1ea0796c5d066e718a209ac5aaf0b577b93dcc2043e592a49335626044079e","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-12T18:17:33.358519Z","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:8c2d79024609f9fa4b5ae5b8d123a66aa2d63068b08b9dec855573e1f4ffc208","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-12T18:17:33.358519Z","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:0e867b6c9d398f269b20bf3ccb589acb2b2dc57871254ddec1505dd7bb078d01","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-12T18:17:33.358519Z","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:d179a2377ed2aaae559052a47c7aef9d638542c8c3ec953f591584e08dc493ac","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-12T18:17:33.358519Z","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:69af459af70e46ca7e10db2b88700546a157af4b9a196af0c1eff21f98533b0f","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-12T18:17:33.358519Z","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:25d30f791d76e15b76620049e9571303ce92e762845d7fc78174d49947904349","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-12T18:17:33.358519Z","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:522473bc0ea58cfc535dd122cff250893fd8606d633c9e0e9270441506e16ef5","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-12T18:17:33.358519Z","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:f40294744afff6f470bc7c34fc038171c4284bf59351c7764a4d641887e71d05","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-12T18:17:33.358519Z","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:5c4ac80937b46f8738b3e52bf455bfd44e6cbf08605a5261cda269e5e57e55cd","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-12T18:17:33.358519Z","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:17af47a1f781d8f89f15181b5a29d0f45084fdb004784aa67b90dca81b571b21","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-12T18:17:33.358519Z","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:29c45222093fc896480c9b2aee269b93d476c74cee03896d992d7cbfd768b9c2","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-12T18:17:33.358519Z","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:15c4a98ce13a237076bf33ecf44b9ecf086d821786ef2be580c30c859e94da77","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-12T18:17:33.358519Z","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:282ef231d9df84e6b66b191385fc12ba9a7c037501e7d08a13c3c17fc59e70df","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-12T18:17:33.358519Z","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:30082dd1a168cf343e2d0f1f3af5570741307b8ed734e2c9c72af28320f7afe1","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-12T18:17:33.358519Z","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:8c621e97871a24ef42fd5f4d04e997b6cb703e1f0b3b7856caf0ce7e358b6301","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-12T18:17:33.358519Z","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:fddf521b85bd79f5cc050a13d96936e9493720f25cae6463bebdaadf925521c3","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-12T18:17:33.358519Z","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:7d279d0b3dfc9531b86be9f895983533e0454c48915e09688d3622a13aa23564","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-12T18:17:33.358519Z","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:fbb7631c60f9e2bf73b9aaf6e89f0613955917d6335f2f88c06783c2194bfd7c","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-07-06T07:23:52.401834Z","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-12T18:17:33.358519Z","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:c4c8c810f3a47f03f166b160656911ce80d625683d24f9e06449be6e6e83868e","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T18:17:33.358519Z","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:c6f5832c41b9d3c3580bbb1a18c2c1fa7516e3943389e42c6e300c74c84a48ad","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-12T18:17:33.358519Z","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:7df505cbef4f00e06dc88ca67ea5b6d5ccc3350ee6274cbbb08a5e8d1b3ea678","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-12T18:17:33.358519Z","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:a093627af2b2dfa48e54c156e3adc66ee4cc76980ad7ef6342935c256f234324","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-12T18:17:33.358519Z","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:15f8d5ae4a94f43946548c54a07a755967f375afeb94f48ddba1c11db748e6d3","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-12T18:17:33.358519Z","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:92ea930143ec51dab6a704a3e43073f4ca1d6a82171995bfe73ac590981eb0ec","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-12T18:17:33.358519Z","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:70e213adb4a53adb8ae984547286a3cfaf3578d38d674f6419885e01a3562000","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-12T18:17:33.358519Z","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:42576d8cb2aea02a2987f7822dbbedd2245b9cf66d9998de03be29c6f6727c93","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-12T18:17:33.358519Z","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:e61a11586ba4f718cc1964d99c8578627144318682fa0f6b938bd73683b41aab","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-12T18:17:33.358519Z","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:b754c9437d27d65a3ddf77d5ca3d5fb02eed69fe5dcdd1bb441d039a1ac5f5c0","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-12T18:17:33.358519Z","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:32760dddd0d2539aacad4b8a8513cbfa3ab24ed60efd6e2363a18ee7d6cddde0","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-12T18:17:33.358519Z","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:beaaf1d1f69c504084f59b4e700575e6856250c1fc11892b6c7a761a50a3ca0a","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-12T18:17:33.358519Z","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:d90d6abf0eb2735cc976145d117f045f4303f1513cdf3eea367ff7b6a6324e6e","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-12T18:17:33.358519Z","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:08df8885fd76d768cb107e6622b61d3d9fc1d06ce7b74f2cbe603e2bbae5376b","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-07-06T14:11:55.178649Z","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-12T18:17:33.358519Z","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:5cf779ca96b0b2cb801d77c44b2674c99b914cb6382263d83b553c994ba0f150","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-12T18:17:33.358519Z","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:43170a491adbe15ad84f5793420d92059f0d3f6c47676eebe1307fc7351cbde7","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-12T18:17:33.358519Z","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:0f8778357f82f8b06eb7b933bb50606c0dfc22255e7b3d806a522d0a3eac812b","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-12T18:17:33.358519Z","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:68dc280447953495d9fd2e00ca36c99bd55f2ba5e2ac2361da0a02e7e28efa81","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-12T18:17:33.358519Z","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:9e2cf8a8d8c3f5671d4979904db47ec2db2747fdf972fcc40e45866fec6b75d4","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-12T18:17:33.358519Z","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:792eb99b91aac523a3959605c575958177bc7311552a774c440d7b132fb8e3da","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-12T18:17:33.358519Z","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:caca736e929754f98410bb91000e97a485c48f0c6208d041f69003146f41363b","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-12T18:17:33.358519Z","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:23adc390056f59a436f77c2e76f4eb7c7243c88da3e53cd0a8957878ce8d624d","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-12T18:17:33.358519Z","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:570bed97a479fcf95471b30847615a4dbbde78e57eac8435cb9027802ef89d2a","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-12T18:17:33.358519Z","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:97997439420b269ea81435e6b42c86c55e07165568f3e47145c363140289ae61","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-12T18:17:33.358519Z","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:a3b5a813ae06088b1db1afa0a57b7d246e6cc397a30d265bf5515080e13c262f","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-12T18:17:33.358519Z","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:2d0539f82fc54711d1e319d6c9aa1a75d575fa2589ab099eaee1b67b3de1fc0f","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-12T18:17:33.358519Z","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:9437309bd93a2fa63e681181838f06c3d1e6b76325c29f110d7291b45cf27e28","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-07-06T18:30:59.857334Z","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-12T18:17:33.358519Z","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:6a0c0fbfdd765682940243d6b1b3fb0f8d57d1ad1d3803a0d4bf6849c4db99ce","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T18:17:33.358519Z","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:c950af608ca67711ef07719685c850fb9dbe5a9fba99a8a9f140b813d7686e9b","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-12T18:17:33.358519Z","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:9ddd50b1c45aa32ac89dc50eaa72a8ebc2e7c2c592e852b460020de295a248bb","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-12T18:17:33.358519Z","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:589dc1c9306d3c416a58d679ca5bb6d89f446bb065c1b54b641bcefd39a8138b","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-08T06:49:33.857954Z","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-12T18:17:33.358519Z","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:dfecc1ffe67a2e4da76ca9c06e80ad9eb790351893d90f14c1b9a2cc9ba7801f","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-12T18:17:33.358519Z","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:c02bcc66195a5419f978c860bc82c9fa90dd6f8e1d6688fd88faa14d4451a09f","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-12T18:17:33.358519Z","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:f4b284cab8daa6784f66d0cc411d0654acf048e9d5c972f85c3aeb4f208453dc","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-12T18:17:33.358519Z","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:f509f1dc5654cac976e6f2d91bcc19dff7fac4bec8a9dfbaf366a53d1ae0c6ea","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-12T18:17:33.358519Z","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:f4c72086545b7775b5069c8ef3848a034585879ae838543dd1894f42c760edd2","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-12T18:17:33.358519Z","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:2fc7de210f5f0fd4831628666cc2c13be8e1c4df1ef7cd4d35ff3755dc1b4e23","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-12T18:17:33.358519Z","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:4eab07cf7bc7ae7e9e6477145eed5e8c52e6bcb6e8d813ef830ec736cf7b5f12","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T18:17:33.358519Z","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:b39bc7a18842d0a73fb9bae2e5579f74786e0bfaa29c7272857d08dcefd74023","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T18:17:33.358519Z","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:aa63d24d7ad7d8a706ac9f1136e618312f29c1ddfb9501689b82499ce76d23e7","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-12T18:17:33.358519Z","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:1f04673bd6908daea0e720c07d0967d43d91813ad4e2b2bf3b33f9e282cd4b66","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-12T18:17:33.358519Z","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:05dedde6e09e604ee737706df966637474a3f7bf7769e493e0e1dd230647a598","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T18:17:33.358519Z","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:c6ce19f1903d15de5311d52f4ce8b5f983a2fcd17a69a0943974478de2af191f","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-12T18:17:33.358519Z","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:ace2e29abc2c5857f0a30e8d8f7daf9b1ef80b33af19e87d64163c2b258609f1","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-12T18:17:33.358519Z","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:fb1d6cb3c208ef18258242cff1cd6c658794ff12a9d98267bf369830416b273a","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-12T18:17:33.358519Z","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:789ef682442498cdc0f73b9a4061d721a870d088a18e3e8fbe8e29b0e4d79560","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-12T18:17:33.358519Z","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:6852f58c48036e0ae8d99b0892ce0360445f4cf3837213e25e7cda8872b3ff1a","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-12T18:17:33.358519Z","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:580e2329c01ab291d4a4c52a2d670029baac8e49f75dacdab71236ae5b0fb4e1","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-12T18:17:33.358519Z","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:9202eeef7bcd3bdc101e525f83776612bd39f4632b811decdaa9c4ad7682cdd9","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-12T18:17:33.358519Z","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:733af2870af56ba5ff43722c98e54de1b748650302f5c872c3d96e98205187f2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T18:17:33.358519Z","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:0d6c08c12e5e9f57940a68fec876d255f9a2ce4c20070c2d9b8afcbd21a839ce","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T18:17:33.358519Z","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:8380a40245b4e075c3e0677f9ebb4e90f60c1dd2963c284c5c6fab48816ea0eb","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T18:17:33.358519Z","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:c0bb0cbd6cbfc77417bdf971579f16629bd91b44c3738608e3f717865b0134e1","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-12T18:17:33.358519Z","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:8d0f9e4826e418b3e35d95743511a2413473e61804ab3847e9d1325a7e4bc646","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-12T18:17:33.358519Z","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:192c1e60ff210f0375f5970f71cb5e7b5793c4c1f8fd262686321c961d17def0","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-12T18:17:33.358519Z","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:4ea27677eb4ac563b5c6f0ad932feed526d05383147dce47d31fd97804f61b3a","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-12T18:17:33.358519Z","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:9816c364a01f20603845a10be1ec724cd86cd8569c366f9a31a24b6f1d7329af","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-12T18:17:33.358519Z","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:d35390053906b5f1d48b5996ee38919a1f3dbbe58c946b8a4fb78b5bcaff83a9","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-12T18:17:33.358519Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 173 outbound references and 0 inbound Pith citation observations for arXiv:2608.09513."}