The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Paths, Trees, and Flowers
Open accessAbstract
A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An edge is said to join its end-points. A matching in G is a subset of its edges such that no two meet the same vertex. We describe an efficient algorithm for finding in a given graph a matching of maximum cardinality. This problem was posed and partly solved by C. Berge; see Sections 3.7 and 3.8.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Cites
The Factorization of Linear Graphs
Tutte, W. T. (1947) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-22.2.107 · Cited by 945
The Theory of Graphs and its Applications.
Harary, F., & Berge, C. (1963) · Biometrika · doi:10.2307/2333777 · Cited by 603
Berge, C. (1957) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.43.9.842 · Cited by 577
Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
Hoffman, A. J. (1960) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/010/0114759 · Cited by 192
An algorithm for a minimum cover of a graph
Norman, R. Z., & Rabin, M. O. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0106853-5 · Cited by 115
Covers and packings in a family of sets
Edmonds, J. (1962) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1962-10791-5 · Cited by 101
Self-citation
Research works printed but not linked: 3
- Ford, 1962, Flows in networks
- Witzgall, 1965, Modification of Edmonds﹜ algorithm for maximum matching of graphs, 69B
- Edmonds, 1965, J. Res. Natl. Bureau Standards, 69B
Cited by
Sorted by citations
Items 501–600 of 1,001
Kidney exchange: An egalitarian mechanism
Yılmaz, Ö. (2011) · Journal of Economic Theory · doi:10.1016/j.jet.2010.10.018 · Cited by 31
Colouring, stable sets and perfect graphs
Toft, B. (1996) · The MIT Press eBooks · Cited by 31
Hardness of optimal spaced seed design
Nicolas, F., & Rivals, É. (2007) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.10.001 · Cited by 31
On the linear k-arboricity of cubic graphs
Jackson, B., & Wormald, N. (1996) · Discrete Mathematics · doi:10.1016/0012-365x(95)00293-6 · Cited by 31
Rank of maximum matchings in a graph
Naddef, D. (1982) · Mathematical Programming · doi:10.1007/bf01581025 · Cited by 31
Polynomial algorithms for estimating network reliability
Zemel, E. (1982) · Networks · doi:10.1002/net.3230120408 · Cited by 31
The difference between the metric dimension and the determining number of a graph
Garijo, D., González, A., & Márquez, A. (2014) · Applied Mathematics and Computation · doi:10.1016/j.amc.2014.10.034 · Cited by 30
Combinatorial algorithms for matchings, even factors and square-free 2-factors
Pap, G. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0053-9 · Cited by 30
On the Chvátal–Gomory closure of a compact convex set
Dadush, D., Dey, S. S., & Vielma, J. P. (2013) · Mathematical Programming · doi:10.1007/s10107-013-0649-9 · Cited by 30
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
Azar, Y., Chiplunkar, A., & Kaplan, H. Y. (2017) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974782.67 · Cited by 30
Optimum matching forests I: Special weights
Giles, R. (1982) · Mathematical Programming · doi:10.1007/bf01581022 · Cited by 28
Solving the linear matroid parity problem as a sequence of matroid intersection problems
Orlin, J. B., & Vate, J. H. V. (1990) · Mathematical Programming · doi:10.1007/bf01580854 · Cited by 30
The Stable Roommates Problem with Globally-Ranked Pairs
Abraham, D. J., Levavi, A., Manlove, D. F., & O’Malley, G. (2007) · Springer eBooks · doi:10.1007/978-3-540-77105-0_48 · Cited by 30
Approximative Algorithms for Discrete Optimization Problems
Körte, B. (1979) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70820-3 · Cited by 30
Kidney Paired Donation With Compatible Pairs
Roth, A. E., Sönmez, T., & Ünver, M. U. (2008) · American Journal of Transplantation · doi:10.1111/j.1600-6143.2007.02052.x · Cited by 30
Combinatorial optimization with 2-joins
Trotignon, N., & Vušković, K. (2011) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2011.06.002 · Cited by 29
Lower and upper bounds for the m-peripatetic vehicle routing problem
Ngueveu, S. U., Prins, C., & Calvo, R. W. (2010) · 4OR · doi:10.1007/s10288-010-0148-2 · Cited by 29
The Time Complexity of the Token Swapping Problem and Its Parallel Variants
Kawahara, J. I., Saitoh, T., & Yoshinaka, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-53925-6_35 · Cited by 27
Two-Stage Stochastic Matching and Pricing with Applications to Ride Hailing
Feng, Y., Niazadeh, R., & Saberi, A. (2023) · Operations Research · doi:10.1287/opre.2022.2398 · Cited by 29
Efficient color code decoders in d ≥ 2 dimensions from toric code decoders
Kubica, A., & Delfosse, N. (2023) · Quantum · doi:10.22331/q-2023-02-21-929 · Cited by 50
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
Koufogiannakis, C., & Young, N. E. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04355-0_23 · Cited by 29
Stochastic Matching with Commitment
Costello, K., Tetali, P., & Tripathi, P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31594-7_69 · Cited by 29
Integer and Fractional Matchings
Balas, E. (1981) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)73453-4 · Cited by 29
An Exact Fast Algorithm for Minimum Hitting Set
Shi, L., & Cai, X. (2010) · International Joint Conference on Computational Sciences and Optimization (CSO) · doi:10.1109/cso.2010.240 · Cited by 29
A min-max relation for stable sets in graphs with no odd-K4
Gerards, A. M. H. (1989) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(89)90032-4 · Cited by 29
Transparent Proofs and Limits to Approximation
Babai, L. (1994) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9110-3_2 · Cited by 29
Welsh, D. J. A. (1983) · Discrete Applied Mathematics · doi:10.1016/0166-218x(83)90023-9 · Cited by 29
Morales, N., Toledo, J. T., Acosta, L., & Medina, J. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2616718 · Cited by 28
Transformation of Differential Algebraic Array Equations to Index One Form
Otter, M., & Elmqvist, H. (2017) · Linköping electronic conference proceedings · doi:10.3384/ecp17132565 · Cited by 28
Fault-Tolerant Qubit from a Constant Number of Components
Wan, K., Choi, S., Kim, I. H., Shutty, N., & Hayden, P. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040345 · Cited by 28
Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server
Li, M., Wang, J., Zheng, L., Wu, H., Cheng, P., Chen, L., & Lin, X. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482288 · Cited by 28
Dalmau, V., & Ford, D. K. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45138-9_30 · Cited by 28
The labeled maximum matching problem
Carrabs, F., Cerulli, R., & Gentili, M. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2008.05.012 · Cited by 28
COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY
Karpiński, M., Ruciński, A., & Szymańska, E. (2010) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054110007635 · Cited by 28
The general maximum matching algorithm of micali and vazirani
Peterson, P. A., & Loui, M. C. (1988) · Algorithmica · doi:10.1007/bf01762129 · Cited by 28
Equitable Bipartitions of Graphs and Related Results
Cardoso, D. M., & Rama, P. (2004) · Journal of Mathematical Sciences · doi:10.1023/b:joth.0000013552.96026.87 · Cited by 28
Solving problems on recursively constructed graphs
Borie, R. B., Parker, R., & Tovey, C. A. (2009) · ACM Computing Surveys · doi:10.1145/1456650.1456654 · Cited by 28
Chapter V Polyhedral combinatorics
Pulleyblank, W. R. (1989) · Handbooks in operations research and management science · doi:10.1016/s0927-0507(89)01006-6 · Cited by 29
Erratum “Optimal Sequencing of Two Equivalent Processors”
Fujii, M., Kasami, T., & Ninomiya, K. (1971) · SIAM Journal on Applied Mathematics · doi:10.1137/0120018 · Cited by 28
Noise Thresholds for the [[4, 2, 2]]-concatenated Toric Code
Criger, B., & Terhal, B. M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.15-16 · Cited by 28
Continental-scale assessment of micro-pumped hydro energy storage using agricultural reservoirs
Gilmore, N., Britz, T., Maartensson, E., Orbegoso-Jordan, C., Schroder, S., & Malerba, M. E. (2023) · Applied Energy · doi:10.1016/j.apenergy.2023.121715 · Cited by 29
The world of hereditary graph classes viewed through Truemper configurations
Vušković, K. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139506748.008 · Cited by 27
Busch, A. H., Ferrara, M. J., Hartke, S. G., Jacobson, M. S., Kaul, H., & West, D. B. (2011) · Journal of Graph Theory · doi:10.1002/jgt.20598 · Cited by 27
Planar Graph Perfect Matching Is in NC
Anari, N., & Vazirani, V. V. (2018) · Journal of the ACM · doi:10.1109/focs.2018.00068 · Cited by 31
Elgabry, M., Nesbeth, D., & Johnson, S. D. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.571672 · Cited by 29
Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach
Swamy, R., King, D. M., & Jacobson, S. H. (2022) · Operations Research · doi:10.1287/opre.2022.2311 · Cited by 27
On generalized matching problems
Hell, P., & Kirkpatrick, D. G. (1981) · Information Processing Letters · doi:10.1016/0020-0190(81)90073-9 · Cited by 27
Novel Spare TSV Deployment for 3-D ICs Considering Yield and Timing Constraints
Chen, Y., Wen, W.-Y., Shi, Y., Hon, W.-K., & Chang, S.-C. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2385759 · Cited by 27
Polynomial-time perfect matchings in dense hypergraphs
Keevash, P., Knox, F., & Mycroft, R. (2014) · Advances in Mathematics · doi:10.1016/j.aim.2014.10.009 · Cited by 27
Linear hypergraphs with large transversal number and maximum degree two
Dorfling, M. J., & Henning, M. A. (2013) · European Journal of Combinatorics · doi:10.1016/j.ejc.2013.07.016 · Cited by 27
Maximizing Expectation on Vertex-Disjoint Cycle Packing
Pedroso, J. P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09129-7_3 · Cited by 27
Genome aliquoting with double cut and join
Warren, R. B., & Sankoff, D. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-s1-s2 · Cited by 27
Induced Matchings in Subcubic Graphs
Joos, F., Rautenbach, D., & Sasse, T. (2014) · SIAM Journal on Discrete Mathematics · doi:10.1137/130944424 · Cited by 27
The Matching Problem in General Graphs Is in Quasi-NC
Svensson, O., & Tarnawski, J. (2017) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2017.70 · Cited by 27
The complexity of linear programming
Rinnooy-Kan, A. H. G., & Telgen, J. (1981) · Statistica Neerlandica · doi:10.1111/j.1467-9574.1981.tb00717.x · Cited by 27
Augmenting graphs for independent sets
Alekseev, V. E., & Lozin, V. (2004) · Discrete Applied Mathematics · doi:10.1016/j.dam.2003.09.003 · Cited by 27
On matroids induced by packing subgraphs
Loebl, M., & Poljak, S. (1988) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(88)90042-1 · Cited by 27
Lineare Charakterisierungen von Travelling Salesman Problemen
Grötschel, M., & Padberg, M. W. (1977) · Mathematical Methods of Operations Research · doi:10.1007/bf01918456 · Cited by 27
The ground state of the +or-J spin glass from a heuristic matching algorithm
Freund, H., & Grassberger, P. (1989) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/22/18/036 · Cited by 27
Methods for Inferring Block-Wise Ancestral History from Haploid Sequences
Schwartz, R. S., Clark, A. G., & Istrail, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45784-4_4 · Cited by 26
Complexity-theoretic algebra II: Boolean algebras
Nerode, A., & Remmel, J. B. (1989) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(89)90047-x · Cited by 27
Two complexity results for the vertex coloring problem
Malyshev, D. S., & Lobanova, O. O. (2016) · Discrete Applied Mathematics · doi:10.1016/j.dam.2016.10.025 · Cited by 26
SplitCast: Optimizing Multicast Flows in Reconfigurable Datacenter Networks
Luo, L., Foerster, K.-T., Schmid, S., & Yu, H. (2020) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom41043.2020.9155246 · Cited by 26
Using subsidies to stabilize peer-to-peer ridesharing markets with role assignment
Tafreshian, A., & Masoud, N. (2020) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2020.102770 · Cited by 26
Algebra and Discrete Mathematics
Bronshtein, I. N., Semendyayev, K. A., Musiol, G., & Muehlig, H. (2004) · Springer eBooks · doi:10.1007/978-3-662-05382-9_5 · Cited by 26
Spencer, T. H., & Mayr, E. W. (1984) · Lecture notes in computer science · doi:10.1007/3-540-13345-3_42 · Cited by 26
On paths avoiding forbidden pairs of vertices in a graph
Yinnone, H. (1997) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(96)00017-0 · Cited by 26
Saturation number of fullerene graphs
Došlić, T. (2006) · Journal of Mathematical Chemistry · doi:10.1007/s10910-006-9217-3 · Cited by 26
Logical error rate scaling of the toric code
Watson, F. H. E., & Barrett, S. D. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/9/093045 · Cited by 26
Natalie 2.0: Sparse Global Network Alignment as a Special Case of Quadratic Assignment
El-Kebir, M., Heringa, J., & Klau, G. W. (2015) · Algorithms · doi:10.3390/a8041035 · Cited by 29
Cheng, X., Chen, X., & Mallat, S. (2016) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iaw007 · Cited by 26
Small maximal matchings in random graphs
Zito, M. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00653-9 · Cited by 26
Randomized Online Matching in Regular Graphs
Cohen, I. R., & Wajc, D. (2018) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975031.62 · Cited by 26
Computational complexity of the semantics of some natural language constructions
Mostowski, M., & Wojtyniak, D. (2004) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2003.11.016 · Cited by 26
Klee, V. L., & den Driessche, P. V. (1977) · Numerische Mathematik · doi:10.1007/bf01389968 · Cited by 26
A 1‐matching blossom‐type algorithm for edge covering problems
Murty, K. G., & Perin, C. (1982) · Networks · doi:10.1002/net.3230120403 · Cited by 26
An Integer Polytope Related to the Design of Survivable Communication Networks
Boyd, S. C., & Hao, T. (1993) · SIAM Journal on Discrete Mathematics · doi:10.1137/0406047 · Cited by 26
Neural ensemble decoding for topological quantum error-correcting codes
Sheth, M., Jafarzadeh, S. Z., & Gheorghiu, V. (2020) · Physical Review A · doi:10.1103/physreva.101.032338 · Cited by 28
Computational Complexity Theory and the Philosophy of Mathematics†
Dean, W. (2019) · Philosophia Mathematica · doi:10.1093/philmat/nkz021 · Cited by 29
Improved instance generation for kidney exchange programmes
Delorme, M., García, S., Gondzio, J., Kalcsics, J., Manlove, D. F., Pettersson, W., & Trimble, J. (2022) · Computers & Operations Research · doi:10.1016/j.cor.2022.105707 · Cited by 25
Performance of surface codes in realistic quantum hardware
iOlius, A. D., Martínez, J. E., Fuentes, P., Crespo, P. M., & Garcia‐Frias, J. (2022) · Physical Review A · doi:10.1103/physreva.106.062428 · Cited by 27
Circuit-level protocol and analysis for twist-based lattice surgery
Chamberland, C., & Campbell, E. T. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023090 · Cited by 25
QULATIS: A Quantum Error Correction Methodology toward Lattice Surgery
Ueno, Y., Kondo, M., Tanaka, M., Suzuki, Y., & Tabuchi, Y. (2022) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00028 · Cited by 26
Conservation Laws and Quantum Error Correction: Toward a Generalized Matching Decoder
Brown, B. J. (2022) · IEEE BITS the Information Theory Magazine · doi:10.1109/mbits.2023.3246025 · Cited by 36
Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems
Plank, J. S., Schuman, C. D., & Robison, B. (2012) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2012.6263937 · Cited by 25
A random graph model of kidney exchanges
Toulis, P., & Parkes, D. C. (2011) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/1993574.1993626 · Cited by 25
The complexity of perfect matchings and packings in dense hypergraphs
Han, J., & Treglown, A. (2019) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2019.06.004 · Cited by 25
A probabilistic analysis of some greedy cardinality matching algorithms
Tinhofer, G. (1984) · Annals of Operations Research · doi:10.1007/bf01874391 · Cited by 25
A short proof of the Berge–Tutte Formula and the Gallai–Edmonds Structure Theorem
West, D. B. (2011) · European Journal of Combinatorics · doi:10.1016/j.ejc.2011.01.009 · Cited by 25
Graph theoretic relaxations of set covering and set partitioning problems
El‐Darzi, E., & Mitra, G. (1995) · European Journal of Operational Research · doi:10.1016/0377-2217(94)00115-s · Cited by 25
Toughness and matching extension in graphs
Plummer, M. D. (1988) · Discrete Mathematics · doi:10.1016/0012-365x(88)90221-x · Cited by 25
SRN: an extended Petri-net-based workflow model for Web service composition
Tang, Y. J., Chen, L., He, K., & Jing, N. (2004) · IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws.2004.1314786 · Cited by 25
A Defect-Tolerant Memory Architecture for Molecular Electronics
Lee, M. H., Kim, Y. K., & Choi, Y.-H. (2004) · IEEE Transactions on Nanotechnology · doi:10.1109/tnano.2004.824011 · Cited by 25
Data-driven decoding of quantum error correcting codes using graph neural networks
Lange, M., Havström, P., Srivastava, B., Bengtsson, I., Bergentall, V., Hammar, K., Heuts, O., van Nieuwenburg, E., & Granath, M. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023181 · Cited by 45
Even factors, jump systems, and discrete convexity
Kobayashi, Y., & Takazawa, K. (2008) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2008.05.001 · Cited by 24
Matroid Matching: The Power of Local Search
Lee, J., Sviridenko, M. I., & Vondrák, J. (2013) · SIAM Journal on Computing · doi:10.1137/11083232x · Cited by 24
Real-time scheduling to minimize machine busy times
Khandekar, R., Schieber, B., Shachnai, H., & Tamir, T. (2014) · Journal of Scheduling · doi:10.1007/s10951-014-0411-z · Cited by 24
Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
Martello, S. (2009) · Central European Journal of Operations Research · doi:10.1007/s10100-009-0125-z · Cited by 24
The Chvátal-Gomory Closure of a Strictly Convex Body
Dadush, D., Dey, S. S., & Vielma, J. P. (2011) · Mathematics of Operations Research · doi:10.1287/moor.1110.0488 · Cited by 24
A degree sequence Hajnal–Szemerédi theorem
Treglown, A. (2016) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2016.01.007 · Cited by 24
Metadata
- Authors
- Edmonds, J.
- Affiliations
- National Institute of Standards and Technology (US)
- Corresponding author
- Edmonds, Jack
- ORCID
- Edmonds, Jack
- Venue
- Canadian Journal of Mathematics
- Publisher
- Canadian Mathematical Society
- Published
- 1965
- Volume
- 17
- Pages
- 449-467
- ISSN
- 0008-414X (ISSN-L)
- 1496-4279
- OpenAlex
- W4233756358
- Cited by
- 2,428
- References
- 6
- Citations by year
- 2026: 80 · 2025: 108 · 2024: 100 · 2023: 110 · 2022: 126 · 2021: 107 · 2020: 134 · 2019: 118 · 2018: 110 · 2017: 91 · 2016: 84 · 2015: 72 · 2014: 83 · 2013: 80 · 2012: 73
- FWCI
- 0.83
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Canadian Journal of Mathematics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- maximum matching, graph theory, matching algorithms, trees, paths, graph algorithms
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
