{"as_of":"2026-08-11T11:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2e2899438d16dbeeddc3702bcedb66364c13d429a05cbb6c9bde3f028dda718","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T07:00:39.997123Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2511.04607/citation-record","integrity":"/paper/2511.04607/integrity","json":"/paper/2511.04607/citation-record.json","paper":"/paper/2511.04607"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:00:37.342397Z","title":"& Carlier, G","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:37.342397Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:38dcca6b0519f1d7b4a507b1f2abb8347bee39aa7af566710cd62a29ad105811","observation_id":"af699cc5-138d-44f7-8d76-59979f7aa610","resolution":{"observed_at":"2026-08-04T07:00:37.342397Z","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-04T07:00:37.397377Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:37.397377Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:d9a8ead81f19e43d6f06f4a5260eea117717dad69b31baa48e6e6dc56087edcb","observation_id":"492bd438-770d-4cd4-a175-aaf38152877f","resolution":{"observed_at":"2026-08-04T07:00:37.397377Z","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-04T07:00:37.470490Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:37.470490Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:68ac2660a9ba8e7001d225f8cce59cc3fca7503f4a59c74e1c094a1f31aa97c3","observation_id":"ceba0a06-7528-4315-9161-90e566b44944","resolution":{"observed_at":"2026-08-04T07:00:37.470490Z","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-04T07:00:37.572907Z","title":"& Miller, J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:37.572907Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:6b92fa4d4b2937bbac6256ef78041684d1f28f4ad717a69d1e6f5dbe0d1bc63e","observation_id":"a3eaa2f1-c898-41f3-8e55-841c769ca30b","resolution":{"observed_at":"2026-08-04T07:00:37.572907Z","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-04T07:00:37.699596Z","title":"& Peyré, G","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:37.699596Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:caaef33dc5a81fee52cd34b62004f11488bbe8f30ff39eff128fcbb8b2ccc2c8","observation_id":"b1e251ff-6ac0-4ee9-a4c0-2f8f65a9d6ac","resolution":{"observed_at":"2026-08-04T07:00:37.699596Z","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-04T07:00:37.765164Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:37.765164Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:38e96a63b4fbe5670c2feb79b96e6203ebcd6d421a76b4d54e538890947ea385","observation_id":"bff350cb-da36-4087-9beb-9a61f2566121","resolution":{"observed_at":"2026-08-04T07:00:37.765164Z","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-04T07:00:37.879876Z","title":"& Cuturi, M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:37.879876Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:6a9e0c9cc956c0a4023b13aecd6ca052d0edaab6937f3a687143bb1c5e890400","observation_id":"ac8edaff-26ed-4cf7-bdb2-d78900b8d6b8","resolution":{"observed_at":"2026-08-04T07:00:37.879876Z","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-04T07:00:37.977041Z","title":"& Pfister, H","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:37.977041Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:12ffbd9953b2f389487437e165623fd45a41b938d244281c06cf3f4414c44921","observation_id":"0e6759c1-8b25-4d90-bcda-3609171ce38e","resolution":{"observed_at":"2026-08-04T07:00:37.977041Z","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-04T07:00:38.046252Z","title":"(2022), ‘An lp-based, strongly-polynomial 2-approximation algorithm for sparse wasserstein barycenters’,Operational Research22(2), 1511–1551","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.046252Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:50d19e9db3f07dfce806338021da9f0590712571b386c0a2e868ef9f4adc515c","observation_id":"305a61ba-6e19-47ef-9006-d923c30ab337","resolution":{"observed_at":"2026-08-04T07:00:38.046252Z","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-04T07:00:38.133114Z","title":"& Patterson, S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.133114Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:f847e9af22e36643a68e3e923f9da6850c4fb8c93a327a6d409b1a2fbdaeef74","observation_id":"52fd471c-daae-4b0e-9da9-97a67af8dfa0","resolution":{"observed_at":"2026-08-04T07:00:38.133114Z","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-04T07:00:38.233710Z","title":"& Patterson, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.233710Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:14be2209afe8f04d15917d4e196b2eb1ca335e91fa25c79208f8c546edcf7e86","observation_id":"be3174be-f47c-4c99-a15a-05afe8fd9bb3","resolution":{"observed_at":"2026-08-04T07:00:38.233710Z","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-04T07:00:38.339284Z","title":"& Patterson, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.339284Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:b13d318a47ea0a6ce5b2ccfd482681e54b999803966306231f8e55b3b7384603","observation_id":"d3c77cdf-ead5-4527-933c-361cfa2d27ea","resolution":{"observed_at":"2026-08-04T07:00:38.339284Z","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-04T07:00:38.452659Z","title":"& Ekeland, I","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.452659Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:5dcdd1346836966f2bba0341f3cc1a48062b7d3bd7a667d9febd3964146dc65b","observation_id":"2d37d136-715b-4d44-8bac-2218916143de","resolution":{"observed_at":"2026-08-04T07:00:38.452659Z","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-04T07:00:38.546590Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.546590Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:26121a408b2baed502340c0639987d0193e4922330574df51876ba1b18318c3c","observation_id":"28326ab8-7d11-425e-bce9-fc4725df8117","resolution":{"observed_at":"2026-08-04T07:00:38.546590Z","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-04T07:00:38.610936Z","title":"& Solomon, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.610936Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:e5b1c62847447daa9e3e9922d0e3855e25947d6c4093a56773e2163abe4d038d","observation_id":"6667abe9-a496-41bc-b272-02fc84ec5d20","resolution":{"observed_at":"2026-08-04T07:00:38.610936Z","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-04T07:00:38.680771Z","title":"& Doucet, A","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.680771Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:cf0b8c9d6450e12a91cd457077e06171b380d721e7e0663fee43af6544a2713a","observation_id":"445a4b30-bb39-47f1-af44-b080825eb9ca","resolution":{"observed_at":"2026-08-04T07:00:38.680771Z","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-04T07:00:38.749795Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.749795Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:e3e7ba5caa830068941f69b952cd044db8b8917734612ae3b9833a8913a1363b","observation_id":"3ab94f9e-5f81-40ef-9ff1-bc411db92953","resolution":{"observed_at":"2026-08-04T07:00:38.749795Z","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-04T07:00:38.836914Z","title":"& Lai, L","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.836914Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:86dc38d6b587d3ac8c4640bb7e980d8b99b6e73ad0b0870e0722d48db7bf67a4","observation_id":"2d8cc961-d84f-4f48-94ae-5189da83305f","resolution":{"observed_at":"2026-08-04T07:00:38.836914Z","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-04T07:00:38.909733Z","title":"& Uribe, C","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:38.909733Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:1955643888fc98f449e3255c8cda99049f57d73df42e016201a935d621d2f465","observation_id":"0b824557-04bd-47fb-aba4-94eae1711b88","resolution":{"observed_at":"2026-08-04T07:00:38.909733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.12136","last_updated":"2022-05-30T09:39:26Z","snapshot_observed_at":"2026-08-05T18:50:54.314341Z","submitted_at":"2022-03-23T02:03:47Z","title":"Wasserstein Distributionally Robust Optimization with Wasserstein Barycenters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.12136","snapshot_observed_at":"2026-08-04T07:00:39.008911Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.008911Z"},"links":{"cited_paper":"/paper/2203.12136","citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:b62a1c83e75d03a5c615da74ad909bc35403d075505c16a7d2f7579b70d1dd70","observation_id":"4a8b22c4-268e-44f8-a90f-2b9a186e8685","resolution":{"observed_at":"2026-08-04T07:00:39.008911Z","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-04T07:00:39.076193Z","title":"& Haffner, P","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.076193Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:b5422243770226d2860fc16a4755089048cf097ff153621ecaa817f248a45ca7","observation_id":"01d1c694-783e-4af9-a750-9ff7d2232afb","resolution":{"observed_at":"2026-08-04T07:00:39.076193Z","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-04T07:00:39.159695Z","title":"& Jordan, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.159695Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:c694cad014827a3750bfce0f672928059e367ec17753d2c19ff4206169d323de","observation_id":"8dbb56c8-1bc2-4a76-bb63-499fbd9c790a","resolution":{"observed_at":"2026-08-04T07:00:39.159695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19627","last_updated":"2025-07-25T18:54:25Z","snapshot_observed_at":"2026-08-09T11:14:53.448066Z","submitted_at":"2025-07-25T18:54:25Z","title":"Federated Calculation of the Free-Support Transportation Barycenter by Single-Loop Dual Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19627","snapshot_observed_at":"2026-08-04T07:00:39.266603Z","title":"& Ruszczyński, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.266603Z"},"links":{"cited_paper":"/paper/2507.19627","citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:34df1ee5f1d1b960c59650635941e140ba38f3d51c96485d9beb0d3f8bd6aff7","observation_id":"067adebe-0c01-4a17-a5ab-b1aeb43cd8f0","resolution":{"observed_at":"2026-08-04T07:00:39.266603Z","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-04T07:00:39.339181Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.339181Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:67b8175691650218dc84120a2eb821df77a98c187a21a32a169d5039b020ddd2","observation_id":"4ec35206-6113-4ed8-88e9-a9da7c88d949","resolution":{"observed_at":"2026-08-04T07:00:39.339181Z","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-04T07:00:39.407626Z","title":"& Ciliberto, C","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.407626Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:de5d1e34d41d6b2a71da862b18923f91e16cfc4605703c869f00f9585cb0119e","observation_id":"e7ec533e-16a7-49b9-83fa-6601c0d8b52a","resolution":{"observed_at":"2026-08-04T07:00:39.407626Z","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-04T07:00:39.504857Z","title":"A., Heitz, M., Bonneel, N., Ngole, F., Coeurjolly, D., Cuturi, M., Peyré, G","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.504857Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:c4debc95ebb60a55c3804000fb527b2bca739f8bbbad3e27825efc6a0d261619","observation_id":"d6e271b2-17ee-44a8-b178-74f82ea5d62c","resolution":{"observed_at":"2026-08-04T07:00:39.504857Z","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-04T07:00:39.626827Z","title":"& Aberdam, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.626827Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:9813434e5c34753679c86313370dd56e156aa6fafad5ab02578c74d1476b77e3","observation_id":"6d45974a-aea3-444e-b707-f8abfcb46023","resolution":{"observed_at":"2026-08-04T07:00:39.626827Z","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-04T07:00:39.729745Z","title":"A., Dvinskikh, D., Dvurechensky, P., Gasnikov, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.729745Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:3a855c1a9c0696867a6b42d369defba1599bbfba8751391f62f25de375fc137b","observation_id":"7f608151-7730-463b-a1b6-c2ac4850d1ce","resolution":{"observed_at":"2026-08-04T07:00:39.729745Z","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-04T07:00:39.833279Z","title":"& Chateau, T","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.833279Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:717aef9a698ee96e6a6db415b72b4b2d947123ad6b413d4fe36f3876e90d3967","observation_id":"3b2e1942-6eaa-4580-99b0-c8b7c5c3e4d4","resolution":{"observed_at":"2026-08-04T07:00:39.833279Z","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-04T07:00:39.916028Z","title":"& Toh, K.-C","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.916028Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:9bc5d8582bce6d036121f9b73aafef40597f34db81c888a1d310f33281289077","observation_id":"4bd2096a-1abd-4e54-aed4-bb911da00b3a","resolution":{"observed_at":"2026-08-04T07:00:39.916028Z","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-04T07:00:39.997123Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T07:00:39.997123Z"},"links":{"citing_paper":"/paper/2511.04607"},"observation_digest":"sha256:cc9a3ca711727fca4251f94927210783d4e5c7b9154636a6a7737465bafc3df7","observation_id":"a4b39edf-951a-4076-945b-02d231974e56","resolution":{"observed_at":"2026-08-04T07:00:39.997123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.04607","last_updated":"2026-08-03T00:08:51Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T15:15:03.074928Z","submitted_at":"2025-11-06T17:58:42Z","title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2511.04607."}