Planar, spiral, and concentric traveling waves distinguish behavioral states in human memory.
3 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 6 matches
- [1] § Methods › Identification of traveling waves ↔ TW_Code/par_funcs_fine.py, lines 163 to 268 · score 0.79 · circular linear regression, vector length, circular correlation, cos, sin, predicted · block
oscr:b:H8M9R53AT8TQ1-N· Report a mismatch - [2] § Methods › Identification of traveling waves ↔ TW_Code/par_funcs_fine.py, lines 163 to 268 · score 0.71 · phase offset, predicted phase, Circular linear, angle, regression · block
oscr:b:H8M9R53AT8TQ1-N· Report a mismatch - [3] § Methods › Validating CICA using simulations ↔ TW_Code/wave_spatial_autocorrelation_ica.ipynb, lines 89 to 132 · score 0.64 · circular shift, spatial autocorrelation, permutation, rotational wave, noise · Report a mismatch
- [4] § Methods › Electrophysiological recordings and preprocessing ↔ TW_Code/RAM_helpers.py, lines 291 to 436 · score 0.63 · electrode location, clinical, configuration, strips, depth, contacts · block
oscr:b:C3JFA78P2AMWA-C· Report a mismatch - [5] § Methods › Identification of oscillations ↔ TW_Code/Anup-th1-grids-2D-fine-CPCAM.ipynb, lines 324 to 400 · score 0.54 · normalized power spectrum, peak frequencies, algorithm, cluster, electrode · Report a mismatch
- [6] § Methods › Identification of oscillations ↔ TW_Code/par_funcs_fine.py, lines 22 to 49 · score 0.51 · standard deviation, power spectrum, fit, peaks, electrode · block
oscr:b:0BFX5CEAXTJ28-0· 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 · 464 lines · 16 KB · no license · 3 matches
- """
- A set of functions that you
- """
- import numpy as np
- import statsmodels.api as sm
- import pdb
- import numexpr
- from scipy.signal import argrelmax
- from scipy.stats import ttest_ind
- from xarray import concat
- from ptsa.data.timeseries import TimeSeries
- from ptsa.data.filters import MorletWaveletFilter
- from tqdm import tqdm
- import pycircstat
- from numpy import exp
- from scipy.optimize import curve_fit
- import matplotlib.pyplot as plt
- from math import cos,sin
- def par_find_peaks_by_chan(p_spect_array, frequencies, std_thresh=1.):
- """
- Parameters
- ----------
- p_spect_array: numpy.ndarray
- An array with dimensions frequencies x channels
- frequencies: numpy.ndarray
- An array of the frequencies used
- std_thresh: float
- Threshold in number of standard deviations above the corrected power spectra to be counted as a peak
- Returns
- -------
- peaks_all_chans: numpy.ndarray with type bool
- An array of booleans the same shape as p_spect_array, specifying if there is a peak at a given frequency
- and electrode
- """
- peaks_all_chans = np.zeros(p_spect_array.shape).astype(bool)
- for i, chan_data in enumerate(p_spect_array.T):
- x = sm.tools.tools.add_constant(np.log10(frequencies))
- model_res = sm.RLM(chan_data, x).fit()
- peak_inds = argrelmax(model_res.resid)
- peaks = np.zeros(x.shape[0], dtype=bool)
- peaks[peak_inds] = True
- above_thresh = model_res.resid > (np.std(model_res.resid) * std_thresh)
- peaks_all_chans[:,i] = peaks & above_thresh
- return peaks_all_chans
- def par_robust_reg(info):
- """
- Parallelizable robust regression function
- info: two element list. first element, power spectra: # freqs x # elecs. Second element: log transformed freqs
- returns intercepts, slopes, resids
- """
- p_spects = info[0]
- x = sm.tools.tools.add_constant(info[1])
- # holds slope of fit line
- slopes = np.empty((p_spects.shape[1]))
- slopes[:] = np.nan
- # holds residuals
- resids = np.empty((p_spects.shape[0], p_spects.shape[1]))
- resids[:] = np.nan
- # holds intercepts
- intercepts = np.empty((p_spects.shape[1]))
- intercepts[:] = np.nan
- # holds mean height of fit line
- bband_power = np.empty((p_spects.shape[1]))
- bband_power[:] = np.nan
- # loop over every electrode
- for i, y in enumerate(p_spects.T):
- model_res = sm.RLM(y, x).fit()
- intercepts[i] = model_res.params[0]
- slopes[i] = model_res.params[1]
- bband_power[i] = model_res.fittedvalues.mean()
- resids[:, i] = model_res.resid
- return intercepts, slopes, resids, bband_power
- def par_robust_reg_no_low_freqs(info):
- """
- Parallelizable robust regression function
- info: two element list. first element, power spectra: # freqs x # elecs. Second element: log transformed freqs
- returns intercepts, slopes, resids
- """
- p_spects = info[0]
- x = sm.tools.tools.add_constant(info[1])
- freq_inds = info[2]
- # holds slope of fit line
- slopes = np.empty((p_spects.shape[1]))
- slopes[:] = np.nan
- # holds residuals
- resids = np.empty((p_spects.shape[0], p_spects.shape[1]))
- resids[:] = np.nan
- # holds intercepts
- intercepts = np.empty((p_spects.shape[1]))
- intercepts[:] = np.nan
- # holds mean height of fit line
- bband_power = np.empty((p_spects.shape[1]))
- bband_power[:] = np.nan
- # loop over every electrode
- for i, y in enumerate(p_spects.T):
- model_res = sm.RLM(y[freq_inds], x[freq_inds]).fit()
- intercepts[i] = model_res.params[0]
- slopes[i] = model_res.params[1]
- bband_power[i] = model_res.fittedvalues.mean()
- resids[:, i] = y - ((x[:, 1]*model_res.params[1]) + model_res.params[0])
- return intercepts, slopes, resids, bband_power
- def my_local_max(arr):
- """
- Returns indices of local maxima in a 1D array. Unlike scipy.signal.argrelmax, this does not ignore consecutive
- values that are peaks. It finds the last repetition.
- """
- b1 = arr[:-1] <= arr[1:]
- b2 = arr[:-1] > arr[1:]
- k = np.where(b1[:-1] & b2[1:])[0] + 1
- if arr[0] > arr[1]:
- k = np.append(k, 0)
- if arr[-1] > arr[-2]:
- k = np.append(k, len(arr) - 1)
- return k
- def par_find_peaks(info):
- """
- Parallelizable peak picking function, uses robust reg but returns
- """
- p_spect = info[0]
- x = sm.tools.tools.add_constant(info[1])
- model_res = sm.RLM(p_spect, x).fit()
- peak_inds = my_local_max(model_res.resid)
- peaks = np.zeros(x.shape[0], dtype=bool)
- peaks[peak_inds] = True
- above_thresh = model_res.resid > np.std(model_res.resid)
- peaks = peaks & above_thresh
- return peaks
- def circ_lin_regress(phases, coords, theta_r, params):
- """
- Performs 2D circular linear regression.
- This is ported from Honghui's matlab code.
- :param phases:
- :param coords:
- :return:
- """
- n = phases.shape[1]
- pos_x = np.expand_dims(coords[:, 0], 1)
- pos_y = np.expand_dims(coords[:, 1], 1)
- # compute predicted phases for angle and phase offset
- x = np.expand_dims(phases, 2) - params[:, 0] * pos_x - params[:, 1] * pos_y
- # Compute resultant vector length. This is faster than calling pycircstat.resultant_vector_length
- # now = time.time()
- x1 = numexpr.evaluate('sum(cos(x) / n, axis=1)')
- x1 = numexpr.evaluate('x1 ** 2')
- x2 = numexpr.evaluate('sum(sin(x) / n, axis=1)')
- x2 = numexpr.evaluate('x2 ** 2')
- Rs = numexpr.evaluate('-sqrt(x1 + x2)')
- # for each time and event, find the parameters with the smallest -R
- min_vals = theta_r[np.argmin(Rs, axis=1)]
- sl = min_vals[:, 1] * np.array([np.cos(min_vals[:, 0]), np.sin((min_vals[:, 0]))])
- offs = np.arctan2(np.sum(np.sin(phases.T - sl[0, :] * pos_x - sl[1, :] * pos_y), axis=0),
- np.sum(np.cos(phases.T - sl[0, :] * pos_x - sl[1, :] * pos_y), axis=0))
- pos_circ = np.mod(sl[0, :] * pos_x + sl[1, :] * pos_y + offs, 2 * np.pi)
- # compute circular correlation coefficient between actual phases and predicited phases
- circ_corr_coef = pycircstat.corrcc(phases.T, pos_circ, axis=0)
- # compute adjusted r square
- # pdb.set_trace()
- r2_adj = circ_corr_coef ** 2
- # r2_adj = 1 - ((1 - circ_corr_coef ** 2) * (n - 1)) / (n - 4)
- wave_ang = min_vals[:, 0]
- wave_freq = min_vals[:, 1]
- #re-estimate finer parameters
- wave_ang_fine = []
- wave_freq_fine = []
- r2_adj_fine = []
- offs_fine = []
- for i_trial in range(0, np.shape(wave_ang)[0], 1):
- wave_ang_deg = np.degrees(wave_ang[i_trial])
- wave_freq_deg = np.degrees(wave_freq[i_trial])
- thetas_tmp = np.radians(np.arange(np.max([0, wave_ang_deg-2.5]), np.min([wave_ang_deg+2.5, 359.99]), 0.05))
- rs_tmp = np.radians(np.arange(np.max([0, wave_freq_deg-0.5]), np.min([wave_freq_deg+0.5, 17.99]), 0.05))
- theta_r_tmp = np.stack([(x, y) for x in thetas_tmp for y in rs_tmp])
- params_tmp = np.stack([theta_r_tmp[:, 1] * np.cos(theta_r_tmp[:, 0]), theta_r_tmp[:, 1] * np.sin(theta_r_tmp[:, 0])], -1)
- # compute predicted phases for angle and phase offset
- x = np.expand_dims(np.expand_dims(phases[i_trial, :], 1), 0) - params_tmp[:, 0] * pos_x - params_tmp[:, 1] * pos_y
- # Compute resultant vector length. This is faster than calling pycircstat.resultant_vector_length
- # now = time.time()
- x1 = numexpr.evaluate('sum(cos(x) / n, axis=1)')
- x1 = numexpr.evaluate('x1 ** 2')
- x2 = numexpr.evaluate('sum(sin(x) / n, axis=1)')
- x2 = numexpr.evaluate('x2 ** 2')
- Rs = numexpr.evaluate('-sqrt(x1 + x2)')
- # for each time and event, find the parameters with the smallest -R
- min_vals = theta_r_tmp[np.argmin(Rs, axis=1)]
- sl = min_vals[:, 1] * np.array([np.cos(min_vals[:, 0]), np.sin((min_vals[:, 0]))])
- offs_tmp = np.arctan2(np.sum(np.sin(np.expand_dims(phases[i_trial, :], 1) - sl[0, :] * pos_x - sl[1, :] * pos_y), axis=0),
- np.sum(np.cos(np.expand_dims(phases[i_trial, :], 1) - sl[0, :] * pos_x - sl[1, :] * pos_y), axis=0))
- offs_fine.append(offs_tmp)
- pos_circ = np.mod(sl[0, :] * pos_x + sl[1, :] * pos_y + offs_tmp, 2 * np.pi)
- # compute circular correlation coefficient between actual phases and predicited phases
- circ_corr_coef = pycircstat.corrcc(np.expand_dims(phases[i_trial, :], 1), pos_circ, axis=0)
- # compute adjusted r square
- # pdb.set_trace()
- r2_adj_fine.append(circ_corr_coef ** 2)
- # r2_adj = 1 - ((1 - circ_corr_coef ** 2) * (n - 1)) / (n - 4)
- wave_ang_fine.append(min_vals[:, 0])
- wave_freq_fine.append(min_vals[:, 1])
- wave_ang_fine = np.squeeze(np.array(wave_ang_fine))
- wave_freq_fine = np.squeeze(np.array(wave_freq_fine))
- r2_adj_fine = np.squeeze(np.array(r2_adj_fine))
- offs_fine = np.squeeze(np.array(offs_fine))
- return wave_ang_fine, wave_freq_fine, r2_adj_fine, offs_fine
- def channel_peak(data):
- params,rs=findpeak(data)
- peaks = np.zeros(len(data)).astype(bool)
- #params=[ int(round(i)) for i in params]
- if len(params)==5:
- if 5<params[3]<195 and params[2]>.3 and params[4]<50:
- peaks[int(round(params[3]))]=True
- elif len(params)==8:
- if 5<params[3]<195 and params[2]>.3 and params[4]<50:
- peaks[int(round(params[3]))]=True
- if 5<params[6]<195 and params[5]>.3 and params[7]<50:
- peaks[int(round(params[6]))]=True
- elif len(params)==11:
- if 5<params[3]<195 and params[2]>.3 and params[4]<50:
- peaks[int(round(params[3]))]=True
- if 5<params[6]<195 and params[5]>.3 and params[7]<50:
- peaks[int(round(params[6]))]=True
- if 5<params[9]<195 and params[8]>.3 and params[10]<50:
- peaks[int(round(params[9]))]=True
- return peaks
- def findpeak(data):
- line,peaks,heights=robustfit(data)
- #when no peaks found from robustfit, return no peaks, extremely rare ad extremely annoying!!!
- if len(peaks)==0 or line[1]>0 or line[0]<0:
- return line,0
- x=np.array(list(range(len(data))))
- y=data
- # Just fit 1 peak
- initial=[line[1],line[0],1,peaks[0],5]
- upper=[0,np.inf,np.inf,199,np.inf]
- lower=[-np.inf,0,0,0,0]
- best_vals,cov = curve_fit(oneOverF1, x, y,p0=initial,bounds=(lower,upper))
- Rs=np.corrcoef(y,oneOverF1(x,*best_vals))[0,1]**2;
- Rs=Radjust(Rs,5,200)
- res=best_vals
- RS=Rs
- # if 1 peaks are good enough, return
- if RS>.999:
- return res,RS
- # fit 2 peaks
- upper=[0,np.inf,np.inf,199,np.inf,np.inf,199,np.inf]
- lower=[-np.inf,0,0,0,0,0,0,0]
- if len(peaks)>=2:
- initial=[line[1],line[0],1,peaks[0],5,1,peaks[1],5]
- best_vals,cov = curve_fit(oneOverF2, x, y,p0=initial,bounds=(lower,upper))
- Rs=np.corrcoef(y,oneOverF2(x,*best_vals))[0,1]**2;
- Rs=Radjust(Rs,8,200)
- if RS<Rs:
- res=best_vals
- RS=Rs
- # fit 2 peaks with interpolation
- # first interpolation point
- initial=[line[1],line[0],1,peaks[0],5,1,peaks[0]/2,5]
- best_vals,cov = curve_fit(oneOverF2, x, y,p0=initial,bounds=(lower,upper))
- Rs=np.corrcoef(y,oneOverF2(x,*best_vals))[0,1]**2;
- Rs=Radjust(Rs,8,200)
- if RS<Rs:
- res=best_vals
- RS=Rs
- # second interpolation point
- initial=[line[1],line[0],1,peaks[0],5,1,(peaks[0]+199)/2,5]
- best_vals,cov = curve_fit(oneOverF2, x, y,p0=initial,bounds=(lower,upper))
- Rs=np.corrcoef(y,oneOverF2(x,*best_vals))[0,1]**2;
- Rs=Radjust(Rs,8,200)
- if RS<Rs:
- res=best_vals
- RS=Rs
- # if 2 peaks are good enough, return
- if RS>.999 or len(peaks)<2:
- return res,RS
- # fit 3 peaks
- upper=[0,np.inf,np.inf,199,199,np.inf,199,199,np.inf,199,199]
- lower=[-np.inf,0,0,0,0,0,0,0,0,0,0]
- if len(peaks)>2:
- initial=[line[1],line[0],1,peaks[0],5,1,peaks[1],5,1,peaks[2],5]
- best_vals,cov = curve_fit(oneOverF3, x, y,p0=initial,bounds=(lower,upper))
- Rs=np.corrcoef(y,oneOverF3(x,*best_vals))[0,1]**2;
- Rs=Radjust(Rs,11,200)
- if RS<Rs:
- res=best_vals
- RS=Rs
- # fit 2 peaks plus different interpolation points cause the 3rd peak is not that reliable.
- Peak=sorted(peaks[:2])
- # first interpolation point
- initial=[line[1],line[0],1,Peak[0]/2,5,1,Peak[0],5,1,Peak[1],5]
- best_vals,cov = curve_fit(oneOverF3, x, y,p0=initial,bounds=(lower,upper))
- Rs=np.corrcoef(y,oneOverF3(x,*best_vals))[0,1]**2;
- Rs=Radjust(Rs,11,len(data))
- if RS<Rs:
- res=best_vals
- RS=Rs
- # second interpolation point
- initial=[line[1],line[0],1,Peak[0],5,1,sum(Peak)/2,5,1,Peak[1],5]
- best_vals,cov = curve_fit(oneOverF3, x, y,p0=initial,bounds=(lower,upper))
- Rs=np.corrcoef(y,oneOverF3(x,*best_vals))[0,1]**2;
- Rs=Radjust(Rs,11,200)
- if RS<Rs:
- res=best_vals
- RS=Rs
- # third interpolation point
- initial=[line[1],line[0],1,Peak[0],5,1,Peak[1],5,1,Peak[1]/2+99.5,5]
- best_vals,cov = curve_fit(oneOverF3, x, y,p0=initial,bounds=(lower,upper))
- Rs=np.corrcoef(y,oneOverF3(x,*best_vals))[0,1]**2;
- Rs=Radjust(Rs,11,200)
- if RS<Rs:
- res=best_vals
- RS=Rs
- return res,RS
- def oneOverF1(x,slope,intercept, amp1, cen1, wid1):
- return x*slope+intercept+amp1 * exp(-.5*(x-cen1)**2 / wid1**2)
- def oneOverF2(x,slope,intercept, amp1, cen1, wid1,amp2, cen2, wid2):
- return x*slope+intercept+amp1 * exp(-.5*(x-cen1)**2 / wid1**2)+amp2 * exp(-.5*(x-cen2)**2 / wid2**2)
- def oneOverF3(x,slope,intercept, amp1, cen1, wid1,amp2, cen2, wid2,amp3, cen3, wid3):
- return x*slope+intercept+amp1 * exp(-.5*(x-cen1)**2 / wid1**2)+amp2 * exp(-.5*(x-cen2)**2 / wid2**2)+amp3 * exp(-.5*(x-cen3)**2 / wid3**2)
- def Radjust(Rs,k,n):
- return 1-(1-Rs)*(n-1)/(n-k-1)
- def robustfit(data):
- x = sm.tools.tools.add_constant(np.array(range(200)))
- model_res = sm.RLM(data, x).fit()
- peak_inds = np.squeeze(argrelmax(model_res.resid))
- if peak_inds.size==1:
- peak_inds=np.expand_dims(peak_inds,0)
- peak_inds=sorted(peak_inds,key=lambda i:model_res.resid[i])[::-1]
- return model_res.params,peak_inds[:3],model_res.resid[peak_inds[:3]]
- def par_find_peaks_by_chan2(p_spect_array, frequencies, std_thresh=1.):
- """
- Parameters
- ----------
- p_spect_array: numpy.ndarray
- An array with dimensions frequencies x channels
- frequencies: numpy.ndarray
- An array of the frequencies used
- std_thresh: float
- Threshold in number of standard deviations above the corrected power spectra to be counted as a peak
- Returns
- -------
- peaks_all_chans: numpy.ndarray with type bool
- An array of booleans the same shape as p_spect_array, specifying if there is a peak at a given frequency
- and electrode
- """
- peaks_all_chans = np.zeros(p_spect_array.shape).astype(bool)
- for i, chan_data in enumerate(p_spect_array.T):
- peaks_all_chans[:,i] = channel_peak(chan_data)
- return peaks_all_chans
- def rbar(x):
- n=len(x)
- x1 = numexpr.evaluate('sum(cos(x) / n, axis=0)')
- x1 = numexpr.evaluate('x1 ** 2')
- x2 = numexpr.evaluate('sum(sin(x) / n, axis=0)')
- x2 = numexpr.evaluate('x2 ** 2')
- Rs = numexpr.evaluate('sqrt(x1 + x2)')
- return Rs
- def circ_hist2(data,n=20,x=0,y=0,radius=1,color='k'):
- bins=np.linspace(-np.pi,np.pi,n+1)
- counts,bins=np.histogram(data,bins)
- counts=radius*counts/np.max(counts)
- for i in range(len(counts)):
- plt.plot([x,x+counts[i]*cos(bins[i])],[y,y+counts[i]*sin(bins[i])],color=color,linewidth=.3)
- plt.plot([x,x+counts[i]*cos(bins[i+1])],[y,y+counts[i]*sin(bins[i+1])],color=color,linewidth=.3)
- arch=np.linspace(bins[i],bins[i+1],100)
- plt.plot(x+counts[i]*np.cos(arch),y+counts[i]*np.sin(arch),color=color,linewidth=.5)
- plt.axis('equal')
- def circ_hist(data,n=20,x=0,y=0,radius=1,color='k',alpha=.3):
- # circular histogram, data need to be within -pi to pi
- bins=np.linspace(-np.pi,np.pi,n+1)
- counts,bins=np.histogram(data,bins)
- counts=radius*counts/np.max(counts)
- for i in range(len(counts)):
- X=[x,x+counts[i]*cos(bins[i]),x+counts[i]*cos(bins[i+1]),x]
- Y=[y,y+counts[i]*sin(bins[i]),y+counts[i]*sin(bins[i+1]),y]
- plt.fill(X,Y,color=color,alpha=alpha,linewidth=0)
- plt.axis('equal')
- def adjust(rs,n,k):
- return 1 - ((1 - rs) * (n - 1)) / (n - 1-k)
par_funcs_fine.py at commit 68587cf, no license · at the source
Overview
- Department of Neurology, University of Chicago,Chicago, IL USA
- Department of Biomedical Engineering, Columbia University,New York, NY USA
- Department of Mathematics, University of Pittsburgh,Pittsburgh, PA USA
Abstract
The abstract is not reproduced here: the paper's license (CC BY-NC-ND) does not allow it. Read it in the paper, at the publisher or on Europe PMC.
Repository
Its files are read in the Code ↔ Paper reader above, with 6 matches between paragraphs and lines of code.
anupdas777/complex_traveling_waves
68587cfd4d364699a31687eef41db080acf796e3, 20 May 2025Availability: 1 check, the latest on 29 September 2026: the link answers
- 29 September 2026: the link answers
5 files
- TW_Code/
Anup-th1-grids-2D-fine-C , Jupyter, 519 lines, 1 matchPCAM.ipynb - TW_Code/
RAM_helpers.py , Python, 811 lines, 1 match - TW_Code/
par_funcs_fine.py , Python, 464 lines, 3 matches - TW_Code/
wave_experiment_stable_e , Jupyter, 209 linespochs_ica.ipynb - TW_Code/
wave_spatial_autocorrela , Jupyter, 416 lines, 1 matchtion_ica.ipynb
Code availability statement
The paper has a code availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- it points to the authors' code: anupdas777/
complex_traveling_waves
Read it in the paper: doi.org/10.1038/s41467-026-71386-z.
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;
- 5 scripts, each with its path and the digest of its content;
- 6 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
No dataset and no data link were found in the paper.
Data availability statement
The paper has a data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- no repository, dataset or request procedure was recognized in it
Read it in the paper: doi.org/10.1038/s41467-026-71386-z.
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, 2 keywords, 9 MeSH terms, 1 funder, 94 references.
Cite
This paper
Das, A., Zabeh, E., Ermentrout, B., & Jacobs, J. (2026). Planar, spiral, and concentric traveling waves distinguish behavioral states in human memory. Nature communications, 17(1), 5143. https://
BibTeX
@article{das2026planar,
author = {Das, Anup and Zabeh, Erfan and Ermentrout, Bard and Jacobs, Joshua},
title = {{Planar, spiral, and concentric traveling waves distinguish behavioral states in human memory}},
journal = {Nature communications},
year = {2026},
month = apr,
volume = {17},
number = {1},
pages = {5143},
publisher = {Nature Portfolio},
issn = {2041-1723},
doi = {10.1038/
url = {https://
pmid = {41963323},
pmcid = {PMC13250086}
}
RIS
TY - JOUR
AU - Das, Anup
AU - Zabeh, Erfan
AU - Ermentrout, Bard
AU - Jacobs, Joshua
TI - Planar, spiral, and concentric traveling waves distinguish behavioral states in human memory
T2 - Nature communications
J2 - Nat Commun
PY - 2026
DA - 2026/
VL - 17
IS - 1
SP - 5143
SN - 2041-1723
PB - Nature Portfolio
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Planar, spiral, and concentric traveling waves distinguish behavioral states in human memory",
"container-title": "Nature communications",
"author": [
{
"family": "Das",
"given": "Anup"
},
{
"family": "Zabeh",
"given": "Erfan"
},
{
"family": "Ermentrout",
"given": "Bard"
},
{
"family": "Jacobs",
"given": "Joshua"
}
],
"container-title-short":
"volume": "17",
"issue": "1",
"page": "5143",
"DOI": "10.1038/
"PMID": "41963323",
"PMCID": "PMC13250086",
"ISSN": "2041-1723",
"publisher": "Nature Portfolio",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
11
]
]
}
}
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.7554/elife.76702 [code]
- Spontaneous neuronal oscillations in the human insula are hierarchically organized traveling waves.Journal: eLifeIn common: xarray, CircStat, Nilearn, 7 other tools, 23 references, 2 authors
- [2] doi:10.1038/s41467-023-41125-9 [code]
- Beta traveling waves in monkey frontal and parietal areas encode recent reward history.Journal: Nature communicationsIn common: CircStat, cognitive, 19 references, 2 authors
- [3] doi:10.1038/s41467-026-68893-4 [code]
- Nested spatiotemporal theta-gamma waves organize hierarchical processing across the mouse visual cortex.Journal: Nature communicationsIn common: xarray, Pillow, statsmodels, 6 other tools, 17 references
- [4] doi:10.1038/s41467-024-47860-x [code]
- Human connectome topology directs cortical traveling waves and shapes frequency gradients.Journal: Nature communicationsIn common: seaborn, scikit-learn, pandas, 3 other tools, 19 references
- [5] doi:10.7554/elife.108208 [code]
- Realistic coupling enables flexible macroscopic traveling waves in the mouse cortex.Journal: eLifeIn common: pandas, NumPy, 17 references
- [6] doi:10.1038/s41467-022-32378-x [code]
- Visual evoked feedforward-feedback traveling waves organize neural activity across the cortical hierarchy in mice.Journal: Nature communicationsIn common: CircStat, 13 references
- [7] doi:10.1016/j.crmeth.2023.100681 [code]
- A modular and adaptable analysis pipeline to compare slow cerebral rhythms across heterogeneous datasets.Journal: Cell reports methodsIn common: seaborn, scikit-learn, pandas, 3 other tools, 11 references
- [8] doi:10.1016/j.celrep.2025.115864 [code]
- Modulation of motor excitability reflects traveling waves of neural oscillations.Journal: Cell reportsIn common: CircStat, statsmodels, pandas, 3 other tools, 10 references
- [9] doi:10.3389/fncom.2026.1844662
- Quantifying cortex-wide traveling brain waves of complex patterns with a graph-based algorithm.Journal: Frontiers in computational neuroscienceIn common: 14 references
- [10] doi:10.7554/elife.92254 [code]
- Sequentially activated discrete modules appear as traveling waves in neuronal measurements with limited spatiotemporal sampling.Journal: eLifeIn common: 13 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: 1 repository of the authors' code, each at its verified commit and with its license, 5 scripts, and 6 matches 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:b0162b4527c8dda2…
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.1038/s41467-026-71386-z)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.1038/s41467-026-71386-z.svg
:target: https://openscicode.org/badge/doi/10.1038/s41467-026-71386-z
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1038/s41467-026-71386-z"><img src="https://openscicode.org/badge/doi/10.1038/s41467-026-71386-z.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.
