{"as_of":"2026-08-10T22:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c400c7c5a94226545b123d9e0c3343b9ade0d351200dc6c848f7d52069ba1f4a","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T22:07:19.897940Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T22:58:00.274594Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T12:26:56.829597Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"cited_work":{"arxiv_id":"2501.18901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18901","snapshot_observed_at":"2026-07-02T12:26:56.829597Z","title":"arXiv preprint arXiv:2501.18901 (2025)","venue":null,"work_id":"b01b7402-d311-413f-a4a2-23f4523085d3","year":2025},"citing_paper":{"arxiv_id":"2605.23028","last_updated":"2026-05-21T20:51:00Z","snapshot_observed_at":"2026-08-02T13:51:46.173822Z","submitted_at":"2026-05-21T20:51:00Z","title":"RADAR: Relative Angular Divergence Across Representations","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T05:39:39.765999Z"},"links":{"cited_paper":"/paper/2501.18901","citing_paper":"/paper/2605.23028"},"observation_digest":"sha256:17357db8d774b0de0209f397befc65546385ac52205ddbaa30ca6daaeac7299f","observation_id":"b377d24f-4b51-445c-98bf-918d6723dbc5","resolution":{"observed_at":"2026-05-25T05:40:23.943983Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"cited_work":{"arxiv_id":"2501.18901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18901","snapshot_observed_at":"2026-07-02T12:26:56.829597Z","title":"arXiv preprint arXiv:2501.18901 (2025)","venue":null,"work_id":"b01b7402-d311-413f-a4a2-23f4523085d3","year":2025},"citing_paper":{"arxiv_id":"2606.05883","last_updated":"2026-06-17T13:39:13Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:53:58Z","title":"Geometry-Aware Dataset Condensation for Diffusion Model Training","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-28T02:07:54.718436Z"},"links":{"cited_paper":"/paper/2501.18901","citing_paper":"/paper/2606.05883"},"observation_digest":"sha256:ad3e5a142f83015a3af18a3ffc962b2b1e27af092fef578b821146cc721e7ce7","observation_id":"e5181a1d-28d2-4916-98a8-3bb493cf89a5","resolution":{"observed_at":"2026-07-02T12:26:56.830868Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18901","snapshot_observed_at":"2026-08-01T22:58:00.274594Z","title":"Lightspeed geometric dataset distance via sliced optimal transport.arXiv preprint arXiv:2501.18901, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15587","last_updated":"2026-07-17T03:18:17Z","snapshot_observed_at":"2026-08-09T17:50:56.609811Z","submitted_at":"2026-07-17T03:18:17Z","title":"Rethinking Transfer in Continual Learning: A Replay-Based Realisation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:00.274594Z"},"links":{"cited_paper":"/paper/2501.18901","citing_paper":"/paper/2607.15587"},"observation_digest":"sha256:2dfcac96a9b986726923c474d87dfbb777093e31b7ddc53078173d3672f484f8","observation_id":"45075863-2028-4181-8ca8-3cf1b5500f56","resolution":{"observed_at":"2026-08-01T22:58:00.274594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.18901/citation-record","integrity":"/paper/2501.18901/integrity","json":"/paper/2501.18901/citation-record.json","paper":"/paper/2501.18901"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:07:20.476365Z","title":"C., Soatto, S., and Perona, P","venue":null,"work_id":"45a00678-c142-4e54-984d-f056e8cf3032","year":2019},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.708491Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:243650158e75f6e5482af69d0cb2bae692942e89c0f0c26288fb17d0b9cfd1d2","observation_id":"76a0b59e-64c0-45c1-84d2-b8c496ea8cab","resolution":{"observed_at":"2026-08-09T22:07:20.480073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.465676Z","title":"Near-linear time approximation algorithms for optimal transport via S inkhorn iteration","venue":null,"work_id":"598be09b-1104-4f69-9fbd-f71ee0004005","year":1964},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.712702Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:3a4097ec35e31953c9878c1b3c989fcc4ed72ac0fa2be65307739030723d6cb8","observation_id":"752f25c3-9b86-4b64-97ad-5ad0ad200212","resolution":{"observed_at":"2026-08-09T22:07:20.469504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.454370Z","title":"and Fusi, N","venue":null,"work_id":"4615d53a-30e6-4f02-90a5-78bf8e535d46","year":2020},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.716829Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:ad4892dfca8cd7e35311f661769d39029237a3001ba764a9268a235c3e495e54","observation_id":"c5ef3938-4732-4ce9-9e41-f0ec81fe3f7c","resolution":{"observed_at":"2026-08-09T22:07:20.458083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.443187Z","title":"and Fusi, N","venue":null,"work_id":"02253a52-db79-4ea6-8889-b6f3e8879b94","year":2021},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.720902Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:5f5ed03306b52bf5fdde2ecf1dcbf4958014b287865d5fe97dbf8be96dcf6d1f","observation_id":"321e2dce-a00d-40fb-a3ca-6bd45232f7ff","resolution":{"observed_at":"2026-08-09T22:07:20.446912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:19.724454Z","title":"Analysis of representations for domain adaptation","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.724454Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:5f19faab3db2cc48015496aef9e58c13d3ffa5f2d3a02e1bccb13c301fc15ddb","observation_id":"c85f0792-0f26-4a97-aff1-0e1e6e28869f","resolution":{"observed_at":"2026-08-09T22:07:19.724454Z","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-09T22:07:20.424767Z","title":null,"venue":null,"work_id":"896e4f36-03cd-44be-8fdc-758521a6989f","year":2025},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.728366Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:52c5bab95e4584d12901596491ee4d4feac9dbd567dbfb5e51dd6323726eeef6","observation_id":"c1313ffa-5a53-4450-97f5-18f3561f5005","resolution":{"observed_at":"2026-08-09T22:07:20.428625Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.411392Z","title":"Hyperbolic sliced- W asserstein via geodesic and horospherical projections","venue":null,"work_id":"aabf3f3d-c4cc-4dbb-a872-b88de3c5ccab","year":2023},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.732397Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:cad758cd029a20787d80123ab9fb25f175db941aef2042e7ac791060de2ab430","observation_id":"e8a440ef-c93c-40bb-b917-3c2656d3bcd6","resolution":{"observed_at":"2026-08-09T22:07:20.415279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06560","last_updated":"2024-03-11T10:01:21Z","snapshot_observed_at":"2026-08-10T22:09:41.821310Z","submitted_at":"2024-03-11T10:01:21Z","title":"Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds","version":1},"cited_work":{"arxiv_id":"2403.06560","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.06560","snapshot_observed_at":"2026-08-09T22:07:19.977161Z","title":"Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds","venue":"cs.LG","work_id":"f286656c-d04b-46d5-b8e9-76e812efc343","year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.735897Z"},"links":{"cited_paper":"/paper/2403.06560","citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:ed1666933be71daa9727785a7c2ff53456555033eda256e8d2b8fd5ebc9bed06","observation_id":"ef2f0d3e-7083-4326-9ce4-3dae3671f86c","resolution":{"observed_at":"2026-08-09T22:07:19.981498Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.398956Z","title":"Sliced and R adon W asserstein barycenters of measures","venue":null,"work_id":"14b4277d-b5eb-48b6-be68-9a4fc216a31a","year":2015},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.739863Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:06ed7d276e62574a76286f34ae13bcef2f3ffb92aa20570af8c1191f07046d4c","observation_id":"a59e8437-fdf5-4803-82c5-2d3f5081acd0","resolution":{"observed_at":"2026-08-09T22:07:20.403432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.387423Z","title":null,"venue":null,"work_id":"eb9c1df5-6662-471e-9f5e-136cfd9354cd","year":2011},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.743586Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:640eb727dbab9009b0d3c98fdd7dc4cfa834b2cda7409d0ffcb73f4ecc5b8270","observation_id":"d53589ce-61e9-4fff-8417-c5f4e0abd1d6","resolution":{"observed_at":"2026-08-09T22:07:20.391213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.375909Z","title":null,"venue":null,"work_id":"9bdad29d-a4af-40d7-ba43-2ce6f5b794b7","year":1960},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.747264Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:ee52c32cc093203f3e5881513fa5987b1ff731487dfd4576eb5ce0f53af8fd03","observation_id":"d8956dea-bf8d-4bca-a1a4-235f1398d0e9","resolution":{"observed_at":"2026-08-09T22:07:20.379730Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.363931Z","title":null,"venue":null,"work_id":"3daf6e31-fbff-4a46-bd30-4b26dc7377ca","year":2000},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.751264Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:7440fe13bdb3b68d4825c5b39b596ea1f6371b902a0f2d78f241d66b9dbffa6a","observation_id":"0d950171-e906-44b4-89ea-2dee5759b1a6","resolution":{"observed_at":"2026-08-09T22:07:20.367845Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:19.754740Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.754740Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:3a1d5358abe8cf73e1c5662c54a6211bf352e17de1c838aa55ded814d3a8bf04","observation_id":"6906b8da-4291-403b-8b8a-8178980b96d1","resolution":{"observed_at":"2026-08-09T22:07:19.754740Z","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-09T22:07:19.758233Z","title":"The mnist database of handwritten digit images for machine learning research [best of the web]","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.758233Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:bf559c4381e4a6a83ee9766fea2728c3ebe3e6a44be0b3706bbd710657d80cec","observation_id":"2fd1914e-6e60-4cd7-8392-7d8e1ca61cf2","resolution":{"observed_at":"2026-08-09T22:07:19.758233Z","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-09T22:07:20.340341Z","title":"and Chaudhari, P","venue":null,"work_id":"03bd72ba-7c6f-434d-b32d-c452b77e456e","year":2021},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.761664Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:7c4e9be3b6e66f82f80f588c5213b0ba637f6faf0ad5524e3303b3ce61b569d0","observation_id":"279ad26f-fe8f-4fd4-b007-10bae7b1db8b","resolution":{"observed_at":"2026-08-09T22:07:20.344197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.328611Z","title":"C., Harris, T., Wang, Z., and Li, B","venue":null,"work_id":"d0fc552d-0bc6-493b-8e2a-c20986a1e740","year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.765203Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:52af9b756ae6f20a5bf4d84106d0d67241d5cf67477ed3704a1afa0cbe58a148","observation_id":"0557ddd5-a5f9-45de-bf16-75937f6dbf33","resolution":{"observed_at":"2026-08-09T22:07:20.332689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.315258Z","title":"The joint effect of task similarity and overparameterization on catastrophic forgetting an analytical model","venue":null,"work_id":"d88907eb-f194-4abc-8628-3254754d8e9d","year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.768649Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:0939edac903f7c8db6547343cd7782f341ed3a07d3eec1fb2eac2d8f4813ed1f","observation_id":"f6b745a6-9919-468a-ba8e-1b269254f762","resolution":{"observed_at":"2026-08-09T22:07:20.320246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:19.772187Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.772187Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:93f9b993ffc23300bb68671613e0f081a884f09ad83f058658bd79aa355f36b8","observation_id":"42535a29-5cca-4630-8860-88236db2f20e","resolution":{"observed_at":"2026-08-09T22:07:19.772187Z","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-09T22:07:20.294317Z","title":"The R adon transform on r n","venue":null,"work_id":"3f7214ea-dde2-41ca-9404-b1e80b76899b","year":2011},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.775820Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:9829a68384562221fdee60ac807de920deb5699aff6a9a603035119c9cf3654c","observation_id":"8ce9d1e4-005f-4a47-ae15-b5e8a2a8fa3d","resolution":{"observed_at":"2026-08-09T22:07:20.298108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:19.779604Z","title":"Continual learning of a mixed sequence of similar and dissimilar tasks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.779604Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:46f336680fcb97f2ee8bdbda51fc2486f75242917ac6e3f896fdf097e6fb32e5","observation_id":"6301a50c-47a5-4a60-a573-d6d26da34f47","resolution":{"observed_at":"2026-08-09T22:07:19.779604Z","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-09T22:07:20.274790Z","title":"F., and Talwalkar, A","venue":null,"work_id":"8c22acb5-7cbb-4fa2-b410-96d169bcc7b3","year":2019},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.783095Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:74f73ca168af5600e9962cf0efa2d4629b8329da405985c328dec9b0a5471d6e","observation_id":"5ca1104d-ad10-4d94-a4a7-57596bc00397","resolution":{"observed_at":"2026-08-09T22:07:20.278594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.262515Z","title":"K., and Hoffmann, H","venue":null,"work_id":"e1d180e6-1d87-42ee-a2af-a3fd6de842eb","year":2021},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.786705Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:0e6f2ed545e9ef66ca582cbfa87668d1ace0819a1a7ea4f628b42d095e28bf33","observation_id":"c7be3994-4c26-402d-9011-398a3a35fa0c","resolution":{"observed_at":"2026-08-09T22:07:20.266577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.252024Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":"ffd9520d-b936-41ef-bf1e-fa3e1a636d6d","year":2009},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.790211Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:27728f8e94e3025bef54a998d20611a36783399871bc2bbd0e33d153d97320ff","observation_id":"944f81b5-9578-49a5-860e-62a5eb734ddd","resolution":{"observed_at":"2026-08-09T22:07:20.255715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:19.793730Z","title":"and Yang, X","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.793730Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:8e63665473d26ce3e499b6923c54527093210aa27ad46c19a49c2bcbeea574d5","observation_id":"b47669fa-02df-4dd1-8a90-20b67f13337b","resolution":{"observed_at":"2026-08-09T22:07:19.793730Z","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-09T22:07:19.797128Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.797128Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:d7e523e5062c09d0d53bea3edf40f50d1d9593403dc876e1d426cae674c196ed","observation_id":"9d8c18b9-c764-45d1-b1fb-4ac407f1a676","resolution":{"observed_at":"2026-08-09T22:07:19.797128Z","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-09T22:07:19.800691Z","title":"Continual learning in the teacher-student setup: Impact of task similarity","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.800691Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:c4c7f2df0292da280bb7b6cb08c363254f6d7f9206efc5e3ff51b6c63fe8d498","observation_id":"3399916b-8ae7-465c-99e9-9c067c066c87","resolution":{"observed_at":"2026-08-09T22:07:19.800691Z","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-09T22:07:20.220750Z","title":"and Brazdil, P","venue":null,"work_id":"70dbb3de-6fc3-49fe-a26a-b19c5de8cc4e","year":2005},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.804126Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:b2d793561bc37e01ce4d66f2a2f2ad551f67786820751695f8d3e8499d680869","observation_id":"9e2db7b6-8635-48cd-8019-fad207964d03","resolution":{"observed_at":"2026-08-09T22:07:20.224480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.208586Z","title":"Sliced- W asserstein estimation with spherical harmonics as control variates","venue":null,"work_id":"a30bd87b-a01b-4fdf-88ad-4a4c6d52ebe7","year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.808184Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:279bf5ae49417302b7816d6b30c739173459a8055e8a3f3d82612615f8c7934a","observation_id":"b2f91edb-bd26-4621-9b00-8cc7dd3ad45f","resolution":{"observed_at":"2026-08-09T22:07:20.212665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.15059","last_updated":"2024-02-06T10:58:38Z","snapshot_observed_at":"2026-07-06T13:15:24.934829Z","submitted_at":"2022-05-30T12:40:32Z","title":"Hilbert Curve Projection Distance for Distribution Comparison","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.15059","snapshot_observed_at":"2026-08-09T22:07:19.811731Z","title":"Hilbert curve projection distance for distribution comparison","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.811731Z"},"links":{"cited_paper":"/paper/2205.15059","citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:e6d6f3a0c112183c90cc91343cfefc46c1b76913646f40562eab7d642b0f4bc4","observation_id":"a6f0c29b-5ec1-4b6d-bff7-a51d9e61f6c4","resolution":{"observed_at":"2026-08-09T22:07:19.811731Z","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-09T22:07:20.197420Z","title":"W asserstein task embedding for measuring task similarities","venue":null,"work_id":"1456183b-e025-4b30-ba25-816df388c5cf","year":2025},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.815280Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:60735da4c032f9bd5732a1b2db96225753a3567d8cde71a48c6cb6f9a6085c37","observation_id":"80b12b6e-5d56-4973-8bbf-838abe6acdb1","resolution":{"observed_at":"2026-08-09T22:07:20.201466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.185605Z","title":"Minimax confidence intervals for the sliced W asserstein distance","venue":null,"work_id":"2f12285f-2146-4eed-b982-31d74e11f5f7","year":2022},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.818790Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:6fe8e2b4b32218fb9f4f525e72f0d73ec08680fe9dff5a72f9ff8717af328696","observation_id":"ada56ff2-6b6f-43fe-ac3a-210ce2b7cf39","resolution":{"observed_at":"2026-08-09T22:07:20.189622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.3430","last_updated":"2023-11-30T22:47:15Z","snapshot_observed_at":"2026-08-10T22:08:48.399249Z","submitted_at":"2009-02-19T18:42:16Z","title":"Domain Adaptation: Learning Bounds and Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0902.3430","snapshot_observed_at":"2026-08-09T22:07:19.822306Z","title":"Domain adaptation: Learning bounds and algorithms","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.822306Z"},"links":{"cited_paper":"/paper/0902.3430","citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:8f3fdb3c32124f846af498c4928a54b5d16e70367e41c57c177c3ec6126729ff","observation_id":"6af6a658-1e63-4fe2-ba24-732d35bd06ca","resolution":{"observed_at":"2026-08-09T22:07:19.822306Z","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-09T22:07:19.826031Z","title":"Statistical and topological properties of sliced probability divergences","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.826031Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:0ae16dd9276c2d566e58d5db955ecb68bcd6e3adf61c35d55f5d7952e2aa837c","observation_id":"94ad1818-1ea1-4040-a499-7f6eed5f3476","resolution":{"observed_at":"2026-08-09T22:07:19.826031Z","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-09T22:07:20.167369Z","title":"and Ho, N","venue":null,"work_id":"ac5780e4-28ef-480d-8331-2413ca65082b","year":2022},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.829583Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:d5af0634d9c5000a37758ad22db937d67d146c5391fb77289db34bb5b2d959c2","observation_id":"b639ade4-3612-474b-a9d0-67574bacb2ff","resolution":{"observed_at":"2026-08-09T22:07:20.170973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.155345Z","title":"and Ho, N","venue":null,"work_id":"e05cb068-72ef-4add-bf3a-260870e668ea","year":2023},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.833105Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:166de6936ef158c56759a1b98a4cb2b11940970b581655d939839e75bc648c3b","observation_id":"b6bb394f-284e-4bc1-b8a0-8505bb5353a1","resolution":{"observed_at":"2026-08-09T22:07:20.159545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.143403Z","title":"and Ho, N","venue":null,"work_id":"87be759e-e486-4013-a25c-08b80f77a038","year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.836871Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:f85d82b758c29da2c2ec9a934dc543ec072b6a2d06148d5d35deafbcdbb693a0","observation_id":"11dfe5dc-9ac2-4f83-9381-b6401ce3218e","resolution":{"observed_at":"2026-08-09T22:07:20.147486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14674","last_updated":"2025-05-08T02:00:36Z","snapshot_observed_at":"2026-08-06T22:33:28.995373Z","submitted_at":"2024-11-22T02:15:38Z","title":"Summarizing Bayesian Nonparametric Mixture Posterior -- Sliced Optimal Transport Metrics for Gaussian Mixtures","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14674","snapshot_observed_at":"2026-08-09T22:07:19.840340Z","title":"and Mueller, P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.840340Z"},"links":{"cited_paper":"/paper/2411.14674","citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:a5bbde948b6be511bc53cda88916c480e317751d83a2fb8f8fb4ef982a3b82f9","observation_id":"2fe8163c-8e4a-46fa-bf51-2330c692fac3","resolution":{"observed_at":"2026-08-09T22:07:19.840340Z","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-09T22:07:20.131848Z","title":"Quasi-monte carlo for 3d sliced W asserstein","venue":null,"work_id":"f18e173d-ba0a-4a60-9eb1-87bea16e3813","year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.844093Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:619e4aedc7c289fe3d4589b73ac53d5ebc797eb2bae22eebcbee18f1dc4eb0ec","observation_id":"17c4c871-1d4e-4225-b53a-66b988392e9a","resolution":{"observed_at":"2026-08-09T22:07:20.135820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.120675Z","title":"Statistical, robustness, and computational guarantees for sliced W asserstein distances","venue":null,"work_id":"3697c370-8db5-4f2d-840a-52c3da765d84","year":2022},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.847499Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:3c8b143c8eab0526e2c1498df67b635291ac4e8dc838abcca187183feb6b739e","observation_id":"cbc531f1-a331-4789-ad59-643fcd9dbef7","resolution":{"observed_at":"2026-08-09T22:07:20.124227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.110239Z","title":"and Cuturi, M","venue":null,"work_id":"81c626f7-8877-4588-81cb-2a0422c2f769","year":2020},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.850920Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:9857f1c03f049a6a8de557f80a12181f47bc14b50696c7446a05226ac08691fe","observation_id":"26146efb-14a5-4eb9-ab9b-8c30cbfb13d4","resolution":{"observed_at":"2026-08-09T22:07:20.113906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.099606Z","title":"Sliced optimal transport on the sphere","venue":null,"work_id":"6bec9365-8a6e-4578-8225-bb9290826a36","year":2023},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.854217Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:62421aec6ae63e9b9689cf9d3c0a9a0a47d3999da1db96f34b4127fd976d4066","observation_id":"8099d9a7-e3fa-4ada-a281-fea608bb14b4","resolution":{"observed_at":"2026-08-09T22:07:20.103454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16896","last_updated":"2024-05-22T09:56:35Z","snapshot_observed_at":"2026-07-06T17:22:24.004418Z","submitted_at":"2024-01-30T11:04:40Z","title":"Parallelly Sliced Optimal Transport on Spheres and on the Rotation Group","version":2},"cited_work":{"arxiv_id":"2401.16896","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.16896","snapshot_observed_at":"2026-08-09T22:07:19.930346Z","title":"Parallelly Sliced Optimal Transport on Spheres and on the Rotation Group","venue":"math.NA","work_id":"2000c361-3fc8-4899-8087-934d0443c29d","year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.857740Z"},"links":{"cited_paper":"/paper/2401.16896","citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:e67cd3812498ca2cd417291f1c0eb0c0c5a33e94dfb0b7919cad412a331d688a","observation_id":"d946c352-05a0-4d46-8708-1887ce62373d","resolution":{"observed_at":"2026-08-09T22:07:19.936328Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:19.861476Z","title":"Wasserstein barycenter and its application to texture mixing","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.861476Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:89706b85132de585a7b6aa629f2528160e6a111b53ddf3d94dbae4056bdc424a","observation_id":"d425003d-d837-42b9-a48f-648a0541e71a","resolution":{"observed_at":"2026-08-09T22:07:19.861476Z","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-09T22:07:20.082299Z","title":"and Simon, B","venue":null,"work_id":"1a71d9d4-77e7-4bc9-a1de-64a5558fde1e","year":1975},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.864967Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:d7aabe32eee9fa1e349da198d61d2b486e2a956bf1e3dabdb02627c1220f7cf5","observation_id":"62c5890e-c259-4ad5-9802-bd13ab664e04","resolution":{"observed_at":"2026-08-09T22:07:20.085961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.071441Z","title":"Otce: A transferability metric for cross-domain cross-task representations","venue":null,"work_id":"39b15e82-920a-44cf-888f-345d4d8ccb93","year":2021},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.868526Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:0dffa8cd52c376fc10879b87f8b5242be824577cfe14209cd28652fa107cb294","observation_id":"29d5d5c4-bcf8-4278-bca3-73953fda2fae","resolution":{"observed_at":"2026-08-09T22:07:20.075498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.060165Z","title":"T., Nguyen, C","venue":null,"work_id":"1c7b13b5-6e47-457d-a420-974231a4201a","year":2019},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.872068Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:d3ae3c536367131d2ae70113aecbeb99c1094a8a237549bd739cb90cfccebf5d","observation_id":"83e5f735-7ff8-4284-9205-3b922066f59b","resolution":{"observed_at":"2026-08-09T22:07:20.064108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.049318Z","title":"D., and Kolouri, S","venue":null,"work_id":"dd3848aa-8bdf-4f46-b56f-4a6e9c9ce3a2","year":2024},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.875617Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:775e166b404ba344cd275a3d89b6e43def17accb995ea11a1c89f8a97267f24e","observation_id":"f5d421ad-03ec-4862-8ead-d821117db7a9","resolution":{"observed_at":"2026-08-09T22:07:20.052921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.038122Z","title":"Optimal transport: old and new, volume 338","venue":null,"work_id":"2ff1c9a8-c9ba-4966-a158-367367a8ae2a","year":2008},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.879086Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:574bdc44a5ebd2ef45d00c80865e0c4d10ef3d98cd6e9593b6bec76c29eaf608","observation_id":"87fd4d6e-b626-4a25-aec8-2928a053d8b1","resolution":{"observed_at":"2026-08-09T22:07:20.041868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.027308Z","title":"A., and Rohde, G","venue":null,"work_id":"a2cb5fe9-528b-41bf-a9c0-4f04fbde7fc9","year":2013},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.882693Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:ae4458214aa634bc962e87df179f84036c3e4f33fac3d03e6b87d5a5317328e5","observation_id":"6352d4b2-7165-4ef3-bbed-1a10ba987e5f","resolution":{"observed_at":"2026-08-09T22:07:20.031005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.016368Z","title":"and Cai, Z","venue":null,"work_id":"4f949acb-ac51-4f8c-bf52-854d34f5b879","year":2023},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.886390Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:12ceef04771e460712b06f59d873be8daa78e2d969d4b91a75fa66ee65d4dd93","observation_id":"8906a32d-6df8-4e0d-9f40-a3a7cdbff2ed","resolution":{"observed_at":"2026-08-09T22:07:20.019926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:20.005248Z","title":null,"venue":null,"work_id":"5c5b18e7-2364-4589-b409-9fcb64647365","year":2019},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.890428Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:79b6eb4410c1f4a7b98899097e56f552b2bbcb6db4344d59dfddd540e4531f07","observation_id":"f314687e-f417-4253-b392-83d430ab12a6","resolution":{"observed_at":"2026-08-09T22:07:20.009049Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:07:19.894172Z","title":"Character-level convolutional networks for text classification","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.894172Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:6fd2850a2b4ae0525b3625a86ea18bacc7a9fddc5c6a44fc3fb1ad45f300d77d","observation_id":"9f25d0a7-c699-4b99-ac0a-cdf1d8a22b41","resolution":{"observed_at":"2026-08-09T22:07:19.894172Z","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-09T22:07:19.897940Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-09T22:07:19.897940Z"},"links":{"citing_paper":"/paper/2501.18901"},"observation_digest":"sha256:137407535899f71b4991d7b483591bf7ded75614de96c1b5308a89cec8a96938","observation_id":"5121dc4d-c863-49d0-bfff-5b07d762cf33","resolution":{"observed_at":"2026-08-09T22:07:19.897940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.18901","last_updated":"2025-05-15T17:48:47Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T18:04:27.799104Z","submitted_at":"2025-01-31T05:42:58Z","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":2,"verified_fuzzy":31},"total_outbound_references":53},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 3 inbound Pith citation observations for arXiv:2501.18901."}