A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Optimal transport with entropic regularization can be formulated as a strictly convex optimization problem that can be solved efficiently using the Sinkhorn-Knopp algorithm.
“Optimal transport with entropic regularization can be formulated as a strictly convex optimization problem that can be solved efficiently using the alternating direction method (Sinkhorn–Knopp algorithm15,16).”
From Causal identification of single-cell experimental perturbation effects with CINEMA-OT (2023) · cites this paper as [15]
Solving the optimal transport problem is often prohibitively resource-intensive for large-scale biological data, but CINEMA-OT considers the tractable case of entropic regularization.
“While solving the optimal transport problem is often prohibitively resource-intensive for large-scale biological data, CINEMA-OT considers the tractable case of entropic regularization15,16.”
From Causal identification of single-cell experimental perturbation effects with CINEMA-OT (2023) · cites this paper as [15]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Kemeny, J. G., & Snell, J. L. (1976) · Medical Entomology and Zoology · Cited by 2,813 · see citing works
Statistical Inference for Markov Processes
Pyke, R., & Billingsley, P. (1963) · Technometrics · doi:10.2307/1266351 · Cited by 561 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A new point matching algorithm for non-rigid registration
Chui, H., & Rangarajan, A. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00009-2 · Cited by 1,560 · see citing works
A graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090 · see citing works
Efficient transformers: A survey
Tay, Y., Dehghani, M., Bahri, D., & Metzler, D. (2023) · ACM Computing Surveys · doi:10.1145/3530811 · Cited by 1,267 · see citing works
Plug-and-Play ADMM for Image Restoration: Fixed-Point Convergence and Applications
Chan, S. H., Wang, X., & Elgendy, O. A. (2017) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2016.2629286 · Cited by 904 · see citing works
Majorization, doubly stochastic matrices, and comparison of eigenvalues
Ando, T. (1989) · Linear Algebra and its Applications · doi:10.1016/0024-3795(89)90580-6 · Cited by 305 · see citing works
The Born supremacy: quantum advantage and training of an Ising Born machine
Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00288-9 · Cited by 155 · see citing works
CLIP-Event: Connecting Text and Images with Event Structures
Li, M., Xu, R., Wang, S., Zhou, L., Lin, X., Zhu, C., Zeng, M., Ji, H., & Chang, S.-F. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01593 · Cited by 117 · see citing works
Causal identification of single-cell experimental perturbation effects with CINEMA-OT
Dong, M., Wang, B., Wei, J., de O. Fonseca, A. H., Perry, C. J., Frey, A., Ouerghi, F., Foxman, E. F., Ishizuka, J. J., Dhodapkar, R. M., et al. (2023) · Nature Methods · doi:10.1038/s41592-023-02040-5 · Cited by 94 · see citing works
Wireless Network Intelligence at the Edge
Park, J., Samarakoon, S., Bennis, M., & Debbah, M. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2941458 · Cited by 92 · see citing works
Automatic 3d free form shape matching using the graduated assignment algorithm
Liu, Y. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.01.008 · Cited by 37 · see citing works
A mean field annealing approach to accurate free form shape matching
Liu, Y. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.11.025 · Cited by 28 · see citing works
- Authors
- Sinkhorn, R.
- Corresponding author
- Sinkhorn, Richard
- Venue
- The Annals of Mathematical Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 1964-06
- Volume
- 35
- Issue
- 2
- Pages
- 876-879
- ISSN
- 0003-4851 (ISSN-L)
- OpenAlex
- W1990283121
- Cited by
- 1,032
- References
- 2
- Citations by year
- 2026: 60 · 2025: 69 · 2024: 70 · 2023: 83 · 2022: 65 · 2021: 80 · 2020: 65 · 2019: 49 · 2018: 42 · 2017: 37 · 2016: 30 · 2015: 38 · 2014: 26 · 2013: 23 · 2012: 25
- FWCI
- 4.56
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Locations
- The Annals of Mathematical Statistics (publishedVersion)
- Project Euclid (Cornell University) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Mathematics › Applied Mathematics › Mathematical Inequalities and Applications
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Keywords
- doubly stochastic matrices, matrix theory, positive matrices, stochastic matrices
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
