OSCR

Intrinsic units: identifying a system's causal grain.

Code ↔ Paper

1 match between paragraphs of the paper and lines of its authors' code, computed by the harvester (lexical-v1). Click a colored paragraph or line to see its counterpart.

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. [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

  1. import pathlib
  2. import pickle
  3. import matplotlib.pyplot as plt
  4. import numpy as np
  5. import pyphi
  6. import pyphi.utils
  7. import pyphi.visualize
  8. from tqdm.auto import tqdm
  9. _BU_MICRO_SAVEDIR = "results/bu_micro" # "Binary units micro"
  10. _BBX_MACRO_SAVEDIR = "results/bbx_macro" # "Blackbox macro"
  11. _BBX_MICRO_SAVEDIR = "results/bbx_micro" # "Blackbox micro"
  12. _CG_MICRO_SAVEDIR = "results/cg_micro" # "Coarsegrain micro"
  13. _CG_MACRO_SAVEDIR = "results/cg_macro" # "Coarsegrain macro"
  14. _MIN_MICRO_SAVEDIR = "results/min_micro" # "Minimal micro"
  15. _MIN_MACRO_SAVEDIR = "results/min_macro" # "Minimal macro"
  16. _SFN_MICRO_SAVEDIR = "results/sfn_micro" # "Something from nothing"
  17. _SFNN_MICRO_SAVEDIR = "results/sfnn_micro" # "Something from nearly nothing"
  18. _SFS_MICRO_SAVEDIR = "results/sfs_micro" # "Something from something"
  19. def get_subsets_by_size(network):
  20. return {
  21. size: list(
  22. pyphi.utils.powerset(network.node_indices, min_size=size, max_size=size)
  23. )
  24. for size in range(1, len(network.node_indices) + 1)
  25. }
  26. def get_subsystem_string(network, subset):
  27. return "".join(sorted(np.array(network.node_labels)[list(subset)].tolist()))
  28. def run_example(
  29. network,
  30. network_state,
  31. subsystem_size=None,
  32. subsystem_index=None,
  33. verbose=1,
  34. savedir=None,
  35. ):
  36. # Create savedir if it does not already exist
  37. if savedir is not None:
  38. savedir = pathlib.Path(savedir)
  39. savedir.mkdir(parents=True, exist_ok=True)
  40. # Get specific subsystems to check
  41. if subsystem_size is not None:
  42. subsets = get_subsets_by_size(network)[subsystem_size]
  43. if subsystem_index is not None:
  44. subsets = [subsets[subsystem_index]]
  45. else: # Check all subsystems
  46. subsets = list(
  47. pyphi.utils.powerset(network.node_indices, nonempty=True, reverse=True)
  48. )
  49. sias = {}
  50. for subset in tqdm(subsets):
  51. # Print progress for user
  52. subsystem_string = get_subsystem_string(network, subset)
  53. if verbose:
  54. print(f"Doing {subsystem_string}...")
  55. # Do actual work
  56. subsystem = pyphi.Subsystem(network, network_state, subset)
  57. sias[subset] = subsystem.sia()
  58. # Print output and save
  59. if verbose == 1:
  60. print(f" φ_s: {[sias[subset].phi]}")
  61. elif verbose >= 2:
  62. print(sias[subset])
  63. if savedir is not None:
  64. with open(savedir / f"{subsystem_string}.pickle", "wb") as f:
  65. pickle.dump(sias[subset], f, protocol=pickle.HIGHEST_PROTOCOL)
  66. def summarize_example(network, savedir):
  67. savedir = pathlib.Path(savedir)
  68. subsets = get_subsets_by_size(network)
  69. with open(savedir / "summary.txt", "w") as f:
  70. for subsystem_size in range(1, len(network.node_indices) + 1):
  71. f.write(f"====={subsystem_size}-node subsystems=====\n")
  72. for subset in subsets[subsystem_size]:
  73. subsystem_string = get_subsystem_string(network, subset)
  74. subsystem_file = savedir / f"{subsystem_string}.pickle"
  75. if subsystem_file.exists():
  76. with open(subsystem_file, "rb") as pf:
  77. sia = pickle.load(pf)
  78. f.write(f"φ_s({subsystem_string}) = {sia.phi}\n")
  79. def run_binary_units_micro_example(savedir=_BU_MICRO_SAVEDIR, **kwargs):
  80. network, network_state = get_binary_units_micro_example()
  81. run_example(network, network_state, savedir=savedir, **kwargs)
  82. def summarize_binary_units_micro_example(savedir=_BU_MICRO_SAVEDIR):
  83. network, _ = get_binary_units_micro_example()
  84. summarize_example(network, savedir)
  85. def run_blackbox_micro_example(savedir=_BBX_MICRO_SAVEDIR, **kwargs):
  86. network, network_state = get_blackbox_micro_example()
  87. run_example(network, network_state, savedir=savedir, **kwargs)
  88. def summarize_blackbox_micro_example(savedir=_BBX_MICRO_SAVEDIR):
  89. network, _ = get_blackbox_micro_example()
  90. summarize_example(network, savedir)
  91. def run_blackbox_macro_example(savedir=_BBX_MACRO_SAVEDIR, **kwargs):
  92. network, network_state = get_blackbox_macro_example()
  93. run_example(network, network_state, savedir=savedir, **kwargs)
  94. def summarize_blackbox_macro_example(savedir=_BBX_MACRO_SAVEDIR):
  95. network, _ = get_blackbox_macro_example()
  96. summarize_example(network, savedir)
  97. def run_coarsegrain_micro_example(savedir=_CG_MICRO_SAVEDIR, **kwargs):
  98. network, network_state = get_coarsegrain_micro_example()
  99. run_example(network, network_state, savedir=savedir, **kwargs)
  100. def summarize_coarsegrain_micro_example(savedir=_CG_MICRO_SAVEDIR):
  101. network, _ = get_coarsegrain_micro_example()
  102. summarize_example(network, savedir)
  103. def run_coarsegrain_macro_example(savedir=_CG_MACRO_SAVEDIR, **kwargs):
  104. network, network_state = get_coarsegrain_macro_example()
  105. run_example(network, network_state, savedir=savedir, **kwargs)
  106. def summarize_coarsegrain_macro_example(savedir=_CG_MACRO_SAVEDIR):
  107. network, _ = get_coarsegrain_macro_example()
  108. summarize_example(network, savedir)
  109. def run_minimal_micro_example(savedir=_MIN_MICRO_SAVEDIR, **kwargs):
  110. network, network_state = get_minimal_micro_example()
  111. run_example(network, network_state, savedir=savedir, **kwargs)
  112. def summarize_minimal_micro_example(savedir=_MIN_MICRO_SAVEDIR):
  113. network, _ = get_minimal_micro_example()
  114. summarize_example(network, savedir)
  115. def run_minimal_macro_example(savedir=_MIN_MACRO_SAVEDIR, **kwargs):
  116. network, network_state = get_minimal_macro_example()
  117. run_example(network, network_state, savedir=savedir, **kwargs)
  118. def summarize_minimal_macro_example(savedir=_MIN_MACRO_SAVEDIR):
  119. network, _ = get_minimal_macro_example()
  120. summarize_example(network, savedir)
  121. def run_something_from_nothing_micro_example(savedir=_SFN_MICRO_SAVEDIR, **kwargs):
  122. network, network_state = get_something_from_nothing_micro_example()
  123. run_example(network, network_state, savedir=savedir, **kwargs)
  124. def summarize_something_from_nothing_micro_example(savedir=_SFN_MICRO_SAVEDIR):
  125. network, _ = get_something_from_nothing_micro_example()
  126. summarize_example(network, savedir)
  127. def run_something_from_nearly_nothing_micro_example(
  128. savedir=_SFNN_MICRO_SAVEDIR, **kwargs
  129. ):
  130. network, network_state = get_something_from_nearly_nothing_micro_example()
  131. run_example(network, network_state, savedir=savedir, **kwargs)
  132. def summarize_something_from_nearly_nothing_micro_example(savedir=_SFNN_MICRO_SAVEDIR):
  133. network, _ = get_something_from_nearly_nothing_micro_example()
  134. summarize_example(network, savedir)
  135. def run_something_from_something_micro_example(savedir=_SFS_MICRO_SAVEDIR, **kwargs):
  136. network, network_state = get_something_from_something_micro_example()
  137. run_example(network, network_state, savedir=savedir, **kwargs)
  138. def summarize_something_from_something_micro_example(savedir=_SFS_MICRO_SAVEDIR):
  139. network, _ = get_something_from_something_micro_example()
  140. summarize_example(network, savedir)
  141. def _get_iit4_fig6d_micro_tpm():
  142. node_labels = ("A", "B", "C", "D", "E", "F")
  143. network_size = len(node_labels)
  144. current_states = np.array(list(pyphi.utils.all_states(network_size)))
  145. tpm = np.zeros_like(current_states, dtype=float)
  146. k = 4
  147. for current_state, p in zip(current_states, tpm):
  148. # Convert 0s to -1s for sigmoidal activation function
  149. current_state = np.where(current_state == 0, -1, current_state)
  150. total_input = np.sum(current_state)
  151. prob = 1.0 / (1.0 + np.exp(-k * total_input))
  152. p[:] = prob
  153. return tpm, current_states, node_labels
  154. def get_iit4_fig6d():
  155. tpm, _, node_labels = _get_iit4_fig6d_micro_tpm()
  156. network = pyphi.Network(tpm, node_labels=node_labels)
  157. state = (1, 0, 0, 0, 0, 0)
  158. return network, state
  159. def get_binary_units_micro_example():
  160. tpm = np.array(
  161. [
  162. [1, 1, 1],
  163. [0, 1, 0],
  164. [0, 0, 0],
  165. [1, 1, 0],
  166. [0, 0, 1],
  167. [0, 1, 1],
  168. [1, 0, 1],
  169. [1, 0, 0],
  170. ]
  171. )
  172. node_labels = ("A", "B", "C")
  173. network = pyphi.Network(tpm, node_labels=node_labels)
  174. state = (0, 0, 0)
  175. return network, state
  176. def _get_blackbox_example_micro_tpm():
  177. node_labels = ("A", "B", "C", "D", "E", "F", "G", "H")
  178. network_size = len(node_labels)
  179. current_states = np.array(list(pyphi.utils.all_states(network_size)))
  180. tpm = np.zeros_like(current_states, dtype=float)
  181. for current_state, p in zip(current_states, tpm):
  182. p[0] = (
  183. 0.01
  184. + 0.01 * current_state[0]
  185. + 0.1 * current_state[3]
  186. + 0.8 * current_state[6]
  187. + 0.05 * current_state[1]
  188. ) # A
  189. p[1] = (
  190. 0.01
  191. + 0.01 * current_state[1]
  192. + 0.1 * current_state[3]
  193. + 0.8 * current_state[6]
  194. + 0.05 * current_state[0]
  195. ) # B
  196. p[2] = (
  197. 0.01
  198. + 0.01 * current_state[2]
  199. + 0.85 * int(current_state[0] + current_state[1] > 0)
  200. + 0.1 * int(current_state[0] + current_state[1] == 2)
  201. ) # C
  202. p[3] = (
  203. 0.01
  204. + 0.01 * current_state[3]
  205. + 0.85 * current_state[2]
  206. + 0.05 * (current_state[0] + current_state[1])
  207. ) # D
  208. p[4] = (
  209. 0.01
  210. + 0.01 * current_state[4]
  211. + 0.1 * current_state[7]
  212. + 0.8 * current_state[2]
  213. + 0.05 * current_state[5]
  214. ) # E
  215. p[5] = (
  216. 0.01
  217. + 0.01 * current_state[5]
  218. + 0.1 * current_state[7]
  219. + 0.8 * current_state[2]
  220. + 0.05 * current_state[4]
  221. ) # F
  222. p[6] = (
  223. 0.01
  224. + 0.01 * current_state[6]
  225. + 0.85 * int(current_state[4] + current_state[5] > 0)
  226. + 0.1 * int(current_state[4] + current_state[5] == 2)
  227. ) # G
  228. p[7] = (
  229. 0.01
  230. + 0.01 * current_state[7]
  231. + 0.85 * current_state[6]
  232. + 0.05 * (current_state[4] + current_state[5])
  233. ) # H
  234. return tpm, current_states, node_labels
  235. def get_blackbox_micro_example():
  236. tpm, _, node_labels = _get_blackbox_example_micro_tpm()
  237. network = pyphi.Network(tpm, node_labels=node_labels)
  238. state = (1, 1, 1, 1, 1, 1, 1, 1)
  239. return network, state
  240. def _get_blackbox_example_macro_tpm():
  241. micro_tpm, micro_states, _ = _get_blackbox_example_micro_tpm()
  242. tpm = pyphi.convert.sbn2sbs(micro_tpm)
  243. tpm2 = np.dot(tpm, tpm) # Take tau=2
  244. D00 = np.where((micro_states[:, 2] == 0) & (micro_states[:, 6] == 0))[0]
  245. D10 = np.where((micro_states[:, 2] == 1) & (micro_states[:, 6] == 0))[0]
  246. D01 = np.where((micro_states[:, 2] == 0) & (micro_states[:, 6] == 1))[0]
  247. D11 = np.where((micro_states[:, 2] == 1) & (micro_states[:, 6] == 1))[0]
  248. Dalpha0 = np.where(micro_states[:, 2] == 0)[0]
  249. Dalpha1 = np.where(micro_states[:, 2] == 1)[0]
  250. Dbeta0 = np.where(micro_states[:, 6] == 0)[0]
  251. Dbeta1 = np.where(micro_states[:, 6] == 1)[0]
  252. assert micro_tpm.shape[0] == 2**8
  253. assert micro_tpm.shape[1] == 8
  254. macro_network_size = 2
  255. macro_states = np.array(list(pyphi.utils.all_states(macro_network_size)))
  256. macro_tpm = np.zeros_like(macro_states, dtype=float) # state-by-node
  257. macro_node_labels = ("α", "β")
  258. macro_tpm[0, 0] = np.mean(np.sum(tpm2[D00[:, np.newaxis], Dalpha1], axis=1))
  259. macro_tpm[0, 1] = np.mean(np.sum(tpm2[D00[:, np.newaxis], Dbeta1], axis=1))
  260. macro_tpm[1, 0] = np.mean(np.sum(tpm2[D10[:, np.newaxis], Dalpha1], axis=1))
  261. macro_tpm[1, 1] = np.mean(np.sum(tpm2[D10[:, np.newaxis], Dbeta1], axis=1))
  262. macro_tpm[2, 0] = np.mean(np.sum(tpm2[D01[:, np.newaxis], Dalpha1], axis=1))
  263. macro_tpm[2, 1] = np.mean(np.sum(tpm2[D01[:, np.newaxis], Dbeta1], axis=1))
  264. macro_tpm[3, 0] = np.mean(np.sum(tpm2[D11[:, np.newaxis], Dalpha1], axis=1))
  265. macro_tpm[3, 1] = np.mean(np.sum(tpm2[D11[:, np.newaxis], Dbeta1], axis=1))
  266. return macro_tpm, macro_states, macro_node_labels
  267. def get_blackbox_macro_example():
  268. tpm, _, node_labels = _get_blackbox_example_macro_tpm()
  269. network = pyphi.Network(tpm, node_labels=node_labels)
  270. state = (1, 1)
  271. return network, state
  272. def get_coarsegrain_micro_example():
  273. tpm = np.array(
  274. [
  275. [0.05, 0.05, 0.05, 0.05],
  276. [0.06, 0.15, 0.05, 0.05],
  277. [0.15, 0.06, 0.05, 0.05],
  278. [0.16, 0.16, 0.85, 0.85],
  279. [0.05, 0.05, 0.06, 0.15],
  280. [0.06, 0.15, 0.06, 0.15],
  281. [0.15, 0.06, 0.06, 0.15],
  282. [0.16, 0.16, 0.86, 0.95],
  283. [0.05, 0.05, 0.15, 0.06],
  284. [0.06, 0.15, 0.15, 0.06],
  285. [0.15, 0.06, 0.15, 0.06],
  286. [0.16, 0.16, 0.95, 0.86],
  287. [0.85, 0.85, 0.16, 0.16],
  288. [0.86, 0.95, 0.16, 0.16],
  289. [0.95, 0.86, 0.16, 0.16],
  290. [0.96, 0.96, 0.96, 0.96],
  291. ]
  292. )
  293. node_labels = ("A", "B", "C", "D")
  294. network = pyphi.Network(tpm, node_labels=node_labels)
  295. state = (0, 0, 0, 0)
  296. return network, state
  297. def get_coarsegrain_macro_example():
  298. tpm = np.array(
  299. [[0.006833, 0.006833], [0.0256, 0.7855], [0.7855, 0.0256], [0.9212, 0.9212]]
  300. )
  301. node_labels = ("α", "β")
  302. network = pyphi.Network(tpm, node_labels=node_labels)
  303. state = (0, 0)
  304. return network, state
  305. def get_minimal_micro_example():
  306. tpm = np.array(
  307. [
  308. [0.05, 0.05],
  309. [0.05, 0.06],
  310. [0.06, 0.05],
  311. [0.95, 0.95],
  312. ]
  313. )
  314. node_labels = ("A", "B")
  315. network = pyphi.Network(tpm, node_labels=node_labels)
  316. state = (0, 0)
  317. return network, state
  318. def get_minimal_macro_example():
  319. tpm = np.array([[0.05 * 0.05 + 2 * 0.01 * 0.05 / 3], [(1 - 0.05) * (1 - 0.05)]])
  320. node_labels = ("α",)
  321. network = pyphi.Network(tpm, node_labels=node_labels)
  322. state = (0,)
  323. return network, state
  324. def get_dancing_couple_node(
  325. current_state: np.ndarray,
  326. self_index: int,
  327. horizontal_neighbor: int,
  328. vertical_neighbor: int,
  329. w_vertical: float,
  330. w_base: float = 0.05,
  331. w_self: float = 0.05,
  332. w_horizontal: float = 0.6,
  333. ) -> float:
  334. return (
  335. w_base
  336. + w_self * current_state[self_index]
  337. + w_horizontal * current_state[horizontal_neighbor]
  338. + w_vertical * current_state[vertical_neighbor]
  339. )
  340. def get_dancing_couples_network(w_vertical: float) -> np.ndarray:
  341. node_labels = ("A", "B", "C", "D")
  342. connectivity = {
  343. 0: {"horizontal_neighbor": 1, "vertical_neighbor": 2},
  344. 1: {"horizontal_neighbor": 0, "vertical_neighbor": 3},
  345. 2: {"horizontal_neighbor": 3, "vertical_neighbor": 0},
  346. 3: {"horizontal_neighbor": 2, "vertical_neighbor": 1},
  347. }
  348. network_size = len(node_labels)
  349. current_states = np.array(list(pyphi.utils.all_states(network_size)))
  350. tpm = np.zeros_like(current_states, dtype=float)
  351. for current_state, p in zip(current_states, tpm):
  352. for i in connectivity:
  353. p[i] = get_dancing_couple_node(
  354. current_state,
  355. i,
  356. connectivity[i]["horizontal_neighbor"],
  357. connectivity[i]["vertical_neighbor"],
  358. w_vertical=w_vertical,
  359. )
  360. return pyphi.Network(tpm, node_labels=node_labels)
  361. def get_something_from_nothing_micro_example():
  362. network = get_dancing_couples_network(w_vertical=0.00)
  363. state = (0, 0, 0, 0)
  364. return network, state
  365. def get_something_from_nearly_nothing_micro_example():
  366. network = get_dancing_couples_network(w_vertical=0.01)
  367. state = (0, 0, 0, 0)
  368. return network, state
  369. def get_something_from_something_micro_example():
  370. network = get_dancing_couples_network(w_vertical=0.25)
  371. state = (0, 0, 0, 0)
  372. return network, state
  373. #### Plotting functions #####
  374. def plot_sbs_tpm(network, use_node_labels=True, height=None):
  375. def _italicize(text):
  376. return "$\it{" + "".join(text) + "}$"
  377. sbs = pyphi.convert.state_by_node2state_by_state(network.tpm)
  378. states_labels = list(pyphi.utils.all_states(network.size))
  379. if use_node_labels:
  380. state_labels = [
  381. pyphi.visualize.phi_structure.text.Labeler(
  382. state, network.node_labels, postprocessor=_italicize
  383. ).nodes(network.node_indices)
  384. for state in states_labels
  385. ]
  386. figsize = None if height is None else (height, height)
  387. fig, ax = plt.subplots(figsize=figsize)
  388. ax.pcolormesh(sbs, edgecolors="k", linewidth=0.5, cmap="Greys", vmin=0, vmax=1)
  389. ax.tick_params(
  390. top=False,
  391. labeltop=use_node_labels,
  392. bottom=False,
  393. labelbottom=False,
  394. left=False,
  395. labelleft=use_node_labels,
  396. )
  397. if use_node_labels:
  398. ax.set_xticks(
  399. np.arange(len(state_labels)) + 0.5, labels=state_labels, rotation=90
  400. )
  401. ax.set_yticks(np.arange(len(state_labels)) + 0.5, labels=state_labels)
  402. ax.set_aspect("equal")
  403. ax.invert_yaxis()
  404. return fig, ax

marshall_intrinsic_units.py at commit 48471b5, under GPL-3.0 · at the source

Overview

Authors: William Marshall1, Graham Findlay2, Larissa Albantakis2, Giulio Tononi2
  1. Department of Mathematics and Statistics, Brock University, 1812 Sir Isaac Brock Way, St. Catharines, Ontario, L2S 3A1, Canada
  2. Department of Psychiatry, University of Wisconsin-Madison, 6001 Research Park Blvd, Madison, WI, 53719, United States
Institutions: Brock University (Canada); University of Wisconsin–Madison (United States)
Journal: Neuroscience of consciousness, volume 2026, issue 1, article niag013
Dates: received 10 January 2025; accepted 13 February 2026; published online 15 April 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1093/nc/niag013 · PMID 41993058 · PMCID PMC13082400 · OpenAlex W7154469130
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: computational modeling (no new data) (modality), none (in silico) (organism)
Keywords: theories and models, philosophy, consciousness, computational modeling, integrated information, causal emergence
Topic: Embodied and Extended Cognition (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Funding: Templeton World Charity Foundation (TWCF 0216); David P White Chair in Sleep Medicine at the University of Wisconsin-Madison; Tiny Blue Dot Foundation (UW 133AAG3451); Natural Sciences and Engineering Research Council of Canada (RGPIN-2019-05418)
Citations: not cited yet (Europe PMC); 49 references in the paper

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

License: GPL-3.0
State: the link answers, verified on 29 September 2026
Evidence: files inventoried
Size: 1 file
Software Heritage: not checked
Found in: the references
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Tools: Matplotlib (2 files), NumPy (2 files)
Availability: 1 check, the latest on 29 September 2026: the link answers (HTTP 200)
  • 29 September 2026: the link answers (HTTP 200)
15 files
At the source:

csc-uw/marshall-intrinsic-units

License: GPL-3.0
State: the link answers, verified on 29 September 2026
Evidence: files inventoried
Commit: 48471b5d43e1453ac536cd4d3a5c48820cbe73cc, 22 September 2025
Languages: Python (12), Jupyter (1)
Size: 30 files, 13 scripts
Software Heritage: not archived
Found in: the Zenodo archive record
Holds: README, license file, CITATION.cff, environment (pyproject.toml, uv.lock), 1 notebook
Not found: tests, continuous integration, documentation
Tools: Matplotlib (2 files), NumPy (2 files)
Availability: 1 check, the latest on 29 September 2026: the link answers
  • 29 September 2026: the link answers
15 files

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://doi.org/10.1093/nc/niag013

BibTeX

@article{marshall2026intrinsic,
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/nc/niag013},
url = {https://doi.org/10.1093/nc/niag013},
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/04/15
VL - 2026
IS - 1
SP - niag013
SN - 2057-2107
PB - Oxford University Press
DO - 10.1093/nc/niag013
UR - https://doi.org/10.1093/nc/niag013
LA - en
ER -

CSL-JSON

{
"id": "10.1093/nc/niag013",
"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": "Neurosci Conscious",
"volume": "2026",
"issue": "1",
"page": "niag013",
"DOI": "10.1093/nc/niag013",
"PMID": "41993058",
"PMCID": "PMC13082400",
"ISSN": "2057-2107",
"publisher": "Oxford University Press",
"URL": "https://doi.org/10.1093/nc/niag013",
"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 review
In 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 biology
In common: Matplotlib, NumPy, 7 references
[4] doi:10.7554/elife.88173 [code]
A synergistic workspace for human consciousness revealed by Integrated Information Decomposition.
Journal: eLife
In 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 biology
In 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 consciousness
In 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 neuroscience
In 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.

Add the badge to the code's README

OSCR: the badge of this paper

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 -->
[![OSCR](https://openscicode.org/badge/doi/10.1093/nc/niag013.svg)](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:end
HTML
<!-- 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.