The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A note on two problems in connexion with graphs
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
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
Loberman, H., & Weinberger, A. (1957) · Journal of the ACM · doi:10.1145/320893.320896 · Cited by 70
Cited by
Items 201–300 of 386
Linear Assignment Problems and Extensions
Burkard, R. E., & Çela, E. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_2 · Cited by 330
Methods to optimise the design and management of biomass-for-bioenergy supply chains: A review
De Meyer, A., Cattrysse, D., Rasinmäki, J., & Van Orshoven, J. (2014) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2013.12.036 · Cited by 329
Delay is Not an Option: Low Latency Routing in Space
Handley, M. (2018) · Proceedings of the 17th ACM Workshop on Hot Topics in Networks · doi:10.1145/3286062.3286075 · Cited by 329
Survey of Robot 3D Path Planning Algorithms
Yang, L., Qi, J., Song, D., Xiao, J., Han, J., & Xia, Y. (2016) · Journal of Control Science and Engineering · doi:10.1155/2016/7426913 · Cited by 328
Gong, G., He, Y., Chen, Z. J., & Evans, A. C. (2012) · NeuroImage · doi:10.1016/j.neuroimage.2011.08.017 · Cited by 328
Highway Hierarchies Hasten Exact Shortest Path Queries
Sanders, P., & Schultes, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11561071_51 · Cited by 327
Finding shortest paths on real road networks: the case for A*
Zeng, W., & Church, R. L. (2009) · International Journal of Geographical Information Science · doi:10.1080/13658810801949850 · Cited by 327
An algorithm for the resource constrained shortest path problem
Beasley, J. E., & Christofides, N. (1989) · Networks · doi:10.1002/net.3230190402 · Cited by 327
Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions
Noreen, I., Khan, A., & Habib, Z. (2016) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2016.071114 · Cited by 326
Hassouna, M. S., & Farag, A. A. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1154 · Cited by 323
Exact Routing in Large Road Networks Using Contraction Hierarchies
Geisberger, R., Sanders, P., Schultes, D., & Vetter, C. (2012) · Transportation Science · doi:10.1287/trsc.1110.0401 · Cited by 323
A survey of recent developments in multiobjective optimization
Chinchuluun, A., & Pardalos, P. M. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0186-0 · Cited by 323
Review of Autonomous Path Planning Algorithms for Mobile Robots
Qin, H., Shao, S., Wang, T., Yu, X., Jiang, Y., & Cao, Z. (2023) · Drones · doi:10.3390/drones7030211 · Cited by 322
Distributed algorithms for transmission power control in wireless sensor networks
Kubisch, M., Karl, H., Wolisz, A., Zhong, L. C., & Rabaey, J. (2004) · 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003. · doi:10.1109/wcnc.2003.1200410 · Cited by 321
Path Smoothing Techniques in Robot Navigation: State-of-the-Art, Current and Future Challenges
Ravankar, A., Ravankar, A. A., Kobayashi, Y., Hoshino, Y., & Peng, C.-C. (2018) · Sensors · doi:10.3390/s18093170 · Cited by 314
Exogenous Cost Allocation in Peer-to-Peer Electricity Markets
Baroche, T., Pinson, P., Latimier, R. L. G., & Ahmed, H. B. (2019) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2019.2896654 · Cited by 314
An Atlas framework for scalable mapping
Bosse, M., Newman, P., Leonard, J., Soika, M., Feiten, W., & Teller, S. (2003) · 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422) · doi:10.1109/robot.2003.1241872 · Cited by 313
Xu, Y., Quan, R., Xu, W., Huang, Y., Chen, X., & Liu, F. (2024) · Bioengineering · doi:10.3390/bioengineering11101034 · Cited by 310
Similarity-Based Extraction of Individual Networks from Gray Matter MRI Scans
Tijms, B. M., Series, P., Willshaw, D. J., & Lawrie, S. M. (2012) · Cerebral Cortex · doi:10.1093/cercor/bhr221 · Cited by 309
Δ-stepping: a parallelizable shortest path algorithm
Meyer, U., & Sanders, P. (2003) · Journal of Algorithms · doi:10.1016/s0196-6774(03)00076-2 · Cited by 309
Shortest‐path algorithms: Taxonomy and annotation
Deo, N., & Pang, C. (1984) · Networks · doi:10.1002/net.3230140208 · Cited by 309
Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
Sethian, J. A., & Vladimirsky, A. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.090060097 · Cited by 307
Kim, V. G., Lipman, Y., & Funkhouser, T. (2011) · ACM SIGGRAPH 2011 papers · doi:10.1145/1964921.1964974 · Cited by 307
Bosse, M., Newman, P., Leonard, J., & Teller, S. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904049393 · Cited by 305
Linear-space best-first search
Korf, R. E. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90045-d · Cited by 305
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
Topological patterns in street networks of self-organized urban settlements
Buhl, C., Gautrais, J., Reeves, N., Solé, R. V., Valverde, S., Kuntz, P., & Theraulaz, G. (2006) · The European Physical Journal B - Condensed Matter and Complex Systems · doi:10.1140/epjb/e2006-00085-1 · Cited by 300
Constructing the visibility graph for n-line segments in O(n2) time
Welzl, E. (1985) · Information Processing Letters · doi:10.1016/0020-0190(85)90044-4 · Cited by 298
Distance spectra of graphs: A survey
Aouchiche, M., & Hansen, P. (2014) · Linear Algebra and its Applications · doi:10.1016/j.laa.2014.06.010 · Cited by 297
An optimal minimum spanning tree algorithm
Pettie, S., & Ramachandran, V. (2002) · Journal of the ACM · doi:10.1145/505241.505243 · Cited by 296
Crawling Ajax-Based Web Applications through Dynamic Analysis of User Interface State Changes
Mesbah, A., van Deursen, A., & Lenselink, S. (2012) · ACM Transactions on the Web · doi:10.1145/2109205.2109208 · Cited by 296
The weighted region problem: finding shortest paths through a weighted planar subdivision
Mitchell, J. S. B., & Papadimitriou, C. H. (1991) · Journal of the ACM · doi:10.1145/102782.102784 · Cited by 295
McCune, R. R., Weninger, T., & Madey, G. (2015) · ACM Computing Surveys · doi:10.1145/2818185 · Cited by 294
Learning, planning, and control for quadruped locomotion over challenging terrain
Kalakrishnan, M., Buchli, J., Pastor, P., Mistry, M., & Schaal, S. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364910388677 · Cited by 294
Fast shortest path distance estimation in large networks
Potamias, M., Bonchi, F., Castillo, C., & Gionis, A. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646063 · Cited by 291
Energy consumption estimation integrated into the Electric Vehicle Routing Problem
Basso, R., Kulcsár, B., Egardt, B., Lindroth, P., & Sanchez-Diaz, I. (2019) · Transportation Research Part D: Transport and Environment · doi:10.1016/j.trd.2019.01.006 · Cited by 290
The shortest-path problem for graphs with random arc-lengths
Frieze, A. M., & Grimmett, G. R. (1985) · Discrete Applied Mathematics · doi:10.1016/0166-218x(85)90059-9 · Cited by 290
Achieving sub-second IGP convergence in large IP networks
Francois, P., Filsfils, C., Evans, J., & Bonaventure, O. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1070873.1070877 · Cited by 288
Global emission hotspots of coal power generation
Oberschelp, C., Pfister, S., Raptis, C. E., & Hellweg, S. (2019) · Nature Sustainability · doi:10.1038/s41893-019-0221-6 · Cited by 288
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
Horton, J. D. (1987) · SIAM Journal on Computing · doi:10.1137/0216026 · Cited by 288
Information processing in complex networks: Graph entropy and information functionals
Dehmer, M. (2008) · Applied Mathematics and Computation · doi:10.1016/j.amc.2007.12.010 · Cited by 286
A new implementation of Yen?s ranking loopless paths algorithm
Martins, E. V., & Pascoal, M. B. (2003) · Quarterly Journal of the Belgian, French and Italian Operations Research Societies · doi:10.1007/s10288-002-0010-2 · Cited by 283
Howard, A., Parker, L. E., & Sukhatme, G. S. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906065378 · Cited by 281
On the importance of cascading moisture recycling in South America
Zemp, D. C., Schleussner, C.-F., Barbosa, H. M. J., van der Ent, R. J., Donges, J. F., Heinke, J., Sampaio, G., & Rammig, A. (2014) · Atmospheric Chemistry and Physics · doi:10.5194/acp-14-13337-2014 · Cited by 281
Guo, Z., & Wilson, N. H. M. (2011) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2010.11.002 · Cited by 281
Edge-based compartmental modelling for infectious disease spread
Miller, J. C., Slim, A. C., & Volz, E. M. (2012) · Journal of The Royal Society Interface · doi:10.1098/rsif.2011.0403 · Cited by 278
MIMOC: A global monthly isopycnal upper‐ocean climatology with mixed layers
Schmidtko, S., Johnson, G. C., & Lyman, J. M. (2013) · Journal of Geophysical Research: Oceans · doi:10.1002/jgrc.20122 · Cited by 277
Metzner, R., Eggert, A., van Dusschoten, D., Pflugfelder, D., Gerth, S., Schurr, U., Uhlmann, N., & Jahnke, S. (2015) · Plant Methods · doi:10.1186/s13007-015-0060-z · Cited by 276
Wang, Z., Scaglione, A., & Thomas, R. J. (2010) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2010.2044814 · Cited by 276
Reasoning about qualitative temporal information
van Beek, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90011-l · Cited by 276
Ant-like agents for load balancing in telecommunications networks
Schoonderwoerd, R., Holland, O., & Bruten, J. (1997) · Proceedings of the first international conference on Autonomous agents - AGENTS '97 · doi:10.1145/267658.267718 · Cited by 275
Some Simple Applications of the Travelling Salesman Problem
Lenstra, J. K., & Kan, A. H. G. R. (1975) · Journal of the Operational Research Society · doi:10.1057/jors.1975.151 · Cited by 270
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
Erdelić, T., & Carić, T. (2019) · Journal of Advanced Transportation · doi:10.1155/2019/5075671 · Cited by 270
UAV Path Planning Using Optimization Approaches: A Survey
Ait Saadi, A., Soukane, A., Meraihi, Y., Benmessaoud Gabis, A., Mirjalili, S., & Ramdane-Cherif, A. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09742-7 · Cited by 269
Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review
Verma, S., Boonsanong, V., Hoang, M., Hines, K. E., Dickerson, J. P., & Shah, C. (2020) · arXiv · doi:10.48550/arxiv.2010.10596 · Cited by 267
Fast map matching, an algorithm integrating hidden Markov model with precomputation
Yang, C., & Gidófalvi, G. (2018) · International Journal of Geographical Information Science · doi:10.1080/13658816.2017.1400548 · Cited by 267
Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
Pallottino, S., & Scutellà, M. G. (1998) · Equilibrium and Advanced Transportation Modelling · doi:10.1007/978-1-4615-5757-9_11 · Cited by 267
RootNav: Navigating Images of Complex Root Architectures
Pound, M. P., French, A. P., Atkinson, J. A., Wells, D. M., Bennett, M. J., & Pridmore, T. (2013) · Plant Physiology · doi:10.1104/pp.113.221531 · Cited by 266
Goldenholz, D. M., Ahlfors, S. P., Hämäläinen, M. S., Sharon, D., Ishitobi, M., Vaina, L. M., & Stufflebeam, S. M. (2009) · Human Brain Mapping · doi:10.1002/hbm.20571 · Cited by 266
Linear-Time Approximation for Maximum Weight Matching
Duan, R., & Pettie, S. (2014) · Journal of the ACM · doi:10.1145/2529989 · Cited by 265
Lanelets: Efficient map representation for autonomous driving
Bender, P., Ziegler, J., & Stiller, C. (2014) · 2014 IEEE Intelligent Vehicles Symposium Proceedings · doi:10.1109/ivs.2014.6856487 · Cited by 263
A generalization of Dijkstra's algorithm
Knuth, D. E. (1977) · Information Processing Letters · doi:10.1016/0020-0190(77)90002-3 · Cited by 263
Connectopic mapping with resting-state fMRI
Haak, K. V., Marquand, A. F., & Beckmann, C. F. (2018) · NeuroImage · doi:10.1016/j.neuroimage.2017.06.075 · Cited by 261
Controlling Allosteric Networks in Proteins
Dokholyan, N. V. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00544 · Cited by 260
Path-Planning for Unmanned Aerial Vehicles with Environment Complexity Considerations: A Survey
Jones, M., Djahel, S., & Welsh, K. (2023) · ACM Computing Surveys · doi:10.1145/3570723 · Cited by 258
An application of heuristic search methods to edge and contour detection
Martelli, A. (1976) · Communications of the ACM · doi:10.1145/359997.360004 · Cited by 258
Segmenting tree crowns from terrestrial and mobile LiDAR data by exploring ecological theories
Tao, S., Wu, F., Guo, Q., Wang, Y., Li, W., Xue, B., Hu, X., Li, P., Tian, D., Li, C., et al. (2015) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2015.10.007 · Cited by 257
A survey on path planning for persistent autonomy of autonomous underwater vehicles
Zeng, Z., Lian, L., Sammut, K., He, F., Tang, Y., & Lammas, A. (2015) · Ocean Engineering · doi:10.1016/j.oceaneng.2015.10.007 · Cited by 256
Pedestrian environment and route choice: evidence from New York City and Hong Kong
Guo, Z., & Loo, B. P. Y. (2013) · Journal of Transport Geography · doi:10.1016/j.jtrangeo.2012.11.013 · Cited by 256
Juliá, M., Gil, A., & Reinoso, O. (2012) · Autonomous Robots · doi:10.1007/s10514-012-9298-8 · Cited by 256
COMMIT: Convex Optimization Modeling for Microstructure Informed Tractography
Daducci, A., Dal Palu, A., Lemkaddem, A., & Thiran, J.-P. (2015) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2014.2352414 · Cited by 255
A review of motion planning algorithms for intelligent robots
Zhou, C., Huang, B., & Fränti, P. (2022) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-021-01867-z · Cited by 255
Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review
Verma, S., Boonsanong, V., Hoang, M., Hines, K., Dickerson, J., & Shah, C. (2024) · ACM Computing Surveys · doi:10.1145/3677119 · Cited by 255
Finding approximate POMDP solutions through belief compression
Roy, N., Gordon, G., & Thrun, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1496 · Cited by 254
Anytime search in dynamic graphs
Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2007.11.009 · Cited by 254
CLARK, R. T., FAMOSO, A. N., ZHAO, K., SHAFF, J. E., CRAFT, E. J., BUSTAMANTE, C. D., MCCOUCH, S. R., ANESHANSLEY, D. J., & KOCHIAN, L. V. (2013) · Plant, Cell & Environment · doi:10.1111/j.1365-3040.2012.02587.x · Cited by 254
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
Abraham, I., Delling, D., Goldberg, A. V., & Werneck, R. F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20662-7_20 · Cited by 254
Semiring Frameworks and Algorithms for Shortest-Distance Problems
Mohri, M. (2002) · doi:10.25596/jalc-2002-321 · Cited by 254
A review of urban computing for mobile phone traces: current methods, challenges and opportunities
Jiang, S., Fiore, G. A., Yang, Y., Ferreira, J., Frazzoli, E., & González, M. C. (2013) · Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing · doi:10.1145/2505821.2505828 · Cited by 254
Seeber, M., Felline, A., Raimondi, F., Muff, S., Friedman, R., Rao, F., Caflisch, A., & Fanelli, F. (2011) · Journal of Computational Chemistry · doi:10.1002/jcc.21688 · Cited by 254
Motion planning and control for mobile robot navigation using machine learning: a survey
Xiao, X., Liu, B., Warnell, G., & Stone, P. (2022) · Autonomous Robots · doi:10.1007/s10514-022-10039-8 · Cited by 254
A Unified Approach to Path Problems
Tarjan, R. E. (1981) · Journal of the ACM · doi:10.1145/322261.322272 · Cited by 253
Guo, F., Yang, J., & Lu, J. (2018) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2018.03.014 · Cited by 253
Quantification of network structural dissimilarities
Schieber, T. A., Carpi, L., Díaz-Guilera, A., Pardalos, P. M., Masoller, C., & Ravetti, M. G. (2017) · Nature Communications · doi:10.1038/ncomms13928 · Cited by 237
Dual targeting of p53 and c-MYC selectively eliminates leukaemic stem cells
Abraham, S. A., Hopcroft, L. E. M., Carrick, E., Drotar, M. E., Dunn, K., Williamson, A. J. K., Korfi, K., Baquero, P., Park, L. E., Scott, M. T., et al. (2016) · Nature · doi:10.1038/nature18288 · Cited by 225
Will There Be Blood? Incentives and Displacement Effects in Pro-Social Behavior
Lacetera, N., Macis, M., & Slonim, R. (2012) · American Economic Journal: Economic Policy · doi:10.1257/pol.4.1.186 · Cited by 222
Planning and navigation as active inference
Kaplan, R., & Friston, K. J. (2018) · Biological Cybernetics · doi:10.1007/s00422-018-0753-2 · Cited by 203
A Nondegenerate Code of Deleterious Variants in Mendelian Loci Contributes to Complex Disease Risk
Blair, D. R., Lyttle, C. S., Mortensen, J. M., Bearden, C. F., Jensen, A. B., Khiabanian, H., Melamed, R., Rabadan, R., Bernstam, E. V., Brunak, S., et al. (2013) · Cell · doi:10.1016/j.cell.2013.08.030 · Cited by 215
Go-Explore: a New Approach for Hard-Exploration Problems
Ecoffet, A., Huizinga, J., Lehman, J., Stanley, K. O., & Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1901.10995 · Cited by 205
Mapping allosteric communications within individual proteins
Wang, J., Jain, A., McDonald, L. R., Gambogi, C., Lee, A. L., & Dokholyan, N. V. (2020) · Nature Communications · doi:10.1038/s41467-020-17618-2 · Cited by 201
A Spatial Access-Oriented Implementation of a 3-D GIS Topological Data Model for Urban Entities
Lee, J. (2004) · GeoInformatica · doi:10.1023/b:gein.0000034820.93914.d0 · Cited by 200
Swarm intelligence for routing in communication networks
Kassabalidis, I., El-Sharkawi, M. A., Marks, R. J., Arabshahi, P., & Gray, A. A. (2002) · GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270) · doi:10.1109/glocom.2001.966355 · Cited by 200
Infectious Disease and Group Size: More than Just a Numbers Game
Nunn, C. L., Jordán, F., McCabe, C. M., Verdolin, J. L., & Fewell, J. H. (2015) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2014.0111 · Cited by 192
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., & Wagner, D. (2010) · ACM Journal of Experimental Algorithmics · doi:10.1145/1671970.1671976 · Cited by 190
Au, A. W. S., Feng, C., Valaee, S., Reyes, S., Sorour, S., Markowitz, S. N., Gold, D., Gordon, K., & Eizenman, M. (2013) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2012.175 · Cited by 183
Ray, N., & Ebener, S. (2008) · International Journal of Health Geographics · doi:10.1186/1476-072x-7-63 · Cited by 182
Howey, M. C. L. (2007) · Journal of Archaeological Science · doi:10.1016/j.jas.2007.01.002 · Cited by 172
PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching
Higgott, O. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3505637 · Cited by 181
Modeling Cyber-Physical Vulnerability of the Smart Grid With Incomplete Information
Srivastava, A., Morris, T., Ernster, T., Vellaithurai, C., Pan, S., & Adhikari, U. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2232318 · Cited by 169
Stay on the Path: Instruction Fidelity in Vision-and-Language Navigation
Jain, V., Magalhaes, G., Ku, A., Vaswani, A., Ie, E., & Baldridge, J. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1181 · Cited by 165
Metadata
- Authors
- Dijkstra, E. W.
- Venue
- Numerische Mathematik
- Published
- 1959-12
- Volume
- 1
- Issue
- 1
- Pages
- 269-271
- ISSN
- 0029-599X (ISSN-L)
- 0945-3245
- OpenAlex
- W2169528473
- Cited by
- 24,043
- References
- 2
- FWCI
- 0.61
- 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.