The DOI matches its Crossref record; 94 of the 94 references it cites were found in a registry or an index.
SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Open accessAbstract
Many important geometric estimation problems naturally take the form of synchronization over the special Euclidean group: estimate the values of a set of unknown group elements [Formula: see text] given noisy measurements of a subset of their pairwise relative transforms [Formula: see text]. Examples of this class include the foundational problems of pose-graph simultaneous localization and mapping (SLAM) (in robotics), camera motion estimation (in computer vision), and sensor network localization (in distributed sensing), among others. This inference problem is typically formulated as a non-convex maximum-likelihood estimation that is computationally hard to solve in general. Nevertheless, in this paper we present an algorithm that is able to efficiently recover certifiably globally optimal solutions of the special Euclidean synchronization problem in a non-adversarial noise regime. The crux of our approach is the development of a semidefinite relaxation of the maximum-likelihood estimation (MLE) whose minimizer provides an exact maximum-likelihood estimate so long as the magnitude of the noise corrupting the available measurements falls below a certain critical threshold; furthermore, whenever exactness obtains, it is possible to verify this fact a posteriori, thereby certifying the optimality of the recovered estimate. We develop a specialized optimization scheme for solving large-scale instances of this semidefinite relaxation by exploiting its low-rank, geometric, and graph-theoretic structure to reduce it to an equivalent optimization problem defined on a low-dimensional Riemannian manifold, and then design a Riemannian truncated-Newton trust-region method to solve this reduction efficiently. Finally, we combine this fast optimization approach with a simple rounding procedure to produce our algorithm, SE-Sync. Experimental evaluation on a variety of simulated and real-world pose-graph SLAM datasets shows that SE-Sync is capable of recovering certifiably globally optimal solutions when the available measurements are corrupted by noise up to an order of magnitude greater than that typically encountered in robotics and computer vision applications, and does so significantly faster than the Gauss–Newton-based approach that forms the basis of current state-of-the-art techniques.
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
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Artificial intelligence: A modern approach
Nilsson, N. J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(96)00007-0 · Cited by 10,583
Horn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Fisher, R. (1953) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1953.0064 · Cited by 5,563
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
Least-squares estimation of transformation parameters between two point patterns
Umeyama, S. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.88573 · Cited by 2,420
G2o: A general framework for graph optimization
Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., & Burgard, W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979949 · Cited by 1,982
Foundations of Differentiable Manifolds and Lie Groups
Warner, F. W. (1983) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1799-0 · Cited by 1,848
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
An Introduction to Differentiable Manifolds and Riemannian Geometry
(1975) · Pure and Applied Mathematics · doi:10.1016/s0079-8169(08)x6065-9 · Cited by 1,778
Optimal Control and Estimation
Stengel, R. F. (1994) · Cited by 1,617
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
iSAM2: Incremental smoothing and mapping using the Bayes tree
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362
Self-citationA Tutorial on Graph-Based SLAM
Grisetti, G., Kummerle, R., Stachniss, C., & Burgard, W. (2010) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2010.939925 · Cited by 1,345
Globally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Journal of the Royal Statistical Society: Series C (Applied Statistics)
(2023) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.1111/(issn)1467-9876 · Cited by 1,178
Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
Dellaert, F., & Kaess, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072768 · Cited by 922
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2010) · Cited by 921
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Steihaug, T. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720042 · Cited by 824
A Course in Large Sample Theory
Ferguson, T. S. (1996) · Springer eBooks · doi:10.1007/978-1-4899-4549-5 · Cited by 806
An Introduction to Matrix Concentration Inequalities
Tropp, J. A. (2015) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000048 · Cited by 792
SBA: A software package for generic sparse bundle adjustment
Lourakis, M. I. A., & Argyros, A. A. (2009) · ACM Transactions on Mathematical Software · doi:10.1145/1486525.1486527 · Cited by 788
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S., & Monteiro, R. D. C. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0352-8 · Cited by 770
Feedback Systems: An Introduction for Scientists and Engineers
Aström, K. J., & Murray, R. M. (2008) · Princeton University Press eBooks · doi:10.1515/9781400828739 · Cited by 760
Manopt, a Matlab toolbox for optimization on manifolds
Boumal, N., Mishra, B., Absil, P.-A., & Sepulchre, R. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.5200 · Cited by 737
A Course in Large Sample Theory
Ferguson, T. S. (2017) · Routledge eBooks · doi:10.1201/9781315136288 · Cited by 719
Sums of Squares, Moment Matrices and Optimization Over Polynomials
Laurent, M. (2009) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-0-387-09686-5_7 · Cited by 648
2011 IEEE International Conference on Robotics and Automation (ICRA 2011)
(2010) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2010.2047467 · Cited by 503
Hartley, R., Trumpf, J., Dai, Y., & Li, H. (2013) · International Journal of Computer Vision · doi:10.1007/s11263-012-0601-0 · Cited by 486
Trust-Region Methods on Riemannian Manifolds
Absil, P.-A., Baker, C. G., & Gallivan, K. A. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0179-9 · Cited by 461
A New Algorithm for Unconstrained Optimization
POWELL, M. J. D. (1970) · Nonlinear Programming · doi:10.1016/b978-0-12-597050-1.50006-3 · Cited by 447
Waki, H., Kim, S., Kojima, M., & Muramatsu, M. (2006) · SIAM Journal on Optimization · doi:10.1137/050623802 · Cited by 439
Fast iterative alignment of pose graphs with poor initial estimates
Olson, E., Leonard, J., & Teller, S. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1642040 · Cited by 427
Self-citationTruncated-Newton algorithms for large-scale unconstrained optimization
Dembo, R. S., & Steihaug, T. (1983) · Mathematical Programming · doi:10.1007/bf02592055 · Cited by 420
2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2010)
Nakao, M. (2011) · Journal of the Robotics Society of Japan · doi:10.7210/jrsj.29.443a2 · Cited by 409
Local Minima and Convergence in Low-Rank Semidefinite Programming
Burer, S., & Monteiro, R. D. C. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0564-1 · Cited by 347
Angular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
Robust Rotation and Translation Estimation in Multiview Reconstruction
Martinec, D., & Pajdla, T. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383115 · Cited by 319
The non-convex Burer-Monteiro approach works on smooth semidefinite programsPreprint
Boumal, N., Voroninski, V., & Bandeira, A. S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.04970 · Cited by 288
Self-citationConvergent SDP‐Relaxations in Polynomial Optimization with Sparsity
Lasserre, J. B. (2006) · SIAM Journal on Optimization · doi:10.1137/05064504x · Cited by 281
Global rates of convergence for nonconvex optimization on manifolds
Boumal, N., Absil, P.-A., & Cartis, C. (2019) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drx080 · Cited by 271
A survey of truncated-Newton methods
Nash, S. G. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00426-x · Cited by 266
Vector diffusion maps and the connection Laplacian
Singer, A., & Wu, H. ‐. (2012) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21395 · Cited by 251
Algebraic Potential Theory on Graphs
Biggs, N. (1997) · Bulletin of the London Mathematical Society · doi:10.1112/s0024609397003305 · Cited by 238
Carlone, L., Tron, R., Daniilidis, K., & Dellaert, F. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139836 · Cited by 237 · cited 1×
“tor product operations. The Gauss-Newton method is initialized using the chordal initialization, a state-of-the-art method for bootstrapping an initial solution in SLAM and bundle adjustment problems [26,57], and we set r 0 = 5 in the Riemannian Staircase (Algorithm1). Finally, since SE-Sync is based upon solving the…”
MethodSelf-citationNonlinear Constraint Network Optimization for Efficient Map Learning
Grisetti, G., Stachniss, C., & Burgard, W. (2009) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2009.2026444 · Cited by 222
A Perspective on Medical Robotics
Taylor, R. H. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2006.880669 · Cited by 220
Efficient Simulation of the von Mises Distribution
Best, D. J., & Fisher, N. I. (1979) · Applied Statistics · doi:10.2307/2346732 · Cited by 199
Distributed Clock Synchronization over Wireless Networks: Algorithms and Analysis
Giridhar, A., & Kumar, P. R. (2006) · Proceedings of the 45th IEEE Conference on Decision and Control · doi:10.1109/cdc.2006.377325 · Cited by 199
Singer, A., & Shkolnisky, Y. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/090767777 · Cited by 178
Exact and stable recovery of rotations for robust synchronization
Wang, L., & Singer, A. (2013) · Information and Inference · doi:10.1093/imaiai/iat005 · Cited by 178
Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
Bandeira, A. S., Boumal, N., & Singer, A. (2016) · Mathematical Programming · doi:10.1007/s10107-016-1059-6 · Cited by 176
Self-citationSimultaneous Localization and Mapping
Stachniss, C., Leonard, J. J., & Thrun, S. (2016) · Springer handbooks · doi:10.1007/978-3-319-32552-1_46 · Cited by 172
Self-citationMinimizing Polynomials via Sum of Squares over the Gradient Ideal
Nie, J., Demmel, J. W., & Sturmfels, B. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0672-6 · Cited by 162
A Cheeger Inequality for the Graph Connection Laplacian
Bandeira, A. S., Singer, A., & Spielman, D. A. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120875338 · Cited by 158
Self-citationSparse Sparse Bundle Adjustment
Konolige, K. (2010) · British Machine Vision Conference (BMVC) · doi:10.5244/c.24.102 · Cited by 151
Nocedal, J., & Wright, S. J. (2006) · Springer series in operations research/Springer series in operations research and financial engineering · doi:10.1007/978-0-387-40065-5_10 · Cited by 141
Millman, R., Guillemin, V., & Pollack, A. S. (1978) · American Mathematical Monthly · doi:10.2307/2321081 · Cited by 139
Distributed 3-D Localization of Camera Sensor Networks From 2-D Image Measurements
Tron, R., & Vidal, R. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2351912 · Cited by 112
Sensor network localization by eigenvector synchronization over the euclidean group
Cucuringu, M., Lipman, Y., & Singer, A. (2012) · ACM Transactions on Sensor Networks · doi:10.1145/2240092.2240093 · Cited by 110
Spectral Synchronization of Multiple Views in SE(3)
Arrigoni, F., Rossi, B., & Fusiello, A. (2016) · SIAM Journal on Imaging Sciences · doi:10.1137/16m1060248 · Cited by 108
The DARPA Robotics Challenge [Competitions]
Pratt, G. A., & Manzo, J. E. (2013) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2013.2255424 · Cited by 105
Cramer-Rao bounds for synchronization of rotations
Boumal, N., Singer, A., Absil, P.-A., & Blondel, V. D. (2013) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iat006 · Cited by 105
Medical Robotics and Computer-Integrated Surgery
Taylor, R. H., Menciassi, A., Gabor Fichtinger, A., & Dario, P. (2008) · Springer eBooks · doi:10.1007/978-3-540-30301-5_53 · Cited by 101
Planar Pose Graph Optimization: Duality, Optimal Solutions, and Verification
Carlone, L., Calafiore, G. C., Tommolillo, C., & Dellaert, F. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2544304 · Cited by 100
Self-citationAnalysis of Measurements Based on the Singular Value Decomposition
Hanson, R. J., & Norris, M. J. (1981) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0902029 · Cited by 98
Lagrangian duality in 3D SLAM: Verification techniques and optimal solutions
Carlone, L., Rosen, D. M., Calafiore, G., Leonard, J. J., & Dellaert, F. (2015) · 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2015.7353364 · Cited by 95
Self-citationAn incremental trust-region method for Robust online sparse least-squares estimation
Rosen, D. M., Kaess, M., & Leonard, J. J. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6224646 · Cited by 88
Self-citationBoumal, N. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.00575 · Cited by 81
Carlone, L., & Censi, A. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2013.2291626 · Cited by 79
Self-citationRISE: An Incremental Trust-Region Method for Robust Online Sparse Least-Squares Estimation
Rosen, D. M., Kaess, M., & Leonard, J. J. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2014.2321852 · Cited by 78
Self-citationHow far is SLAM from a linear least squares problem?
Huang, S., Lai, Y., Frese, U., & Dissanayake, G. (2010) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2010.5652603 · Cited by 67
Navigating inner space: 3-D assistance for minimally invasive surgery
Burschka, D., Corso, J. J., Dewan, M., Lau, W. W., Li, M., Lin, H., Marayong, P., Ramey, N. A., Hager, G. D., Hoffman, B. D., et al. (2005) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2005.03.013 · Cited by 61
Robotics: Science and Systems (RSS)
Lepora, N. F., Martínez-Hernández, U., & Prescott, T. J. (2013) · Cited by 59
Subgraph-preconditioned conjugate gradients for large scale SLAM
Dellaert, F., Carlson, J., Ila, V, Ni, K., & Thorpe, C. E. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5650422 · Cited by 58 · cited 1×
“Indeed, there now exist a variety of mature algorithms and software libraries implementing this approach that are able to process special Euclidean synchronization problems involving tens to hundreds of thousands of latent states in real time using only a single thread on a commodity processor (Dellaert et al., 2010;…”
BackgroundA convex relaxation for approximate global optimization in simultaneous localization and mapping
Rosen, D. M., DuHadway, C., & Leonard, J. J. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7140014 · Cited by 56 · cited 1×
“edience comes at the expense of reliability, as their restriction to local search renders these methods vulnerable to convergence to suboptimal critical points, even for relatively small noise levels [15, 36]. This observation, together with the fact that suboptimal critical points usually correspond to egregiously wr…”
Self-citationStable Camera Motion Estimation Using Convex Programming
Özyeşil, O., Singer, A., & Basri, R. (2015) · SIAM Journal on Imaging Sciences · doi:10.1137/140977576 · Cited by 56
Global Synchronization in Sensornets
Elson, J., Karp, R. M., Papadimitriou, C. H., & Shenker, S. J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24698-5_63 · Cited by 55
Duality-based verification techniques for 2D SLAM
Carlone, L., & Dellaert, F. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139835 · Cited by 49
Self-citationA Survey on Rotation Optimization in Structure from Motion
Tron, R., Zhou, X., & Daniilidis, K. (2016) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2016.133 · Cited by 46
Multi-agent localization from noisy relative pose measurements
Aragüés, R., Carlone, L., Calafiore, G. C., & Sagüés, C. (2011) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2011.5979799 · Cited by 40
Self-citationA note on probably certifiably correct algorithms
Bandeira, A. S. (2016) · Comptes Rendus Mathématique · doi:10.1016/j.crma.2015.11.009 · Cited by 38
Self-citationOn the Structure of Nonlinearities in Pose Graph
Wang, H., Hu, G., Huang, S., & Dissanayake, G. (2012) · Robotics: Science and Systems · doi:10.15607/rss.2012.viii.054 · Cited by 33
On the number of local minima to the point feature based SLAM problem
Huang, S., Wang, H., Frese, U., & Dissanayake, G. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6224876 · Cited by 28
Wide-Sense Estimation on the Special Orthogonal Group
Chiuso, A., Picci, G., & Soatto, S. (2008) · Communications in Information and Systems · doi:10.4310/cis.2008.v8.n3.a1 · Cited by 25
Sensor Network Localization on the Group of Three-Dimensional Displacements
Peters, J. R., Borra, D., Paden, B. E., & Bullo, F. (2015) · SIAM Journal on Control and Optimization · doi:10.1137/140957743 · Cited by 16
Cited by
Deep Closest Point: Learning Representations for Point Cloud Registration
Wang, Y., & Solomon, J. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00362 · Cited by 1,112
TEASER: Fast and Certifiable Point Cloud Registration
Yang, H., Shi, J., & Carlone, L. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3033695 · Cited by 895
Self-citationYang, H., Antonante, P., Tzoumas, V., & Carlone, L. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2965893 · Cited by 325
Self-citationKimera-Multi: Robust, Distributed, Dense Metric-Semantic SLAM for Multi-Robot Systems
Tian, Y., Chang, Y., Herrera Arias, F., Nieto-Granda, C., How, J. P., & Carlone, L. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3137751 · Cited by 288
Self-citationKimera: From SLAM to spatial perception with 3D dynamic scene graphs
Rosinol, A., Violette, A., Abate, M., Hughes, N., Chang, Y., Shi, J., Gupta, A., & Carlone, L. (2021) · The International Journal of Robotics Research · doi:10.1177/02783649211056674 · Cited by 271
Self-citation
Metadata
- Authors
- Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2018-08-29
- Volume
- 38
- Issue
- 2-3
- Pages
- 95-125
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2547811925
- Cited by
- 282
- References
- 94
- FWCI
- 23.87
- Type
- journal article
- Language
- en
- Open access
- bronze
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.