Cluster-Aware Matching via Laplacian Optimal Transport | Paper Citation Record

Observation 215bcf7e-6a3b-4567-8957-a8cffc31f866 · outbound

This paper cites Gromov-Wasserstein Alignment of Word Embedding Spaces.

Cluster-Aware Matching via Laplacian Optimal Transport Gromov-Wasserstein Alignment of Word Embedding Spaces

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.336195Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7662676-4d43-439c-bff3-d9a37afe0bd9 · outbound

This paper cites Laplacian eigenmaps and spectral techniques for embedding and clustering.

Cluster-Aware Matching via Laplacian Optimal Transport Laplacian eigenmaps and spectral techniques for embedding and clustering

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.404383Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4cf3b1c-894f-41f3-98c3-30d74a8ffe65 · outbound

This paper cites A sober look at clustering stability.

Cluster-Aware Matching via Laplacian Optimal Transport A sober look at clustering stability

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.468276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fddb790b-283d-425c-976a-331b809c671a · outbound

This paper cites A method for registration of 3-D shapes.IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2):239–256, 1992.

Cluster-Aware Matching via Laplacian Optimal Transport A method for registration of 3-D shapes.IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2):239–256, 1992

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.523951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c6241d8-79b8-445b-a144-77aac9009e1b · outbound

This paper cites MREC: a fast and versatile framework for aligning and matching point clouds with applications to single cell molecular data.

Cluster-Aware Matching via Laplacian Optimal Transport MREC: a fast and versatile framework for aligning and matching point clouds with applications to single cell molecular data

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.577842Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b609fe0-3f6e-44fb-9d49-1718d3910de0 · outbound

This paper cites McGraw Hill, 2011.

Cluster-Aware Matching via Laplacian Optimal Transport McGraw Hill, 2011

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.641970Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b53feb98-bf00-46f6-976b-3d42e3e582f8 · outbound

This paper cites Learning generative models across incomparable spaces.

Cluster-Aware Matching via Laplacian Optimal Transport Learning generative models across incomparable spaces

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.720047Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a6e1729-ae04-4e81-990c-cab787e81101 · outbound

This paper cites Diffusion maps.Applied and Computational Harmonic Analysis, 21(1):5–30, 2006.

Cluster-Aware Matching via Laplacian Optimal Transport Diffusion maps.Applied and Computational Harmonic Analysis, 21(1):5–30, 2006

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.780755Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a153161f-6251-4e61-9b5c-0b1ca01bb7a1 · outbound

This paper cites Optimal transport for domain adaptation.IEEE Transactions on Pattern Analysis and Machine Intelligence, 39(9):1853–1865, 2017.

Cluster-Aware Matching via Laplacian Optimal Transport Optimal transport for domain adaptation.IEEE Transactions on Pattern Analysis and Machine Intelligence, 39(9):1853–1865, 2017

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.842145Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37765069-0ab4-4e86-b6f1-832fed0d2640 · outbound

This paper cites Sinkhorn distances: Lightspeed computation of optimal transport.

Cluster-Aware Matching via Laplacian Optimal Transport Sinkhorn distances: Lightspeed computation of optimal transport

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.918496Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 535ed611-3446-4faa-9486-81b187105a54 · outbound

This paper cites Efficient random graph matching via degree profiles.Probability Theory and Related Fields, 179(1):29–115, 2021.

Cluster-Aware Matching via Laplacian Optimal Transport Efficient random graph matching via degree profiles.Probability Theory and Related Fields, 179(1):29–115, 2021

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:43.976845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 014d7ab6-c898-440e-9055-3e14faf3023f · outbound

This paper cites On the existence of Monge maps for the Gromov-Wasserstein problem.Foundations of Computational Mathematics, 25(2):463–510, 2025.

Cluster-Aware Matching via Laplacian Optimal Transport On the existence of Monge maps for the Gromov-Wasserstein problem.Foundations of Computational Mathematics, 25(2):463–510, 2025

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.058910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2cb8d7c-0a61-4dc5-b884-bcf6aebeec06 · outbound

This paper cites An algorithm for restricted least squares regression.Journal of the American Statistical Association, 78(384):837–842, 1983.

Cluster-Aware Matching via Laplacian Optimal Transport An algorithm for restricted least squares regression.Journal of the American Statistical Association, 78(384):837–842, 1983

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.121399Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac6868d7-3dd7-4cf7-843a-0a371baa1a4a · outbound

This paper cites Regularized discrete optimal transport.SIAM Journal on Imaging Sciences, 7(3):1853–1882, 2014.

Cluster-Aware Matching via Laplacian Optimal Transport Regularized discrete optimal transport.SIAM Journal on Imaging Sciences, 7(3):1853–1882, 2014

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.199465Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1fcd27e-637d-4c1e-843e-24110d285732 · outbound

This paper cites Statistical optimal transport via factored couplings.

Cluster-Aware Matching via Laplacian Optimal Transport Statistical optimal transport via factored couplings

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.267449Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af4a6b50-2a64-4f13-b67c-4caa7c29d08d · outbound

This paper cites Unsupervised alignment of embeddings with Wasserstein procrustes.

Cluster-Aware Matching via Laplacian Optimal Transport Unsupervised alignment of embeddings with Wasserstein procrustes

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.303380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afa3e718-8ffb-4408-94b2-9ba8d6cb6d93 · outbound

This paper cites On the added value of bootstrap analysis for K-means clustering.Journal of Classification, 32(2):268–284, 2015.

Cluster-Aware Matching via Laplacian Optimal Transport On the added value of bootstrap analysis for K-means clustering.Journal of Classification, 32(2):268–284, 2015

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.365564Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adb5dbf9-b171-4901-9c35-7bb868a99ec7 · outbound

This paper cites Statistical significance of clustering using soft thresholding.Journal of Computational and Graphical Statistics, 24(4):975–993, 2015.

Cluster-Aware Matching via Laplacian Optimal Transport Statistical significance of clustering using soft thresholding.Journal of Computational and Graphical Statistics, 24(4):975–993, 2015

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.431538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7113cd8-38a4-4013-b180-fb8e9edbbc36 · outbound

This paper cites Reversible Gromov–Monge sampler for simulation-based inference.SIAM Journal on Mathematics of Data Science, 6(2):283–310, 2024.

Cluster-Aware Matching via Laplacian Optimal Transport Reversible Gromov–Monge sampler for simulation-based inference.SIAM Journal on Mathematics of Data Science, 6(2):283–310, 2024

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.500327Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 995c4595-72d5-4a1c-aa52-47e5edb2b848 · outbound

This paper cites Robust point matching with distance profiles.Journal of Machine Learning Research, 26(205):1–38, 2025.

Cluster-Aware Matching via Laplacian Optimal Transport Robust point matching with distance profiles.Journal of Machine Learning Research, 26(205):1–38, 2025

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.553682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed18baf8-0ad1-489d-8e97-762dadb3b557 · outbound

This paper cites A Convexified Matching Approach to Imputation and Individualized Inference.

Cluster-Aware Matching via Laplacian Optimal Transport A Convexified Matching Approach to Imputation and Individualized Inference

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.618646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 787419bc-fdb2-4493-953e-fcee38086d74 · outbound

This paper cites Inference for Clustering: Conformal Sets for Cluster Labels.

Cluster-Aware Matching via Laplacian Optimal Transport Inference for Clustering: Conformal Sets for Cluster Labels

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.689947Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 47ece751-c1b2-4e16-a791-fe3afb0de212 · outbound

This paper cites an unresolved cited work.

Cluster-Aware Matching via Laplacian Optimal Transport Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.835632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 160b23ad-b5ae-45a7-82a4-9067d773a8c0 · outbound

This paper cites Assignment problems and the location of economic activities.Econometrica, pages 53–76, 1957.

Cluster-Aware Matching via Laplacian Optimal Transport Assignment problems and the location of economic activities.Econometrica, pages 53–76, 1957

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:44.948541Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 61ebb858-8108-43f0-92cc-126cd240b4d3 · outbound

This paper cites Mechanisms to improve clustering uncertain data with UKmeans.Data & Knowledge Engineering, 116:1–18, 2018.

Cluster-Aware Matching via Laplacian Optimal Transport Mechanisms to improve clustering uncertain data with UKmeans.Data & Knowledge Engineering, 116:1–18, 2018

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.039508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6b1a0ff3-e36e-48b6-8915-bcaef92524d4 · outbound

This paper cites A survey for the quadratic assignment problem.European Journal of Operational Research, 176(2):657–690, 2007.

Cluster-Aware Matching via Laplacian Optimal Transport A survey for the quadratic assignment problem.European Journal of Operational Research, 176(2):657–690, 2007

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.162093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4006e082-f020-4e46-af5c-e38154a3c667 · outbound

This paper cites Gromov-Wasserstein distances and the metric approach to object matching.Founda- tions of Computational Mathematics, 11(4):417–487, 2011.

Cluster-Aware Matching via Laplacian Optimal Transport Gromov-Wasserstein distances and the metric approach to object matching.Founda- tions of Computational Mathematics, 11(4):417–487, 2011

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.277737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e5617e8b-2a8e-46af-bb1b-07c8af193ffd · outbound

This paper cites Comparison results for Gromov-Wasserstein and Gromov-Monge distances.ESAIM: Control, Optimisation and Calculus of Variations, 30:78, 2024.

Cluster-Aware Matching via Laplacian Optimal Transport Comparison results for Gromov-Wasserstein and Gromov-Monge distances.ESAIM: Control, Optimisation and Calculus of Variations, 30:78, 2024

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.399183Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0084fef0-0b95-403d-b040-f308b69e554f · outbound

This paper cites Point set registration: Coherent point drift.IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(12):2262–2275, 2010.

Cluster-Aware Matching via Laplacian Optimal Transport Point set registration: Coherent point drift.IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(12):2262–2275, 2010

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.496242Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b271f33-5a5d-4d65-b7df-8501d9c1e21a · outbound

This paper cites Weighted Conformal Clustering.

Cluster-Aware Matching via Laplacian Optimal Transport Weighted Conformal Clustering

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.615657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a48dcca7-78e4-4ab8-bb9e-1d361512eb10 · outbound

This paper cites The canonically posed 3d objects dataset.

Cluster-Aware Matching via Laplacian Optimal Transport The canonically posed 3d objects dataset

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.776260Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 811c1729-b0f9-4c24-b226-a89cbf631e06 · outbound

This paper cites Computational optimal transport: With applications to data science.

Cluster-Aware Matching via Laplacian Optimal Transport Computational optimal transport: With applications to data science

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.863495Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d0cc7e7d-89af-4d65-9a3c-cff2a67544fd · outbound

This paper cites Gromov-Wasserstein averaging of kernel and distance matrices.

Cluster-Aware Matching via Laplacian Optimal Transport Gromov-Wasserstein averaging of kernel and distance matrices

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.921766Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8efd5689-0ef8-4931-b9b1-91e7877ebe6e · outbound

This paper cites Stability k-means clustering.

Cluster-Aware Matching via Laplacian Optimal Transport Stability k-means clustering

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:45.993056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e615c42b-a954-45fd-bb7a-69f8ed771153 · outbound

This paper cites an unresolved cited work.

Cluster-Aware Matching via Laplacian Optimal Transport Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.056367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36ca1a09-b072-4b8e-b4b1-db5358593a20 · outbound

This paper cites Fast point feature histograms (FPFH) for 3d registration.IEEE International Conference on Robotics and Automation, pages 3212–3217, 2009.

Cluster-Aware Matching via Laplacian Optimal Transport Fast point feature histograms (FPFH) for 3d registration.IEEE International Conference on Robotics and Automation, pages 3212–3217, 2009

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.118294Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b9fafcd-f262-4405-a854-63133fbb6e52 · outbound

This paper cites Recent advances in shape correspondence.The Visual Computer, 36(8):1705–1721, 2020.

Cluster-Aware Matching via Laplacian Optimal Transport Recent advances in shape correspondence.The Visual Computer, 36(8):1705–1721, 2020

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.192640Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f62e1f5-8cce-4930-976a-3275abdddfb9 · outbound

This paper cites Low-rank optimal transport: Approximation, statistics and debiasing.

Cluster-Aware Matching via Laplacian Optimal Transport Low-rank optimal transport: Approximation, statistics and debiasing

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.312458Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8236b62-3e1e-408b-aeb5-5278267d6f31 · outbound

This paper cites Low-rank Sinkhorn factorization.

Cluster-Aware Matching via Laplacian Optimal Transport Low-rank Sinkhorn factorization

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.466953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2743b34-43f9-423d-9095-677b0834b06f · outbound

This paper cites an unresolved cited work.

Cluster-Aware Matching via Laplacian Optimal Transport Unresolved cited work

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.586746Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4517affc-a2d5-42a2-9785-a40ae01c0e73 · outbound

This paper cites Generalized-ICP.

Cluster-Aware Matching via Laplacian Optimal Transport Generalized-ICP

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.709456Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a4ec3fd-dcb3-469c-b6f1-f6df1e38f554 · outbound

This paper cites Critical limitations of consensus clustering in class discovery.Scientific Reports, 4(1):6207, 2014.

Cluster-Aware Matching via Laplacian Optimal Transport Critical limitations of consensus clustering in class discovery.Scientific Reports, 4(1):6207, 2014

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.865655Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 39136c2c-4875-4bff-853f-2d0c4f38f316 · outbound

This paper cites Alignment of density maps in Wasserstein distance.Biological Imaging, 4:e5, 2024.

Cluster-Aware Matching via Laplacian Optimal Transport Alignment of density maps in Wasserstein distance.Biological Imaging, 4:e5, 2024

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:46.986495Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c88d65c6-c5b6-4433-9696-f24b39708ad8 · outbound

This paper cites Lack of evidence for the transitional cerebellar progenitor.Nature, 643(8071):E1–E8, 2025.

Cluster-Aware Matching via Laplacian Optimal Transport Lack of evidence for the transitional cerebellar progenitor.Nature, 643(8071):E1–E8, 2025

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:47.214622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f9a24e7-d9f9-4bdf-9ffa-1b2fa5a7f582 · outbound

This paper cites Entropic metric alignment for corre- spondence problems.ACM Transactions on Graphics, 35(4):1–13, 2016.

Cluster-Aware Matching via Laplacian Optimal Transport Entropic metric alignment for corre- spondence problems.ACM Transactions on Graphics, 35(4):1–13, 2016

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:47.349713Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7f6a152-18d8-4489-9efa-9d9eae3395d1 · outbound

This paper cites A survey on shape corre- spondence.Computer Graphics Forum, 30(6):1681–1707, 2011.

Cluster-Aware Matching via Laplacian Optimal Transport A survey on shape corre- spondence.Computer Graphics Forum, 30(6):1681–1707, 2011

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:47.509099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ce4acb2-4e9b-427e-a04b-09dabdfcdd07 · outbound

This paper cites American Mathematical Society, 2003.

Cluster-Aware Matching via Laplacian Optimal Transport American Mathematical Society, 2003

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:47.625014Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9620e8d3-3448-421b-bf0c-bd3d7d8f36d4 · outbound

This paper cites A tutorial on spectral clustering.Statistics and Computing, 17(4):395–416, 2007.

Cluster-Aware Matching via Laplacian Optimal Transport A tutorial on spectral clustering.Statistics and Computing, 17(4):395–416, 2007

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:47.773615Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71cdb0d6-c807-49d3-babb-d67a4aa19973 · outbound

This paper cites Clustering stability: An overview.Foundations and Trends®in Machine Learning, 2(3):235–274, 2010.

Cluster-Aware Matching via Laplacian Optimal Transport Clustering stability: An overview.Foundations and Trends®in Machine Learning, 2(3):235–274, 2010

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:47.948721Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aad866c6-7a60-4365-92eb-f8cde4d18fc8 · outbound

This paper cites Bayesian cluster analysis: Point estimation and credible balls (with discussion).Bayesian Analysis, 13(2):559–626, 2018.

Cluster-Aware Matching via Laplacian Optimal Transport Bayesian cluster analysis: Point estimation and credible balls (with discussion).Bayesian Analysis, 13(2):559–626, 2018

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:48.033484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ba7a700-f37f-423d-a80e-230a741814f0 · outbound

This paper cites The use of entropy maximising models, in the theory of trip distribution, mode split and route split.Journal of Transport Economics and Policy, pages 108–126, 1969.

Cluster-Aware Matching via Laplacian Optimal Transport The use of entropy maximising models, in the theory of trip distribution, mode split and route split.Journal of Transport Economics and Policy, pages 108–126, 1969

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:48.105718Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ccda70e-41f3-47a2-89ee-1d672d6dded3 · outbound

This paper cites Optimal transport for brain-image alignment: Unveiling redundancy and synergy in neural information processing.

Cluster-Aware Matching via Laplacian Optimal Transport Optimal transport for brain-image alignment: Unveiling redundancy and synergy in neural information processing

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-01T21:11:48.177477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7aacc24-841c-46c9-beef-b62bab39a4fc · outbound

This paper cites Gromov-Wasserstein learning for graph matching and node embedding.

Cluster-Aware Matching via Laplacian Optimal Transport Gromov-Wasserstein learning for graph matching and node embedding

Reference 53

Resolution: malformed identifier; no resolver link, observed 2026-08-01T21:11:48.250542Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers