Analysis of Area-Efficiency vs. Unrolling for eSTREAM Hardware Portfolio Stream Ciphers
Open accessThe DOI matches its Crossref record; 20 of the 21 references it cites were found in a registry or an index; none of the 11 sources its claims cite is checked for support yet.
Abstract
The demand for low resource devices has increased rapidly due to the advancements in Internet-of-things applications. These devices operate in environments that have limited resources. To ensure security, stream ciphers are implemented on hardware due to their speed and simplicity. Amongst different stream ciphers, the eSTREAM ciphers stand due to their frugal implementations. This work probes the effect of unrolling on the efficiency of eSTREAM ciphers, including Trivium, Grain (Grain 80 and Grain 128) and MICKEY (MICKEY 2.0 and MICKEY-128 2.0). It addresses the question of optimal unrolling for designing high-performance stream ciphers. The increase in the area consumption is also bench-marked. The analysis is conducted to identify efficient design principles for ciphers. We experimentally show that the resulting performance after unrolling may disagree with the theoretical prediction when the effects of technology library are considered. We report pre-layout synthesis results on 65 and 130 nm ASIC technology as well as synthesis results for Xilinx FPGA platform in support of our claim. Based on our findings, cipher design and implementation suggestions are proposed to aid hardware designers. Furthermore, we explore why and where area-efficiency for these ciphers saturate.
Overview
CoChat Summary
TL;DR
This paper benchmarks how loop unrolling affects area-efficiency of eSTREAM hardware portfolio stream ciphers (Trivium, Grain-80/128, MICKEY 2.0/MICKEY-128 2.0) using 65/130 nm ASIC and Xilinx FPGA synthesis. It finds that unrolling does not always improve efficiency as theory predicts; MICKEY 2.0 peaks at 2×, Trivium saturates around 64–72× under throughput-driven synthesis, and ASIC/FPGA technology effects cause deviations.
Key findings
- MICKEY 2.0: TPAR is highest at 2× unrolling (373 Kbps/Gates; area 5360 gates, 2.0 Gbps at 1.0 GHz) and drops for 3×, 4×, and 8× (353, 302, 299 Kbps/Gates, respectively). MICKEY-128 2.0 instead shows rising TPAR with unroll factor (258 to 442 Kbps/Gates from 1× to 8×).
- Grain: TPAR improves as unrolling increases; the paper reports Grain-80 ×16 and Grain-128 ×32 as the most efficient unrolled versions (65 nm Grain-80 ×16: 3047.75 GE, 16 Gbps, 5.25 Mbps/GE; Grain-128 ×32: 5392.25 gates, 32 Gbps, 5.93 Mbps/Gates).
- Trivium: area-efficiency stops growing around unrolling factor 64–72 under throughput-driven synthesis (65 nm: 64× = 45.98 Gbps/KGates, 72× = 41.89; 130 nm: 64× = 17.67, 72× = 16.66). But with a 500 MHz target on 130 nm, area-efficiency continued growing beyond 64× (7.41 and 10.05 Gbps/KGates for 64× and 128×).
- Theory vs practice: predicted area-efficiency gain matched FPGA target well but deviated for ASIC; the theoretical prediction was “too optimistic compared to the ASIC technology library and too pessimistic compared to the FPGA technology library.” Saturation model: relative efficiency = (C/S + 1)/(C/S + 1/n), so lower combinational-to-storage ratio C/S gives sharper growth and later saturation.
Methods
- The authors implemented the eSTREAM hardware portfolio ciphers in HDL and unrolled them by various factors: MICKEY 2.0 for n = 2, 3, 4, 8; Grain-80 up to 16× and Grain-128 up to 32×; Trivium up to 128× (with detailed ASIC tables through 128× and FPGA through 32×).
- Synthesis used Synopsys Design Compiler H-2013.03-SP1 with compile_ultra, throughput maximization, max_area = 0, frequency scaled until clock constraint failure, and area reported in equivalent NAND gates. ASIC targets: Faraday UMC 65 nm SP/RVT Low-K (1.1 V, -40°C) and Faraday UMC 130 nm high-speed FSG (1.2 V, 25°C). FPGA targets: Xilinx Spartan6 XC6SLX45 with ISE 14.3, balanced goal, 100 MHz; Grain tables also use Xilinx Virtex7 XC7vx330t.
- Main analysis compares throughput/area (TPAR) and relative area-efficiency across unroll factors, and compares practical synthesis results against a theoretical prediction based on counting Boolean functions and approximating them with equivalent NAND gates.
Limitations
- Stated: the paper uses pre-layout synthesis results, and it notes that pre-layout synthesis does not accurately model buffer insertion; it also lists imprecise modeling factors including cell selection, increased driving load, interconnect/buffer insertion, ASIC vs. FPGA technology differences, and design constraints/synthesis options.
- Stated future work: extend the unrolling methodology to other prominent stream ciphers, add countermeasures against side-channel analysis attacks, and explore loop pipelining.
- Evident from the text: some reported values appear inconsistent or typo-prone (e.g., MICKEY-128 2.0 area is listed as 93–119 gates, and a sentence refers to “Grain-80 ×32” for Grain-128), which limits confidence in those specific numbers.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 7 Not valid · 9 Not checked · 45 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Consequently, no improvement is observed in area efficiency.”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 4.4. Unrolling Grain-80/128
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For unrolled versions, the number of outputs for several registers increases.”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 5.1. Effect of Cell Selection
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A similar trend of improvement in area efficiency can be seen for FPGA synthesis results as can be seen in Tables 8 and 9 for Grain-80 and Grain-128, respectively.”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 4.4.1. Unrolled Design Synthesis for Grain-80/128
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We experimentally show that the resulting performance after unrolling may disagree with the theoretical prediction when the effects of technology library are considered.”
- Also stated in: § 4.4.1. Unrolled Design Synthesis for Grain-80/128 · plain
“This is reflected in the experimental results presented in the Tables 101112.”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > Abstract
plainstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § 4.4.1. Unrolled Design Synthesis for Grain-80/128 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It can be observed from the Figure 5 that, the predicted gain in area-efficiency matches well with the FPGA target technology.”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 4.4.1. Unrolled Design Synthesis for Grain-80/128
boostedstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
25 more claims
Create a free account to see all 61 claims and every source verdict.
- Borderline: one of the tests for a substantial claim is unclear. 1
- It may state two separate claims as one. 13
- Probably not a substantial claim. 22
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
“| 2 | 618.77 | 81 | 139 | 158 | 1392.85 | 10.02 | 8.81 |”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 7. Conclusions
Reported 1392.85 · recomputed 1237.54
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
“| 4 | 618.77 | 41 | 151 | 190 | 2785.71 | 18.44 | 14.66 |”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 7. Conclusions
Reported 2785.71 · recomputed 2475.08
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
“| 16 | 595.09 | 11 | 223 | 403 | 11,142.83 | 49.97 | 27.65 |”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 7. Conclusions
Reported 11142.83 · recomputed 9521.44
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
“| 8 | 606.87 | 21 | 175 | 261 | 5571.42 | 31.84 | 21.35 |”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 7. Conclusions
Reported 5571.42 · recomputed 4854.96
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 4.4.1. Unrolled Design Synthesis for Grain-80/128
“Consequently, Grain-80 × 16 and Grain-80 × 32 are the most efficient unrolled versions of Grain-80 and Grain-128, respectively.”
§ Analysis of area-efficiency vs. unrolling for eSTREAM hardware portfolio stream ciphers > 4.4. Unrolling Grain-80/128
“For Grain-80, L can be taken as any factor of 160 up to 16 (where 160 is the state size for Grain-80, ref.Table 1).”
Citations
Cites
Grain: A stream cipher for constrained environments
Hell, M., Johansson, T., & Meier, W. (2007) · International Journal of Wireless and Mobile Computing · doi:10.1504/ijwmc.2007.013798 · Cited by 568 · cited 3×
“The keysize of Grain-80 [7] is 80 bits whereas the initialization vector (IV) is of 64 bits.”
BackgroundMethodPerformance optimization of VLSI interconnect layout
Cong, J., He, L., Koh, C.-K., & Madden, P. H. (1996) · Integration · doi:10.1016/s0167-9260(96)00008-9 · Cited by 334
A Stream Cipher Proposal: Grain-128
Hell, M., Johansson, T., Maximov, A., & Meier, W. (2006) · 2006 IEEE International Symposium on Information Theory · doi:10.1109/isit.2006.261549 · Cited by 279 · cited 1×
“The hardware portfolio comprised of Grain (Now Grain Family: Grain-128AEAD [4], Grain-128a [5], Grain-128 [6], and Grain v.1 [7] ciphers for constrained computing environments) MICKEY [8] and Trivium [9] stream cipher proposals.”
MethodNew Stream Cipher Designs: The eSTREAM Finalists
(2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3 · Cited by 263
Grain-128a: A new version of Grain-128 with optional authentication
Ågren, M., Hell, M., Johansson, T., & Meier, W. (2011) · International Journal of Wireless and Mobile Computing · doi:10.1504/ijwmc.2011.044106 · Cited by 228 · cited 2×
“The hardware portfolio comprised of Grain (Now Grain Family: Grain-128AEAD [4], Grain-128a [5], Grain-128 [6], and Grain v.1 [7] ciphers for constrained computing environments) MICKEY [8] and Trivium [9] stream cipher proposals.”
BackgroundBabbage, S., & Dodd, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_15 · Cited by 143 · cited 2×
“1 [7] ciphers for constrained computing environments) MICKEY [8] and Trivium [9] stream cipher proposals.”
BackgroundMethodStream cipher designs: a review
Jiao, L., Hao, Y., & Feng, D. (2020) · Science China Information Sciences · doi:10.1007/s11432-018-9929-x · Cited by 67 · cited 1×
“preferred due to their speed and simplicity [2].”
BackgroundConditional Differential Cryptanalysis of Trivium and KATAN
Knellwolf, S., Meier, W., & Naya-Plasencia, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28496-0_12 · Cited by 66 · cited 1×
“Although the security of Trivium was criticized in [13], most importantly they are considered to be secure as there are no successful cryptanalytic attacks till date on Trivium [14], MICKEY [15], and Grain [16]).”
BackgroundA survey on lightweight ciphers for IoT devices
Philip, M. A., & Vaithiyanathan (2017) · 2017 International Conference on Technological Advancements in Power and Energy ( TAP Energy) · doi:10.1109/tapenergy.2017.8397271 · Cited by 65 · cited 2×
“In [1], authors discuss the efficiency of stream ciphers Trivium, Grain and Mickey.”
BackgroundMethodFPGA-based performance analysis of stream ciphers ZUC, Snow3g, Grain V1, Mickey V2, Trivium and E0
Kitsos, P., Sklavos, N., Provelengios, G., & Skodras, A. N. (2012) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2012.09.007 · Cited by 58 · cited 1×
“In the work [21], six different stream cipher algorithms are implemented for comparison using the Xilinx Spartan XC3S700A-4FG484 device.”
MethodComparison of the hardware architectures and FPGA implementations of stream ciphers
Galanis, M. D., Kitsos, P., Kostopoulos, G., Sklavos, N., Koufopavlou, O., & Goutis, C. E. (2005) · Proceedings of the 2004 11th IEEE International Conference on Electronics, Circuits and Systems, 2004. ICECS 2004. · doi:10.1109/icecs.2004.1399745 · Cited by 43 · cited 1×
“These ciphers have two phases for initialization namely, key/IV setup, randomization, followed by the key-stream generation [23].”
BackgroundAn AEAD Variant of the Grain Stream Cipher
Hell, M., Johansson, T., Meier, W., Sönnerup, J., & Yoshida, H. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-16458-4_5 · Cited by 34 · cited 2×
“The hardware portfolio comprised of Grain (Now Grain Family: Grain-128AEAD [4], Grain-128a [5], Grain-128 [6], and Grain v.1 [7] ciphers for constrained computing environments) MICKEY [8] and Trivium [9] stream cipher proposals.”
BackgroundFPGA implementations of Grain v1, Mickey 2.0, Trivium, Lizard and Plantlet
Li, B., Liu, M., & Lin, D. (2020) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2020.103210 · Cited by 32 · cited 1×
“A new FPGA implementation approach is proposed in the work in [22].”
MethodUnrolling Cryptographic Circuits: A Simple Countermeasure Against Side-Channel Attacks
Bhasin, S., Guilley, S., Sauvage, L., & Danger, J.-L. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11925-5_14 · Cited by 30 · cited 1×
“The unrolled hardware implementations are less vulnerable to side-channel analysis (SCA) attacks since they execute multiple rounds in every clock cycle and hence require a stronger hypothesis for cryptanalysis on multiple values due to deeper diffusion of the secret state [17].”
BackgroundTowards Low Energy Stream Ciphers
Banik, S., Mikhalev, V., Armknecht, F., Isobe, T., Meier, W., Bogdanov, A., Watanabe, Y., & Regazzoni, F. (2018) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2018.i2.1-19 · Cited by 30
Designing integrated accelerator for stream ciphers with structural similarities
Sen Gupta, S., Chattopadhyay, A., & Khalid, A. (2013) · Cryptography and Communications · doi:10.1007/s12095-012-0074-6 · Cited by 28
Self-citationResearch of cross-platform stream symmetric ciphers implementation
Kuznetsov, A. A., Frolenko, V., Eremin, E., et al. (2018) · IEEE International Conference on Dependable Systems, Services and Technologies (DESSERT) · doi:10.1109/dessert.2018.8409148 · Cited by 20 · cited 1×
“The performance of these stream cipher algorithms is further analysed in [19] by conducting simulations using Java programming language.”
MethodCryptanalysis of MICKEY family of stream ciphers
Ding, L., & Guan, J. (2013) · Security and Communication Networks · doi:10.1002/sec.637 · Cited by 16 · cited 1×
“Although the security of Trivium was criticized in [13], most importantly they are considered to be secure as there are no successful cryptanalytic attacks till date on Trivium [14], MICKEY [15], and Grain [16]).”
BackgroundOrdóñez, F. E. P., Jimenez-Fernandez, C. J., & Valencia, M. (2016) · Conference on Design of Circuits and Integrated Systems · doi:10.1109/dcis.2016.7845270 · Cited by 9 · cited 1×
“Although the security of Trivium was criticized in [13], most importantly they are considered to be secure as there are no successful cryptanalytic attacks till date on Trivium [14], MICKEY [15], and Grain [16]).”
BackgroundCryptanalysis of the Grain Family of Ciphers: A Review
Hridya, P. R., & Jose, J. (2019) · International Conference on Communications and Signal Processing (ICCSP) · doi:10.1109/iccsp.2019.8697972 · Cited by 7 · cited 1×
“Although the security of Trivium was criticized in [13], most importantly they are considered to be secure as there are no successful cryptanalytic attacks till date on Trivium [14], MICKEY [15], and Grain [16]).”
Background
Research works printed but not linked: 7
- Hwang, D., Chaney, M., Karanam, S., Ton, N., and Gaj, K. (2008, January 13–14). Comparison of FPGA-targeted hardware implementations of eSTREAM stream cipher candidates. Proceedings of the ECRYPT State of the Art of Stream Ciphers, Lausanne, Switzerland.
- Good, T., Chelton, W., and Benaissa, M. (2006, January 2–3). Review of stream cipher candidates from a low resource hardware perspective. Proceedings of the SASC 2006 Stream Ciphers Revisit, Leuven, Belgium.
- Gaj, K., Southern, G., and Bachimanchi, R. (February, January 31). Comparison of hardware performance of selected Phase II eSTREAM candidates. Proceedings of the State Art Stream Ciphers Workshop (SASC), Bochum, Germany.
- Robshaw, M., and Billet, O. (2008). The Grain Family of Stream Ciphers. New Stream Cipher Designs: The eSTREAM Finalists, Springer. · DOI · Paper page
- Babbage, S., and Dodd, M. (2006). The stream cipher MICKEY 2.0. ECRYPT Stream Cipher, Springer.
- Robshaw, M., and Billet, O. (2008). Trivium. New Stream Cipher Designs: The eSTREAM Finalists, Springer. · DOI · Paper page
- Stefan, D., and Mitchell, C. (2008, January 13–14). On the parallelization of the MICKEY-128 2.0 stream cipher. Proceedings of the ECRYPT State of the Art of Stream Ciphers, Lausanne, Switzerland.
Cited by
An exhaustive review of the stream ciphers and their performance analysis
Ananth, R., & Ramaiah, N. S. (2024) · International Journal of Reconfigurable and Embedded Systems (IJRES) · doi:10.11591/ijres.v13.i2.pp360-371 · Cited by 10
The Implementaion of MICKEY Cipher in Securing Constrained Devices Based on LoRa
Limas, F. B., Kusyanti, A., & Primananda, R. (2023) · International Conference on Sustainable Information Engineering and Technology (SIET) · doi:10.1145/3626641.3627018 · Cited by 1
“The reason for selecting this algorithm for implementing security in LoRa is that no successful cryptanalysis attacks have been reported on this algorithm as shown in [9].”
MethodAnanth, R., Rao, M. V. P., & Ramaiah, N. S. (2024) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v33.i1.pp218-226 · Cited by 3
Yengil vaznli kriptografik algoritmlarda foydalanilgan chiziqsiz akslantirishlash tahlili
Xudoykulov, Z., & Rahmatullayev, I. R. (2024) · Международный Журнал Теоретических и Прикладных Вопросов Цифровых Технологий · doi:10.62132/ijdt.v7i2.181 · Cited by 1
“Bundan tashqari, [11,12] larda eSTREAM loyihasi algoritmlarining apparat amalga oshirish va kriptotahlil usullariga baholash masalasi ko‘rib o‘tilgan.”
BackgroundChua-oscillator-driven modified RC4 stream cipher and its FPGA prototyping for secure communication
Sharma, N., Kumar, P., Rai, S. K., & Patel, S. K. (2026) · Integration · doi:10.1016/j.vlsi.2026.102723
Metadata
- Authors
- Alharbi, F., Hameed, M. K., Chowdhury, A., Khalid, A., Chattopadhyay, A., & Javed, I. T.
- Affiliations
- Shaqra University (SA)
- Bahria University (PK)
- Indian Institute of Technology Kanpur (IN)
- Queen's University Belfast (GB)
- Nanyang Technological University (SG)
- University of Limerick (IE)
- Corresponding author
- Javed, Ibrahim Tariq
- Venue
- Electronics
- Publisher
- MDPI AG
- Published
- 2020-11-17
- Volume
- 9
- Issue
- 11
- Pages
- 1935
- ISSN
- 2079-9292 (ISSN-L)
- OpenAlex
- W3099940110
- Cited by
- 5
- References
- 21
- Citations by year
- 2026: 1 · 2024: 3 · 2023: 1
- FWCI
- 0.13
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Electronics (publishedVersion, cc-by)
- Arrow@dit (Dublin Institute of Technology) (acceptedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- DR-NTU (Nanyang Technological University) (submittedVersion, cc-by)
- Figshare (submittedVersion, cc-by-nc-sa)
- Research Portal (Queen's University Belfast) (submittedVersion, cc-by)
- University of Limerick Institutional Repository (University of Limerick) (submittedVersion, cc-by-nc-sa)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Engineering › Electrical and Electronic Engineering › graph theory and CDMA systems
- Keywords
- eSTREAM, stream ciphers, area efficiency, trivium, grain, resource-constrained devices, Internet of Things security, FPGA implementation
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.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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.