Intrinsic units: identifying a system's causal grain.
One block of code here has a permanent identifier (oscr:b:…), listed with the matches below: citable for good, with a page of its own. Select a match and press Cite to copy it. What a block identifier is.
The 1 match
- [1] § Examples › Example 2: coarse-graining ↔ marshall_intrinsic_units/marshall_intrinsic_units.py, lines 418 to 433 · score 0.50 · horizontal neighbor, vertical neighbor · block
oscr:b:JDNPT1BT589BC-3· Report a mismatch
Paper
Loaded from Europe PMC by your browser; OSCR does not store it: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Python · 513 lines · 17 KB · GPL-3.0 · 1 match
- import pathlib
- import pickle
- import matplotlib.pyplot as plt
- import numpy as np
- import pyphi
- import pyphi.utils
- import pyphi.visualize
- from tqdm.auto import tqdm
- _BU_MICRO_SAVEDIR = "results/bu_micro" # "Binary units micro"
- _BBX_MACRO_SAVEDIR = "results/bbx_macro" # "Blackbox macro"
- _BBX_MICRO_SAVEDIR = "results/bbx_micro" # "Blackbox micro"
- _CG_MICRO_SAVEDIR = "results/cg_micro" # "Coarsegrain micro"
- _CG_MACRO_SAVEDIR = "results/cg_macro" # "Coarsegrain macro"
- _MIN_MICRO_SAVEDIR = "results/min_micro" # "Minimal micro"
- _MIN_MACRO_SAVEDIR = "results/min_macro" # "Minimal macro"
- _SFN_MICRO_SAVEDIR = "results/sfn_micro" # "Something from nothing"
- _SFNN_MICRO_SAVEDIR = "results/sfnn_micro" # "Something from nearly nothing"
- _SFS_MICRO_SAVEDIR = "results/sfs_micro" # "Something from something"
- def get_subsets_by_size(network):
- return {
- size: list(
- pyphi.utils.powerset(network.node_indices, min_size=size, max_size=size)
- )
- for size in range(1, len(network.node_indices) + 1)
- }
- def get_subsystem_string(network, subset):
- return "".join(sorted(np.array(network.node_labels)[list(subset)].tolist()))
- def run_example(
- network,
- network_state,
- subsystem_size=None,
- subsystem_index=None,
- verbose=1,
- savedir=None,
- ):
- # Create savedir if it does not already exist
- if savedir is not None:
- savedir = pathlib.Path(savedir)
- savedir.mkdir(parents=True, exist_ok=True)
- # Get specific subsystems to check
- if subsystem_size is not None:
- subsets = get_subsets_by_size(network)[subsystem_size]
- if subsystem_index is not None:
- subsets = [subsets[subsystem_index]]
- else: # Check all subsystems
- subsets = list(
- pyphi.utils.powerset(network.node_indices, nonempty=True, reverse=True)
- )
- sias = {}
- for subset in tqdm(subsets):
- # Print progress for user
- subsystem_string = get_subsystem_string(network, subset)
- if verbose:
- print(f"Doing {subsystem_string}...")
- # Do actual work
- subsystem = pyphi.Subsystem(network, network_state, subset)
- sias[subset] = subsystem.sia()
- # Print output and save
- if verbose == 1:
- print(f" φ_s: {[sias[subset].phi]}")
- elif verbose >= 2:
- print(sias[subset])
- if savedir is not None:
- with open(savedir / f"{subsystem_string}.pickle", "wb") as f:
- pickle.dump(sias[subset], f, protocol=pickle.HIGHEST_PROTOCOL)
- def summarize_example(network, savedir):
- savedir = pathlib.Path(savedir)
- subsets = get_subsets_by_size(network)
- with open(savedir / "summary.txt", "w") as f:
- for subsystem_size in range(1, len(network.node_indices) + 1):
- f.write(f"====={subsystem_size}-node subsystems=====\n")
- for subset in subsets[subsystem_size]:
- subsystem_string = get_subsystem_string(network, subset)
- subsystem_file = savedir / f"{subsystem_string}.pickle"
- if subsystem_file.exists():
- with open(subsystem_file, "rb") as pf:
- sia = pickle.load(pf)
- f.write(f"φ_s({subsystem_string}) = {sia.phi}\n")
- def run_binary_units_micro_example(savedir=_BU_MICRO_SAVEDIR, **kwargs):
- network, network_state = get_binary_units_micro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_binary_units_micro_example(savedir=_BU_MICRO_SAVEDIR):
- network, _ = get_binary_units_micro_example()
- summarize_example(network, savedir)
- def run_blackbox_micro_example(savedir=_BBX_MICRO_SAVEDIR, **kwargs):
- network, network_state = get_blackbox_micro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_blackbox_micro_example(savedir=_BBX_MICRO_SAVEDIR):
- network, _ = get_blackbox_micro_example()
- summarize_example(network, savedir)
- def run_blackbox_macro_example(savedir=_BBX_MACRO_SAVEDIR, **kwargs):
- network, network_state = get_blackbox_macro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_blackbox_macro_example(savedir=_BBX_MACRO_SAVEDIR):
- network, _ = get_blackbox_macro_example()
- summarize_example(network, savedir)
- def run_coarsegrain_micro_example(savedir=_CG_MICRO_SAVEDIR, **kwargs):
- network, network_state = get_coarsegrain_micro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_coarsegrain_micro_example(savedir=_CG_MICRO_SAVEDIR):
- network, _ = get_coarsegrain_micro_example()
- summarize_example(network, savedir)
- def run_coarsegrain_macro_example(savedir=_CG_MACRO_SAVEDIR, **kwargs):
- network, network_state = get_coarsegrain_macro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_coarsegrain_macro_example(savedir=_CG_MACRO_SAVEDIR):
- network, _ = get_coarsegrain_macro_example()
- summarize_example(network, savedir)
- def run_minimal_micro_example(savedir=_MIN_MICRO_SAVEDIR, **kwargs):
- network, network_state = get_minimal_micro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_minimal_micro_example(savedir=_MIN_MICRO_SAVEDIR):
- network, _ = get_minimal_micro_example()
- summarize_example(network, savedir)
- def run_minimal_macro_example(savedir=_MIN_MACRO_SAVEDIR, **kwargs):
- network, network_state = get_minimal_macro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_minimal_macro_example(savedir=_MIN_MACRO_SAVEDIR):
- network, _ = get_minimal_macro_example()
- summarize_example(network, savedir)
- def run_something_from_nothing_micro_example(savedir=_SFN_MICRO_SAVEDIR, **kwargs):
- network, network_state = get_something_from_nothing_micro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_something_from_nothing_micro_example(savedir=_SFN_MICRO_SAVEDIR):
- network, _ = get_something_from_nothing_micro_example()
- summarize_example(network, savedir)
- def run_something_from_nearly_nothing_micro_example(
- savedir=_SFNN_MICRO_SAVEDIR, **kwargs
- ):
- network, network_state = get_something_from_nearly_nothing_micro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_something_from_nearly_nothing_micro_example(savedir=_SFNN_MICRO_SAVEDIR):
- network, _ = get_something_from_nearly_nothing_micro_example()
- summarize_example(network, savedir)
- def run_something_from_something_micro_example(savedir=_SFS_MICRO_SAVEDIR, **kwargs):
- network, network_state = get_something_from_something_micro_example()
- run_example(network, network_state, savedir=savedir, **kwargs)
- def summarize_something_from_something_micro_example(savedir=_SFS_MICRO_SAVEDIR):
- network, _ = get_something_from_something_micro_example()
- summarize_example(network, savedir)
- def _get_iit4_fig6d_micro_tpm():
- node_labels = ("A", "B", "C", "D", "E", "F")
- network_size = len(node_labels)
- current_states = np.array(list(pyphi.utils.all_states(network_size)))
- tpm = np.zeros_like(current_states, dtype=float)
- k = 4
- for current_state, p in zip(current_states, tpm):
- # Convert 0s to -1s for sigmoidal activation function
- current_state = np.where(current_state == 0, -1, current_state)
- total_input = np.sum(current_state)
- prob = 1.0 / (1.0 + np.exp(-k * total_input))
- p[:] = prob
- return tpm, current_states, node_labels
- def get_iit4_fig6d():
- tpm, _, node_labels = _get_iit4_fig6d_micro_tpm()
- network = pyphi.Network(tpm, node_labels=node_labels)
- state = (1, 0, 0, 0, 0, 0)
- return network, state
- def get_binary_units_micro_example():
- tpm = np.array(
- [
- [1, 1, 1],
- [0, 1, 0],
- [0, 0, 0],
- [1, 1, 0],
- [0, 0, 1],
- [0, 1, 1],
- [1, 0, 1],
- [1, 0, 0],
- ]
- )
- node_labels = ("A", "B", "C")
- network = pyphi.Network(tpm, node_labels=node_labels)
- state = (0, 0, 0)
- return network, state
- def _get_blackbox_example_micro_tpm():
- node_labels = ("A", "B", "C", "D", "E", "F", "G", "H")
- network_size = len(node_labels)
- current_states = np.array(list(pyphi.utils.all_states(network_size)))
- tpm = np.zeros_like(current_states, dtype=float)
- for current_state, p in zip(current_states, tpm):
- p[0] = (
- 0.01
- + 0.01 * current_state[0]
- + 0.1 * current_state[3]
- + 0.8 * current_state[6]
- + 0.05 * current_state[1]
- ) # A
- p[1] = (
- 0.01
- + 0.01 * current_state[1]
- + 0.1 * current_state[3]
- + 0.8 * current_state[6]
- + 0.05 * current_state[0]
- ) # B
- p[2] = (
- 0.01
- + 0.01 * current_state[2]
- + 0.85 * int(current_state[0] + current_state[1] > 0)
- + 0.1 * int(current_state[0] + current_state[1] == 2)
- ) # C
- p[3] = (
- 0.01
- + 0.01 * current_state[3]
- + 0.85 * current_state[2]
- + 0.05 * (current_state[0] + current_state[1])
- ) # D
- p[4] = (
- 0.01
- + 0.01 * current_state[4]
- + 0.1 * current_state[7]
- + 0.8 * current_state[2]
- + 0.05 * current_state[5]
- ) # E
- p[5] = (
- 0.01
- + 0.01 * current_state[5]
- + 0.1 * current_state[7]
- + 0.8 * current_state[2]
- + 0.05 * current_state[4]
- ) # F
- p[6] = (
- 0.01
- + 0.01 * current_state[6]
- + 0.85 * int(current_state[4] + current_state[5] > 0)
- + 0.1 * int(current_state[4] + current_state[5] == 2)
- ) # G
- p[7] = (
- 0.01
- + 0.01 * current_state[7]
- + 0.85 * current_state[6]
- + 0.05 * (current_state[4] + current_state[5])
- ) # H
- return tpm, current_states, node_labels
- def get_blackbox_micro_example():
- tpm, _, node_labels = _get_blackbox_example_micro_tpm()
- network = pyphi.Network(tpm, node_labels=node_labels)
- state = (1, 1, 1, 1, 1, 1, 1, 1)
- return network, state
- def _get_blackbox_example_macro_tpm():
- micro_tpm, micro_states, _ = _get_blackbox_example_micro_tpm()
- tpm = pyphi.convert.sbn2sbs(micro_tpm)
- tpm2 = np.dot(tpm, tpm) # Take tau=2
- D00 = np.where((micro_states[:, 2] == 0) & (micro_states[:, 6] == 0))[0]
- D10 = np.where((micro_states[:, 2] == 1) & (micro_states[:, 6] == 0))[0]
- D01 = np.where((micro_states[:, 2] == 0) & (micro_states[:, 6] == 1))[0]
- D11 = np.where((micro_states[:, 2] == 1) & (micro_states[:, 6] == 1))[0]
- Dalpha0 = np.where(micro_states[:, 2] == 0)[0]
- Dalpha1 = np.where(micro_states[:, 2] == 1)[0]
- Dbeta0 = np.where(micro_states[:, 6] == 0)[0]
- Dbeta1 = np.where(micro_states[:, 6] == 1)[0]
- assert micro_tpm.shape[0] == 2**8
- assert micro_tpm.shape[1] == 8
- macro_network_size = 2
- macro_states = np.array(list(pyphi.utils.all_states(macro_network_size)))
- macro_tpm = np.zeros_like(macro_states, dtype=float) # state-by-node
- macro_node_labels = ("α", "β")
- macro_tpm[0, 0] = np.mean(np.sum(tpm2[D00[:, np.newaxis], Dalpha1], axis=1))
- macro_tpm[0, 1] = np.mean(np.sum(tpm2[D00[:, np.newaxis], Dbeta1], axis=1))
- macro_tpm[1, 0] = np.mean(np.sum(tpm2[D10[:, np.newaxis], Dalpha1], axis=1))
- macro_tpm[1, 1] = np.mean(np.sum(tpm2[D10[:, np.newaxis], Dbeta1], axis=1))
- macro_tpm[2, 0] = np.mean(np.sum(tpm2[D01[:, np.newaxis], Dalpha1], axis=1))
- macro_tpm[2, 1] = np.mean(np.sum(tpm2[D01[:, np.newaxis], Dbeta1], axis=1))
- macro_tpm[3, 0] = np.mean(np.sum(tpm2[D11[:, np.newaxis], Dalpha1], axis=1))
- macro_tpm[3, 1] = np.mean(np.sum(tpm2[D11[:, np.newaxis], Dbeta1], axis=1))
- return macro_tpm, macro_states, macro_node_labels
- def get_blackbox_macro_example():
- tpm, _, node_labels = _get_blackbox_example_macro_tpm()
- network = pyphi.Network(tpm, node_labels=node_labels)
- state = (1, 1)
- return network, state
- def get_coarsegrain_micro_example():
- tpm = np.array(
- [
- [0.05, 0.05, 0.05, 0.05],
- [0.06, 0.15, 0.05, 0.05],
- [0.15, 0.06, 0.05, 0.05],
- [0.16, 0.16, 0.85, 0.85],
- [0.05, 0.05, 0.06, 0.15],
- [0.06, 0.15, 0.06, 0.15],
- [0.15, 0.06, 0.06, 0.15],
- [0.16, 0.16, 0.86, 0.95],
- [0.05, 0.05, 0.15, 0.06],
- [0.06, 0.15, 0.15, 0.06],
- [0.15, 0.06, 0.15, 0.06],
- [0.16, 0.16, 0.95, 0.86],
- [0.85, 0.85, 0.16, 0.16],
- [0.86, 0.95, 0.16, 0.16],
- [0.95, 0.86, 0.16, 0.16],
- [0.96, 0.96, 0.96, 0.96],
- ]
- )
- node_labels = ("A", "B", "C", "D")
- network = pyphi.Network(tpm, node_labels=node_labels)
- state = (0, 0, 0, 0)
- return network, state
- def get_coarsegrain_macro_example():
- tpm = np.array(
- [[0.006833, 0.006833], [0.0256, 0.7855], [0.7855, 0.0256], [0.9212, 0.9212]]
- )
- node_labels = ("α", "β")
- network = pyphi.Network(tpm, node_labels=node_labels)
- state = (0, 0)
- return network, state
- def get_minimal_micro_example():
- tpm = np.array(
- [
- [0.05, 0.05],
- [0.05, 0.06],
- [0.06, 0.05],
- [0.95, 0.95],
- ]
- )
- node_labels = ("A", "B")
- network = pyphi.Network(tpm, node_labels=node_labels)
- state = (0, 0)
- return network, state
- def get_minimal_macro_example():
- tpm = np.array([[0.05 * 0.05 + 2 * 0.01 * 0.05 / 3], [(1 - 0.05) * (1 - 0.05)]])
- node_labels = ("α",)
- network = pyphi.Network(tpm, node_labels=node_labels)
- state = (0,)
- return network, state
- def get_dancing_couple_node(
- current_state: np.ndarray,
- self_index: int,
- horizontal_neighbor: int,
- vertical_neighbor: int,
- w_vertical: float,
- w_base: float = 0.05,
- w_self: float = 0.05,
- w_horizontal: float = 0.6,
- ) -> float:
- return (
- w_base
- + w_self * current_state[self_index]
- + w_horizontal * current_state[horizontal_neighbor]
- + w_vertical * current_state[vertical_neighbor]
- )
- def get_dancing_couples_network(w_vertical: float) -> np.ndarray:
- node_labels = ("A", "B", "C", "D")
- connectivity = {
- 0: {"horizontal_neighbor": 1, "vertical_neighbor": 2},
- 1: {"horizontal_neighbor": 0, "vertical_neighbor": 3},
- 2: {"horizontal_neighbor": 3, "vertical_neighbor": 0},
- 3: {"horizontal_neighbor": 2, "vertical_neighbor": 1},
- }
- network_size = len(node_labels)
- current_states = np.array(list(pyphi.utils.all_states(network_size)))
- tpm = np.zeros_like(current_states, dtype=float)
- for current_state, p in zip(current_states, tpm):
- for i in connectivity:
- p[i] = get_dancing_couple_node(
- current_state,
- i,
- connectivity[i]["horizontal_neighbor"],
- connectivity[i]["vertical_neighbor"],
- w_vertical=w_vertical,
- )
- return pyphi.Network(tpm, node_labels=node_labels)
- def get_something_from_nothing_micro_example():
- network = get_dancing_couples_network(w_vertical=0.00)
- state = (0, 0, 0, 0)
- return network, state
- def get_something_from_nearly_nothing_micro_example():
- network = get_dancing_couples_network(w_vertical=0.01)
- state = (0, 0, 0, 0)
- return network, state
- def get_something_from_something_micro_example():
- network = get_dancing_couples_network(w_vertical=0.25)
- state = (0, 0, 0, 0)
- return network, state
- #### Plotting functions #####
- def plot_sbs_tpm(network, use_node_labels=True, height=None):
- def _italicize(text):
- return "$\it{" + "".join(text) + "}$"
- sbs = pyphi.convert.state_by_node2state_by_state(network.tpm)
- states_labels = list(pyphi.utils.all_states(network.size))
- if use_node_labels:
- state_labels = [
- pyphi.visualize.phi_structure.text.Labeler(
- state, network.node_labels, postprocessor=_italicize
- ).nodes(network.node_indices)
- for state in states_labels
- ]
- figsize = None if height is None else (height, height)
- fig, ax = plt.subplots(figsize=figsize)
- ax.pcolormesh(sbs, edgecolors="k", linewidth=0.5, cmap="Greys", vmin=0, vmax=1)
- ax.tick_params(
- top=False,
- labeltop=use_node_labels,
- bottom=False,
- labelbottom=False,
- left=False,
- labelleft=use_node_labels,
- )
- if use_node_labels:
- ax.set_xticks(
- np.arange(len(state_labels)) + 0.5, labels=state_labels, rotation=90
- )
- ax.set_yticks(np.arange(len(state_labels)) + 0.5, labels=state_labels)
- ax.set_aspect("equal")
- ax.invert_yaxis()
- return fig, ax
marshall_intrinsic_units.py at commit 48471b5, under GPL-3.0 · at the source
Overview
- Department of Mathematics and Statistics, Brock University, 1812 Sir Isaac Brock Way, St. Catharines, Ontario, L2S 3A1, Canada
- Department of Psychiatry, University of Wisconsin-Madison, 6001 Research Park Blvd, Madison, WI, 53719, United States
Abstract
Integrated information theory (IIT) aims to account for the quality and quantity of consciousness in physical terms. According to IIT, a substrate of consciousness must be a system of units (e.g. synapses, neurons, minicolumns, etc.) that is a maximum of intrinsic, specific, unitary cause-effect power, quantified by integrated information (). The grain of each unit must be the one—from micro (finer) to macro (coarser)—that maximizes the system’s integrated information. Here we provide a framework for computing the integrated information of systems whose constituents include macro units, and in doing so provide the means to identify a system’s intrinsic units—those that constitute the system from its intrinsic perspective, and directly account for its experience. First, we formalize what it means for these units, as part of a substrate of consciousness, to satisfy IIT’s postulates of physical existence. Next, we extend the mathematical framework of IIT 4.0 to assess cause-effect power across grains. Then, using simple, simulated systems, we show that the integrated information of systems containing macro units can be higher than that of corresponding systems of micro units. Three examples highlight specific kinds of macro units, and how each kind can increase cause-effect power. The implications of the framework are discussed in the broader context of IIT, including how it provides a foundation for tests and inferences about consciousness.
Reproduced under the paper's license (CC BY), from the paper cited above.
Repositories
Its files are read in the Code ↔ Paper reader above, with 1 match between paragraphs and lines of code.
Zenodo 11211435
Availability: 1 check, the latest on 29 September 2026: the link answers (HTTP 200)
- 29 September 2026: the link answers (HTTP 200)
15 files
- figures.ipynb, Jupyter, 177 lines
- marshall_intrinsic_units
/ , Python, 79 lines__init__.py - marshall_intrinsic_units
/ , Python, 513 linesmarshall_intrinsic_units .py - scripts/
run_bbx_macro.py , Python, 4 lines - scripts/
run_bbx_micro.py , Python, 12 lines - scripts/
run_bu_micro.py , Python, 7 lines - scripts/
run_cg_macro.py , Python, 4 lines - scripts/
run_cg_micro.py , Python, 4 lines - scripts/
run_min_macro.py , Python, 4 lines - scripts/
run_min_micro.py , Python, 4 lines - scripts/
run_sfn_micro.py , Python, 4 lines - scripts/
run_sfnn_micro.py , Python, 4 lines - scripts/
run_sfs_micro.py , Python, 4 lines - LICENSE, License, 674 lines
- README.md, Text, 21 lines
csc-uw/marshall-intrinsic-units
48471b5d43e1453ac536cd4d3a5c48820cbe73cc, 22 September 2025Availability: 1 check, the latest on 29 September 2026: the link answers
- 29 September 2026: the link answers
15 files
- figures.ipynb, Jupyter, 177 lines
- marshall_intrinsic_units
/ , Python, 79 lines__init__.py - marshall_intrinsic_units
/ , Python, 513 lines, 1 matchmarshall_intrinsic_units .py - scripts/
run_bbx_macro.py , Python, 4 lines - scripts/
run_bbx_micro.py , Python, 12 lines - scripts/
run_bu_micro.py , Python, 7 lines - scripts/
run_cg_macro.py , Python, 4 lines - scripts/
run_cg_micro.py , Python, 4 lines - scripts/
run_min_macro.py , Python, 4 lines - scripts/
run_min_micro.py , Python, 4 lines - scripts/
run_sfn_micro.py , Python, 4 lines - scripts/
run_sfnn_micro.py , Python, 4 lines - scripts/
run_sfs_micro.py , Python, 4 lines - LICENSE, License, 674 lines
- README.md, Text, 21 lines
The paper's code and data availability statement is in the Data section.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 2 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 26 scripts, each with its path and the digest of its content;
- 1 match between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
No dataset and no data link were found in the paper.
Data availability
No new data were generated or analysed in support of this research. All code used to obtain figures and examples can be found at (Findlay and Marshall, 2025).
Reproduced under the paper's license (CC BY), from the paper cited above.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 29 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 4 authors, 6 keywords, 4 funders, 43 references.
Cite
This paper
Marshall, W., Findlay, G., Albantakis, L., & Tononi, G. (2026). Intrinsic units: identifying a system's causal grain. Neuroscience of consciousness, 2026(1), niag013. https://
BibTeX
@article{marshall2026int
author = {Marshall, William and Findlay, Graham and Albantakis, Larissa and Tononi, Giulio},
title = {{Intrinsic units: identifying a system's causal grain}},
journal = {Neuroscience of consciousness},
year = {2026},
month = apr,
volume = {2026},
number = {1},
pages = {niag013},
publisher = {Oxford University Press},
issn = {2057-2107},
doi = {10.1093/
url = {https://
pmid = {41993058},
pmcid = {PMC13082400}
}
RIS
TY - JOUR
AU - Marshall, William
AU - Findlay, Graham
AU - Albantakis, Larissa
AU - Tononi, Giulio
TI - Intrinsic units: identifying a system's causal grain
T2 - Neuroscience of consciousness
J2 - Neurosci Conscious
PY - 2026
DA - 2026/
VL - 2026
IS - 1
SP - niag013
SN - 2057-2107
PB - Oxford University Press
DO - 10.1093/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1093/
"type": "article-journal",
"title": "Intrinsic units: identifying a system's causal grain",
"container-title": "Neuroscience of consciousness",
"author": [
{
"family": "Marshall",
"given": "William"
},
{
"family": "Findlay",
"given": "Graham"
},
{
"family": "Albantakis",
"given": "Larissa"
},
{
"family": "Tononi",
"given": "Giulio"
}
],
"container-title-short":
"volume": "2026",
"issue": "1",
"page": "niag013",
"DOI": "10.1093/
"PMID": "41993058",
"PMCID": "PMC13082400",
"ISSN": "2057-2107",
"publisher": "Oxford University Press",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
15
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.3390/e28040410 [code]
- Intrinsic Cause-Effect Power: The Tradeoff Between Differentiation and Specification.Journal: Entropy (Basel, Switzerland)In common: Matplotlib, NumPy, 9 references
- [2] doi:10.1093/nsr/nwae279 [code]
- Finding emergence in data by maximizing effective information.Journal: National science reviewIn common: Matplotlib, NumPy, 8 references
- [3] doi:10.1371/journal.pcbi.1012572 [code]
- Capturing the emergent dynamical structure in biophysical neural models.Journal: PLoS computational biologyIn common: Matplotlib, NumPy, 7 references
- [4] doi:10.7554/elife.88173 [code]
- A synergistic workspace for human consciousness revealed by Integrated Information Decomposition.Journal: eLifeIn common: NumPy, 8 references
- [5] doi:10.3390/e25010026 [code]
- Neural Information Squeezer for Causal Emergence.Journal: Entropy (Basel, Switzerland)In common: Matplotlib, NumPy, 5 references
- [6] doi:10.3390/e24050625 [code]
- Emergence of Integrated Information at Macro Timescales in Real Neural Recordings.Journal: Entropy (Basel, Switzerland)In common: NumPy, 5 references
- [7] doi:10.1038/s42003-023-05063-y [code]
- An implementation of integrated information theory in resting-state fMRI.Journal: Communications biologyIn common: 6 references
- [8] doi:10.1093/nc/niaf024
- Decrease and recovery of integrated information Φ during anesthesia and sleep on human functional magnetic resonance imaging.Journal: Neuroscience of consciousnessIn common: 6 references
- [9] doi:10.3389/fnins.2025.1512724
- Integrated information theory reveals the potential role of the posterior parietal cortex in sustaining conditioning responses in classical conditioning tasks.Journal: Frontiers in neuroscienceIn common: 6 references
- [10] doi:10.1016/j.patter.2025.101457 [code]
- Evolving reservoir computers reveal bidirectional coupling between predictive power and emergent dynamics.Journal: Patterns (New York, N.Y.)In common: 5 references
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 2 repositories of the authors' code, each at its verified commit and with its license, 26 scripts, and 1 match between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:e15491a5659d28a3…
Add the badge to the code's README
If you are an author or a maintainer of this paper's code, you can add this badge. It says what OSCR knows of the paper (its code, its validated tracing map) and links the code to this page. Paste one of these snippets under the README's title. Keep the two marks around it, so that the badge can be replaced in place and is never added twice. OSCR changes nothing in your repository.
Markdown
<!-- oscr-badge:start -->
[](https://openscicode.org/badge/doi/10.1093/nc/niag013)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.1093/nc/niag013.svg
:target: https://openscicode.org/badge/doi/10.1093/nc/niag013
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1093/nc/niag013"><img src="https://openscicode.org/badge/doi/10.1093/nc/niag013.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->On GitHub, open the README, choose Edit (the pencil), paste the snippet under the title, then "Commit changes".
If you choose to, you can have the badge kept up to date for you, with oscr badge --write from the command line or with the GitHub Action in your repository's workflows. Every other form and option (a card, AsciiDoc, LaTeX, shields.io) is on the badge page.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: code errors and mismatches between the code and the paper about this paper and its code, from readers and its authors, beside the paper and its tracing map.
Report a mismatch between the code and the paper · Report a code error (signed in)
Reproductions: reports from readers who ran the authors' code and did not get the paper's result, what they ran, with which environment, commit and data.
Report a reproduction failure (signed in)
Versions of its code: the releases of its code tied to a version of this paper (the preprint, the accepted manuscript, the version of record…), each with the tracing map versioned with it.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
