{"as_of":"2026-08-09T10:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21ec5e87bee6e8304efc5b02873df5416280813307cd53612d0248ccd8c16ff9","coverage":[{"denominator":80,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":80,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T10:29:27.699628Z","state":"measured"},{"denominator":80,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":80,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2509.04089/citation-record","integrity":"/paper/2509.04089/integrity","json":"/paper/2509.04089/citation-record.json","paper":"/paper/2509.04089"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611972238.bm","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.661747Z","title":"Burkard, M","venue":null,"work_id":"529ee340-7ee4-4472-809e-7c2c3a6fd1b3","year":2012},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.226519Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:81d26429caf93815387ff04e5fe79723a0d1ccd00c131d8f717655d478414966","observation_id":"8a4f3b7c-a498-44ed-a037-79d8262e6068","resolution":{"observed_at":"2026-08-05T10:29:28.668934Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.246169Z","title":null,"venue":null,"work_id":"078232c2-dfb4-47cc-b77b-b1879fa1ce2d","year":2007},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.233800Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:223d6c2d4ec00d35a02e19eed51cb9775fec959a093627f0fb889a5c9255a5a4","observation_id":"93134c4d-e59e-4827-a7dd-d2b475af6f56","resolution":{"observed_at":"2026-08-05T10:29:30.251658Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.228614Z","title":"Seyedi, S","venue":null,"work_id":"379b2b70-cc61-4e5d-b0c6-d92110495f17","year":2016},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.240851Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:423ffb43e50c1e8a50df564172bc1f3e85947529a6211134b10851ebf3b9b0d2","observation_id":"fb2cdfc9-c10c-44c5-ab4a-ea2bd8292de0","resolution":{"observed_at":"2026-08-05T10:29:30.233511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T10:29:27.245769Z","title":"Munkres, ‘Algorithms for the Assignment and Transportation Problems’, J","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.245769Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:29290a28d40cad97241ba3dbab331323f3aae55b3740dbde09e7a40bd7879187","observation_id":"dc797fef-65fe-4f98-8e18-09d5634a3692","resolution":{"observed_at":"2026-08-05T10:29:27.245769Z","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-05T10:29:27.251601Z","title":null,"venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.251601Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:51a1a5283e372884d331ec448359fc1de3cd78adcb3aadc1da6b453d4382d59e","observation_id":"3d4b977f-6648-4da5-9c9f-904d9430e51f","resolution":{"observed_at":"2026-08-05T10:29:27.251601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.210425Z","title":null,"venue":null,"work_id":"29b8952f-0676-406c-b6c7-9288e6d9af67","year":1998},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.257386Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:73670f6a683b4851d3fc6a2d291a817aed00037317dbfea94b4cad3ac5123cb3","observation_id":"31a98b72-a772-488b-918e-e8b92a21fe9a","resolution":{"observed_at":"2026-08-05T10:29:30.216882Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1090.0301","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.485337Z","title":"Laporte, ‘Fifty Years of Vehicle Routing’, Transp","venue":null,"work_id":"6e384818-b007-43a5-b677-d50ec7b3ded3","year":2009},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.280171Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:11c50dae2767bfcd19e0021694dde71e65e37979e4be105151ac2d4c5ec888dc","observation_id":"e86de56b-6f5e-4817-92c2-138b38f0d49b","resolution":{"observed_at":"2026-08-05T10:29:29.495846Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.153612Z","title":null,"venue":null,"work_id":"35391318-60b1-4f3c-93ed-0cb6f51598a5","year":1957},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.285299Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:16d4e9bdee80a88d67bc82efaee3956c5daf59742cb7787853490fd81d807ba1","observation_id":"0ae64505-31ad-49d7-a316-0558e928406f","resolution":{"observed_at":"2026-08-05T10:29:30.160389Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1958.32197","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.404797Z","title":"Sahni and T","venue":null,"work_id":"1eedb03b-ca0c-41a8-a42b-88288eb2b911","year":1976},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.290804Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:c48149f2aee72bcbde92ed0aa7cd655c9fbe2092cb42db38eac3d7e90c70e70c","observation_id":"3c82451b-3cbf-4e31-9c0f-42bcfd851da6","resolution":{"observed_at":"2026-08-05T10:29:29.416402Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.132581Z","title":null,"venue":null,"work_id":"af169b83-fa0e-4b94-83d7-97baa09abd81","year":1991},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.296065Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:e3a5a465ada09ca60753fe164167d4ed858b6f0091562546e43d6096dea4c897","observation_id":"35d4bec2-6817-4e1d-9826-3b4e3f264735","resolution":{"observed_at":"2026-08-05T10:29:30.138737Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2408.06525","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.612530Z","title":"Kravtsova, ‘The NP-hardness of the Gromov-Wasserstein distance’, Mar","venue":null,"work_id":"df9da53b-213c-41e2-a568-1f59f8b2a778","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.301025Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:7caac878b7af7007136ab064ccf5a0294042fc59d7642a4b9a316827cd9c136d","observation_id":"3dc7ce3e-f932-4885-86cb-c6c2300e8567","resolution":{"observed_at":"2026-08-05T10:29:28.618740Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.114832Z","title":"Villani, Topics in optimal transportation, vol","venue":null,"work_id":"5ceed4b7-112d-4434-80e2-38d2f399aff5","year":2021},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.306406Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:e9e8982895175742d81ccde41cf6ee476158e0968ef43bfa852faeafb051ccd1","observation_id":"89037ce0-d4a3-48b9-9309-239c719b0b23","resolution":{"observed_at":"2026-08-05T10:29:30.120504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.093572Z","title":"Monge, Mémoire sur le calcul intégral des équations aux différences partielles","venue":null,"work_id":"0d92e486-464a-4074-8bfe-7d2eb7ac33ba","year":null},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.312319Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:7627f5857b492e9cee2198598ef8e8199b2fc0203146ad4854453a857140ec69","observation_id":"861ef7b3-e93a-4300-9ccf-92d43f7208d8","resolution":{"observed_at":"2026-08-05T10:29:30.101200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"crid/1370565","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.328902Z","title":"Kantorovich, ‘On the transfer of masses (in Russian)’, in Doklady Akademii Nauk, 1942, p","venue":null,"work_id":"a2fec120-5536-4dff-9739-562180e2a1f5","year":1942},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.317679Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:aeb77d7aa082858d4d83f00982b4c522c680f010d3c0eb1bb5f59c613ec11b03","observation_id":"f0b2ceb4-505e-4143-ad51-3c11cd4ad72c","resolution":{"observed_at":"2026-08-05T10:29:29.337646Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/0-387-22755-5_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:08:14.039542Z","title":null,"venue":"Probability and its applications","work_id":"6c845e49-48d2-448e-9aa7-7730f10ba6cb","year":null},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.324059Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:8ec717b986ba4eff04b50202019aaf52a6710cb12af71e9f0e292508e4a8dbe8","observation_id":"50fed125-6d9b-44f8-b8a7-e28bbc6b9467","resolution":{"observed_at":"2026-08-05T10:29:28.534348Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"document/1074030","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.239839Z","title":null,"venue":null,"work_id":"ddac9c12-3034-48e6-83dc-67fa74c3663b","year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.329904Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:a8bb419b8ea19ca1b4e4d2bd994dc3010fffc19b13997bcf4c07d137a4aeb0b2","observation_id":"d3660ea5-895e-4176-888f-7808710e40aa","resolution":{"observed_at":"2026-08-05T10:29:29.248836Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"document/1047676","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.129969Z","title":"Khamis, R","venue":null,"work_id":"fefa3271-d571-4b85-b43a-afb741d777e1","year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.336091Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:26ada0a2c014b1851dcd02db381036b07b7da79d9553ce4a904a3cc4cd60eb7e","observation_id":"c9ce4ba1-4ce8-4cd6-80b9-fb28e6723406","resolution":{"observed_at":"2026-08-05T10:29:29.142706Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s12652-023-04640-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.507287Z","title":"Candelieri, A","venue":null,"work_id":"ca15135a-e8c8-4f69-9d90-23a59dd217b0","year":2023},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.341860Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:432afad44a661f36a2bf396f3b798ab6e16ea09300cbd0b2b09d93696bdf522a","observation_id":"48877ed5-2331-426d-a957-ed2514937255","resolution":{"observed_at":"2026-08-05T10:29:28.514447Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10898-024-01380-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.483982Z","title":"Kaňková, ‘Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric’, J","venue":null,"work_id":"2a2d7e55-4253-43aa-b42e-363ce0a02a32","year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.347557Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:3c0a5329d68e806406d2e6ecd87470aad379a6d064c3e8097996eb4afbd9b255","observation_id":"99a10e9c-c780-42f0-bd9a-93821e3ecf5a","resolution":{"observed_at":"2026-08-05T10:29:28.490672Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.074452Z","title":"Schiebinger et al., ‘Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming’, Cell, vol","venue":null,"work_id":"0104a7e0-63be-42ba-b08f-7a92fc45ff85","year":2019},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.353110Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:ba2f5d83e5a0f369a03c18671f1d2adae137c59c1e926d952298795c7f280fed","observation_id":"b17347eb-098d-4a17-8792-487441c52fad","resolution":{"observed_at":"2026-08-05T10:29:30.080607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T10:29:27.359144Z","title":"Rubner, ‘The earth mover’s distance as a metric for image retrieval’, Int","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.359144Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:e71e99b3243607e77ecdb8b81f2909905a5ace8ccc1b073f1bc21790c1ab102e","observation_id":"932a7a36-1d27-4014-9d18-4f85d32d3ce6","resolution":{"observed_at":"2026-08-05T10:29:27.359144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14655","last_updated":"2024-01-26T05:28:17Z","snapshot_observed_at":"2026-07-06T17:20:45.227692Z","submitted_at":"2024-01-26T05:28:17Z","title":"Distributionally Robust Optimization and Robust Statistics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14655","snapshot_observed_at":"2026-08-05T10:29:27.364339Z","title":"Blanchet, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.364339Z"},"links":{"cited_paper":"/paper/2401.14655","citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:72523c80be3b0d3390fbff13f542bed5f8e07b4ae0617ec724f4766413bfeb84","observation_id":"0b9ba0e2-bc5f-4ebe-8675-261cf6cf60f3","resolution":{"observed_at":"2026-08-05T10:29:27.364339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.191298Z","title":"Bertsekas, Network optimization: continuous and discrete models, vol","venue":null,"work_id":"6e3e82a7-d8a8-4f18-b15f-2d847be7d245","year":null},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.369656Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:20d7a80ca63a1b82ede233645c6df89dad30352e7e57ec847498be98e3a3c02e","observation_id":"77e170da-f33d-4614-a55e-5988f88659c9","resolution":{"observed_at":"2026-08-05T10:29:30.196943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.034078Z","title":"Cuturi, ‘Sinkhorn distances: Lightspeed computation of optimal transport’, Adv","venue":null,"work_id":"7827fe5e-d2d2-4725-b8ae-49fdf8c8f397","year":2013},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.380877Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:de72f044afd9f1def06f0204a229e12517e83bddbdbe563661925e74f5f21cb2","observation_id":"b4b678cd-9322-4178-90cb-5f74bdb1b81d","resolution":{"observed_at":"2026-08-05T10:29:30.039908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.053030Z","title":"17, 2025","venue":null,"work_id":"ad28ee41-b51a-436c-980e-dcdd98ec17e4","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.375397Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:a14cdd67ffe45cd7ce8200d976dc9d75b6fadb94bbcb9b8459bd86cef98d5712","observation_id":"ac12c29b-aefd-4bc5-87b3-4c1c0e3b88fb","resolution":{"observed_at":"2026-08-05T10:29:30.060794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.980229Z","title":"Flamary et al., ‘Pot: Python optimal transport’, J","venue":null,"work_id":"fb819fd8-0edc-4128-8b4f-ba30dec233e9","year":2021},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.396679Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:3e692a9d8187bce8a0ffea568186254c2a72e9accb336e204265c7595835a119","observation_id":"f1287aa3-2c85-4b62-acf0-cf17e8a89ec6","resolution":{"observed_at":"2026-08-05T10:29:29.985675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.016693Z","title":"Altschuler, J","venue":null,"work_id":"f6426be1-82a8-4724-8d97-19b65f4f1652","year":2017},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.385989Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:381512f5dcc06f992667d45fcf18bc70267670b93d56ba0f0d4656a5ad7b0081","observation_id":"a214c1de-d9f4-4f73-890f-d4a01c40af05","resolution":{"observed_at":"2026-08-05T10:29:30.022081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.944582Z","title":"Peyré and M","venue":null,"work_id":"2371520c-3443-409a-ac81-a3e51eb68629","year":2019},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.407457Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:15d18c39f5b1ca8e9591177e36851a55ebffadfbd7cbfe76e0340c69c45d81bb","observation_id":"ae9c528e-3af8-4a44-abe5-965e99205813","resolution":{"observed_at":"2026-08-05T10:29:29.950265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.12220","last_updated":"2023-03-01T13:38:35Z","snapshot_observed_at":"2026-08-05T10:35:13.239357Z","submitted_at":"2022-01-28T16:24:13Z","title":"Neural Optimal Transport","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.12220","snapshot_observed_at":"2026-08-05T10:29:27.412676Z","title":"Korotin, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.412676Z"},"links":{"cited_paper":"/paper/2201.12220","citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:62a1b8b63ebc273c18135c0ec89c8401caacafd0e5742e5eecadc7f20eea3f4f","observation_id":"8b638c82-5546-46dc-8a13-664712467438","resolution":{"observed_at":"2026-08-05T10:29:27.412676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.962234Z","title":"Genevay, M","venue":null,"work_id":"0ba8b9e0-2508-4164-b0ea-219ff6945266","year":2016},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.402023Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:807dab06daaf23b93d13172ae3ac00f55e7a4d6e5b2817c59feaeefe7bafdad4","observation_id":"0c0c1360-8d47-49bc-8df5-ce5eebd67164","resolution":{"observed_at":"2026-08-05T10:29:29.968120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.09114","last_updated":"2019-05-13T15:44:06Z","snapshot_observed_at":"2026-08-02T11:14:40.788420Z","submitted_at":"2018-05-23T13:13:27Z","title":"Optimal Transport for structured data with application on graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.09114","snapshot_observed_at":"2026-08-05T10:29:27.430734Z","title":"Vayer, L","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.430734Z"},"links":{"cited_paper":"/paper/1805.09114","citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:e8327ad5b2bd6607c7ebcba9d99eab150a77f9e36aff5c76d5a81fa34cb29115","observation_id":"b3fd8241-4768-4ca9-bdb8-39b5a66ecf06","resolution":{"observed_at":"2026-08-05T10:29:27.430734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.926789Z","title":"Bunne, D","venue":null,"work_id":"d64037d4-6592-4947-949c-b5a709d9d96d","year":2019},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.419650Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:8928e32cdafa9991ed3afbc9d89dbce97bd3e117ecb1e25219d9cf6d8f497c96","observation_id":"6e0f6a65-cd06-4652-8507-1d98afa468f3","resolution":{"observed_at":"2026-08-05T10:29:29.932291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08970","last_updated":"2024-04-13T11:23:34Z","snapshot_observed_at":"2026-08-07T23:50:28.995201Z","submitted_at":"2024-04-13T11:23:34Z","title":"Fast Gradient Computation for Gromov-Wasserstein Distance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08970","snapshot_observed_at":"2026-08-05T10:29:27.442553Z","title":"Zhang, Z","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.442553Z"},"links":{"cited_paper":"/paper/2404.08970","citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:52a5d3c8fbf2ef01670c5e0c9e2d211286c595f345c855dd87c84ac09cbc4aae","observation_id":"dc52d68d-6f40-4ccf-8c8a-72deffb87ad5","resolution":{"observed_at":"2026-08-05T10:29:27.442553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.909066Z","title":"Rioux, Z","venue":null,"work_id":"71a85926-e31c-4be4-9246-ffec302fb335","year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.448969Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:95a28473189da6e76fa69c15518d1f8a81f5f5eafe0d47e55fdd1d3160e08efe","observation_id":"9cc4a87a-690c-489a-8264-b5613afeb74c","resolution":{"observed_at":"2026-08-05T10:29:29.915403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.21507","last_updated":"2025-06-26T17:32:53Z","snapshot_observed_at":"2026-08-06T22:21:19.299698Z","submitted_at":"2025-06-26T17:32:53Z","title":"Robust Alignment via Partial Gromov-Wasserstein Distances","version":1},"cited_work":{"arxiv_id":"2506.21507","doi":"10.48550/arxiv.2506.21507","metadata_source":"pith","pith_arxiv_id":"2506.21507","snapshot_observed_at":"2026-08-05T12:16:14.913508Z","title":"Robust Alignment via Partial Gromov-Wasserstein Distances","venue":"math.ST","work_id":"b1766d05-8f9e-4547-b2e3-b86a267c3c13","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.436897Z"},"links":{"cited_paper":"/paper/2506.21507","citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:d610c00fa8ffaacb18506cff97456aadb8b34382561e3c4357deef47639117ca","observation_id":"a1dbefb7-a047-412c-9da9-85341c04713c","resolution":{"observed_at":"2026-08-05T10:29:28.362465Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.891670Z","title":"Beier, R","venue":null,"work_id":"81688322-d4d1-45da-b3e0-30e517e61c87","year":2022},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.460705Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:43c06549c71f5e874372453a4dff56b667a7b9210063525ab5528b5b21ce5950","observation_id":"c99a194f-e679-4dbd-85cc-4adf79e4f201","resolution":{"observed_at":"2026-08-05T10:29:29.896805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.873132Z","title":null,"venue":null,"work_id":"40ada399-03d8-40c1-80a2-76898af3672b","year":2019},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.465578Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:11f18a3258bbbabb23eb26e7f1b77b7dce9c6e7f5c6508cf678952755430cbdd","observation_id":"f5726bda-cc22-49ad-9783-95ff64e66e31","resolution":{"observed_at":"2026-08-05T10:29:29.878816Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/15m1010087","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.292957Z","title":"Peyré, ‘Entropic Approximation of Wasserstein Gradient Flows’, SIAM J","venue":null,"work_id":"e2348f6d-c288-4c50-b91f-4da8e6990b02","year":2015},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.455339Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:3d2dd1bfd3f9fc870bb48f1bb9185571bfa4c82cec432f91ecafc2a0f4d3b6da","observation_id":"82f3a1c4-c0f7-460f-8189-dcfe26fb52e3","resolution":{"observed_at":"2026-08-05T10:29:28.300828Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.838182Z","title":"Séjourné, G","venue":null,"work_id":"d877edf4-43df-4261-96f5-20022841adf2","year":2023},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.476619Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:7f1787f8d0d7ad88b29622e728dd2026f3f9f167581f5f3ba47beb8e1dacaca0","observation_id":"d29fd287-3b0d-4191-a11a-ad9b22515e4b","resolution":{"observed_at":"2026-08-05T10:29:29.843574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.821467Z","title":"Titouan, R","venue":null,"work_id":"b848020a-e413-4d67-b2ec-e306a30cb492","year":2019},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.484047Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:01b87a88b419d28510a9fbd07e95a0e7b3bd263c4a2da715aa0578f39beb78b5","observation_id":"305f1d7e-14ab-4c3c-86a1-9481e423c3a8","resolution":{"observed_at":"2026-08-05T10:29:29.826874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.855535Z","title":"Séjourné, F.-X","venue":null,"work_id":"f530be43-2484-4f9e-9389-4ec48f210023","year":2021},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.471529Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:34e77cfbca3682710b94d91f0fe1e5f89982fd69ba19abe015c6a2b56436311d","observation_id":"5fb82e77-8309-4baf-b397-272cb171e558","resolution":{"observed_at":"2026-08-05T10:29:29.861235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"cocv/2024063","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.041411Z","title":"Mémoli and T","venue":null,"work_id":"136498c1-9ade-496b-8de9-dc18512c9d1a","year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.495042Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:e1fa10779e65e478fb494255677bb3c471913c2373ba07dc98c4f5cf9edba496","observation_id":"3ff0691e-90fb-491c-bce4-4b2ff374028b","resolution":{"observed_at":"2026-08-05T10:29:29.050201Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.783979Z","title":"Titouan, I","venue":null,"work_id":"db9e1df5-24e9-40d4-8269-4eab3c958dfb","year":2020},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.499974Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:4da397b178839a3d0ff1d9cd212471610dcf040349d9c9786d3b7dd1495b7aa2","observation_id":"483e0d96-36c8-4cec-b842-9c3496485886","resolution":{"observed_at":"2026-08-05T10:29:29.789447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.802146Z","title":"Peyré, M","venue":null,"work_id":"41b48423-c296-4945-99e5-14daf6e286e7","year":2016},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.489759Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:1f186d72df829aee25910cce943008a33f8ba7bccc7143222820e4c11570ab9d","observation_id":"625b1540-dddc-4f57-8876-fdb59ab0be08","resolution":{"observed_at":"2026-08-05T10:29:29.808985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2507.09865","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.248660Z","title":null,"venue":null,"work_id":"0fb5280d-84cd-4694-9a54-aa67750cce33","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.512025Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:8624b3ca19103290943e9ad7a8e563508c880a684db5ded27b701100163272c6","observation_id":"f6696f33-a5c4-46c4-ae4f-81a7a5dd24e9","resolution":{"observed_at":"2026-08-05T10:29:28.255691Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.766370Z","title":"Petric Maretic, M","venue":null,"work_id":"c12ebbf8-b9a0-4ad2-b2cc-b9f0c29edf10","year":2019},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.518275Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:43a811d1a72c334ac92fef39ff34a1466e2675339c86fdf8b1bbf41a08acbfb9","observation_id":"a97359b0-5f8d-4aed-9491-6ae27a68c8b5","resolution":{"observed_at":"2026-08-05T10:29:29.772152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10898-025-01463-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.272236Z","title":"Candelieri, A","venue":null,"work_id":"2e4bd144-d26e-4f79-9af1-b6e76c699da2","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.505994Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:92cccbf97c938649e008ff708bb4a397e2e113d808a56516b85bf06d809dcda0","observation_id":"604d0959-a78a-4489-a2f5-e557623871fe","resolution":{"observed_at":"2026-08-05T10:29:28.278231Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10472-023-09883-w","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.157459Z","title":"Candelieri, A","venue":null,"work_id":"c8c6b969-d0e4-481c-bc05-b96386bb7d37","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.534640Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:571a542f607d443f13e9ce724d56d737cd95025da85db85717137ae2f770192a","observation_id":"5dec3613-631a-412f-9482-c0949d1941e3","resolution":{"observed_at":"2026-08-05T10:29:28.164341Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.713513Z","title":"Jiao and J.-P","venue":null,"work_id":"0e9af63d-70be-4b3c-a7c6-0f3ee9eda5bd","year":2015},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.541588Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:8ec0aa8b14fb9291e23fcd31e1e7a041acda10e433b39d7b11993b544b031be0","observation_id":"f8553bde-e5c8-4312-a386-8386926d36c4","resolution":{"observed_at":"2026-08-05T10:29:29.718845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.748256Z","title":"Available: https://proceedings.neurips.cc/paper/2019/hash/fdd5b16fc8134339089ef25b3cf0e588-Abstract.html","venue":null,"work_id":"04136c00-2fc6-4f2e-bbae-352119f7ba82","year":2019},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.524329Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:8a0dd15a236f4ac28070a50e46e08305312d56b8e0565c9aa38e5106dd69a3ed","observation_id":"a3768ffd-be80-4ce0-94b9-0469aba9dbf0","resolution":{"observed_at":"2026-08-05T10:29:29.753968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.730372Z","title":"Deshwal, S","venue":null,"work_id":"909fd649-b733-4d0d-b799-321a2476e632","year":2022},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.529389Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:fa20acae499f074f550f8166709e63555006aa8ca62195e8ed3793afdfbd36b8","observation_id":"30cc119d-5c21-4806-bd58-4525ebaad70c","resolution":{"observed_at":"2026-08-05T10:29:29.736126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.676219Z","title":"Chang, Y","venue":null,"work_id":"e38a1b08-2ffd-4e21-8222-0ba6942d946c","year":2022},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.559524Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:8a891873806d647fff28673910f115f7d392bf14c1783b9191425c4695a2929d","observation_id":"ee5fe327-5d51-42e7-b7a8-b2c916efcaa9","resolution":{"observed_at":"2026-08-05T10:29:29.682077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.656015Z","title":null,"venue":null,"work_id":"adab52e8-bb62-413d-97eb-4f81b48fd317","year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.565877Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:8c3cce2c854b03232e77de380ed483c2abfc7f25a25d634af0abd29a95daf723","observation_id":"ca9f51e0-da05-4b52-adc2-531fac6c7393","resolution":{"observed_at":"2026-08-05T10:29:29.661166Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2507.13263","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.136153Z","title":"Xie and L","venue":null,"work_id":"599c696f-5571-4a0d-9d2b-0d04c79d95ee","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.547197Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:e9f32538633b010820c171849b07d2b00bc1b6c7bf371858814fff99a56ddbe4","observation_id":"54a8f06d-65f3-472b-9bdc-b2bb440fe5e9","resolution":{"observed_at":"2026-08-05T10:29:28.143763Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.696579Z","title":"De Plaen, P.-F","venue":null,"work_id":"62381401-8ea8-4b4c-a687-a4caf00052e3","year":2023},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.554206Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:bf678a2a7a186de7e965bb09afcd44e5d45f1240983746897689b8816d9c6fce","observation_id":"432b4f03-f10c-419b-864e-10cf66f3e59d","resolution":{"observed_at":"2026-08-05T10:29:29.701993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.638083Z","title":"Cela, The quadratic assignment problem: theory and algorithms, vol","venue":null,"work_id":"a7604320-1473-4996-9a3f-c3b9cc0d5117","year":2013},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.584536Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:15f85eb95286b28b8bbd1b0ae8bb7b4371f2dda096ab0bb04502c1c3b8483251","observation_id":"3d7c313e-daa4-4aad-ac97-fddd0dc1d497","resolution":{"observed_at":"2026-08-05T10:29:29.643633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.620926Z","title":"Cuturi and A","venue":null,"work_id":"2864f2e1-439e-4407-90d4-1eb075a38f1c","year":2014},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.589693Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:f9919155a1b57e26248eef110803e9eefc2ec6c5ae38b6c564dccba76d0e28f8","observation_id":"12369449-c5e5-4f2e-920d-257123bebb80","resolution":{"observed_at":"2026-08-05T10:29:29.626216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T10:29:27.578746Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.578746Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:ca1a5028c350ad5373172814275ddec8701e695449316aa5e42992539e7f8632","observation_id":"11ac891e-37a7-4721-8908-e190662a27ec","resolution":{"observed_at":"2026-08-05T10:29:27.578746Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.603956Z","title":"Mallasto and A","venue":null,"work_id":"c2ca03a5-ce3d-4e1c-a2f5-d82ca6a94073","year":2017},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.606260Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:b6609ee773f7c198e31162c990e19a5d16a37f278712e4869678cb44c465a44b","observation_id":"ad3e0188-acc9-450f-8d1d-743dfd6abd0d","resolution":{"observed_at":"2026-08-05T10:29:29.609182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.587393Z","title":"Kullback, ‘Kullback-leibler divergence’","venue":null,"work_id":"d729d398-dd05-41a0-8892-735b14d072fa","year":1951},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.612681Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:483c3b671861cecd5fa4c2cd31d24fa62b222bd03ea4eeacfa797075a66ae542","observation_id":"8347f603-aeb4-4bfe-8ae5-68fc75393c83","resolution":{"observed_at":"2026-08-05T10:29:29.592920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10472-022-09807-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:27.897349Z","title":"Candelieri, A","venue":null,"work_id":"ef907f24-6c18-4b6b-a987-716ac90a0b4d","year":2023},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.595318Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:0c1cc43e2e0566347e2f716c3b55aaa77bea872f531dc498d5db85852a8e551d","observation_id":"51385c9e-7fa7-41bf-bd6c-13af0b4ae2bb","resolution":{"observed_at":"2026-08-05T10:29:27.903103Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/make7030090","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:27.878310Z","title":"Seyedi, A","venue":null,"work_id":"3a6c604e-5a9d-44e4-bc9b-6af5437b12ea","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.601037Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:a170d1903a943a917c1cbace3bf8d8cd9633998a2da2e07908ffc33040e456d6","observation_id":"62498bc9-d108-4d2e-bee3-7ef8bd723aab","resolution":{"observed_at":"2026-08-05T10:29:27.884180Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.12471","last_updated":"2025-05-18T15:48:18Z","snapshot_observed_at":"2026-08-07T15:43:38.284558Z","submitted_at":"2025-05-18T15:48:18Z","title":"Wasserstein Barycenter Gaussian Process based Bayesian Optimization","version":1},"cited_work":{"arxiv_id":"2505.12471","doi":"10.48550/arxiv.2505.12471","metadata_source":"pith","pith_arxiv_id":"2505.12471","snapshot_observed_at":"2026-08-05T12:16:14.913508Z","title":"Wasserstein Barycenter Gaussian Process based Bayesian Optimization","venue":"stat.ML","work_id":"b6676f5d-a703-4d9c-b0c4-bd5e3fb30028","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.629052Z"},"links":{"cited_paper":"/paper/2505.12471","citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:a7ffd633d50578da23a396c0e4034816906d1b9aa646927e6a3325b9f319bb3a","observation_id":"abb116fa-b256-485d-a91d-a15478d17b0c","resolution":{"observed_at":"2026-08-05T10:29:27.845840Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10994-021-06035-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:27.806189Z","title":"Kerdoncuff, R","venue":null,"work_id":"96ec6892-dc0f-40dc-9220-1c7b096988e5","year":2021},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.634889Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:ab312b0397978062c3cc8c499a877dc24da976d140617289bba3957c2f9b9075","observation_id":"292d5134-2a70-413a-8488-f766523b2311","resolution":{"observed_at":"2026-08-05T10:29:27.813860Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.569540Z","title":"Ponti, I","venue":null,"work_id":"2043723b-7858-4073-94fe-e09cb41cbd9f","year":2024},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.618214Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:4df97e6dd8cfc71b93d3cf72ae0685c889fcc687507e80684dcd4dcdbed26378","observation_id":"3332f1fe-09d9-4dd4-b1b9-fae3ddf5a4f7","resolution":{"observed_at":"2026-08-05T10:29:29.575013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-49988-4_28","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:08:14.039542Z","title":"Dvurechensky, A","venue":"Lecture notes in computer science","work_id":"74df0c87-241b-4a87-85bb-b747ed9749e1","year":2020},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.623437Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:4801610c19ee34ff3b62c7768c18c74e9bdc8dcd4161a0f1f4c21060dffd47f9","observation_id":"fe1b6155-b6a1-42d8-a718-fcb25d8296d6","resolution":{"observed_at":"2026-08-05T10:29:27.864542Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T10:29:27.651838Z","title":"Mémoli, ‘Gromov–Wasserstein Distances and the Metric Approach to Object Matching’, Found","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.651838Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:15fdbe44240c8029f9d60517f1a8ec830a3d324f17ae0e80e2e73a39bff89617","observation_id":"9c57c535-f801-4326-b02d-16074f8fc7bb","resolution":{"observed_at":"2026-08-05T10:29:27.651838Z","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-05T10:29:27.656988Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.656988Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:f6836cfa8bc7ddd16f73fa9221502ed3e2f32dfc529bd71f719b328cc46a476f","observation_id":"33616716-1d2f-49b3-aca1-5d78a08df6d3","resolution":{"observed_at":"2026-08-05T10:29:27.656988Z","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.1007/978-1-4613-0303-9_27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:08:14.039542Z","title":null,"venue":null,"work_id":"8252d9c3-c142-4ae7-b6a7-0a8e400b07be","year":1998},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.640768Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:7d7162f342cb76c98ec37c54cdce5274fbef66cb3732d22c022e1c709d05e5bf","observation_id":"a901d347-ea22-414c-a396-7e5e47a39882","resolution":{"observed_at":"2026-08-05T10:29:27.942646Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T10:29:27.646563Z","title":"Mémoli and T","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.646563Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:909a0d4da74e7bdbc1e66ff3c136ad8e1c15809f8b7d876d504be084c3b26a81","observation_id":"54a82842-9f2f-4a1e-a5b0-be5174fb01ea","resolution":{"observed_at":"2026-08-05T10:29:27.646563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.528856Z","title":null,"venue":null,"work_id":"ed081669-05fb-4ee1-b039-786bea6543b3","year":2021},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.673087Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:009e0b10b150d2cc4eab747edb079cdaf58f95e51baf9e43d8aa87c78f0b079b","observation_id":"b79e8807-5a9e-4f4e-a164-a2b869bc15b9","resolution":{"observed_at":"2026-08-05T10:29:29.535314Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T10:29:27.677957Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.677957Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:4591738268aa4ef5a4ce0815890894df3cc22b2e7a097e1b776a489db3a5fafd","observation_id":"0b74293b-eb38-439f-b7f4-44056fbc6ff5","resolution":{"observed_at":"2026-08-05T10:29:27.677957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.550545Z","title":"Scetbon, G","venue":null,"work_id":"22c482c6-9db8-4be4-beba-d7406140d8ea","year":2022},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.661983Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:608edab307bb5d76d816cd036924a6fdc8dd4475675e1ca25e3bdf4f646e44b5","observation_id":"e16866db-8f95-4f72-92f8-59c479f9d083","resolution":{"observed_at":"2026-08-05T10:29:29.557471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.01615","last_updated":"2021-02-10T09:47:53Z","snapshot_observed_at":"2026-08-05T05:34:24.446076Z","submitted_at":"2020-02-05T03:09:23Z","title":"Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.01615","snapshot_observed_at":"2026-08-05T10:29:27.667545Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.667545Z"},"links":{"cited_paper":"/paper/2002.01615","citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:8988bb0cec5b8b80c101a8301c6bd3b132df879be7e7c46d7de3954fc0256428","observation_id":"92821989-d51b-4b38-884a-7fda9e7b5149","resolution":{"observed_at":"2026-08-05T10:29:27.667545Z","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.3390/math13132144","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:27.736891Z","title":"Seyedi, A","venue":null,"work_id":"3eaf0a07-2c14-49ff-8601-a7c92aa6275b","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.694113Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:cad353046bb1552bdc777402299357d59c700abe4cbb7d341b6dc990c50090b5","observation_id":"d852ab63-437e-4991-9661-14a5619faa56","resolution":{"observed_at":"2026-08-05T10:29:27.743779Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2014.05010","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:28.759009Z","title":null,"venue":null,"work_id":"9788cd4d-94dc-4906-a844-673672924b6d","year":2014},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.699628Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:5a85c8fbac099906efa2f5411d51e5eaffbb55f8dfcf881be5790cf1969f3319","observation_id":"0ac5db84-832d-45db-8bf9-66d5d4e06bc0","resolution":{"observed_at":"2026-08-05T10:29:28.769664Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s40430-023-04106-z","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:27.756926Z","title":null,"venue":null,"work_id":"8a79a154-98ef-4abe-aca8-709d89a040d7","year":2023},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.683154Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:46eef05f89d353c47e6cc5f2904deceb328f35d5ed1f30d220be547a0384b9a7","observation_id":"606a1233-3cb1-40cb-adfd-371b758e46c8","resolution":{"observed_at":"2026-08-05T10:29:27.762479Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.509209Z","title":null,"venue":null,"work_id":"65f9388f-8fc4-466f-b88b-ba2f1657d300","year":2000},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.688583Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:ef097ad2c2fd854cc140a09639e1357a43dd7f4080ac0992c016cdf4779250a1","observation_id":"a1fc22c0-4831-4da7-a171-cbf91dfbb19d","resolution":{"observed_at":"2026-08-05T10:29:29.514330Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:30.174101Z","title":"17, 2025","venue":null,"work_id":"532374e3-a00d-4af2-97e8-bc8cf4bb94e0","year":2025},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.274718Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:285e5cd3125e548e978d5b59b62e97ae480ff2b936295b6e78685febb5e39145","observation_id":"ab8a8e9f-1b9d-4885-84a2-b692a5cff41f","resolution":{"observed_at":"2026-08-05T10:29:30.179420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:29:29.998199Z","title":"Available: https://proceedings.neurips.cc/paper/2017/hash/491442df5f88c6aa018e86dac21d3606-Abstract.html","venue":null,"work_id":"9fc52a22-b9d9-4f46-813b-82d580986bd6","year":2017},"citing_paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T10:29:27.391000Z"},"links":{"citing_paper":"/paper/2509.04089"},"observation_digest":"sha256:b62b7c485a9918a3eb6d8c5815fb9d448efe090971f730564eaf7a1ff7fa622e","observation_id":"51504c25-0a19-477a-8417-73cadf3b8854","resolution":{"observed_at":"2026-08-05T10:29:30.005083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.04089","last_updated":"2025-09-04T10:44:30Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T03:07:13.633312Z","submitted_at":"2025-09-04T10:44:30Z","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric"},"reference_resolution":{"displayed":80,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":20,"verified_exact":24,"verified_fuzzy":33},"total_outbound_references":80},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 80 of 80 outbound references and 0 inbound Pith citation observations for arXiv:2509.04089."}