The DOI matches its Crossref record; 77 of the 82 references it cites were found in a registry or an index; 22 of the 34 sources its claims cite were checked for support.
High-threshold and low-overhead fault-tolerant quantum memory
Open accessAbstract
The accumulation of physical errors 1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction 4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm 5 . We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes 6 . Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code 7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length- n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
Overview
CoChat Summary
## TL;DR
The paper presents a family of bivariate bicycle (BB) LDPC quantum codes and an end-to-end fault-tolerant memory protocol with low overhead. In numerical simulations, the authors report an error threshold/pseudo-threshold of about 0.7% and show that a 12-logical-qubit code can be preserved for nearly 1 million syndrome cycles using 288 physical qubits at physical error rate 0.1%.
## Key findings
- The proposed BB codes have weight-6 check operators, degree-6 Tanner graphs, and thickness 2, meaning their connectivity can be split into two edge-disjoint planar subgraphs.
- The authors report an error threshold close to 0.7% for the standard circuit-based noise model, “on par with the surface code” and exceeding other high-rate LDPC codes known to them.
- For the [[144, 12, 12]] code, they state a net encoding rate of 1/24 and that it can preserve 12 logical qubits for nearly 1 million syndrome cycles using 288 physical qubits at physical error rate 0.1%.
- Compared with separate surface-code patches, they report about a 10× reduction in physical-qubit overhead for the distance-12 BB code in the example they analyze.
## Methods
- The paper introduces bivariate bicycle (BB) stabilizer codes defined from pairs of bivariate polynomials/matrices \(A\) and \(B\), yielding CSS codes with \(n=2\ell m\) data qubits and six-qubit check operators.
- They analyze code structure through the Tanner graph, proving results about connectivity, toric layouts, and thickness-2 planar decompositions of the graph.
- Performance is evaluated with an end-to-end fault-tolerant memory protocol under a circuit-based noise model where each operation fails independently with probability \(p\), using a BP-OSD decoder adapted to circuit noise and numerical simulations of logical error rates.
## Limitations
- The authors explicitly note that it remains unclear whether the code examples can be scaled up while retaining the high encoding rate in the limit of large code length.
- They also state that optimization of the code layout satisfying specific hardware constraints is left for future work.
- Evident from the text: the reported performance is based on numerical simulations and, for lower error rates, extrapolation/fitting, rather than a hardware demonstration.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures
![Fig. 1 Tanner graphs of surface and BB codes. a, Tanner graph of a surface code, for comparison. b, Tanner graph of a BB code with parameters [[144, 12, 12]] embedded into a torus. Any edge of the Tanner graph connects a data and a check vertex. Data qubits associated with the registers q(L) and q(R) are shown by blue and orange circles. Each vertex has six incident edges including four short-range edges (pointing north, south, east and west) and two long-range edges. We only show a few long-range edges to avoid clutter. Dashed and solid edges indicate two planar subgraphs spanning the Tanner graph, see the Methods. c, Sketch of a Tanner graph extension for measuring Z¯ and X¯ following ref. 50, attaching to a surface code. The ancilla corresponding to the X¯ measurement can be connected to a surface code, enabling load-store operations for all logical qubits by means of quantum teleportation and some logical unitaries. This extended Tanner graph also has an implementation in a thickness-2 architecture through the A and B edges (Methods).](https://figures.cochat.ai/paper-figures/20af192c4ee94b7fa6b80267a250cfa4/high-threshold-and-low-overhead-fault-tolerant-quantum-memory-figure-1.jpg)

![Fig. 3 Noise properties of BB codes. a, Logical versus physical error rate for small examples of BB LDPC codes. A numerical estimate of pL (diamonds) was obtained by simulating d syndrome cycles for a distance-d code. Most of the data points have error bars roughly equal to pL/10 due to sampling errors. b, Comparison between the BB LDPC code [[144, 12, 12]] and surface codes with 12 logical qubits and distance d ∈ {9, 11, 13, 15}. The distance-d surface code with 12 logical qubits has the length n = 12d2 because each logical qubit is encoded into a separate d × d patch of the surface code lattice.](https://figures.cochat.ai/paper-figures/f0bf7cfff4e947da83298b00ebf12280/high-threshold-and-low-overhead-fault-tolerant-quantum-memory-figure-3.jpg)


Verification
Claims the paper makes
12 Valid · 9 Not valid · 10 Not checked · 61 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold”
- Also stated in: § Main · hedged
“which is nearly the same as the error threshold of the surface code49”
§ High-threshold and low-overhead fault-tolerant quantum memory > Abstract The accumulation of physical errors1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
What the sources say
- Partly supportedcites [7] Kitaev, A. Y. Fault-tolerant quantum computation by anyons. Ann. Phys. 303, 2–30 (2003); preprint at https://doi.org/10.48550/arXiv.quant-ph/9707021 (1997). sourceExperimental — accuracy not yet measured
The section on toric codes (p. 4) says they work below an error threshold, supporting the comparison’s premise that this code has a threshold. But the Abstract (p. 1) says the threshold was not known and gives estimates from 1/300 to 10^-6; it does not establish that a 0.7% threshold is on par with it or that it led other codes for 20 years. (LLM, conf=0.82)
- Partly supportedcites [8] Bravyi, S. B. & Kitaev, A. Y. Quantum codes on a lattice with boundary. Preprint at https://doi.org/10.48550/arXiv.quant-ph/9811052 (1998). sourceExperimental — accuracy not yet measured
The Abstract (pp. 1–2) describes a lattice code with boundaries and local stabilizers, supporting the citation’s identification of a surface code. The copy gives code distance and the number of errors the code can correct (p. 4), but it does not give an error-rate threshold or establish that 0.7% is comparable to it. (LLM, conf=0.82)
- Partly supportedcites [9] Dennis, E., Kitaev, A., Landahl, A. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452–4505 (2002). sourceExperimental — accuracy not yet measured
The paper analyzes surface-code error thresholds: §F (p. 17) gives a lower bound of 1.14% when data and measurement error probabilities are equal. It does not give 0.7% as the surface-code threshold, so it supports the comparison’s subject but not the specific numerical equivalence. Its 2002 text also cannot establish the citing sentence’s retrospective claim of 20 years of leadership. (LLM, conf=0.85)
- Supportedcites [10] Fowler, A. G., Stephens, A. M. & Groszkowski, P. High-threshold universal quantum computation on the surface code. Phys. Rev. A 80, 052312 (2009). source
Section VIII (p. 15) reports a numerical surface-code threshold of approximately 0.6%, and the conclusion (p. 16) repeats that value. A threshold of 0.7% is therefore on par with the threshold this paper reports. (LLM, conf=0.91)
- Not matchedcites [49] Groszkowski, P., Fowler, A. & Stephens, A. M. High-threshold surface code quantum computing: threshold calculation. In Proc. APS March Meeting Abstracts W17–002 (APS, 2009).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
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.
- Also stated in: § Main · hedged
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs.”
- Also stated in: § Main · plain
“The Tanner graph of any BB code has vertex degree six and graph thickness29 equal to two, which means it can be decomposed into two edge-disjoint planar subgraphs (Methods).”
- Also stated in: § Main · plain
“Although the qubit connectivity graph is not locally embeddable into a 2D grid, it can be decomposed into two planar degree-3 subgraphs.”
§ High-threshold and low-overhead fault-tolerant quantum memory > Abstract The accumulation of physical errors1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
What the sources say
- Partly supportedcites [29] Tremblay, M. A., Delfosse, N. & Beverland, M. E. Constant-overhead quantum error correction with thin planar connectivity. Phys. Rev. Lett. 129, 050504 (2022). sourceExperimental — accuracy not yet measured
Proposition 1 (p. 2) supports partitioning a low-degree connectivity graph into planar subgraphs. For degree 6, it guarantees a layout with at most three planar layers, not the claimed two. The passages about hypergraph product codes do not identify BB codes or establish their degree-6 connectivity. (LLM, conf=0.87)
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.
- Also stated in: § Main · plain
Every source the paper cites for this claim was checked and supports it.
In the paper
“Recent progress in the study of LDPC codes suggests that they can achieve quantum fault tolerance with a much higher encoding efficiency29.”
§ High-threshold and low-overhead fault-tolerant quantum memory > Main
What the sources say
- Supportedcites [29] Tremblay, M. A., Delfosse, N. & Beverland, M. E. Constant-overhead quantum error correction with thin planar connectivity. Phys. Rev. Lett. 129, 050504 (2022). source
On p. 1, the paper says some quantum LDPC codes can achieve arbitrarily low logical error rates with a constant ratio of tens of physical qubits per logical qubit, potentially reducing qubit overhead by more than an order of magnitude compared with surface codes. It also reports a circuit-noise threshold for a positive-rate code family, supporting the claim's qualified statement about fault tolerance and encoding efficiency. (LLM, conf=0.93)
hedgedstates 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.
- Supported
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“The latter were shown39,40 to be asymptotically ‘good’ in the sense of offering a constant encoding rate and linear distance: a parameter quantifying the number of correctable errors.”
§ High-threshold and low-overhead fault-tolerant quantum memory > Main
What the sources say
- Not checked — no full text of the sourcecites [39] Panteleev, P. & Kalachev, G. Asymptotically good quantum and locally testable classical LDPC codes. In Proc. 54th Annual ACM SIGACT Symposium on Theory of Computing 375–388 (ACM, 2022). source
- Supportedcites [40] Leverrier, A. & Zémor, G. Quantum Tanner codes. In Proc. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) 872–883 (IEEE, 2022). source
The Contributions section (p. 2) states that, under sufficient expansion and robustness conditions, the construction yields asymptotically good quantum LDPC codes with constant rate and linear minimum distance. This directly supports the attributed claim. (LLM, conf=0.95)
plainstates 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.
Every source the paper cites for this claim was checked and supports it.
In the paper
“As shown in Fig. 1c, extensions of the Tanner graph leveraging techniques by Cohen et al.50 enable fault-tolerant measurement operations involving an ancillary surface code.”
§ High-threshold and low-overhead fault-tolerant quantum memory > Main
What the sources say
- Supportedcites Cohen et al.50 Cohen, L. Z., Kim, I. H., Bartlett, S. D. & Brown, B. J. Low-overhead fault-tolerant quantum computing using long-range connectivity. Sci. Adv. https://doi.org/10.1126/sciadv.abn1717 (2022). source
The Results section (‘Logical CSS measurement’; page unavailable) describes extending a Tanner graph with an ancilla system to measure logical operators fault-tolerantly. The sentence attributes that technique to Cohen et al.; its reference to an ancillary surface code describes the citing authors’ application, not a claim that Cohen et al. used one. (LLM, conf=0.88)
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.
- Supported
54 more claims · 2 with their cited sources checked
Create a free account to see all 92 claims and every source verdict.
- Probably not a substantial claim. 23
- It may state two separate claims as one. 12
- The quote only partly states this claim. 2
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720 · cited 1×
“This new gate is also similar to the gates used by Google Quantum AI 57 , which have shown that a square lattice arrangement is possible.”
MethodFault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238 · cited 3×
“This resulted in the development of the surface code 7–10 that offers a high error threshold close to 1%, fast decoding algorithms and compatibility with the existing quantum processors relying on two-dimensional (2D) square lattice qubit connectivity.”
BackgroundMethodInfluentialScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479 · cited 2×
“The possibility of quantum fault tolerance is well-established 4 .”
BackgroundLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“It is believed that a scalable functioning quantum computer may help solve computational problems in such areas as scientific discovery, materials research, chemistry, and drug design, to name a few [2, 3, 4, 5].”
BackgroundGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 2×
“The length of the inner cycle is equal to the order of the matrix A A T 3 2 that is the transpose of A A T 3 2 considered earlier.”
BackgroundDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768 · cited 1×
“The sources of noise include imperfections in qubits, materials used, controlling apparatus, state preparation and measurement errors and a variety of external factors ranging from local man-made, such as stray electromagnetic fields, to those inherent to the Universe, such as cosmic rays.”
BackgroundDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · cited 1×
“The first proposals for quantum error correction, such as concatenated codes [16, 17, 18], focused on demonstrating the theoretical possibility of error suppression.”
BackgroundMultiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284 · cited 1×
“These are stabilizer codes of the Calderbank–Shor–Steane (CSS) type 43,44 that can be described by a collection of six-qubit check (stabilizer) operators composed of Pauli X and Z .”
Method
Research works printed but not linked: 1
- Groszkowski, P., Fowler, A. & Stephens, A. M. High-threshold surface code quantum computing: threshold calculation. In Proc. APS March Meeting Abstracts W17–002 (APS, 2009).
Cited by
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“5 | Complex logical circuits using 3D codes. a , [[8,3,2]] block codes can transversally realize {CCZ, CZ, Z, CNOT} gates within each block and transversal CNOTs between blocks.”
MethodQuantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
Scaling and networking a modular photonic quantum computer
Aghaee Rad, H., Ainsworth, T., Alexander, R. N., Altieri, B., Askarani, M. F., Baby, R., Banchi, L., Baragiola, B. Q., Bourassa, J. E., Chadwick, R. S., et al. (2025) · Nature · doi:10.1038/s41586-024-08406-9 · Cited by 178
“To benchmark the key functionalities 1–4 listed above, 2 core experiments were carried out using the machine.”
Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays
Xu, Q., Ataides, J. P. B., Pattison, C. A., Raveendran, N., Bluvstein, D., Wurtz, J., Vasic, B. V., Lukin, M. D., Jiang, L., & Zhou, H. (2024) · Nature Physics · doi:10.1038/s41567-024-02479-z · Cited by 412
IBM quantum computers: evolution, performance, and future directions
AbuGhanem, M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07047-7 · Cited by 336
Metadata
- Authors
- Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J.
- Affiliations
- IBM (United States) (US)
- Corresponding author
- Maslov, Dmitri
- Venue
- Nature
- Published
- 2024-03-27
- Volume
- 627
- Issue
- 8005
- Pages
- 778-782
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- PMC
- PMC10972743
- OpenAlex
- W4393234688
- Cited by
- 456
- References
- 82
- Citations by year
- 2026: 150 · 2025: 223 · 2024: 76
- FWCI
- 65.98
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Nature (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- fault-tolerant quantum memory, quantum error correction, LDPC codes, error threshold, syndrome measurement, logical qubits, qubit connectivity, planar graphs
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
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).
Cited sources are checked with a language model’s help (gpt-6-sol).
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: High-threshold and low-overhead fault-tolerant quantum memory. https://app.cochat.ai/papers/10.1038/s41586-024-07107-7
- The paper
- Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024). High-threshold and low-overhead fault-tolerant quantum memory. Nature. https://doi.org/10.1038/s41586-024-07107-7
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.