Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.

The Intrinsic Cause-Effect Power of Discrete Dynamical Systems–From Elementary Cellular Automata to Adapting Animats

Open access

Abstract

Current approaches to characterize the complexity of dynamical systems usually rely on state-space trajectories. In this article instead we focus on causal structure, treating discrete dynamical systems as directed causal graphs—systems of elements implementing local update functions. This allows us to characterize the system’s intrinsic cause-effect structure by applying the mathematical and conceptual tools developed within the framework of integrated information theory (IIT). In particular, we assess the number of irreducible mechanisms (concepts) and the total amount of integrated conceptual information Φ specified by a system. We analyze: (i) elementary cellular automata (ECA); and (ii) small, adaptive logic-gate networks (“animats”), similar to ECA in structure but evolving by interacting with an environment. We show that, in general, an integrated cause-effect structure with many concepts and high Φ is likely to have high dynamical complexity. Importantly, while a dynamical analysis describes what is “happening” in a system from the extrinsic perspective of an observer, the analysis of its cause-effect structure reveals what a system “is” from its own intrinsic perspective, exposing its dynamical and evolutionary potential under many different scenarios.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/e17085472

Cites

40 of 40 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Elementary cellular automata (ECA). ( A ) ECA consist of a 1-dimensional chain of cells in either state 0 or 1, which are updated according to a time-evolution rule dependent on a cell's previous state and that of its two nearest neighbors. Given the 2 3 = 8 possible past configurations, 256 different update rules exist, which are labeled by the decimal number of their rule in binary. '0' to '1' and/or left-right transformation of a rule (past and current state) lead to rules with equivalent behavior; ( B ) Example evolutions of four ECA (number of cells N = 50) with distinct long-term behavior over 50 time-steps for a random initial state and periodic boundary conditions; ( C ) ECA with N = 6 cells and periodic boundary conditions illustrated as a network of interacting elements. Edges denote connections between cells. Each cell in the ECA has a self-loop and connections to its nearest neighbors. Note, however, that depending on the cell's update rule some of the edges may not be causally effective, e.g., if the state of the left neighbor is irrelevant as in rule 136 (10001000).
Figure 1 Elementary cellular automata (ECA). ( A ) ECA consist of a 1-dimensional chain of cells in either state 0 or 1, which are updated according to a time-evolution rule dependent on a cell's previous state and that of its two nearest neighbors. Given the 2 3 = 8 possible past configurations, 256 different update rules exist, which are labeled by the decimal number of their rule in binary. '0' to '1' and/or left-right transformation of a rule (past and current state) lead to rules with equivalent behavior; ( B ) Example evolutions of four ECA (number of cells N = 50) with distinct long-term behavior over 50 time-steps for a random initial state and periodic boundary conditions; ( C ) ECA with N = 6 cells and periodic boundary conditions illustrated as a network of interacting elements. Edges denote connections between cells. Each cell in the ECA has a self-loop and connections to its nearest neighbors. Note, however, that depending on the cell's update rule some of the edges may not be causally effective, e.g., if the state of the left neighbor is irrelevant as in rule 136 (10001000).CC-BY · From the PDF
Figure 2 Relation of < Φ Max > , <#concepts> , and < Σφ Max > to Wolfram ECA classes I-IV. ( A ) Mean number of concepts <#concepts> plotted against < Φ Max > for all 88 ECA equivalence classes for ECA implementations with N = 5 cells. Each rule is color coded by its Wolfram class: (I) uniform fixed points in black; (II) non-uniform fixed points and periodic behavior in blue, (III) random, chaotic behavior in green; and (IV) complex behavior in red; ( B ) < Σφ Max > of all concepts in the system plotted against < Φ Max > for N = 5 cells. ( C , D ) Same as ( A , B ), for N = 6 cells. Rules shown in Figure 1B and below in Figure 3 are labeled by their rule number.
Figure 2 Relation of < Φ Max > , <#concepts> , and < Σφ Max > to Wolfram ECA classes I-IV. ( A ) Mean number of concepts <#concepts> plotted against < Φ Max > for all 88 ECA equivalence classes for ECA implementations with N = 5 cells. Each rule is color coded by its Wolfram class: (I) uniform fixed points in black; (II) non-uniform fixed points and periodic behavior in blue, (III) random, chaotic behavior in green; and (IV) complex behavior in red; ( B ) < Σφ Max > of all concepts in the system plotted against < Φ Max > for N = 5 cells. ( C , D ) Same as ( A , B ), for N = 6 cells. Rules shown in Figure 1B and below in Figure 3 are labeled by their rule number.CC-BY · From the PDF
Figure 3 Examples of N = 5 cell ECA cause-effect structures. ( A ) Systems that implement reducible rules can be partitioned without loss of cause-effect power, as indicated by the system's network diagram (left). Note that the three reducible rules 0, 51, and 204 produce different patterns: class I, class II with periodic behavior, and class II with steady state behavior respectively; ( B -F ) For each example system, the effective network diagram in its current state is displayed on the left, together with the cause-effect structure in cause-effect space (middle), and a time evolution of the rule for 50 cells (right). The cause-effect structures are projected onto three dimensions of cause-effect space (see Methods). Blue axes indicate past system states, green axes futures system states. The φ Max value of each concept is indicated by the size of its yellow circle. The coordinates for every concept in cause-effect space are the probabilities their cause-effect repertoire specifies for each system state; ( B ) The AND rule 128 system is a class I example for a system that does form a complex, but has only 1st order concepts. Its cause-effect structure lacks composition, leading to a low Φ Max value; ( C ) Linear class II rules can have many concepts, albeit with rather low φ Max ; ( D ) Example for a non-linear class II rule with all concepts; ( E ) Example of the nonlinear class III rule 90, which does not have 1st order concepts, but highly irreducible concepts of higher orders and high Φ Max for odd numbers of cells; ( F ) Example of a complex class IV rule with all possible concepts and high Φ Max .
Figure 3 Examples of N = 5 cell ECA cause-effect structures. ( A ) Systems that implement reducible rules can be partitioned without loss of cause-effect power, as indicated by the system's network diagram (left). Note that the three reducible rules 0, 51, and 204 produce different patterns: class I, class II with periodic behavior, and class II with steady state behavior respectively; ( B -F ) For each example system, the effective network diagram in its current state is displayed on the left, together with the cause-effect structure in cause-effect space (middle), and a time evolution of the rule for 50 cells (right). The cause-effect structures are projected onto three dimensions of cause-effect space (see Methods). Blue axes indicate past system states, green axes futures system states. The φ Max value of each concept is indicated by the size of its yellow circle. The coordinates for every concept in cause-effect space are the probabilities their cause-effect repertoire specifies for each system state; ( B ) The AND rule 128 system is a class I example for a system that does form a complex, but has only 1st order concepts. Its cause-effect structure lacks composition, leading to a low Φ Max value; ( C ) Linear class II rules can have many concepts, albeit with rather low φ Max ; ( D ) Example for a non-linear class II rule with all concepts; ( E ) Example of the nonlinear class III rule 90, which does not have 1st order concepts, but highly irreducible concepts of higher orders and high Φ Max for odd numbers of cells; ( F ) Example of a complex class IV rule with all possible concepts and high Φ Max .CC-BY · From the PDF
Figure 4 Distribution of <#concepts> and < φ Max > across concept orders for N = 5 ECA. The 88 rule equivalency classes are ordered by their < Φ Max >. For each rule, the bar plot shows the <#concepts> of each concept order (1st-5th) as a fraction of the maximum number of possible concepts (2 N -1 = 31 for N = 5). The blue line depicts < φ Max > of all concepts at the respective concept order (same y axis as the fraction of concepts). Both <#concepts> and < φ Max > are averages across N +1 system states. Bar colors indicate a rule's Wolfram class, as in Figure 2: (I) black; (II) blue; (III) green; and (IV) red. Note that there are maximally 5 possible 1st and 4th order concepts < φ Max >, 10 possible 2nd and 3rd order concepts, and only one possible 5th order concept in an N = 5 system.
Figure 4 Distribution of <#concepts> and < φ Max > across concept orders for N = 5 ECA. The 88 rule equivalency classes are ordered by their < Φ Max >. For each rule, the bar plot shows the <#concepts> of each concept order (1st-5th) as a fraction of the maximum number of possible concepts (2 N -1 = 31 for N = 5). The blue line depicts < φ Max > of all concepts at the respective concept order (same y axis as the fraction of concepts). Both <#concepts> and < φ Max > are averages across N +1 system states. Bar colors indicate a rule's Wolfram class, as in Figure 2: (I) black; (II) blue; (III) green; and (IV) red. Note that there are maximally 5 possible 1st and 4th order concepts < φ Max >, 10 possible 2nd and 3rd order concepts, and only one possible 5th order concept in an N = 5 system.CC-BY · From the PDF
Figure 5 Relation of IIT measures to the rule based parameters λ , µ , and Z . Correlation of < Φ Max >, <#concepts> , and < Σφ Max > with ( A ) Langton's λ parameter; ( B ) sensitivity µ , and ( C ) Wuensche's Z parameter (see text for details). ρ is Spearman's rank correlation coefficient, with p < 0.001 for all correlations, except for the λ and Z parameter vs. <#concepts> , which were not significantly correlated when corrected for multiple comparisons. Colors indicate Wolfram classes I-IV as in Figures 2 and 4: (I) uniform fixed points in black; (II) non-uniform fixed points and periodic behavior in blue; (III) random, chaotic behavior in green; and (IV) complex behavior in red.
Figure 5 Relation of IIT measures to the rule based parameters λ , µ , and Z . Correlation of < Φ Max >, <#concepts> , and < Σφ Max > with ( A ) Langton's λ parameter; ( B ) sensitivity µ , and ( C ) Wuensche's Z parameter (see text for details). ρ is Spearman's rank correlation coefficient, with p < 0.001 for all correlations, except for the λ and Z parameter vs. <#concepts> , which were not significantly correlated when corrected for multiple comparisons. Colors indicate Wolfram classes I-IV as in Figures 2 and 4: (I) uniform fixed points in black; (II) non-uniform fixed points and periodic behavior in blue; (III) random, chaotic behavior in green; and (IV) complex behavior in red.CC-BY · From the PDF
Figure 6 'Being' vs. 'Happening'. ( A ) Different rules show the same behavior under certain initial conditions. Rules 0, 128, and 232 all immediately converge to the state 'all 0' for the standard initial condition of a single cell in state '1'. Perturbing the system into random initial conditions, however, reveals that rules 0 and 128 belong to class I, while rule 232 belongs to class II; ( B ) Also rules 2, 74, and 106 show the same behavior for the standard initial condition, but belong to different classes under random initial conditions: rules 2 and 74 belong to class II, while rule 106 belongs to class IV; ( C ) Rules from the four different Wolfram classes all quickly converge to a steady state or periodic behavior for small ECA with N = 6 cells as indicated by their maximal transient length for N = 6 cells max (transient) (compare to Figures 1B and 3). The IIT measures reflect the classification ('being'), i.e. , the potential dynamical complexity, rather than the actual behavior ('happening'). The indicated IIT measures were obtained from the respective N = 6 ECA of each rule.
Figure 6 'Being' vs. 'Happening'. ( A ) Different rules show the same behavior under certain initial conditions. Rules 0, 128, and 232 all immediately converge to the state 'all 0' for the standard initial condition of a single cell in state '1'. Perturbing the system into random initial conditions, however, reveals that rules 0 and 128 belong to class I, while rule 232 belongs to class II; ( B ) Also rules 2, 74, and 106 show the same behavior for the standard initial condition, but belong to different classes under random initial conditions: rules 2 and 74 belong to class II, while rule 106 belongs to class IV; ( C ) Rules from the four different Wolfram classes all quickly converge to a steady state or periodic behavior for small ECA with N = 6 cells as indicated by their maximal transient length for N = 6 cells max (transient) (compare to Figures 1B and 3). The IIT measures reflect the classification ('being'), i.e. , the potential dynamical complexity, rather than the actual behavior ('happening'). The indicated IIT measures were obtained from the respective N = 6 ECA of each rule.CC-BY · From the PDF
Figure 7 ( A ) < Φ Max > ; ( B ) <#concepts> ; and ( C ) < Σφ Max > across N = 3-7 cells. Already small systems reveal typical features of an ECA's cause-effect structure. How the IIT measures of an ECA rule depend on N is further indicative of the general properties of the rule's cause-effect structure (see main text); ( D ) Maximal transient length of the respective rules evaluated across all system states plotted against the number of cells N . Class I rules and class II rules with lower < Φ Max > values (32, 108, 128, and 232) tend to have shorter transients as well; ( E ) Maximal transient length of all ECA equivalency classes plotted against < Φ Max > . The top panel shows the correlation of NT = 14 ECA transients to the < Φ Max > values obtained from the respective NI = 6 ECA systems. The lower panel shows the correlation of NT = 15 ECA transients to the < Φ Max > values obtained from the respective NI = 5 ECA systems. The labels indicate some of the example rules discussed above. ( A -E ) Note the logarithmic scale of the y-axis in all panels. Colors denote Wolfram classes as in Figures 2, 4, and 5.
Figure 7 ( A ) < Φ Max > ; ( B ) <#concepts> ; and ( C ) < Σφ Max > across N = 3-7 cells. Already small systems reveal typical features of an ECA's cause-effect structure. How the IIT measures of an ECA rule depend on N is further indicative of the general properties of the rule's cause-effect structure (see main text); ( D ) Maximal transient length of the respective rules evaluated across all system states plotted against the number of cells N . Class I rules and class II rules with lower < Φ Max > values (32, 108, 128, and 232) tend to have shorter transients as well; ( E ) Maximal transient length of all ECA equivalency classes plotted against < Φ Max > . The top panel shows the correlation of NT = 14 ECA transients to the < Φ Max > values obtained from the respective NI = 6 ECA systems. The lower panel shows the correlation of NT = 15 ECA transients to the < Φ Max > values obtained from the respective NI = 5 ECA systems. The labels indicate some of the example rules discussed above. ( A -E ) Note the logarithmic scale of the y-axis in all panels. Colors denote Wolfram classes as in Figures 2, 4, and 5.CC-BY · From the PDF
Figure 8 Fitness, <#concepts> , < Φ Max > , and state entropy H , of animats adapting to four task environments with varying requirements for internal memory. ( A ) Schematic of animat in example environment. On each trial, the animat has to recognize the size of the downward moving block and either catch or avoid it. Blocks continuously move downward and either to the right or left, at a speed of one unit per time step (periodic boundary conditions). The animat has two sensors with a space of 1 unit between them and thus a total width of three units. Its two motors can move it one unit to the left or right, respectively; ( B ) Animat evolution. Each animat is initialized at generation 0 without connections between elements. Through mutation and fitness selection, the animats develop complex network structures with mechanisms that enable them to solve their task. Animats were let to evolve for 60,000 generations; ( C ) Illustration of the four Task environments with increasing difficulty and requirements for internal memory from left to right; ( D ) The final fitness achieved by the animats after 60,000 generations corresponds to the task difficulty. The two red traces show data from a subset of Task 3 and Task 4 trials with the same high average fitness as Task 1 and 2. Animats that evolved to the more difficult tasks, particularly Task 4, developed significantly more concepts, higher < Φ Max > values, and more state entropy H , than those animats that evolved to Task 1. Shaded areas around curves denote SEM across 50 independent evolutions (LODs); ( E ) Scatter plots of all evaluated generations of animats
Figure 8 Fitness, <#concepts> , < Φ Max > , and state entropy H , of animats adapting to four task environments with varying requirements for internal memory. ( A ) Schematic of animat in example environment. On each trial, the animat has to recognize the size of the downward moving block and either catch or avoid it. Blocks continuously move downward and either to the right or left, at a speed of one unit per time step (periodic boundary conditions). The animat has two sensors with a space of 1 unit between them and thus a total width of three units. Its two motors can move it one unit to the left or right, respectively; ( B ) Animat evolution. Each animat is initialized at generation 0 without connections between elements. Through mutation and fitness selection, the animats develop complex network structures with mechanisms that enable them to solve their task. Animats were let to evolve for 60,000 generations; ( C ) Illustration of the four Task environments with increasing difficulty and requirements for internal memory from left to right; ( D ) The final fitness achieved by the animats after 60,000 generations corresponds to the task difficulty. The two red traces show data from a subset of Task 3 and Task 4 trials with the same high average fitness as Task 1 and 2. Animats that evolved to the more difficult tasks, particularly Task 4, developed significantly more concepts, higher < Φ Max > values, and more state entropy H , than those animats that evolved to Task 1. Shaded areas around curves denote SEM across 50 independent evolutions (LODs); ( E ) Scatter plots of all evaluated generations of animatsCC-BY · From the PDF
Figure 9 Information, integration, and exclusion postulate at the level of mechanisms. ( A ) ECA 232 with N = 6 cells A-F illustrated as a network of interacting elements in the current state A-Ft = 111000. All cells implement rule 232, the Majority rule; ( B ) Information: Element At in state 1 constrains the past and future states of ABFt±1 compared to their unconstrained (flat) distribution (overlaid in gray); ( C ) Integration: Elements A and D do not form a higher order mechanism, since ADt is reducible to its component mechanisms At and Dt. ABt in state 11, however, does form a higher order mechanism, since ABt specifies both irreducible causes and irreducible effects, as evaluated by integrated information φ (see text); ( D ) Exclusion: Cause and effect repertoires are evaluated over all sets of system elements. The cause and effect repertoire that are maximally irreducible and their φ Max value form the concept of a mechanism. In case of AB, the maximally irreducible cause-repertoire is over elements BCFt-1; the maximally irreducible effect-repertoire is over elements ABt+1.
Figure 9 Information, integration, and exclusion postulate at the level of mechanisms. ( A ) ECA 232 with N = 6 cells A-F illustrated as a network of interacting elements in the current state A-Ft = 111000. All cells implement rule 232, the Majority rule; ( B ) Information: Element At in state 1 constrains the past and future states of ABFt±1 compared to their unconstrained (flat) distribution (overlaid in gray); ( C ) Integration: Elements A and D do not form a higher order mechanism, since ADt is reducible to its component mechanisms At and Dt. ABt in state 11, however, does form a higher order mechanism, since ABt specifies both irreducible causes and irreducible effects, as evaluated by integrated information φ (see text); ( D ) Exclusion: Cause and effect repertoires are evaluated over all sets of system elements. The cause and effect repertoire that are maximally irreducible and their φ Max value form the concept of a mechanism. In case of AB, the maximally irreducible cause-repertoire is over elements BCFt-1; the maximally irreducible effect-repertoire is over elements ABt+1.CC-BY · From the PDF
Figure 10 Information, integration, and exclusion postulate at the level of systems of mechanisms. ( A ) Information: The system A-Ft in state '111000' has 14 concepts: six elementary concepts At,Bt,Ct,Dt,Et and Ft, four 2nd order concepts of adjacent elements, as well as ACt and DFt, and the 3rd order concepts ABCt and DEFt; ( B ) Integration: the causeeffect structures of A-Ft is irreducible to the cause-effect structure of its minimum information partition ( MIP ), which eliminates the effects of subset ABCt onto subset DEFt, as measured by the integrated conceptual information Φ , which quantifies the distance between the whole and partitioned cause-effect structure; ( C ) Exclusion: Cause-effect structures and their Φ values are evaluated over all sets of system elements. The set of elements ܵ ௧ ∗ with the maximally irreducible cause-effect structure forms a complex; here it is the whole system A-Ft. This is not always the case. For different types of rules, or more heterogeneous connections or rules, system subsets may be maximally irreducible complexes. Complexes cannot overlap. In the three examples on the right, DEFt thus may form another complex beneath the main complex ABCt; the whole system, however, is excluded from being a complex, as are subsets of elements within a complex.
Figure 10 Information, integration, and exclusion postulate at the level of systems of mechanisms. ( A ) Information: The system A-Ft in state '111000' has 14 concepts: six elementary concepts At,Bt,Ct,Dt,Et and Ft, four 2nd order concepts of adjacent elements, as well as ACt and DFt, and the 3rd order concepts ABCt and DEFt; ( B ) Integration: the causeeffect structures of A-Ft is irreducible to the cause-effect structure of its minimum information partition ( MIP ), which eliminates the effects of subset ABCt onto subset DEFt, as measured by the integrated conceptual information Φ , which quantifies the distance between the whole and partitioned cause-effect structure; ( C ) Exclusion: Cause-effect structures and their Φ values are evaluated over all sets of system elements. The set of elements ܵ ௧ ∗ with the maximally irreducible cause-effect structure forms a complex; here it is the whole system A-Ft. This is not always the case. For different types of rules, or more heterogeneous connections or rules, system subsets may be maximally irreducible complexes. Complexes cannot overlap. In the three examples on the right, DEFt thus may form another complex beneath the main complex ABCt; the whole system, however, is excluded from being a complex, as are subsets of elements within a complex.CC-BY · From the PDF

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 40 references

Research works printed but not linked: 2

  1. Von Neumann, J. (1966). Essays on Cellular Automata, University of Illinois Press.
  2. Wuensche, A., and Lesser, M. (1992). The Global Dynamics of Cellular Automata: An Atlas of Basin of Attraction Fields of One-dimensional Cellular Automata, Addison-Wesley. Santa Fe Institute Studies in the Sciences of Complexity: Reference Volume I.

Cited by

See all 61

Metadata

Authors
Albantakis, L., & Tononi, G.
Affiliations
University of Wisconsin–Madison (US)
Corresponding author
  • Albantakis, Larissa
  • Tononi, Giulio
Venue
Entropy
Publisher
MDPI AG
Published
2015-07-31
Volume
17
Issue
8
Pages
5472-5502
ISSN
1099-4300 (ISSN-L)
OpenAlex
W1554794238
Cited by
58
References
40
Citations by year
2025: 4 · 2024: 7 · 2023: 7 · 2022: 7 · 2021: 8 · 2020: 6 · 2019: 7 · 2018: 5 · 2017: 4 · 2016: 3
FWCI
4.12
Type
journal article
Language
en
Open access
Locations
  • Entropy (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
Templeton World Charities Foundation (#TWCF 0067/AB41)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Systems and Dynamics
  • Social Sciences › Arts and Humanities › History and Philosophy of Science › Philosophy of Biology and Scientific Explanation
Keywords
integrated information theory, causal structure, elementary cellular automata, animats, dynamical complexity

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The Intrinsic Cause-Effect Power of Discrete Dynamical Systems–From Elementary Cellular Automata to Adapting Animats. https://app.cochat.ai/papers/10.3390/e17085472
The paper
Albantakis, L., & Tononi, G. (2015). The Intrinsic Cause-Effect Power of Discrete Dynamical Systems–From Elementary Cellular Automata to Adapting Animats. Entropy. https://doi.org/10.3390/e17085472

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.