The DOI matches its Crossref record.
The Distribution of a Product from Several Sources to Numerous Localities
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 4,568
Management Models and Industrial Applications of Linear Programming
Charnes, A., & Cooper, W. W. (1957) · Management Science · doi:10.1287/mnsc.4.1.38 · Cited by 1,902
Feature point tracking and trajectory analysis for video imaging in cell biology
Sbalzarini, I. F., & Koumoutsakos, P. (2005) · Journal of Structural Biology · doi:10.1016/j.jsb.2005.06.002 · Cited by 1,392
Zhang, C., Cai, Y., Lin, G., & Shen, C. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01222 · Cited by 898
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
On Minimizing a Convex Function Subject to Linear Inequalities
Beale, E. M. L. (1955) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1955.tb00191.x · Cited by 625
An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison
Ling, H., & Okada, K. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1058 · Cited by 414
Vehicle routing problems for city logistics
Cattaruzza, D., Absi, N., Feillet, D., & González-Feliu, J. (2017) · EURO Journal on Transportation and Logistics · doi:10.1007/s13676-014-0074-0 · Cited by 334
Perceptual Metrics for Image Database Navigation
Rubner, Y., & Tomasi, C. (2001) · Springer eBooks · doi:10.1007/978-1-4757-3343-3 · Cited by 296
Detecting Phishing Web Pages with Visual Similarity Assessment Based on Earth Mover's Distance (EMD)
Fu, A. Y., Wenyin, L., & Deng, X. (2006) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2006.50 · Cited by 294
A genetic algorithm for two-stage transportation problem using priority-based encoding
Gen, M., Altiparmak, F., & Lin, L. (2006) · OR Spectrum · doi:10.1007/s00291-005-0029-9 · Cited by 286
A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
Ford, L. R., & Fulkerson, D. R. (1957) · Canadian Journal of Mathematics · doi:10.4153/cjm-1957-024-0 · Cited by 286
Linear-Time Approximation for Maximum Weight Matching
Duan, R., & Pettie, S. (2014) · Journal of the ACM · doi:10.1145/2529989 · Cited by 265
Content based video matching using spatiotemporal volumes
Basharat, A., Zhai, Y., & Shah, M. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.09.016 · Cited by 94
Optimal transport for single-cell and spatial omics
Bunne, C., Schiebinger, G., Krause, A., Regev, A., & Cuturi, M. (2024) · Nature Reviews Methods Primers · doi:10.1038/s43586-024-00334-2 · Cited by 71
Affective Polarization in Online Climate Change Discourse on Twitter
Tyagi, A., Uyheng, J., & Carley, K. M. (2020) · 2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam49781.2020.9381419 · Cited by 75
“For a group holding stance k, we define our novel affective polarization metric as: lk = { − ∫ +∞ −∞ |Uk − Vk| : Pk 0∫ +∞ −∞ |Uk − Vk| : Pk ≥ 0 (4) where Uk and Vk are the respective CDFs of uk and vk. EMD is proportional to the minimum amount of work required to covert one distribution to another 4.”
BackgroundInfluentialA statistical framework for high-content phenotypic profiling using cellular feature distributions
Pearson, Y. E., Kremb, S., Butterfoss, G. L., Xie, X., Fahs, H., & Gunsalus, K. C. (2022) · Communications Biology · doi:10.1038/s42003-022-04343-3 · Cited by 19
“The EMD was originally conceived as a solution to the transport problem from linear optimization 54 but is regularly applied in different fi elds including image processing, pattern recognition (text processing), machine learning and fl ow cyto-metry data 55 .”
ADTnorm: Robust Integration of Single-cell Protein Measurement across CITE-seq Datasets
Zheng, Y., Caron, D. P., Kim, J. Y., Jun, S.-H., Tian, Y., Florian, M., Stuart, K. D., Sims, P. A., & Gottardo, R. (2022) · doi:10.1101/2022.04.29.489989 · Cited by 18
Metadata
- Authors
- Hitchcock, F. L.
- Venue
- Journal of Mathematics and Physics
- Publisher
- Wiley
- Published
- 1941-04
- Volume
- 20
- Issue
- 1-4
- Pages
- 224-230
- ISSN
- 0022-2526 (ISSN-L)
- 0097-1421
- OpenAlex
- W2328725012
- Cited by
- 1,609
- References
- 0
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.