OSCR

Phase-tuned modulation during reward expectancy in human anterior insular cortex.

Code ↔ Paper

2 matches 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.

2 blocks of code here have 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 2 matches
  1. [1] § Methods › Analysis of phase shifts in PAC temporal patterns ↔ Precession_utils.py, lines 119 to 192 · score 0.65 · circular linear correlation, circular variable, correlation coefficient, phases · block oscr:b:CRSWRB05375NM-5 · Report a mismatch
  2. [2] § Methods › Identification of RBPs and their pre-activation ↔ extractRSAvalues.m, lines 47 to 99 · score 0.57 · brain patterns, Fisher, overlap, transformed, Spearman, vector · block oscr:b:V8NK8VFWP2FH0-M · 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 · 388 lines · 12 KB · CC-BY-4.0 · 1 match

  1. import numpy as np
  2. import os
  3. import math
  4. import scipy as sp
  5. import pandas as pd
  6. import pycircstat as pcs
  7. import pyfftw
  8. import multiprocessing
  9. import numba
  10. from scipy.signal import find_peaks
  11. # These are the core functions used to identify both spatial and non-spatial phase precession
  12. def corrcc(alpha1, alpha2, axis=None):
  13. """
  14. Circular correlation coefficient for two circular random variables.
  15. Parameters
  16. ----------
  17. alpha1: 1d array
  18. sample of angles in radians
  19. alpha2: 1d array
  20. sample of angles in radians
  21. axis: int
  22. correlation coefficient is computed along this dimension
  23. (default axis=None, across all dimensions)
  24. Returns
  25. ----------
  26. rho: float
  27. Circular-circular correlation coefficient
  28. pval: float
  29. Circular-circular correlation p-value
  30. References: [Jammalamadaka2001]_
  31. Original: https://github.com/circstat/pycircstat
  32. modified by: Salman Qasim, 11/12/2018
  33. """
  34. assert alpha1.shape == alpha2.shape, 'Input dimensions do not match.'
  35. n = len(alpha1)
  36. # center data on circular mean
  37. alpha1_centered, alpha2_centered = pcs.descriptive.center(alpha1, alpha2, axis=axis)
  38. num = np.sum(np.sin(alpha1_centered) * np.sin(alpha2_centered), axis=axis)
  39. den = np.sqrt(np.sum(np.sin(alpha1_centered) ** 2, axis=axis) *
  40. np.sum(np.sin(alpha2_centered) ** 2, axis=axis))
  41. # compute correlation coefficient from p. 176
  42. rho = num / den
  43. # Modification:
  44. # significance of this correlation coefficient can be tested using the fact that Z is approx. normal
  45. l20 = np.mean(np.sin(alpha1_centered) ** 2)
  46. l02 = np.mean(np.sin(alpha2_centered) ** 2)
  47. l22 = np.mean((np.sin(alpha1_centered) ** 2) * (np.sin(alpha2_centered) ** 2))
  48. z = np.sqrt((n * l20 * l02) / l22) * rho
  49. pval = 2 * (1 - sp.stats.norm.cdf(np.abs(z))) # two-sided test
  50. return rho, pval
  51. def corrcc_uniform(alpha1, alpha2, axis=None):
  52. """
  53. Circular correlation coefficient for two circular random variables.
  54. Use if at least one of our variables may be a uniform distribution
  55. Parameters
  56. ----------
  57. alpha1: 1d array
  58. sample of angles in radians
  59. alpha2: 1d array
  60. sample of angles in radians
  61. axis: int
  62. correlation coefficient is computed along this dimension
  63. (default axis=None, across all dimensions)
  64. Returns
  65. ----------
  66. rho: float
  67. Circular-circular correlation coefficient
  68. pval: float
  69. Circular-circular correlation p-value
  70. References: [Jammalamadaka2001]_
  71. Original: https://github.com/circstat/pycircstat
  72. https://github.com/HoniSanders/measure_phaseprec/blob/master/cl_corr.m
  73. modified by: Salman Qasim, 11/12/2018
  74. """
  75. assert alpha1.shape == alpha2.shape, 'Input dimensions do not match.'
  76. n = len(alpha1)
  77. # center data on circular mean
  78. alpha1_centered, alpha2_centered = pcs.descriptive.center(alpha1, alpha2, axis=axis)
  79. # One of the sample means is not well defined due to uniform distribution of data
  80. # so take the difference of the resultant vector length for the sum and difference of the alphas
  81. num = pcs.descriptive.resultant_vector_length(alpha1 - alpha2) - pcs.descriptive.resultant_vector_length(alpha1 + alpha2)
  82. den = 2 * np.sqrt(np.sum(np.sin(alpha1_centered) ** 2, axis=axis) *
  83. np.sum(np.sin(alpha2_centered) ** 2, axis=axis))
  84. rho = n * num / den
  85. # significance of this correlation coefficient can be tested using the fact that Z is approx. normal
  86. l20 = np.mean(np.sin(alpha1_centered) ** 2)
  87. l02 = np.mean(np.sin(alpha2_centered) ** 2)
  88. l22 = np.mean((np.sin(alpha1_centered) ** 2) * (np.sin(alpha2_centered) ** 2))
  89. z = np.sqrt((n * l20 * l02) / l22) * rho
  90. pval = 2 * (1 - sp.stats.norm.cdf(np.abs(z))) # two-sided test
  91. return rho, pval
  92. def spatial_phase_precession(spike_phases, spike_position, slope_bounds=[-3*np.pi, 3*np.pi]):
  93. """
  94. Compute the circular-linear correlation as in: https://pubmed.ncbi.nlm.nih.gov/22487609/
  95. Parameters
  96. ----------
  97. circ : 1d array
  98. Circular data in radians (i.e. spike phases)
  99. lin : 1d array
  100. Linear data (i.e. spike positions)
  101. slope_bounds: 1d array, or tuple
  102. Slope range has to be restricted for optimization
  103. Returns
  104. ----------
  105. rho: float
  106. Circular-linear correlation coefficient
  107. pval: float
  108. Circular-linear correlation p-value
  109. sl: float
  110. Circular-linear correlation slope
  111. offs: float
  112. Circular-linear correlation offset
  113. Notes
  114. -----
  115. This is different from the linear-circular correlation used in: https://science.sciencemag.org/content/340/6138/1342
  116. I've modified the pcs.descriptive.corrcc function above to compute a p-value in two different scenarios
  117. """
  118. # Get rid of all the nans in this data
  119. nan_index = np.logical_or(np.isnan(circ), np.isnan(lin))
  120. circ = circ[~nan_index]
  121. lin = lin[~nan_index]
  122. # Make sure there are still valid data
  123. if np.size(lin) == 0:
  124. return np.nan, np.nan, np.nan, np.nan
  125. def myfun1(p):
  126. return -np.sqrt(
  127. (np.sum(np.cos(circ - (p * lin))) / len(circ)) ** 2 + (np.sum(np.sin(circ - (p * lin))) / len(circ)) ** 2)
  128. # finding the optimal slope, note that we have to restrict the range of slopes
  129. sl = sp.optimize.fminbound(myfun1, slope_bounds[0] / (np.max(lin) - np.min(lin)), slope_bounds[1] / (
  130. np.max(lin) - np.min(lin)))
  131. # calculate offset
  132. offs = np.arctan2(np.sum(np.sin(circ - (sl * lin))), np.sum(np.cos(circ - (sl * lin))))
  133. # circular variable derived from the linearization
  134. linear_circ = np.mod(abs(sl) * lin, 2 * np.pi)
  135. # # marginal distributions:
  136. # p1, z1 = pcs.tests.rayleigh(circ)
  137. # p2, z2 = pcs.tests.rayleigh(linear_circ)
  138. # circular-linear correlation:
  139. if (p1 > 0.5) | (p2 > 0.5):
  140. # This means at least one of our variables may be a uniform distribution
  141. rho, pval = corrcc_uniform(circ, linear_circ)
  142. else:
  143. rho, pval = corrcc(circ, linear_circ)
  144. # Assign the correct sign to rho
  145. if sl < 0:
  146. rho = -np.abs(rho)
  147. else:
  148. rho = np.abs(rho)
  149. return rho, pval, sl, offs
  150. @numba.jit(nopython=True)
  151. def pcorrelate(t, u, bins):
  152. """
  153. From : https://github.com/OpenSMFS/pycorrelate
  154. Compute correlation of two arrays of discrete events (Point-process).
  155. The input arrays need to be values of a point process, such as
  156. photon arrival times or positions. The correlation is efficiently
  157. computed on an arbitrary array of lag-bins. As an example, bins can be
  158. uniformly spaced in log-space and span several orders of magnitudes.
  159. (you can use :func:`make_loglags` to creat log-spaced bins).
  160. This function implements the algorithm described in
  161. `(Laurence 2006) <https://doi.org/10.1364/OL.31.000829>`__.
  162. Arguments:
  163. t (array): first array of "points" to correlate. The array needs
  164. to be monothonically increasing.
  165. u (array): second array of "points" to correlate. The array needs
  166. to be monothonically increasing.
  167. bins (array): bin edges for lags where correlation is computed.
  168. normalize (bool): if True, normalize the correlation function
  169. as typically done in FCS using :func:`pnormalize`. If False,
  170. return the unnormalized correlation function.
  171. Returns:
  172. Array containing the correlation of `t` and `u`.
  173. The size is `len(bins) - 1`.
  174. """
  175. nbins = len(bins) - 1
  176. # Array of counts (histogram)
  177. counts = np.zeros(nbins, dtype=np.int64)
  178. # For each bins, imin is the index of first `u` >= of each left bin edge
  179. imin = np.zeros(nbins, dtype=np.int64)
  180. # For each bins, imax is the index of first `u` >= of each right bin edge
  181. imax = np.zeros(nbins, dtype=np.int64)
  182. # For each ti, perform binning of (u - ti) and accumulate counts in Y
  183. for ti in t:
  184. for k, (tau_min, tau_max) in enumerate(zip(bins[:-1], bins[1:])):
  185. if k == 0:
  186. j = imin[k]
  187. # We start by finding the index of the first `u` element
  188. # which is >= of the first bin edge `tau_min`
  189. while j < len(u):
  190. if u[j] - ti >= tau_min:
  191. break
  192. j += 1
  193. imin[k] = j
  194. if imax[k] > j:
  195. j = imax[k]
  196. while j < len(u):
  197. if u[j] - ti >= tau_max:
  198. break
  199. j += 1
  200. imax[k] = j
  201. # Now j is the index of the first `u` element >= of
  202. # the next bin left edge
  203. counts += imax - imin
  204. G = counts / np.diff(bins)
  205. return G
  206. def fast_acf(counts, width, bin_width, cut_peak=True):
  207. """
  208. Super fast ACF function relying on numba (above).
  209. Parameters
  210. ----------
  211. cut_peak : bool
  212. Whether or not the largest central peak should be replaced for subsequent fitting
  213. counts : 1d array
  214. Variable of interest (i.e. spike times or spike phases)
  215. width: float
  216. Time window for ACF
  217. bin_width: float
  218. Width of bins
  219. Returns
  220. ----------
  221. acf: 1d array
  222. Counts for ACF
  223. bins: 1d array
  224. Lag bins for ACF
  225. Notes
  226. -----
  227. """
  228. n_b = int(np.ceil(width / bin_width)) # Num. edges per side
  229. # Define the edges of the bins (including rightmost bin)
  230. bins = np.linspace(-width, width, 2 * n_b, endpoint=True)
  231. temp = pcorrelate(counts, counts, np.split(bins, 2)[1])
  232. acf = np.ones(bins.shape[0] - 1)
  233. acf[0:temp.shape[0]] = np.flip(temp)
  234. acf[temp.shape[0]] = temp[0]
  235. acf[temp.shape[0] + 1:] = temp
  236. if cut_peak:
  237. acf[np.nanargmax(acf)] = np.sort(acf)[-2]
  238. return acf, bins
  239. def acf_power(acf, norm=True):
  240. """
  241. Compute the power spectrum of the signal by computing the FFT of the autocorrelation.
  242. Parameters
  243. ----------
  244. acf: 1d array
  245. Counts for ACF
  246. norm: bool
  247. To normalize or not
  248. Returns
  249. ----------
  250. psd: 1d array
  251. Power spectrum
  252. Notes
  253. -----
  254. """
  255. # Take the FFT
  256. fft = pyfftw.interfaces.numpy_fft.fft(acf, threads=multiprocessing.cpu_count())
  257. # Compute the power from the real component squared
  258. pow = (np.abs(fft) ** 2)
  259. # Account for nyquist
  260. psd = pow[0:round(pow.shape[0] / 2)]
  261. # normalize
  262. if norm:
  263. psd = psd / np.trapz(psd)
  264. return psd
  265. def nonspatial_phase_precession(unwrapped_spike_phases, width=4 * 2 * np.pi, bin_width=np.pi/3, cut_peak=True, norm=True, psd_lims = [0.65, 1.55]):
  266. """
  267. Compute the nonspatial spike-LFP relationship modulation index.
  268. Parameters
  269. ----------
  270. unwrapped_spike_phases : 1d array
  271. Spike phases that have been linearly unwrapped
  272. width: float
  273. Time window for ACF in cycles (default = 4 cycles)
  274. bin_width: float
  275. Width of bins in radians (default = 60 degrees)
  276. cut_peak : bool
  277. Whether or not the largest central peak should be replaced for subsequent fitting
  278. norm: bool
  279. To normalize the ACF or not
  280. Returns
  281. ----------
  282. max_freq: float
  283. Relative spike-LFP frequency of PSD peak
  284. MI: float
  285. Modulation index of non-spatial phase relationship
  286. Notes
  287. -----
  288. """
  289. frequencies = (np.arange(2 * (width // bin_width) - 1)) * (2 * np.pi) / (
  290. 2 * width - bin_width)
  291. freqs_of_interest = np.intersect1d(np.where(frequencies < psd_lims[0]),
  292. np.where(frequencies> psd_lims[1]))
  293. acf, _ = fast_acf(unwrapped_spike_phases, width, bin_width, cut_peak=cut_peak)
  294. psd = acf_power(acf, norm=norm)
  295. all_peaks = find_peaks(PSD_norm[freqs_of_interest], None)[0] # FIND ALL LOCAL MAXIMA IN WINDOW
  296. # make sure there is a peak.... .
  297. if ~np.any(all_peaks):
  298. return np.nan, np.nan
  299. max_peak = np.max(PSD_norm[freqs_of_interest][all_peaks])
  300. max_idx = [all_peaks[np.argmax(PSD_norm[freqs_of_interest][all_peaks])]]
  301. max_freq = frequencies[freqs_of_interest][max_idx]
  302. MI = max_peak / np.trapz(PSD_norm[freqs_of_interest])
  303. return max_freq, MI

Precession_utils.py, under CC-BY-4.0 · at the source

Overview

Authors: Linglin Yang1,2, Katia Lehongre3, Xinfeng Yu4, Hongyi Ye2, Vincent Navarro5,6,7, Sen Cheng8, Nikolai Axmacher9,10, Shuang Wang2, Hui Zhang9
  1. Department of Psychiatry, Second Affiliated Hospital, School of Medicine, Zhejiang University,Hangzhou, China
  2. Department of Neurology, Epilepsy Center, Second Affiliated Hospital, School of Medicine, Zhejiang University,Hangzhou, China
  3. CENIR - Centre de Neuro-Imagerie de Recherche, Paris Brain Institute, ICM, Hôpital de la Pitié-Salpêtrière,Paris, France
  4. Department of Radiology, Second Affiliated Hospital, School of Medicine, Zhejiang University,Hangzhou, China
  5. Sorbonne Université, Inserm, CNRS, Paris Brain Institute, ICM, Hôpital de la Pitié-Salpêtrière,Paris, France
  6. Epilepsy Unit, AP-HP, PitiéSalpêtrière Hospital,Paris, France
  7. Clinical Neurophysiology Department, AP-HP, Pitié-Salpêtrière Hospital,Paris, France
  8. Institute for Neural Computation, Faculty of Computer Science, Ruhr University Bochum,Bochum, Germany
  9. Department of Neuropsychology, Institute of Cognitive Neuroscience, Faculty of Psychology, Ruhr University Bochum,Bochum, Germany
  10. State Key Laboratory of Cognitive Neuroscience and Learning and IDG/McGovern Institute for Brain Research, Beijing Normal University,Beijing, PR China
Journal: Communications biology, volume 9, issue 1, article 1148
Dates: received 3 October 2025; accepted 28 May 2026; published online 16 June 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1038/s42003-026-10427-1 · PMID 42304129 · PMCID PMC13521940 · OpenAlex W7164931953
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: EEG (modality), human (organism)
Methods: Spectral & time-frequency, Preprocessing, Statistics, Connectivity, Machine learning
Keywords: Cognitive control, Reward
MeSH: Insular Cortex*, Reward*, Adult, Electroencephalography, Female, Humans, Male, Theta Rhythm, Young Adult (* major topic)
Topic: Neural dynamics and brain function (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Funding: Deutsche Forschungsgemeinschaft (ZH822/1-1, 316803389 - SFB 1280, projects F01); National Natural Science Foundation of China (81901319, 82471926, 81971207, 82171437)
Citations: not cited yet (Europe PMC); 84 references in the paper

Abstract

Reward expectancy engages the anterior insular cortex (AIC) to coordinate cognitive allocation. Using intracranial electroencephalographic data from epilepsy patients navigating a virtual T-maze, we identified reward-specific brain patterns (RBPs) that were preactivated in the AIC prior to reward onset. This pre-activation was followed by phase-amplitude coupling (PAC) between theta oscillations and gamma activity, with coupling strength positively correlated with the pre-activation level across contacts. Furthermore, this PAC exhibited a phase-precession-like effect (PPLE), characterized by a progressive shift of peak gamma activity to earlier theta phases across successive navigation rounds. Participants exhibiting stronger PPLE in the AIC showed greater trial-by-trial improvements in reward-collection performance. Taken together, these findings reveal a precise phase-tuned timing mechanism in the AIC that supports reward-directed behavior. Specifically, oscillatory coordination initiated by representational pre-activation, is dynamically refined through PPLE across successive exposures to the same reward. This mechanism accelerates responses to impending rewards, thereby optimizing adaptive behavior.

Reproduced under the paper's license (CC BY), from the paper cited above.

Repository

Its files are read in the Code ↔ Paper reader above, with 2 matches between paragraphs and lines of code.

figshare 30413173

License: CC-BY-4.0
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Languages: MATLAB (5), Python (3)
Size: 15 files, 8 scripts
Software Heritage: not checked
Found in: “Code availability”
Holds: README
Not found: license file, CITATION.cff, environment file, tests, continuous integration, documentation
Tools: Statistics and Machine Learning Toolbox (3 files), NumPy (3 files), SciPy (3 files), CircStat (1 file), Numba (1 file), pandas (1 file)
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
  • 27 September 2026: the link answers (HTTP 200)
9 files
At the source:

Code availability

The custom-written Matlab and Python code supporting the findings of this study will be made available at the Figshare repository84 https://doi.org/10.6084/m9.figshare.30413173.

Reproduced under the paper's license (CC BY), from the paper cited above.

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:

  • 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 8 scripts, each with its path and the digest of its content;
  • 2 matches 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

Data links

Data availability

The raw iEEG data are confidential medical records and cannot be publicly deposited due to ethical and privacy restrictions. All numerical data used to generate the data shown are available at the Figshare repository84 https://doi.org/10.6084/m9.figshare.30413173. Additional data that support the findings of this study are available from the corresponding author upon reasonable request.

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, 27 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 9 authors, 2 keywords, 9 MeSH terms, 2 funders, 83 references.

Cite

This paper

Yang, L., Lehongre, K., Yu, X., Ye, H., Navarro, V., Cheng, S., Axmacher, N., Wang, S., & Zhang, H. (2026). Phase-tuned modulation during reward expectancy in human anterior insular cortex. Communications biology, 9(1), 1148. https://doi.org/10.1038/s42003-026-10427-1

BibTeX

@article{yang2026phase,
author = {Yang, Linglin and Lehongre, Katia and Yu, Xinfeng and Ye, Hongyi and Navarro, Vincent and Cheng, Sen and Axmacher, Nikolai and Wang, Shuang and Zhang, Hui},
title = {{Phase-tuned modulation during reward expectancy in human anterior insular cortex}},
journal = {Communications biology},
year = {2026},
month = jun,
volume = {9},
number = {1},
pages = {1148},
publisher = {Nature Portfolio},
issn = {2399-3642},
doi = {10.1038/s42003-026-10427-1},
url = {https://doi.org/10.1038/s42003-026-10427-1},
pmid = {42304129},
pmcid = {PMC13521940}
}

RIS

TY - JOUR
AU - Yang, Linglin
AU - Lehongre, Katia
AU - Yu, Xinfeng
AU - Ye, Hongyi
AU - Navarro, Vincent
AU - Cheng, Sen
AU - Axmacher, Nikolai
AU - Wang, Shuang
AU - Zhang, Hui
TI - Phase-tuned modulation during reward expectancy in human anterior insular cortex
T2 - Communications biology
J2 - Commun Biol
PY - 2026
DA - 2026/06/16
VL - 9
IS - 1
SP - 1148
SN - 2399-3642
PB - Nature Portfolio
DO - 10.1038/s42003-026-10427-1
UR - https://doi.org/10.1038/s42003-026-10427-1
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s42003-026-10427-1",
"type": "article-journal",
"title": "Phase-tuned modulation during reward expectancy in human anterior insular cortex",
"container-title": "Communications biology",
"author": [
{
"family": "Yang",
"given": "Linglin"
},
{
"family": "Lehongre",
"given": "Katia"
},
{
"family": "Yu",
"given": "Xinfeng"
},
{
"family": "Ye",
"given": "Hongyi"
},
{
"family": "Navarro",
"given": "Vincent"
},
{
"family": "Cheng",
"given": "Sen"
},
{
"family": "Axmacher",
"given": "Nikolai"
},
{
"family": "Wang",
"given": "Shuang"
},
{
"family": "Zhang",
"given": "Hui"
}
],
"container-title-short": "Commun Biol",
"volume": "9",
"issue": "1",
"page": "1148",
"DOI": "10.1038/s42003-026-10427-1",
"PMID": "42304129",
"PMCID": "PMC13521940",
"ISSN": "2399-3642",
"publisher": "Nature Portfolio",
"URL": "https://doi.org/10.1038/s42003-026-10427-1",
"language": "en",
"issued": {
"date-parts": [
[
2026,
6,
16
]
]
}
}

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.1038/s41562-025-02268-5 [code]
Representational dynamics during extinction of fear memories in the human brain.
Journal: Nature human behaviour
In common: Statistics and Machine Learning Toolbox, EEG, 5 references, 2 authors
[2] doi:10.7554/elife.70296 [code]
Neuronal sequences during theta rely on behavior-dependent spatial maps.
Journal: eLife
In common: pandas, SciPy, NumPy, 7 references, author Sen Cheng
[3] doi:10.1038/s41467-023-41803-8 [code]
Phase information is conserved in sparse, synchronous population-rate-codes via phase-to-rate recoding.
Journal: Nature communications
In common: Numba, pandas, SciPy, 1 other tool, 9 references
[4] doi:10.7554/elife.86548 [code]
Theta- and gamma-band oscillatory uncoupling in the macaque hippocampus.
Journal: eLife
In common: CircStat, Statistics and Machine Learning Toolbox, NumPy, 9 references
[5] doi:10.1038/s41467-024-45898-5 [code]
Induced neural phase precession through exogenous electric fields.
Journal: Nature communications
In common: Statistics and Machine Learning Toolbox, NumPy, 9 references
[6] doi:10.1002/hipo.70008 [code]
Phase Precession Relative to Turning Angle in Theta-Modulated Head Direction Cells.
Journal: Hippocampus
In common: CircStat, pandas, SciPy, 1 other tool, 8 references
[7] doi:10.1038/s41467-024-52541-w [code]
Maintenance and transformation of representational formats during working memory prioritization.
Journal: Nature communications
In common: Statistics and Machine Learning Toolbox, SciPy, NumPy, EEG, 2 references, 2 authors
[8] doi:10.1016/j.celrep.2022.111395 [code]
Neural computations underlying contextual processing in humans.
Journal: Cell reports
In common: 10 references
[9] doi:10.1038/s41467-025-62553-9 [code]
Theta-phase locking of single neurons during human spatial memory.
Journal: Nature communications
In common: CircStat, Statistics and Machine Learning Toolbox, EEG, 7 references
[10] doi:10.1038/s41562-024-01983-9 [code]
Theta phase precession supports memory formation and retrieval of naturalistic experience in humans.
Journal: Nature human behaviour
In common: 9 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.1038/s42003-026-10427-1.svg)](https://openscicode.org/badge/doi/10.1038/s42003-026-10427-1)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

.. image:: https://openscicode.org/badge/doi/10.1038/s42003-026-10427-1.svg
   :target: https://openscicode.org/badge/doi/10.1038/s42003-026-10427-1
   :alt: OSCR

.. oscr-badge:end
HTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1038/s42003-026-10427-1"><img src="https://openscicode.org/badge/doi/10.1038/s42003-026-10427-1.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->

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)

Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.