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 701–800 of 1,001
A control microarchitecture for fault-tolerant quantum computing
Fu, X., Lao, L., Bertels, K., & Almudéver, C. G. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.06.011 · Cited by 18
Symmetries for a high-level neural decoder on the toric code
Wagner, T., Kampermann, H., & Bruß, D. (2020) · Physical Review A · doi:10.1103/physreva.102.042411 · Cited by 18
García-Soriano, D., & Bonchi, F. (2020) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-020-00675-y · Cited by 18
Baste, J., Bui-Xuan, B.-M., & Roux, A. (2019) · Theoretical Computer Science · doi:10.1016/j.tcs.2019.03.026 · Cited by 18
Hartvigsen, D., Hell, P., & Szabó, J. (2006) · Journal of Graph Theory · doi:10.1002/jgt.20161 · Cited by 18
Direct evaluation of pure graph state entanglement
Hajdušek, M., & Murao, M. (2013) · New Journal of Physics · doi:10.1088/1367-2630/15/1/013039 · Cited by 18
Interior-point methods: An old and new approach to nonlinear programming
Nesterov, Y. E. (1997) · Mathematical Programming · doi:10.1007/bf02614321 · Cited by 18
Independent sets in bounded-degree hypergraphs
Halldórsson, M. M., & Losievskaja, E. (2009) · Discrete Applied Mathematics · doi:10.1016/j.dam.2008.11.013 · Cited by 18
Efficient stabilization of cooperative matching games
Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., & Okamoto, Y. (2017) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.03.020 · Cited by 18
Comparison of exact and approximate methods of solving the uncapacitated plant location problem
Thizy, J., Wassenhove, L. N. V., & Khumawala, B. M. (1985) · Journal of Operations Management · doi:10.1016/0272-6963(85)90032-4 · Cited by 18
An efficient scheduling algorithm for the hot coil making in the steel mini-mill
Park, H.-W., Hong, Y., & Chang, S. Y. (2002) · Production Planning & Control · doi:10.1080/09537280110086749 · Cited by 18
Alternating Whitney sums and matchings in trees, part 1
Jamison, R. E. (1987) · Discrete Mathematics · doi:10.1016/0012-365x(87)90026-4 · Cited by 18
Tutte, W. T. (1967) · Canadian Journal of Mathematics · doi:10.4153/cjm-1967-101-8 · Cited by 18
Heuristically guided search and chromosome matching
Montanari, U. (1970) · Artificial Intelligence · doi:10.1016/0004-3702(70)90009-3 · Cited by 18
Philosophy of Computer Science
Turner, R. J. (2019) · Oxford University Press eBooks · doi:10.1093/obo/9780195396577-0224 · Cited by 19
Quantum resource estimation for large scale quantum algorithms
Gheorghiu, V., & Mosca, M. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.107480 · Cited by 19
Körte, B., & Vygen, J. (2011) · Algorithms and combinatorics · doi:10.1007/978-3-642-24488-9_1 · Cited by 17
Performance enhancement of surface codes via recursive minimum-weight perfect-match decoding
iOlius, A. D., Martínez, J. E., Fuentes, P., & Crespo, P. M. (2023) · Physical Review A · doi:10.1103/physreva.108.022401 · Cited by 17
A Polynomial Kernel for Trivially Perfect Editing
Drange, P. G., & Pilipczuk, M. (2017) · Algorithmica · doi:10.1007/s00453-017-0401-6 · Cited by 17
Finding a maximum matching in a circular-arc graph
Liang, Y. D., & Rhee, C. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90117-r · Cited by 17
Tang, Y., Guo, H., Zhu, Y., Yuan, T., Gao, X., Wang, C., & Wu, J. (2018) · Journal of Lightwave Technology · doi:10.1109/jlt.2018.2883387 · Cited by 17
Round Compression for Parallel Matching Algorithms
Czumaj, A., Łącki, J., Mądry, A., Onak, K., Mitrović, S., & Sankowski, P. (2020) · ReIn UW (University of Warsaw) · doi:10.1137/18m1197655 · Cited by 17
Billé, A. G., & Leorato, S. (2019) · Econometric Reviews · doi:10.1080/07474938.2019.1682314 · Cited by 17
Optimum distance flag codes from spreads via perfect matchings in graphs
Alonso-González, C., Navarro-Pérez, M. Á., & Soler–Escrivà, X. (2021) · Journal of Algebraic Combinatorics · doi:10.1007/s10801-021-01086-y · Cited by 17
Tailored cluster states with high threshold under biased noise
Claes, J., Bourassa, J. E., & Puri, S. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00677-w · Cited by 20
Fault-tolerant holonomic quantum computation in surface codes
Zheng, Y.-C., & Brun, T. A. (2015) · Physical Review A · doi:10.1103/physreva.91.022302 · Cited by 15
Zhao, M., & Yang, Y. (2010) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2010.5506199 · Cited by 17
Heuristics for the mixed swapping problem
Bordenave, C., Michel Gendreau, A., & Gilbert Laporte, A. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2009.03.032 · Cited by 17
Computing the nucleolus of weighted cooperative matching games in polynomial time
Könemann, J., Pashkovich, K., & Toth, J. (2020) · Mathematical Programming · doi:10.1007/s10107-020-01483-4 · Cited by 17
Domination When the Stars Are Out
Hermelin, D., Mnich, M., van Leeuwen, E. J., & Woeginger, G. J. (2019) · ACM Transactions on Algorithms · doi:10.1145/3301445 · Cited by 17
Impact of service quality factors on ride sharing in urban areas
Bilali, A., Dandl, F., Fastenrath, U., & Bogenberger, K. (2019) · International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS) · doi:10.1109/mtits.2019.8883364 · Cited by 17
Hidden Hamiltonian Cycle Recovery via Linear Programming
Bagaria, V., Ding, J., Tse, D. N. C., Wu, Y., & Xu, J. (2020) · Operations Research · doi:10.1287/opre.2019.1886 · Cited by 17
Bayesian Nonparametric Object Association for Semantic SLAM
Zhang, J., Yuan, L., Ran, T., Tao, Q., & He, L. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3073644 · Cited by 17
A Model for Minimizing Active Processor Time
Chang, J., Gabow, H. N., & Khuller, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33090-2_26 · Cited by 17
Optimal Cycles in Graphs and the Minimal Cost-To-Time Ratio Problem
Lawler, E. L. (1972) · Springer eBooks · doi:10.1007/978-3-7091-2652-3_3 · Cited by 17
Disconnected 2-Factors in Planar Cubic Bridgeless Graphs
Diwan, A. A. (2002) · Journal of Combinatorial Theory Series B · doi:10.1006/jctb.2001.2079 · Cited by 17
A combinatorial column generation algorithm for the maximum stable set problem
Bourjolly, J.-M., Gilbert Laporte, A., & Mercure, H. (1997) · Operations Research Letters · doi:10.1016/s0167-6377(96)00038-7 · Cited by 17
Binary group and Chinese postman polyhedra
Gastou, G., & Johnson, E. L. (1986) · Mathematical Programming · doi:10.1007/bf01582160 · Cited by 17
A Survey of Progress in Graph Theory in the Soviet Union
Turner, J., & Kautz, W. H. (1970) · SIAM Review · doi:10.1137/1012125 · Cited by 17
Worst‐case greedy matchings in the unit d‐cube
Snyder, T. L., & Steele, J. M. (1990) · Networks · doi:10.1002/net.3230200607 · Cited by 17
Finite-model theory—a personal perspective
Fagin, R. (1990) · Lecture notes in computer science · doi:10.1007/3-540-53507-1_67 · Cited by 17
Symbolic Execution for Quantum Error Correction Programs
Fang, W. S., & Ying, M. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3656419 · Cited by 26
Concatenation of the Gottesman-Kitaev-Preskill code with the XZZX surface code
Zhang, J., Wu, Y.-C., & Guo, G. (2023) · Physical Review A · doi:10.1103/physreva.107.062408 · Cited by 19
Color code decoder with improved scaling for correcting circuit-level noise
Lee, S.-H., Li, A., & Bartlett, S. D. (2025) · Quantum · doi:10.22331/q-2025-01-27-1609 · Cited by 16
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
Dabrowski, K. K., Lozin, V., Müller, H., & Rautenbach, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19222-7_1 · Cited by 16
Stochastic geometric network models for groups of functional and structural connectomes
Friedman, E. J., Landsberg, A. S., Owen, J. P., Li, Y., & Mukherjee, P. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2014.07.039 · Cited by 16
A simple reduction from maximum weight matching to maximum cardinality matching
Pettie, S. (2012) · Information Processing Letters · doi:10.1016/j.ipl.2012.08.010 · Cited by 16
New findings on the complexity of cluster head selection algorithms
Nguyen, D. Q., Minet, P., Kunz, T., & Lamont, L. (2011) · IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) · doi:10.1109/wowmom.2011.5986490 · Cited by 16
Jaal: Engineering a High Quality All-Quadrilateral Mesh Generator
Verma, C. S., & Tautges, T. (2011) · Springer eBooks · doi:10.1007/978-3-642-24734-7_28 · Cited by 17
Interference constrained network control based on curvature
Wang, C., JONCKHEERE, E. A., & Banirazi, R. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526617 · Cited by 16
Determination of the semion code threshold using neural decoders
Varona, S., & Martin-Delgado, M. A. (2020) · Physical Review A · doi:10.1103/physreva.102.032411 · Cited by 16
Graph-Theoretic Concepts in Computer Science
Hromkovic̆, J., Westfechtel, B., & Nagl, M. (2005) · Lecture notes in computer science · doi:10.1007/b104584 · Cited by 16
Lozin, V., & Milanič, M. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2008.03.008 · Cited by 16
Dominating induced matchings in graphs without a skew star
Korpelainen, N., Lozin, V., & Purcell, C. (2013) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2013.11.002 · Cited by 16
Maximum Cardinality Simple 2-matchings in Subcubic Graphs
Hartvigsen, D., & Li, Y. (2011) · SIAM Journal on Optimization · doi:10.1137/090760416 · Cited by 16
Packing non-returning A-paths algorithmically
Pap, G. (2007) · Discrete Mathematics · doi:10.1016/j.disc.2007.07.073 · Cited by 16
Maximum matching in multi-interface networks
Kosowski, A., Alfredo Navarra, B., Pająk, D., & Pinotti, C. M. (2013) · Theoretical Computer Science · doi:10.1016/j.tcs.2013.01.018 · Cited by 16
Induced Packing of Odd Cycles in a Planar Graph
Golovach, P. A., Kamiński, M., Paulusma, D., & Thilikos, D. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10631-6_53 · Cited by 16
Multipumping Flexible DSP Blocks for Resource Reduction on Xilinx FPGAs
Ronak, B., & Fahmy, S. A. (2016) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2016.2629421 · Cited by 16
On some domination colorings of graphs
Bagan, G., Merouane, H. B., Haddad, M., & Kheddouci, H. (2017) · Discrete Applied Mathematics · doi:10.1016/j.dam.2017.06.013 · Cited by 16
Kidney exchange with immunosuppressants
Heo, E. J., Hong, S., & Chun, Y. (2020) · Economic Theory · doi:10.1007/s00199-020-01276-y · Cited by 16
Fast and Simple Algorithms for Weighted Perfect Matching
Wattenhofer, M., & Wattenhofer, R. P. (2004) · Electronic Notes in Discrete Mathematics · doi:10.1016/j.endm.2004.03.052 · Cited by 16
Huang, S., & Brown, K. R. (2020) · Physical Review A · doi:10.1103/physreva.101.042312 · Cited by 19
Spanning trees of 3-uniform hypergraphs
Goodall, A. J., & de Mier, A. (2011) · Advances in Applied Mathematics · doi:10.1016/j.aam.2011.04.006 · Cited by 16
A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms
Spille, B., & Weismantel, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47867-1_2 · Cited by 16
Maximum Matching and the Rank of a Matrix
Anderson, W. N. (1975) · SIAM Journal on Applied Mathematics · doi:10.1137/0128011 · Cited by 16
Euclidean matching problems and the metropolis algorithm
Weber, M., & Liebling, T. M. (1986) · Mathematical Methods of Operations Research · doi:10.1007/bf01919172 · Cited by 16
Implementing weighted b-matching algorithms
Müller‐Hannemann, M., & Schwartz, A. (1999) · ACM Journal of Experimental Algorithmics · doi:10.1145/347792.347815 · Cited by 16
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Eisenbrand, F., Oriolo, G., Stauffer, G., & Ventura, P. (2005) · Lecture notes in computer science · doi:10.1007/11496915_22 · Cited by 16
High-performance repetition cat code using fast noisy operations
Régent, F.-M. L., Berdou, C., Leghtas, Z., Guillaud, J., & Mirrahimi, M. (2023) · Quantum · doi:10.22331/q-2023-12-06-1198 · Cited by 15
Classical Control of Large-Scale Quantum Computers
Devitt, S. J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08494-7_3 · Cited by 14
Nash-solvable two-person symmetric cycle game forms
Boros, E., Gurvich, V., Makino, K., & Shao, W. P. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.05.011 · Cited by 15
On the Chvátal-Gomory Closure of a Compact Convex Set
Dadush, D., Dey, S. S., & Vielma, J. P. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20807-2_11 · Cited by 15
How (not) to integrate blood subtyping technology to kidney exchange
Sönmez, T., Ünver, M. U., & Yılmaz, Ö. (2018) · Journal of Economic Theory · doi:10.1016/j.jet.2018.03.011 · Cited by 15
Apfelstädt, A., Dashkovskiy, S. N., & Nieberding, B. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.03.004 · Cited by 15
On the Alleged Simplicity of Impure Proof
Arana, A. (2017) · Mathematics, culture, and the arts · doi:10.1007/978-3-319-53385-8_16 · Cited by 15
Ding, L., Feng, Z., & Bai, Y. (2019) · BMC Medical Genomics · doi:10.1186/s12920-019-0562-z · Cited by 15
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
Cooper, M. (2013) · Cited by 15
Quantum error correction with the color-Gottesman-Kitaev-Preskill code
Zhang, J., Zhao, J., Wu, Y.-C., & Guo, G. (2021) · Physical Review A · doi:10.1103/physreva.104.062434 · Cited by 15
Knowledge Transfer in Activity Recognition Using Sensor Profile
Chiang, Y.-T., & Hsu, J. Y.-J. (2012) · Autonomic and Trusted Computing · doi:10.1109/uic-atc.2012.78 · Cited by 15
On the design of fair contact plans in predictable Delay-Tolerant Networks
Fraire, J. A., Madoery, P. G., & Finochietto, J. M. (2013) · IEEE International Conference on Wireless for Space and Extreme Environments (WiSEE) · doi:10.1109/wisee.2013.6737548 · Cited by 15
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
Sanghavi, S. (2007) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2007.4313081 · Cited by 15
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
Müller‐Hannemann, M., & Schwartz, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48518-x_2 · Cited by 15
Line density control in screen-space via balanced line hierarchies
Kanzler, M., Ferstl, F., & Westermann, R. (2016) · Computers & Graphics · doi:10.1016/j.cag.2016.08.001 · Cited by 15
Fabry, R. E., & Pantsar, M. (2019) · Synthese · doi:10.1007/s11229-019-02276-9 · Cited by 15
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Könemann, J., Pashkovich, K., & Toth, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17953-3_31 · Cited by 15
A Weighted Linear Matroid Parity Algorithm
Iwata, S., & Kobayashi, Y. (2021) · SIAM Journal on Computing · doi:10.1137/17m1141709 · Cited by 15
Convex Quadratic Programming Approach to the Maximum Matching Problem
Cardoso, D. M. (2001) · Journal of Global Optimization · doi:10.1023/a:1017969603632 · Cited by 15
Vertex colorings without isolates
Maurer, S. B. (1979) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(79)90020-0 · Cited by 15
Alternating Whitney sums and matchings in trees, part II
Jamison, R. E. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90032-d · Cited by 15
Bond graphs II: Causality and singularity
Lamb, J. D., Woodall, D. R., & Asher, G. M. (1997) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(96)00006-6 · Cited by 15
ALTERNATING CHAIN METHODS: A SURVEY
Berge, C. (1972) · Elsevier eBooks · doi:10.1016/b978-1-4832-3187-7.50006-4 · Cited by 15
The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems
Hoffman, A. J. (1979) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70819-7 · Cited by 15
A partitioning algorithm for minimum weighted Euclidean matching
Dyer, M., & FRIEZE, A. M. (1984) · Information Processing Letters · doi:10.1016/0020-0190(84)90024-3 · Cited by 15
Maximum cardinality matchings on trees by randomized local search
Giel, O., & Wegener, I. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144095 · Cited by 15
Minimum Covers of Fixed Cardinality in Weighted Graphs
White, L. J. (1971) · SIAM Journal on Applied Mathematics · doi:10.1137/0121014 · Cited by 15
A primal dual integer programming algorithm
Llewellyn, D. C., & Ryan, J. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90014-f · Cited by 15
Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
Naddef, D., & Pulleyblank, W. R. (1982) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)72455-1 · Cited by 15
Complexity-Theoretic Algebra: Vector Space Bases
Nerode, A., & Remmel, J. B. (1990) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-3466-1_17 · Cited by 15
Swarm Path Planning for the Deployment of Drones in Emergency Response Missions
Anastasiou, A., Kolios, P., Panayiotou, C. G., & Papadaki, K. P. (2020) · International Conference on Unmanned Aircraft Systems (ICUAS) · doi:10.1109/icuas48674.2020.9213876 · Cited by 14
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
