The unconstrained binary quadratic programming problem: a survey
The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
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
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Self-citationHandbook of Combinatorial Optimization
(1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4 · Cited by 1,216
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827 · cited 1×
“A simple procedure (see for instance Hammer and Rudeanu 1968; Hansen 1979; Hansen et al. 1993; Boros and Hammer 2002) for finding an appropriate penalty for any linear constraint is given as follows: Consider the general constrained problem of the form This model accommodates both quadratic and…”
MethodBoolean Methods in Operations Research and Related Areas
Hammer, P. L., & Rudeanu, S. (1968) · Ökonometrie und Unternehmensforschung / Econometrics and Operations Research · doi:10.1007/978-3-642-85823-9 · Cited by 529
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
Barahona, F., Grötschel, M., Jünger, M., & Reinelt, G. (1988) · Operations Research · doi:10.1287/opre.36.3.493 · Cited by 504
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
Cluster Analysis and Mathematical Programming
Rao, M. R. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482319 · Cited by 377
Algorithms for the maximum satisfiability problem
Hansen, P., & Jaumard, B. (1990) · Computing · doi:10.1007/bf02241270 · Cited by 360
A Selection Problem of Shared Fixed Costs and Network Flows
Rhys, J. M. W. (1970) · Management Science · doi:10.1287/mnsc.17.3.200 · Cited by 239
Maximal Closure of a Graph and Applications to Combinatorial Problems
Picard, J.-C. (1976) · Management Science · doi:10.1287/mnsc.22.11.1268 · Cited by 234
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
Helmberg, C., & Rendl, F. (1998) · Mathematical Programming · doi:10.1007/bf01580072 · Cited by 226
Methods of Nonlinear 0-1 Programming
Hansen, P. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70343-1 · Cited by 220
Adaptive Memory Tabu Search for Binary Quadratic Programs
Glover, F., Kochenberger, G. A., & Alidaee, B. (1998) · Management Science · doi:10.1287/mnsc.44.3.336 · Cited by 209
Self-citationKrarup, J., & Pruzan, P. M. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0120827 · Cited by 190
Heuristic algorithms for the unconstrained binary quadratic programming problem
Beasley, J. E. (1998) · Cited by 189
Iasemidis, L. D., Pardalos, P., Sackellares, J. C., & Shiau, D.-S. (2001) · Journal of Combinatorial Optimization · doi:10.1023/a:1009877331765 · Cited by 183
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
Billionnet, A., & Elloumi, S. (2007) · Mathematical Programming · doi:10.1007/s10107-005-0637-9 · Cited by 182
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
Merz, P., & Freisleben, B. (2002) · Journal of Heuristics · doi:10.1023/a:1017912624016 · Cited by 164
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
Boros, E., Hammer, P. L., & Tavares, G. (2007) · Journal of Heuristics · doi:10.1007/s10732-007-9009-3 · Cited by 163
Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm
De Simone, C., Diehl, M., Jünger, M., Mutzel, P., Reinelt, G., & Rinaldi, G. (1995) · Journal of Statistical Physics · doi:10.1007/bf02178370 · Cited by 160
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem
Palubeckis, G. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039522.58036.68 · Cited by 155
Quadratic Binary Programming with Application to Capital-Budgeting Problems
Laughhunn, D. J. (1970) · Operations Research · doi:10.1287/opre.18.3.454 · Cited by 144
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
Boros, E., & Hammer, P. L. (1991) · Annals of Operations Research · doi:10.1007/bf02115753 · Cited by 110
Katayama, K., & Narihisa, H. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00242-3 · Cited by 109
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
Beck, A., & Teboulle, M. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623498336930 · Cited by 109
Diversification-driven tabu search for unconstrained binary quadratic problems
Glover, F., Lü, Z., & Hao, J. (2010) · 4OR · doi:10.1007/s10288-009-0115-y · Cited by 103
Self-citationPath relinking for unconstrained binary quadratic programming
Wang, Y., Lü, Z., Glover, F., & Hao, J. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.07.012 · Cited by 101
Self-citationA hybrid metaheuristic approach to solving the UBQP problem
Lü, Z., Glover, F., & Hao, J. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2010.06.039 · Cited by 97
Self-citationComplexity of uniqueness and local search in quadratic 0–1 programming
Pardalos, P. M., & Jha, S. (1992) · Operations Research Letters · doi:10.1016/0167-6377(92)90043-3 · Cited by 92
0-1 Quadratic programming approach for optimum solutions of two scheduling problems
Alidaee, B., Kochenberger, G. A., & Ahmadian, A. (1994) · International Journal of Systems Science · doi:10.1080/00207729408928968 · Cited by 89
Self-citationNeighborhood analysis: a case study on curriculum-based course timetabling
Lü, Z., Hao, J., & Glover, F. (2010) · Journal of Heuristics · doi:10.1007/s10732-010-9128-0 · Cited by 83
Self-citationSolving large scale Max Cut problems via tabu search
Kochenberger, G. A., Hao, J., Lü, Z., Wang, H., & Glover, F. (2011) · Journal of Heuristics · doi:10.1007/s10732-011-9189-8 · Cited by 83
Self-citationA solvable case of quadratic 0–1 programming
Barahona, F. (1986) · Discrete Applied Mathematics · doi:10.1016/0166-218x(86)90065-x · Cited by 72
One-pass heuristics for large-scale unconstrained binary quadratic problems
Glover, F., Alidaee, B., Rego, C., & Kochenberger, G. A. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00209-0 · Cited by 71
Self-citationPreprocessing of unconstrained quadratic binary optimization
Boros, E., Hammer, P. L., & Tavares, G. (2006) · Cited by 66
Solutions to quadratic minimization problems with box and integer constraints
Gao, D. Y., & Ruan, N. (2009) · Journal of Global Optimization · doi:10.1007/s10898-009-9469-0 · Cited by 65
Simulated annealing for the unconstrained quadratic pseudo-Boolean function
Alkhamis, T. M., Hasan, M., & Ahmed, M. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00130-6 · Cited by 65
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
Kochenberger, G. A., Glover, F., Alidaee, B., & Rego, C. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3449-7 · Cited by 60
Self-citationNeven, H., Rose, G., & Macready, W. G. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0804.4457 · Cited by 54
Dinh, T. P., Canh, N. N., & Thi, H. A. L. (2010) · Journal of Global Optimization · doi:10.1007/s10898-009-9507-y · Cited by 54
A new modeling and solution approach for the set-partitioning problem
Lewis, M. W., Kochenberger, G. A., & Alidaee, B. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2006.04.002 · Cited by 53
Self-citationA new approach for modeling and solving set packing problems
Alidaee, B., Kochenberger, G. A., Lewis, K. R., Lewis, M. W., & Wang, H. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.12.068 · Cited by 52
Self-citationMinimization of a quadratic pseudo-Boolean function
Billionnet, A., & Sutter, A. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90125-2 · Cited by 51
Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs
Glover, F., Kochenberger, G. A., Alidaee, B., et al. (1999) · Springer eBooks · doi:10.1007/978-1-4615-5775-3_7 · Cited by 47
Self-citationContinuous Approaches for Solving Discrete Optimization Problems
Pardalos, P. M., Prokopyev, O. A., & Busygin, S. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-32942-0_2 · Cited by 47
A linearization framework for unconstrained quadratic (0-1) problems
Guèye, S., & Michelon, P. Y. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2008.01.028 · Cited by 34
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming
Huang, H.-X., Pardalos, P. M., & Prokopyev, O. A. (2005) · Computational Optimization and Applications · doi:10.1007/s10589-005-3062-3 · Cited by 32
A new modeling and solution approach for the number partitioning problem
Alidaee, B., Glover, F., Kochenberger, G. A., & Rego, C. (2005) · Journal of Applied Mathematics and Decision Sciences · doi:10.1155/jamds.2005.113 · Cited by 29
Self-citationUsing the unconstrained quadratic program to model and solve Max 2-SAT problems
Kochenberger, G. A., Glover, F., Alidaee, B., & Lewis, K. R. (2005) · International Journal of Operational Research · doi:10.1504/ijor.2005.007435 · Cited by 28
Self-citationUsing xQx to model and solve the uncapacitated task allocation problem
Lewis, M. W., Alidaee, B., & Kochenberger, G. A. (2004) · Operations Research Letters · doi:10.1016/j.orl.2004.04.014 · Cited by 26
Self-citationAn exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
Li, D., Sun, X. L., & Liu, C. L. (2011) · Journal of Global Optimization · doi:10.1007/s10898-011-9713-2 · Cited by 25
A global continuation algorithm for solving binary quadratic programming problems
Pan, S., Tan, T., & Jiang, Y. (2007) · Computational Optimization and Applications · doi:10.1007/s10589-007-9110-4 · Cited by 22
Applications of pseudo-Boolean methods to economic problems
Hammer, P. L., & Shlifer, E. (1971) · Theory and Decision · doi:10.1007/bf00139572 · Cited by 18
A note on xQx as a modelling and solution framework for the Linear Ordering Problem
Lewis, M. W., Alidaee, B., Glover, F., & Kochenberger, G. A. (2009) · International Journal of Operational Research · doi:10.1504/ijor.2009.025005 · Cited by 15
Self-citationWang, J., Zhou, Y., & Yin, J. P. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.05.060 · Cited by 13
On characterization of maximal independent sets via quadratic optimization
Pajouh, F. M., Balasundaram, B., & Prokopyev, O. A. (2011) · Journal of Heuristics · doi:10.1007/s10732-011-9171-5 · Cited by 10
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems
Hanafi, S., Rebaï, A., & Vasquez, M. (2011) · Journal of Heuristics · doi:10.1007/s10732-011-9169-z · Cited by 10
Research works printed but not linked: 42
- Barahona F, Junger M, Reinelt G (1989) Experiments in quadratic 0–1 programming. Math Program 44:127–137 · doi:10.1007/bf01587084
- Cai Y, Wang J, Yin J, Zhou Y (2011) Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems. Expert Syst Appl 38(6):7817–7827. doi: 10.1016/j.eswa.2010.12.124 · DOI
- Carraesi P, Malucelli F, Farinaccio F (1995) Testing optimality for quadratic 0-1 unconstrained problems. ZOR-Math Methods Oper Res 42:295–311 · doi:10.1007/bf01432506
- Carraesi P, Farinaccio F, Malucelli F (1999) Testing optimality for quadratic 0-1 problems. Math Program 85:407–421 · doi:10.1007/s101070050064
- Carter MW (1984) The indefinite zero-one quadratic problem. Discret Appl Math 7(1):23–44 · doi:10.1016/0166-218x(84)90111-2
- Douiri SM, Elbernouss S (2012) The unconstrained binary quadratic programming for the sum coloring problem. Mod Appl Sci 6(9):26–33. doi: 10.5539/mas.v6n9p26 · doi:10.5539/mas.v6n9p26
- Gulati VP, Gupta SK, Mittal AK (1984) Unconstrained quadratic bivalent programming problem. Eur J Oper Res 15(1):121–125. doi: 10.1016/0377-2217(84)90055-9 · doi:10.1016/0377-2217(84)90055-9
- Hansen P, Jaumard B, Mathon V (1993) State-of-the-art survey-constrained nonlinear 0-1 programming. ORSA J Comput 5(2):97–119 · doi:10.1287/ijoc.5.2.97
- Hansen P, Jaumard B, Meyer C (2000) Exact sequential algorithms for additive clustering. Groupe d’études et de recherche en analyse des décisions, Montréal
- Jeyakumar V, Rubinov AM, Wu ZY (2007) Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. Math Program Ser A 110:521–541. doi: 10.1007/s10107-006-0012-5 · doi:10.1007/s10107-006-0012-5
- Kalantari B, Bagchi A (1990) An algorithm for quadratic zero-one programs. Naval Res Logist (NRL) 37(4):527–538 · doi:10.1002/1520-6750(199008)37:4<527::aid-nav3220370407>3.0.co;2-p
- Katayama K, Tani M, Narihisa H (2000) Solving large binary quadratic programming problems by effective genetic local search algorithm. In: Proceedings of 2000 Genetic and Evolutionary Computation Conference, pp 643–650
- Kochenberger G, Alidaee B, Glover F, Wang H (2007) An effective modeling and solution approach for the generalized independent set problem. Optim Lett 1(1):111–117 · doi:10.1007/s11590-006-0007-4
- Kochenberger G, Glover F, Alidaee B, Wang H (2005c) Clustering of microarray data via clique partitioning. J Comb Optim 10(1):77–92 · doi:10.1007/s10878-005-1861-1
- Li G (2012) Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition. J Optim Theory 52:710–726. doi: 10.1007/s10957-011-9930-3 · doi:10.1007/s10957-011-9930-3
- Lodi A, Allemand K, Liebling TM (1999) An evolutionary heuristic for quadratic 0–1 programming. Eur J Oper Res 119(3):662–670. doi: 10.1016/S0377-2217(98)00359-2 · doi:10.1016/s0377-2217(98)00359-2
- Lu C, Fang A, Jin Q, Wang Z, Xing W (2011) KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems. SIAM J Optim 21(4):1475–1490 · doi:10.1137/100793955
- Lü Z, Hao J-K, Glover F (2010b) A study of memetic search with multi-parent combination for UBQP. In: Evolutionary Computation in Combinatorial Optimization. Springer, Berlin, pp 154–165 · doi:10.1007/978-3-642-12139-5_14
- Mauri GR, Lorena LAN (2011) Lagrangean decompositions for the unconstrained binary quadratic programming problem. Int Trans Oper Res 18(2):257–270. doi: 10.1111/j.1475-3995.2009.00743.x · doi:10.1111/j.1475-3995.2009.00743.x
- Mauri GR, Lorena LAN (2012a) A column generation approach for the unconstrained binary quadratic programming problem. Eur J Oper Res 217(1):69–74. doi: 10.1016/j.ejor.2011.09.016 · doi:10.1016/j.ejor.2011.09.016
- Mauri GR, Lorena LAN (2012b) Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem. Comput Oper Res 39(7):1577–1581. doi: 10.1016/j.cor.2011.09.008 · doi:10.1016/j.cor.2011.09.008
- Merz P, Freisleben B (1999) Genetic algorithms for binary quadratic programming. In: Proceedings of the genetic and evolutionary computation conference, Citeseer, pp 417–424
- Merz P, Katayama K (2004) Memetic algorithms for the unconstrained binary quadratic programming problem. Biosystems 78(1–3):99–118. doi: 10.1016/j.biosystems.2004.08.002 · DOI
- Oosten M, Rutten J, Spieksma F (2001) The Clique partitioning problem: facets and patching facets. Networks 38(4):209–226 · doi:10.1002/net.10004
- Palubeckis G (1995) A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming. Computing 54(4):283–301. doi: 10.1007/BF02238228 · doi:10.1007/bf02238228
- Palubeckis G (2006) Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2):279–296 · doi:10.15388/informatica.2006.138
- Palubeckis G, Tomkevicius A (2002) GRASP implementations for the unconstrained binary quadratic optimization problem. Inf Technol Control 24:14–20
- Pardalos PM, Jha S (1991) Graph separation techniques for quadratic zero-one programming. Comput Math Appl 21(6–7):107–113. doi: 10.1016/0898-1221(91)90165-Z · doi:10.1016/0898-1221(91)90165-z
- Pardalos PM, Rodgers GP (1990a) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2):131–144 · doi:10.1007/bf02247879
- Pardalos PM, Rodgers GP (1990b) Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture. Ann Oper Res 22(1–4):271–292 · doi:10.1007/bf02023057
- Pardalos PM, Rodgers GP (1992) A branch and bound algorithm for the maximum clique problem. Comput Oper Res 19(5):363–375. doi: 10.1016/0305-0548(92)90067-F · doi:10.1016/0305-0548(92)90067-f
- Pinar MC (2004) Sufficient global optimality conditions for bivalent quadratic optimization. J Optim Theory Appl 122(2):433–440 · doi:10.1023/b:jota.0000042530.24671.80
- Shylo V, Shylo O (2011) Systems analysis solving unconstrained binary quadratic programming problem by global equilibrium search. Cybern Syst Anal 47(6):889–897. doi: 10.1007/s10559-011-9368-5 · doi:10.1007/s10559-011-9368-5
- Sun XL, Liu CL, Li D, Gao JJ (2012) On duality gap in binary quadratic programming. J Global Optim 53:255–269. doi: 10.1007/s10898-011-9683-4 · doi:10.1007/s10898-011-9683-4
- Wang F, Xu Z (2013) Metaheuristics for robust graph coloring. J Heuristics 19(4):529–548 · doi:10.1007/s10732-011-9180-4
- Wang H, Alidaee B, Glover F, Kochenberger G (2006) Solving group technology problems via clique partitioning. Int J Flex Manuf Syst 18(2):77–77 · doi:10.1007/s10696-006-9011-3
- Wang Y, Lü Z, Glover F, Hao J-K (2012a) A multilevel algorithm for large unconstrained binary quadratic optimization. In: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems. Springer, Berlin, pp 395–408 · doi:10.1007/978-3-642-29828-8_26
- Wang Y, Lü Z, Glover F, Hao J-K (2012c) Probabilistic GRASP-tabu search algorithms for the UBQP problem. Comput Oper Res 40:3100–3107 · doi:10.1016/j.cor.2011.12.006
- Williams HP (1985) Model building in linear and integer programming. In: Schittkowski K (ed) Computational mathematical programming, vol 15. NATO ASI Series. Springer, Berlin, pp 25–53. doi: 10.1007/978-3-642-82450-0_2 · doi:10.1007/978-3-642-82450-0_2
- Witzgall C (1975) Mathematical methods of site selection for Electronic Message Systems (EMS). NBS Internal report, NBS · doi:10.6028/nbs.ir.75-737
- Xia Y (2009) New optimality conditions for quadratic optimization problems with binary constraints. Optim Lett 3:253–263. doi: 10.1007/s11590-008-0105-6 · doi:10.1007/s11590-008-0105-6
- Zheng XJ, Sun XL, Li D, Xu YF (2012) On zero duality gap in nonconvex quadratic programming problems. J Global Optim 52:229–242. doi: 10.1007/s10898-011-9660-y · doi:10.1007/s10898-011-9660-y
Cited by
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
A review on Quantum Approximate Optimization Algorithm and its variants
Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.03.002 · Cited by 408
Cai, F., Kumar, S., Van Vaerenbergh, T., Sheng, X., Liu, R., Li, C., Liu, Z., Foltin, M., Yu, S., Xia, Q., et al. (2020) · Nature Electronics · doi:10.1038/s41928-020-0436-6 · Cited by 393
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., Hennig, R., & Du, Y. (2022) · Annals of Operations Research · doi:10.1007/s10479-022-04634-2 · Cited by 297
Self-citationQuantum Bridge Analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., & Du, Y. (2019) · 4OR · doi:10.1007/s10288-019-00424-y · Cited by 298
Self-citation
Metadata
- Authors
- Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., & Wang, Y.
- Venue
- Journal of Combinatorial Optimization
- Published
- 2014-04-18
- Volume
- 28
- Issue
- 1
- Pages
- 58-81
- ISSN
- 1382-6905 (ISSN-L)
- 1573-2886
- OpenAlex
- W2067612530
- Cited by
- 473
- References
- 59
- FWCI
- 15.28
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
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.