The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Occam's razor in metacomputation: the notion of a perfect process tree
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“It uses ¢ to compare nodes in a marked partial process tree: a notion originating from Glück and Klimov • 241 [1993] and corresponding to global trees in partial deduction.”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Glück and Klimov [1993]
Citations
Cites
Fast Pattern Matching in Strings
Knuth, D. E., Morris, J. H., & Pratt, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,915
Partial evaluation and automatic program generation
Jones, N. D., Gomard, C. K., & Sestoft, P. (1993) · Medical Entomology and Zoology · Cited by 1,440
The concept of a supercompiler
Turchin, V. F. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5956.5957 · Cited by 363
Mix: A self-applicable partial evaluator for experiments in compiler generation
Jones, N. D., Sestoft, P., & Søndergaard, H. (1989) · LISP and Symbolic Computation · doi:10.1007/bf01806312 · Cited by 250
Automatic autoprojection of recursive equations with global variables and abstract data types
Bondorf, A., & Olivier Danvy, A. (1991) · Science of Computer Programming · doi:10.1016/0167-6423(91)90002-f · Cited by 154
Partial evaluation of pattern matching in strings
Consel, C., & Olivier Danvy, A. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90113-0 · Cited by 92
Semantics-Directed Compiler Generation
(1980) · Lecture notes in computer science · doi:10.1007/3-540-10250-7 · Cited by 85
Binding time analysis for high order untyped functional languages
Consel, C. (1990) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/91556.91668 · Cited by 84
Essence of generalized partial computation
Futamura, Y., Nogi, K., & Takano, A. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90299-h · Cited by 59
Program transformation with metasystem transitions
Turchin, V. F. (1993) · Journal of Functional Programming · doi:10.1017/s0956796800000757 · Cited by 58
Research works printed but not linked: 9
- Abramov S. M., Metacomputation and program testing. In: 1st International Workshop on Automated and Algorithmic Debugging. (Linköping, Sweden). 121–135, Linköping University 1993.
- Glück R., Projections for knowledge based systems. In: Trappl R. (ed.), Cybernetics and Systems Research '92. Vol. 1, 535–542, World Scientific: Singapore 1992.
- Jones N. D., Automatic program specialization: a re-examination from basic principles. In: BjØrner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel AvernÆs, Denmark). 225–282, North-Holland 1988.
- Klimov And. V. Klimov, Romanenko S. A., A metaevaluator for the language Refal. Basic concepts and examples. Keldysh Institute of Applied Mathematics, Academy of Sciences of the USSR, Moscow. Preprint No. 71, 1987 (in Russian).
- Mogensen T. Æ., Partially static structures in a self-applicable partial evaluator. In: BjØrner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel AvernÆs, Denmark). 325–347, North-Holland 1988.
- Romanenko S. A., Driving for Refal-4 programs. Keldysh Institute of Applied Mathematics, Academy of Sciences of the USSR, Moscow. Preprint No. 211, 1987 (in Russian).
- Turchin V. F., Equivalent transformations of recursive functions defined in Refal. In: Teoria Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods). (Kiev-Alushta, USSR). 31–42, 1972 (in Russian).
- Turchin V. F., Equivalent transformations of Refal programs. In: Avtomatizirovannaja Sistema upravlenija stroitel'stvom. Trudy CNIPIASS, 6: 36–68, 1974 (in Russian).
- Turchin V. F., The algorithm of generalization in the supercompiler. In: BjØrner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gl. AvernÆs, Denmark). 341–353, 1988.
Cited by
Sorted by citations
Program Analysis and Specialization for the C Programming Language
Andersen, L. O., & Lee, P. (2005) · Cited by 903
Bidirectionalizing graph transformations
Hidaka, S., Hu, Z., Inaba, K., Kato, H., Matsuda, K., & Nakano, K. (2010) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1863543.1863573 · Cited by 105
Partial evaluation of functional logic programs
Alpuente, M., Falaschi, M., & Vidal, G. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/291891.291896 · Cited by 89
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
A computational formalization for partial evaluation
John Hatcliff, A., & Olivier Danvy, A. (1997) · Mathematical Structures in Computer Science · doi:10.1017/s0960129597002405 · Cited by 71
Towards unifying partial evaluation, deforestation, supercompilation, and GPC
Sørensen, M. H., Glück, R., & Jones, N. D. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57880-3_32 · Cited by 71
Self-citationPartial deduction and driving are equivalent
Glück, R., & Sørensen, M. H. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58402-1_13 · Cited by 56
Self-citationThe narrowing-driven approach to functional logic program specialization
Albert, E., & Vidal, G. (2002) · New Generation Computing · doi:10.1007/bf03037257 · Cited by 54
Principles of Inverse Computation and the Universal Resolving Algorithm
Abramov, S., & Glück, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36377-7_13 · Cited by 51
Self-citationA roadmap to metacomputation by supercompilation
Glück, R., & Sørensen, M. H. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_8 · Cited by 50
Self-citationProving the correctness of recursion-based automatic program transformations
Sands, D. (1996) · Theoretical Computer Science · doi:10.1016/0304-3975(96)00074-6 · Cited by 47
Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs
Lafave, L., & Gallagher, J. P. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49674-2_9 · Cited by 40
The essence of program transformation by partial evaluation and driving
Jones, N. D. (2005) · Springer eBooks · doi:10.1007/bfb0032402 · Cited by 39
An Introduction to Online and Offline Partial Evaluation Using a Simple Flowchart Language
John Hatcliff, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-47018-2_2 · Cited by 37
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
Abramov, S., & Glück, R. (2000) · Lecture notes in computer science · doi:10.1007/10722010_13 · Cited by 37
Self-citationA Practical Partial Evaluation Scheme for Multi-Paradigm Declarative Languages
Albert, E., Hanus, M., & Vidal, G. (2002) · Cited by 36
Generating transformers for deforestation and supercompilation
Glück, R., & Jørgensen, J. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58485-4_57 · Cited by 35
Self-citationAdvanced Techniques for Logic Program Specialisation
Leuschel, M. (1997) · Lirias · Cited by 35
Metacomputation: Metasystem transitions plus supercompilation
Turchin, V. F. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_24 · Cited by 34
Regular approximation of computation paths in logic and functional languages
Gallagher, J., & Lafave, L. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61580-6_7 · Cited by 34
The universal resolving algorithm and its correctness: inverse computation in a functional language
Abramov, S., & Glück, R. (2002) · Science of Computer Programming · doi:10.1016/s0167-6423(02)00023-0 · Cited by 34
Self-citationIntroduction to Supercompilation
Sørensen, M. H., & Glück, R. (1999) · Lecture notes in computer science · doi:10.1007/3-540-47018-2_10 · Cited by 34
Self-citationGenerating optimizing specializers
Glück, R., & Jorgensen, J. (2002) · International Conference on Computer Languages (ICCL) · doi:10.1109/iccl.1994.288382 · Cited by 34
Self-citationProgram transformation system based on generalized partial computation
Futamura, Y., Konishi, Z., & Glück, R. (2002) · New Generation Computing · doi:10.1007/bf03037260 · Cited by 32
Self-citationSecher, J. P., & Sørensen, M. H. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46562-6_10 · Cited by 30
On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation
Ager, M. S., Olivier Danvy, A., & Rohde, H. K. (2002) · doi:10.1145/568173.568177 · Cited by 28
Controlling conjunctive partial deduction
Glück, R., Jørgensen, J., Martens, B., & Sørensen, M. H. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61756-6_83 · Cited by 27
Self-citationThe Abstraction and Instantiation of String-Matching Programs
Amtoft, T., Consel, C., Olivier Danvy, A., & Malmkjær, K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36377-7_15 · Cited by 27
A Self-Applicable supercompiler
Nemytykh, A. P., Pinchuk, V. A., & Turchin, V. F. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_16 · Cited by 26
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
Klyuchnikov, I. G., & Romanenko, S. A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11486-1_17 · Cited by 25
Fast partial evaluation of pattern matching in strings
Ager, M. S., Olivier Danvy, A., & Rohde, H. K. (2003) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/777388.777390 · Cited by 25
Jones, N. D. (1995) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/215465.215468 · Cited by 24
Reducing nondeterminism while specializing logic programs
Pettorossi, A., Proietti, M., & Renault, S. (1997) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/263699.263759 · Cited by 24
Supercompilation: Techniques and results
Turchin, V. F. (1996) · Lecture notes in computer science · doi:10.1007/3-540-62064-8_20 · Cited by 23
Staging static analyses using abstraction-based program specialization
John Hatcliff, A., Dwyer, M. B., & Laubach, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056612 · Cited by 23
Specialization of functional logic programs based on needed narrowing
Alpuente, M., Lucas, S., Vidal, G., & Hanus, M. (2005) · Theory and Practice of Logic Programming · doi:10.1017/s1471068404002303 · Cited by 23
Combining abstract interpretation and partial evaluation (brief overview)
Jones, N. D. (1997) · Lecture notes in computer science · doi:10.1007/bfb0032761 · Cited by 22
Offline partial evaluation can be as accurate as online partial evaluation
Christensen, N. H., & Glück, R. (2004) · ACM Transactions on Programming Languages and Systems · doi:10.1145/963778.963784 · Cited by 22
Self-citationA unifying view of functional and logic program specialization
Alpuente, M., Falaschi, M., & Vidal, G. (1998) · ACM Computing Surveys · doi:10.1145/289121.289130 · Cited by 22
The Abstraction and Instantiation of String-Matching Programs
Amtoft, T., Consel, C., Olivier Danvy, A., & Malmkjær, K. (2001) · BRICS Report Series · doi:10.7146/brics.v8i12.20469 · Cited by 21
Fast partial evaluation of pattern matching in strings
Ager, M. S., Olivier Danvy, A., & Rohde, H. K. (2006) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1146809.1146812 · Cited by 20
Partial evaluation of pattern matching in strings, revisited
Grobauer, B., & Lawall, J. (2001) · doi:10.5555/766502.766505 · Cited by 19
The Essence of Program Transformation by Partial Evaluation and Driving
Jones, N. D. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46562-6_6 · Cited by 17
Supercompiler HOSC 1.0: under the hood
Klyuchnikov, I. G. (2009) · Cited by 17
Transforming interpreters into inverse interpreters by partial evaluation
Glück, R., Kawada, Y., & Hashimoto, T. (2003) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/777388.777391 · Cited by 16
Self-citationSelf-applicable online partial evaluation
Sperber, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_23 · Cited by 16
From checking to inference via driving and dag grammars
Secher, J. P., & Sørensen, M. H. (2002) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/503032.503036 · Cited by 14
FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS
Abramov, S., & Glück, R. (2001) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054101000448 · Cited by 13
Self-citationProving the correctness of recursion-based automatic program transformations
Sands, D. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59293-8_228 · Cited by 13
Lawall, J., Muller, G., & Duchesne, H. (2004) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/1014007.1014016 · Cited by 12
Automatic generation of efficient string matching algorithms by generalized partial computation
Futamura, Y., Konishi, Z., & Glück, R. (2002) · doi:10.1145/568173.568174 · Cited by 12
Self-citationLanguage Design for Implementing Process Scheduling Hierarchies
Lawall, J., Muller, G., & Duchesne, H. (2004) · Cited by 12
An Universal Resolving Algorithm for Inverse Computation of Lazy Languages
Abramov, S., Glück, R., & Klimov, Y. A. (2007) · Springer eBooks · doi:10.1007/978-3-540-70881-0_6 · Cited by 10
Self-citationBootstrapping higher-order program transformers from interpreters
Sperber, M., Glück, R., & Thiemann, P. J. (1996) · ACM Symposium on Applied Computing · doi:10.1145/331119.331417 · Cited by 10
Self-citationA Constraint-based Partial Evaluator for Functional Logic Programs and its Application
Lafave, L. (1998) · Cited by 10
Specialization with clause splitting for deriving deterministic constraint logic programs
Fioravanti, F., Pettorossi, A., & Proietti, M. (2005) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2002.1167971 · Cited by 10
Higher-order expression procedures
Sands, D. (1995) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/215465.215587 · Cited by 9
A Program Specialization Relation Based on Supercompilation and its Properties
Klimov, A. V. (2007) · Cited by 8
Self-citationGeneralization in Hierarchies of Online Program Specialization Systems
Glück, R., John Hatcliff, A., & Jørgensen, J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48958-4_10 · Cited by 8
Self-citationEnhancing partial deduction via unfold/fold rules
Pettorossi, A., Proietti, M., & Renault, S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62718-9_9 · Cited by 8
Topics in Semantics-based Program Manipulation
Grobauer, B. (2001) · Cited by 8
WSDFU: Program Transformation System Based on Generalized Partial Computation
Futamura, Y., Konishi, Z., & Glück, R. (2007) · Springer eBooks · doi:10.1007/3-540-36377-7_16 · Cited by 8
Self-citationSqueezing intermediate construction in equational programs
Miniussi, A., & Sherman, D. J. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_14 · Cited by 8
A Computational Formalization for Partial Evaluation (Extended Version)
John Hatcliff, A., & Olivier Danvy, A. (1996) · BRICS Report Series · doi:10.7146/brics.v3i34.20015 · Cited by 8
Using partial evaluation to enable verification of concurrent software
Dwyer, M. B., John Hatcliff, A., & Nanda, M. (1998) · ACM Computing Surveys · doi:10.1145/289121.289143 · Cited by 7
Secher, J. P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44978-7_12 · Cited by 7
Reasoning about hierarchies of online program specialization systems
Hatcliff, J., & Glück, R. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_9 · Cited by 7
Self-citationAn Experiment with the Fourth Futamura Projection
Glück, R. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11486-1_12 · Cited by 4
Self-citationDerivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
Pettorossi, A., Proietti, M., & Renault, S. (2005) · LISP and Symbolic Computation · doi:10.1007/s10990-005-7008-3 · Cited by 4
Extending the power of automatic constraint-based partial evaluators
Lafave, L., & Gallagher, J. P. (1998) · ACM Computing Surveys · doi:10.1145/289121.289136 · Cited by 4
Narrowing-driven Specialization of Functional Logic Programs
Alpuente, M., Falaschi, M., & Vidal, G. (2004) · Cited by 4
An investigation of Jones optimality and BTI-universal specializers
Glück, R. (2008) · LISP and Symbolic Computation · doi:10.1007/s10990-008-9033-5 · Cited by 3
Self-citationStrengthening supercompilation for call-by-value languages
Jönsson, P., & Nordlander, J. (2010) · Cited by 3
Measuring the Propagation of Information in Partial Evaluation
Rohde, H. K. (2005) · BRICS Report Series · doi:10.7146/brics.v12i26.21893 · Cited by 3
Supercompilation: main principles and basic conceptsPreprint
Klimov, A. V., & Romanenko, S. A. (2018) · Keldysh Institute Preprints · doi:10.20948/prepr-2018-111 · Cited by 3
Self-citationFast Partial Evaluation of Pattern Matching in Strings
Ager, M. S., Olivier Danvy, A., & Rohde, H. K. (2003) · BRICS Report Series · doi:10.7146/brics.v10i20.21790 · Cited by 3
Reduction of Language Hierarchies
Glück, R., & Klimov, A. V. (2008) · Cited by 2
Self-citationSpecifying Monogenetic Specializers by Means of a Relation Between Source and Residual Programs
Klimov, A. V. (2007) · Springer eBooks · doi:10.1007/978-3-540-70881-0_22 · Cited by 2
Self-citationTowards a Framework for Building Formally Verified Supercompilers in Coq
Krustev, D. N. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40447-4_9 · Cited by 1
A partial evaluation tool for multi-paradigm declarative languages
Vidal, G. (2005) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2002.1167972 · Cited by 1
Automatic generation of very efficient programs by Generalized Partial Computation
Futamura, Y., Konishi, Z., & Glück, R. (2001) · Wuhan University Journal of Natural Sciences · doi:10.1007/bf03160221 · Cited by 1
Self-citationSoftware test generation using refinement types
Krustev, D. N. (2003) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.1999.802321 · Cited by 1
A program specialization relation based on supercompilation and its
Klimov, A. V. (2008) · Cited by 1
Self-citationMaximally-Polyvariant Partial Evaluation in Polynomial Time
Glück, R. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-41579-6_11 · Cited by 1
Self-citationNullness Analysis of Java Bytecode via Supercompilation over Abstract Values
Klyuchnikov, I. G. (2012) · Cited by 1
Supercompilation for Datatypes
Mogensen, T. Æ. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46823-4_19 · Cited by 1
Specialization of imperative programs through analysis of relational expressions
Sakharov, A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_21 · Cited by 1
Inverse computation and the Universal Resolving Algorithm
Abramov, S., & Glück, R. (2001) · Wuhan University Journal of Natural Sciences · doi:10.1007/bf03160224 · Cited by 1
Self-citationOn the Place of Supercompilation inside Program Specialization
Nemytykh, A. P. (2007) · Cited by 1
Partial Evaluation of Pattern Matching in Strings, revisited
Grobauer, B., & Lawall, J. (2000) · BRICS Report Series · doi:10.7146/brics.v7i31.20165 · Cited by 1
Fast Partial Evaluation of Pattern Matching in Strings
Ager, M. S., Olivier Danvy, A., & Rohde, H. K. (2004) · BRICS Report Series · doi:10.7146/brics.v11i40.21865 · Cited by 1
XSG: Fair Language with Built-in Equality
Klimov, Y. A., & Yu, A. (2007) · Cited by 1
Automatic generation of a boyer-moore lype pattern matcher by generalized partial computation
Futamura, Y., Konishi, Z., & Glück, R. (2005) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2002.1167973
Self-citationDesign, Analysis and Reasoning about Tools: Abstracts from the Third Workshop
Nielson, F. (1993) · DAIMI Report Series · doi:10.7146/dpb.v22i457.6930
Fioravanti, F., Pettorossi, A., & Proietti, M. (2002)
Thiemann, P. J. (1994) · Leitfäden der Informatik · doi:10.1007/978-3-322-89207-2_6
Reverse Universal Resolving Algorithm and inverse driving
Pécseli, T. (2011) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2011.12.002
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
Pettorossi, A., Proietti, M., & Renault, S. (2008) · Springer eBooks · doi:10.1007/978-1-4020-6585-9_12
Metadata
- Authors
- Glück, R., & Klimov, A. V.
- Affiliations
- TU Wien (AT)
- Russian Academy of Sciences (RU)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1993
- Pages
- 112-123
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2162352259
- Cited by
- 106
- References
- 19
- Citations by year
- 2020: 1 · 2018: 1 · 2016: 1 · 2015: 1 · 2013: 2 · 2012: 1
- FWCI
- 8.93
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Research at the University of Copenhagen (University of Copenhagen) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- supercompilation, constant propagation, pattern matching, Knuth-Morris-Pratt algorithm, program specialization, program transformation
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
