{"as_of":"2026-08-07T21:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21163c51efc000bcd993bcf3be348317d48d578c126d936acc8e6c3e2d5c689b","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-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/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-06T23:23:59.317989Z","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:a9a0a598b4e042ef8543d2aa2639d90b65502a942b35920630fe4982d12e1959","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-06T23:23:59.317989Z","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:607c5edc66a1e6e0ef45b72eb0522d44c6a6c22a91c9c0e78118133600a2b780","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-06T23:23:59.317989Z","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:949b0ffcb76e54ae5cd0e916cbe4bcdbd715479e6e0d874d4469f803530f680f","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-06T23:23:59.317989Z","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:f17e68ae50c003c70112ebf6911e5fc6061a972c2021b8506d3d76e1a7d15310","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-06T23:23:59.317989Z","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:7b8dc48cc97bbec6fbbce66b13a7e2bcc8c0ea6d669050fcb08073c89f83a13c","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-06T23:23:59.317989Z","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:f313b044113766d1871dfa466d7f2b0168aabd907786d970e036182ff2300780","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-06T23:23:59.317989Z","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:2b12adcc47326ee18a062d9080aaa0f0a001ad5ec5e945007d6c09812effa1f6","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-06T23:23:59.317989Z","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:e0a48cd2ddff27fbbf8df61a6fd5903c20f27fa8589eedeb861d91e2d97b3e93","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-06T23:23:59.317989Z","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:ba0bcb558b9cdf3426752805142a1774cf3989188500ebed215cc4a8567d0391","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-06T23:23:59.317989Z","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:e3ad3eae0ca9d7f839aa8e2a9ff770de3892a574cc66fbf3fc40e0d6b179f582","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-06T23:23:59.317989Z","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:dfa90b771564055e172652bb34c8f1d42b02a82bccdc4463a4df6ef345f35c9d","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-06T23:23:59.317989Z","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:2bcfab3c930f1b7fa692ca9695ba2165b0bd57daa3cee00c096290e43c345971","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-06T23:23:59.317989Z","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:d6a739788c4afb74674141abb1f7119812724a8a6fc658373891f1e6a85aab69","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-06T23:23:59.317989Z","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:d09e973539a55952dab4892fc1ca5c80cc0bc5efba135f3991f1d20af7bff1bb","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-06T23:23:59.317989Z","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:3a8841f8b1af152cb4834ce76836a15469063cdf8983daaec3f0757af6366c3d","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-06T23:23:59.317989Z","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:7b1e1229f03eaae35a26bcd2333d8f99a64f8ee289ca8ffaa27722aa2cab366f","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-06T23:23:59.317989Z","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:912fdfdb8547808f78beebbab1e2a52fccc0e62e5a8b61a27a2cb25bb3ade762","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-06T23:23:59.317989Z","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:95494a174c9c75b375d8ad8529b801db655c4215b00f78b5619d01cfea317046","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-06T23:23:59.317989Z","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:a00424b99af9c14912f89ec05ce21cafeff8e16ef640bb1d3e9f2e8109f25842","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-06T23:23:59.317989Z","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:100f0dc2e87db85fa7978047f1408a3345558fa97d9133d5ab4d5c08fa20a9f8","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-06T23:23:59.317989Z","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:99051818053186806b6b6a6ba696d9e5e584f9cd3fed45a3437b37f64b401623","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-06T23:23:59.317989Z","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:3e4db06d26174813c8c70cfce24adcf3fbeac5d1b2ddd5339c8b64eda82f2b76","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-06T14:20:16.112621Z","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-06T23:23:59.317989Z","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:12b4965680b85709a80b389ca7737e17e4a845cc420d3609e5cbad733fe05561","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-06T23:23:59.317989Z","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:9437b72d5879a981bcb2631357f2ad2dc5c8e3eb29d282304e6a10476d62eb5f","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-06T23:23:59.317989Z","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:0b99b0f8fc6be067291f1e7fc3fee35815a64680bf098f1bbf5e73180bec6310","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-06T23:23:59.317989Z","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:71d84dd5319734a92f353ecae0e74adb9d5d3e02bcd20ba58457211728e21253","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-06T23:23:59.317989Z","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:dc660a114a29d0b607a1345d97ddefb1ed63c17832606bb7ef565a6e842183a3","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-06T23:23:59.317989Z","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:e33c44d650d2e588701d9a8e9938a4ae1e641c9b4380f89d6d941db3a0344076","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-06T23:23:59.317989Z","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:11267666787a7740c1e5743c75b81c65cb902a4e2d59c765890bae0f3384ee36","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-06T23:23:59.317989Z","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:309f0bf6a829e462753c03a3eea750c8caad2747d94e77df870776740effac75","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-06T23:23:59.317989Z","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:9929681eecf0cd530f960bfc1aad2b122d7e47965706fd1012f71a83702ae00b","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-06T23:23:59.317989Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2511.04607."}