The DOI matches its Crossref record; 14 of the 15 references it cites were found in a registry or an index.
New hash functions and their use in authentication and set equality
Open accessOverview
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
“This kind of extractor is also a strong extractor. 101”
From Quantum random number generation (2016) · cites this paper as [101]
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,539
Self-citationExtendible hashing—a fast access method for dynamic files
Fagin, R., Nievergelt, J., Pippenger, N. J., & Strong, H. R. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320092 · Cited by 669
Gilbert, E. N., Macwilliams, F. J., & Sloane, N. J. A. (1974) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1974.tb02751.x · Cited by 373
On Digital Signatures and Public-Key Cryptosystems.
Rivest, R. L., Adi Shamir, Z., & Adleman, L. (1977) · Defense Technical Information Center (DTIC) · Cited by 179
Exact and approximate membership testers
Carter, L., Floyd, R. W., Gill, J. T., III, Markowsky, G., & Wegman, M. N. (1978) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800133.804332 · Cited by 138
Self-citationOn taking roots in finite fields
Adleman, L. M., Manders, K. L., & Miller, G. L. (1977) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1977.18 · Cited by 119
Proceedings of the tenth annual ACM symposium on Theory of computing
Lipton, R. J., Burkhard, W. A., Savitch, W. J., Friedman, E. P., & Aho, A. (1978) · Cited by 71
Proceedings of the eleventh annual ACM symposium on Theory of computing
Fischer, M. J., DeMillo, R. A., Lynch, N. A., Burkhard, W. A., & Aho, A. V. (1979) · Cited by 44
Gilles Brassard, A. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.36 · Cited by 37
Cited by
Sorted by citations
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
The security of practical quantum key distribution
Scarani, V., Bechmann-Pasquinucci, H., Cerf, N. J., Dušek, M., Lütkenhaus, N., & Peev, M. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.1301 · Cited by 3,870
Quantum cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,069
Naor, M., & Adi Shamir, Z. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053419 · Cited by 2,452
Secret key agreement by public discussion from common information
Maurer, U. M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256484 · Cited by 1,971
Wireless Information-Theoretic Security
Bloch, M. R., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921908 · Cited by 1,853
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Ostrovsky, R., Reyzin, L., & Smith, A. (2008) · SIAM Journal on Computing · doi:10.1137/060651380 · Cited by 1,708
Experimental quantum cryptography
Bennett, C. H., Bessette, F., Gilles Brassard, A., Salvail, L., & Smolin, J. A. (1992) · Journal of Cryptology · doi:10.1007/bf00191318 · Cited by 1,672
Generalized privacy amplification
Bennett, C. H., Gilles Brassard, A., Crépeau, C., & Maurer, U. M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476316 · Cited by 1,426
(2016) · IACR Cryptology ePrint Archive · Cited by 1,288
SECURITY OF QUANTUM KEY DISTRIBUTION
Renner, R. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003256 · Cited by 1,160
Quantum nonlocality without entanglement
Bennett, C. H., Divincenzo, D. P., Fuchs, C. A., Mor, T., Rains, E. M., Shor, P. W., Smolin, J. A., & Wootters, W. K. (1999) · Physical Review A · doi:10.1103/physreva.59.1070 · Cited by 1,168
Unconditional security in quantum cryptography
Mayers, D. (2001) · Journal of the ACM · doi:10.1145/382780.382781 · Cited by 1,113
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. M. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73011 · Cited by 960
Experimental Quantum Cryptography
Bennett, C. H., Bessette, F., Gilles Brassard, A., Salvail, L., & Smolin, J. A. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_23 · Cited by 958
Chosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. I. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_13 · Cited by 912
Privacy Amplification by Public Discussion
Bennett, C. H., Brassard, G., & Robert, J. (1988) · SIAM Journal on Computing · doi:10.1137/0217014 · Cited by 859
A secure and efficient conference key distribution system
Burmester, M. V. D., & Desmedt, Y. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053443 · Cited by 846
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Cramer, R., & Shoup, V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_4 · Cited by 841
Quantum random number generators
Herrero-Collantes, M., & García-Escartín, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 850
Przydatek, B., Song, D. X., & Perrig, A. (2003) · ACM Conference on Embedded Networked Sensor Systems (SenSys) · doi:10.1145/958491.958521 · Cited by 786
Secret-Key Reconciliation by Public Discussion
Gilles Brassard, A., & Salvail, L. (2007) · Springer eBooks · doi:10.1007/3-540-48285-7_35 · Cited by 779
Bowers, K. D., Juels, A., & Oprea, A. (2009) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1653662.1653686 · Cited by 749
Security against individual attacks for realistic quantum key distribution
Lütkenhaus, N. (2000) · Physical Review A · doi:10.1103/physreva.61.052304 · Cited by 741
Fiat, A., & Naor, M. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_40 · Cited by 731
Physical-Layer Security: From Information Theory to Security Engineering
Bloch, M. R., & Barros, J. (2011) · CERN Document Server (European Organization for Nuclear Research) · Cited by 695
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. R. (2008) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 640
The Security of the Cipher Block Chaining Message Authentication Code
Mihir Bellare, Y., Kilian, J., & Rogaway, P. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1694 · Cited by 597
The Secure Real-time Transport Protocol (SRTP)
Baugher, M., McGrew, D. A., Näslund, M., Carrara, E., & Norrman, K. (2004) · doi:10.17487/rfc3711 · Cited by 580
The Security and Performance of the Galois/Counter Mode (GCM) of Operation
McGrew, D. A., & Viega, J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30556-9_27 · Cited by 530
Krishnamurthy, B., Sen, S. B., Zhang⋆, Y., & Chen, Y. (2003) · ACM Internet Measurement Conference (IMC) · doi:10.1145/948205.948236 · Cited by 528
Information-theoretic security proof for quantum-key-distribution protocols
Renner, R., Gisin, N., & Kraus, B. (2005) · Physical Review A · doi:10.1103/physreva.72.012332 · Cited by 521
Practical free-space quantum key distribution over 10 km in daylight and at night
Hughes, R., Nordholt, J. E., Derkacs, D., & Peterson, C. G. (2002) · New Journal of Physics · doi:10.1088/1367-2630/4/1/343 · Cited by 500
LFSR-based Hashing and Authentication
Krawczyk, H. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_15 · Cited by 492
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
Coron, J.-S., Mandal, A., Naccache, D., & Tibouchi, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_28 · Cited by 469
Chor, B., Fiat, A., & Naor, M. (1994) · International Cryptology Conference · Cited by 468
Counting Distinct Elements in a Data Stream
Bar-Yossef, Z., Jayram, T. S., Kumar, R., Sivakumar, D., & Trevisan, L. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45726-7_1 · Cited by 466
Quantum random number generation
Ma, X., Yuan, X., Cao, Z., Qi, B., & Zhang, Z. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.21 · Cited by 445
On the Composition of Zero-Knowledge Proof Systems
Goldreich, O., & Krawczyk, H. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539791220688 · Cited by 423
Information-Theoretically Secret Key Generation for Fading Wireless Channels
Ye, C., Mathur, S., Reznik, A., Shah, Y., Trappe, W. K., & Mandayam, N. B. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2043187 · Cited by 417
Chosen‐Ciphertext Security from Identity‐Based Encryption
Boneh, D., Canetti, R., Halevi, S., & Katz, J. I. (2006) · SIAM Journal on Computing · doi:10.1137/s009753970544713x · Cited by 415
Concise security bounds for practical decoy-state quantum key distribution
Lim, C. C. W., Curty, M., Walenta, N., Xu, F., & Zbinden, H. (2014) · Physical Review A · doi:10.1103/physreva.89.022307 · Cited by 405
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 475
Designing programs that check their work
Blum, M., & Kannan, S. (1995) · Journal of the ACM · doi:10.1145/200836.200880 · Cited by 394
UMAC: Fast and Secure Message Authentication
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., & Rogaway, P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_14 · Cited by 392
A New Randomness Extraction Paradigm for Hybrid Encryption
Kiltz, E., Pietrzak, K., Stam, M., & Yung, M. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01001-9_34 · Cited by 388
Long-term performance of the SwissQuantum quantum key distribution network in a field environment
Stucki, D., Legré, M., Buntschu, F., Clausen, B., Felber, N., Gisin, N., Henzen, L., Junod, P., Litzistorf, G., Monbaron, P., et al. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/12/123001 · Cited by 348
Private randomness expansion with untrusted devices
Colbeck, R., & Kent, A. (2011) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/44/9/095305 · Cited by 379
Chor, B., Fiat, A., & Naor, M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-48658-5_25 · Cited by 366
The Poly1305-AES Message-Authentication Code
Bernstein, D. J. (2005) · Lecture notes in computer science · doi:10.1007/11502760_3 · Cited by 364
Renner, R., & Cirac, J. I. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110504 · Cited by 364
Scarani, V., & Renner, R. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.200501 · Cited by 356
New Proofs for NMAC and HMAC: Security Without Collision-Resistance
Mihir Bellare, Y. (2006) · Lecture notes in computer science · doi:10.1007/11818175_36 · Cited by 348
Collision Free Hash Functions and Public Key Signature Schemes
Damgård, I. (2010) · Lecture notes in computer science · doi:10.1007/3-540-39118-5_19 · Cited by 339
Mehić, M., Niemiec, M., Raß, S., Ma, J., Peev, M., Aguado, A., Martín, V., Schauer, S., Poppe, A., Pacher, C., et al. (2020) · ACM Computing Surveys · doi:10.1145/3402192 · Cited by 340
Universally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
Quantum key distribution and 1 Gbps data encryption over a single fibre
Eraerds, P., Walenta, N., Legré, M., Gisin, N., & Zbinden, H. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/6/063027 · Cited by 330
The Galois/Counter Mode of Operation (GCM)
McGrew, D. A., & Viega, J. (2005) · Cited by 332
Chernoff–Hoeffding Bounds for Applications with Limited Independence
Schmidt, J. P., Siegel, A. R., & Srinivasan, A. (1995) · SIAM Journal on Discrete Mathematics · doi:10.1137/s089548019223872x · Cited by 317
SIA: Secure information aggregation in sensor networks
Chan, H., Perrig, A., Przydatek, B., & Song, D. X. (2007) · Journal of Computer Security · doi:10.3233/jcs-2007-15104 · Cited by 309
Secure Hybrid Encryption from Weakened Key Encapsulation
Hofheinz, D., & Kiltz, E. (2007) · Springer eBooks · doi:10.1007/978-3-540-74143-5_31 · Cited by 305
Chor, B., Fiat, A., Naor, M., & Benny Pinkas, B. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841169 · Cited by 304
Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs
Manzoor, E., Milajerdi, S. M., & Akoglu, L. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939783 · Cited by 325
High rate, long-distance quantum key distribution over 250 km of ultra low loss fibres
Stucki, D., Walenta, N., Vannel, F., Thew, R., Gisin, N., Zbinden, H., Gray, S., Towery, C. R., & Ten, S. Y. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/7/075003 · Cited by 299
Universal hashing and authentication codes
Stinson, D. R. (1994) · Designs Codes and Cryptography · doi:10.1007/bf01388651 · Cited by 292
Designing programs that check their work
Blum, M., & Kanna, S. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73015 · Cited by 287
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
Naor, M., & Reingold, O. (1999) · Journal of Cryptology · doi:10.1007/pl00003817 · Cited by 285
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption
Boneh, D., & Katz, J. I. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_8 · Cited by 284
Authentication of quantum messages
Barnum, H., Crépeau, C., Gottesman, D., Smith, A., & Tapp, A. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181969 · Cited by 283
A Block-Cipher Mode of Operation for Parallelizable Message Authentication
Black, J., & Rogaway, P. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_25 · Cited by 274
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 270
Security of quantum key distribution
Renner, R. (2005) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005115027 · Cited by 263
Optical networking for quantum key distribution and quantum communications
Chapuran, T. E., Toliver, P., Peters, N. A., Jackel, J., Goodman, M. S., Runser, R. J., McNown, S. R., Dallmann, N. A., Hughes, R., McCabe, K. P., et al. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/10/105001 · Cited by 249
Entropy measures and unconditional security in cryptography
Cachin, C. (1997) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-001806220 · Cited by 249
Efficient generation of shared RSA keys
Boneh, D., & Franklin, M. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052253 · Cited by 245
Vadhan, S. (2012) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000010 · Cited by 343
Graph-Induced Multilinear Maps from Lattices
Gentry, C., Gorbunov, S., & Halevi, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46497-7_20 · Cited by 237
Boldyreva, A., Fehr, S., & O’Neill, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_19 · Cited by 229
Wang, X., Zhang, Y., Yu, S., & Guo, H. M. (2018) · IEEE photonics journal · doi:10.1109/jphot.2018.2824316 · Cited by 233
Peters, N. A., Toliver, P., Chapuran, T. E., Runser, R. J., McNown, S. R., Peterson, C. G., Rosenberg, D., Dallmann, N. A., Hughes, R., McCabe, K. P., et al. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/4/045012 · Cited by 231
A complexity theory of efficient parallel algorithms
Kruskal, C. P., Rudolph, L., & Snir, M. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90192-k · Cited by 229
Ultrafast quantum random number generation based on quantum phase fluctuations
Xu, F., Qi, B., Ma, X., Xu, H., Zheng, H., & Lo, H.-K. (2012) · Optics Express · doi:10.1364/oe.20.012366 · Cited by 228
The Universal Composable Security of Quantum Key Distribution
Ben-Or, M., Horodecki, M., Leung, D. W., Mayers, D., & Oppenheim, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_21 · Cited by 227
Using quantum key distribution for cryptographic purposes: A survey
Alléaume, R., Branciard, C., Bouda, J., Debuisschert, T., Dianati, M., Gisin, N., Godfrey, M. S., Grangier, P., Länger, T., Lütkenhaus, N., et al. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.09.018 · Cited by 252
Estimates for practical quantum cryptography
Lütkenhaus, N. (1999) · Physical Review A · doi:10.1103/physreva.59.3301 · Cited by 219
Collision-Resistant hashing: Towards making UOWHFs practical
Mihir Bellare, Y., & Rogaway, P. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052256 · Cited by 216
MDx-MAC and Building Fast MACs from Hash Functions
Bart Preneel, A., & van Oorschot, P. C. (1995) · Lecture notes in computer science · doi:10.1007/3-540-44750-4_1 · Cited by 213
SipHash: A Fast Short-Input PRF
Aumasson, J.-P., & Bernstein, D. J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34931-7_28 · Cited by 211
On Fast and Provably Secure Message Authentication Based on Universal Hashing
Shoup, V. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_24 · Cited by 211
Indistinguishability of Random Systems
Maurer, U. M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_8 · Cited by 208
Quantum Communication Using Semiconductor Quantum Dots
Vajner, D. A., Rickert, L., Gao, T., Kaymazlar, K., & Heindel, T. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100116 · Cited by 225
Pseudorandom functions revisited: the cascade construction and its concrete security
Mihir Bellare, Y., Canetti, R., & Krawczyk, H. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1996.548510 · Cited by 213
Practical issues in quantum-key-distribution postprocessing
Fung, C. F., Ma, X., & Chau, H. F. (2010) · Physical Review A · doi:10.1103/physreva.81.012318 · Cited by 207
Combinatorial Aspects of Covering Arrays
Colbourn, C. J. (2004) · Le Matematiche · Cited by 203
Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
Mouha, N., Mennink, B., Herrewege, A. V., Watanabe, D., Bart Preneel, A., & Verbauwhede, I. M. R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13051-4_19 · Cited by 204
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
Chaum, D., van Heijst, E., & Pfitzmann, B. (1992) · Lecture notes in computer science · doi:10.1007/3-540-46766-1_38 · Cited by 199
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
Mayers, D. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_26 · Cited by 202
Comparing information without leaking it
Fagin, R., Naor, M., & Winkler, P. M. (1996) · Communications of the ACM · doi:10.1145/229459.229469 · Cited by 200
Daylight Quantum Key Distribution over 1.6 km
Buttler, W. T., Hughes, R., Lamoreaux, S. K., Morgan, G. L., Nordholt, J. E., & Peterson, C. G. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.5652 · Cited by 195
Metadata
- Authors
- Wegman, M. N., & Carter, J. L.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1981-06
- Volume
- 22
- Issue
- 3
- Pages
- 265-279
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1985623009
- Cited by
- 1,402
- References
- 15
- Citations by year
- 2026: 44 · 2025: 45 · 2024: 52 · 2023: 34 · 2022: 48 · 2021: 43 · 2020: 57 · 2019: 39 · 2018: 42 · 2017: 59 · 2016: 57 · 2015: 51 · 2014: 55 · 2013: 60 · 2012: 59
- FWCI
- 2.80
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Journal of Computer and System Sciences (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- hash functions, authentication, message authentication, probabilistic data structures
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