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
Assembly of long, error-prone reads using repeat graphs
Kolmogorov, M., Yuan, J., Lin, Y., & Pevzner, P. A. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0072-8 · Cited by 5,986
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,799
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,531
Self-citationDowsland, K. A., & Thompson, J. M. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,470
Complexity of Machine Scheduling Problems
Lenstra, J. K., Kan, A. H. G. R., & Brucker, P. (1977) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70743-x · Cited by 2,217
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Matching, Euler tours and the Chinese postman
Edmonds, J., & Johnson, E. L. (1973) · Mathematical Programming · doi:10.1007/bf01580113 · Cited by 978
Self-citationFarrington, N., Porter, G., Radhakrishnan, S., Bazzaz, H. H., Subramanya, V., Fainman, Y., Papen, G. C., & Vahdat, A. M. (2010) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1851182.1851223 · Cited by 918
State preservation by repetitive error detection in a superconducting quantum circuit
Kelly, J., Barends, R., Fowler, A. G., Megrant, A., Jeffrey, E. R., White, T., Sank, D., Mutus, J., Campbell, B., Chen, Y., et al. (2015) · Nature · doi:10.1038/nature14270 · Cited by 933
Routing and scheduling of vehicles and crews
Raff, S. J. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
Micali, S. M., & Vazirani, V. V. (1980) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1980.12 · Cited by 821
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 774
Edmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Self-citationIntegrating Hi-C links with assembly graphs for chromosome-scale assembly
Ghurye, J., Rhie, A., Walenz, B. P., Schmitt, A. D., Selvaraj, S., Pop, M., Phillippy, A. M., & Koren, S. (2019) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1007273 · Cited by 686
Realizing repeated quantum error correction in a distance-three surface code
Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., et al. (2022) · Nature · doi:10.1038/s41586-022-04566-8 · Cited by 686
Vertex packings: Structural properties and algorithms
Nemhauser, G. L., & Trotter, L. E. (1975) · Mathematical Programming · doi:10.1007/bf01580444 · Cited by 663
Wang, G., Andersen, D. G., Kaminsky, M., Papagiannaki, K., Ng, T. S. E., Kozuch, M. A., & Ryan, M. P. (2010) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1851182.1851222 · Cited by 653
Edmonds polytopes and a hierarchy of combinatorial problems
Chvátal, V. (1973) · Discrete Mathematics · doi:10.1016/0012-365x(73)90167-2 · Cited by 624
Building logical qubits in a superconducting quantum computing system
Gambetta, J., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 680
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Optimal scheduling for two-processor systems
Coffman, E. G., & Graham, R. L. (1972) · Acta Informatica · doi:10.1007/bf00288685 · Cited by 616
Matching is as easy as matrix inversion
Mulmuley, K., Vazirani, U. V., & Vazirani, V. V. (1987) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/28395.383347 · Cited by 641
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
“[19, 20, 21].”
A Survey on Optical Interconnects for Data Centers
Kachris, C., & Tomkos, I. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.122111.00069 · Cited by 595
A Catalog of Complexity Classes
Johnson, D. S. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50007-2 · Cited by 575
Fast probabilistic algorithms for hamiltonian circuits and matchings
Dana Angluin, A., & Valiant, L. G. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90045-x · Cited by 569
Roth, A. E., Sönmez, T., & Ünver, M. U. (2005) · Journal of Economic Theory · doi:10.1016/j.jet.2005.04.004 · Cited by 542
Blocking and anti-blocking pairs of polyhedra
Fulkerson, D. R. (1971) · Mathematical Programming · doi:10.1007/bf01584085 · Cited by 540
Approximation Algorithms for the Set Covering and Vertex Cover Problems
Hochbaum, D. S. (1982) · SIAM Journal on Computing · doi:10.1137/0211045 · Cited by 508
Complexity Results for Multiprocessor Scheduling under Resource Constraints
Garey, M. R., & Johnson, D. S. (1975) · SIAM Journal on Computing · doi:10.1137/0204035 · Cited by 494
Efficient algorithms for finding maximum matching in graphs
Galil, Z. (1986) · ACM Computing Surveys · doi:10.1145/6462.6502 · Cited by 461
On maximal independent sets of vertices in claw-free graphs
Minty, G. J. (1980) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(80)90074-x · Cited by 459
Aggregation of Inequalities in Integer Programming
Chvátal, V., & Hammer, P. L. (1977) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70731-3 · Cited by 449
A comparison connection assignment for diagnosis of multiprocessor systems
Malek, M. (1980) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/800053.801906 · Cited by 433
Blossom V: a new implementation of a minimum cost perfect matching algorithm
Kolmogorov, V. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0002-8 · Cited by 435
Gai, Y., Krishnamachari, B., & Jain, R. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2181864 · Cited by 412
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Online Matching and Ad Allocation
Mehta, A. (2013) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000057 · Cited by 419
Efficient Kidney Exchange: Coincidence of Wants in Markets with Compatibility-Based Preferences
Roth, A. E., Sönmez, T., & Ünver, M. U. (2007) · American Economic Review · doi:10.1257/aer.97.3.828 · Cited by 38
Finding a Maximum Cut of a Planar Graph in Polynomial Time
Hadlock, F. (1975) · SIAM Journal on Computing · doi:10.1137/0204019 · Cited by 389
Matching is as easy as matrix inversion
Mulmuley, K., Vazirani, U. V., & Vazirani, V. V. (1987) · COMBINATORICA · doi:10.1007/bf02579206 · Cited by 388
Fusion-based quantum computation
Bartolucci, S., Birchall, P. M., Bombín, H., Cable, H. V., Dawson, C., Gimeno-Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-36493-1 · Cited by 516
Quantum error correction: an introductory guide
Roffe, J. (2019) · Contemporary Physics · doi:10.1080/00107514.2019.1667078 · Cited by 461
Farrington, N., Porter, G., Radhakrishnan, S., Bazzaz, H. H., Subramanya, V., Fainman, Y., Papen, G. C., & Vahdat, A. M. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1851275.1851223 · Cited by 363
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 358
Surface code quantum computing with error rates over 1%
Wang, D. S., Fowler, A. G., & Hollenberg, L. C. L. (2011) · Physical Review A · doi:10.1103/physreva.83.020302 · Cited by 345
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Gabow, H. N. (1976) · Journal of the ACM · doi:10.1145/321941.321942 · Cited by 342
Wang, C., Harrington, J., & Preskill, J. P. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00019-2 · Cited by 330
The status of the P versus NP problem
Fortnow, L. (2009) · Communications of the ACM · doi:10.1145/1562164.1562186 · Cited by 330
Graph construction and b -matching for semi-supervised learning
Jebara, T., Wang, J., & Chang, S. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553432 · Cited by 321
Faster scaling algorithms for general graph matching problems
Gabow, H. N., & Tarjan, R. E. (1991) · Journal of the ACM · doi:10.1145/115234.115366 · Cited by 301
Order batching to minimize total travel time in a parallel-aisle warehouse
Gademann, N., & van de Velde, S. (2004) · IIE Transactions · doi:10.1080/07408170590516917 · Cited by 295
Computational Complexity of Discrete Optimization Problems
Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70821-5 · Cited by 294
Image segmentation with ratio cut
Wang, S., & Siskind, J. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1201819 · Cited by 293
An O (N2.5) algorithm for maximum matching in general graphs
Even, S., & Kariv, O. (1975) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1975.5 · Cited by 287
A comparison of heuristics and relaxations for the capacitated plant location problem
Cornuéjols, G., Sridharan, R., & Thizy, J. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90261-s · Cited by 285
An introduction to matching polynomials
Farrell, E. J. (1979) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(79)90070-4 · Cited by 284
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281
Low-distance surface codes under realistic quantum noise
Tomita, Y., & Svore, K. M. (2014) · Physical Review A · doi:10.1103/physreva.90.062320 · Cited by 314
A Kidney Exchange Clearinghouse in New England
Roth, A. E., Sönmez, T., & Ünver, M. U. (2005) · American Economic Review · doi:10.1257/000282805774669989 · Cited by 279
Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
Sbihi, N. (1980) · Discrete Mathematics · doi:10.1016/0012-365x(90)90287-r · Cited by 273
Maximum Matchings via Gaussian Elimination
Mucha, M., & Sankowski, P. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.40 · Cited by 271
Linear-Time Approximation for Maximum Weight Matching
Duan, R., & Pettie, S. (2014) · Journal of the ACM · doi:10.1145/2529989 · Cited by 306
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
Increasing the Opportunity of Live Kidney Donation by Matching for Two- and Three-Way Exchanges
Saidman, S. L., Roth, A. E., Sönmez, T., Ünver, M. U., & Delmonico, F. L. (2006) · Transplantation · doi:10.1097/01.tp.0000195775.77081.25 · Cited by 262
The Complexity of Finite Functions
Boppana, R. B., & Sipser, M. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50019-9 · Cited by 262
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Panteleev, P., & Kalachev, G. (2021) · Quantum · doi:10.22331/q-2021-11-22-585 · Cited by 257
Quantum error correction : an introductory guide
Roffe, J. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 256
Computing Minimum-Weight Perfect Matchings
Cook, W. J., & Rohe, A. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.2.138 · Cited by 252
Machine Models and Simulations
Boas, P. V. E. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50006-0 · Cited by 248
Fast Decoders for Topological Quantum Codes
Duclos-Cianci, G., & Poulin, D. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.050504 · Cited by 244
Asynchronous secure computation
Ben-Or, M., Canetti, R., & Goldreich, O. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167109 · Cited by 227
Wang, G., Andersen, D. G., Kaminsky, M., Papagiannaki, K., Ng, T. S. E., Kozuch, M. A., & Ryan, M. P. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1851275.1851222 · Cited by 230
Edmonds, J., & Fulkerson, D. R. (1970) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(70)80083-7 · Cited by 229
Self-citationTopological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B., & Cross, A. W. (2020) · Physical Review X · doi:10.1103/physrevx.10.011022 · Cited by 223
Nickerson, N., Li, Y., & Benjamin, S. C. (2013) · Nature Communications · doi:10.1038/ncomms2773 · Cited by 238
Machine learning for quantum matter
Carrasquilla, J. (2020) · Advances in Physics X · doi:10.1080/23746149.2020.1797528 · Cited by 250
Nickerson, N., Fitzsimons, J. F., & Benjamin, S. C. (2014) · Physical Review X · doi:10.1103/physrevx.4.041041 · Cited by 249
Bargaining in a network of buyers and sellers
Bosch, M. C. (2003) · Journal of Economic Theory · doi:10.1016/s0022-0531(03)00110-8 · Cited by 220
Fulkerson, D. R. (1972) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(72)90032-9 · Cited by 214
Towards Practical Classical Processing for the Surface Code
Fowler, A. G., Whiteside, A. C., & Hollenberg, L. C. L. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.180501 · Cited by 203
On the Complexity of General Graph Factor Problems
Kirkpatrick, D. G., & Hell, P. (1983) · SIAM Journal on Computing · doi:10.1137/0212040 · Cited by 206
A Survey of mmWave-Based Human Sensing: Technology, Platforms and Applications
Zhang, J., Xi, R., He, Y., Sun, Y., Guo, X., Wang, W., Na, X., Liu, Y., Shi, Z., & Gu, T. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3298300 · Cited by 220
A survey of heuristics for the weighted matching problem
Avis, D. (1983) · Networks · doi:10.1002/net.3230130404 · Cited by 203
Fifty years of scheduling: a survey of milestones
Potts, C. N., & Strusevich, V. A. (2009) · Journal of the Operational Research Society · doi:10.1057/jors.2009.2 · Cited by 202
Utilizing List Exchange and Nondirected Donation through ‘Chain’ Paired Kidney Donations
Roth, A. E., Sönmez, T., Ünver, M. U., Delmonico, F. L., & Saidman, S. L. (2006) · American Journal of Transplantation · doi:10.1111/j.1600-6143.2006.01515.x · Cited by 202
Yannakakis, M. (1981) · SIAM Journal on Computing · doi:10.1137/0210021 · Cited by 202
Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238
“Here we check a polynomial-time algorithm for solving the minimumweight perfect-matching (MWPM) problem [70, 71] and show that it cannot be used to efficiently determine the ground state of the logical planted instances defined on Chimera with the gadget.”
MethodNeural Decoder for Topological Codes
Torlai, G., & Melko, R. G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.030501 · Cited by 214
Faudree, R. J., Flandrin, E., & Ryjáček, Z. (1997) · Discrete Mathematics · doi:10.1016/s0012-365x(96)00045-3 · Cited by 195
A 4 k 2 kernel for feedback vertex set
Thomassé, S. (2010) · ACM Transactions on Algorithms · doi:10.1145/1721837.1721848 · Cited by 194
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem
Kleywegt, A. J., Nori, V. S., & Savelsbergh, M. W. P. (2004) · Transportation Science · doi:10.1287/trsc.1030.0041 · Cited by 194
A Survey on Online Judge Systems and Their Applications
Wąsik, S., Antczak, M., Badura, J., Laskowski, A., & Sternal, T. (2018) · ACM Computing Surveys · doi:10.1145/3143560 · Cited by 193
The complexity of restricted spanning tree problems
Papadimitriou, C. H., & Yannakakis, M. (1982) · Journal of the ACM · doi:10.1145/322307.322309 · Cited by 193
Ataides, J. P. B., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · RePEc: Research Papers in Economics · Cited by 201
Decoding across the quantum low-density parity-check code landscape
Roffe, J., White, D. R., Burton, S., & Campbell, E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043423 · Cited by 192
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
