Distinct beta burst motifs exhibit opposing error relationships during motor adaptation
The 10 matches · 2 of them tie a paragraph to a whole file, not to given lines: weak matches, whose lines are not tinted
- [1] § Methods › Beta power and burst extraction ↔ python/burst_detection.py, lines 179–261 · score 0.95 · DC offset, Hilbert transform, instantaneous phase, detected peak, phase minimum, burst detection
- [2] § Methods › Beta power and burst extraction ↔ matlab/extract_bursts_single_trial.m, lines 118–188 · score 0.92 · DC offset, Hilbert transform, instantaneous phase, phase minimum, peak amplitude, deflection
- [3] § Methods › Beta power and burst extraction ↔ python/burst_detection.py, lines 264–330 · score 0.86 · aperiodic spectrum, event related, burst detection, detected bursts, burst waveforms, ERF
- [4] § Methods › Beta power and burst extraction ↔ matlab/extract_bursts.m, the whole file · a weak match · score 0.83 · aperiodic spectrum, event related, detected bursts, burst waveforms, ERF, regressed
- [5] § Methods › Beta power and burst extraction ↔ python/burst_detection.py, lines 131–177 · score 0.73 · noise floor, peak amplitude, peak frequency, iteration, Gaussian, subtracted
- [6] § Methods › Beta power and burst extraction ↔ matlab/extract_bursts_single_trial.m, lines 43–116 · score 0.73 · noise floor, peak amplitude, peak frequency, Gaussian, subtracted, band
- [7] § Methods › Statistics › Behavior ↔ 02_behav_stats.R, the whole file · a weak match · score 0.63 · emmeans, lme4, adaptation blocks, Pairwise, variable, zero
- [8] § Methods › Statistics › Burst features, burst count and PC-quartile time series ↔ xx_bursts_lmms.ipynb, lines 89–147 · score 0.54 · random intercepts, Separate models, variable, fit, error, implicit
- [9] § Results › Waveform-specific burst dynamics predict trial-by-trial error ↔ xx_bursts_lmms.ipynb, lines 625–767 · score 0.53 · Linear mixed, sliding window, beta burst, variable, fitted, models
- [10] § Methods › MEG ↔ xx_beta_power_lmms.ipynb, lines 179–231 · score 0.50 · MEG signal, removal, tracking, match, filtered
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Python · 330 lines · 13 KB · no license · 3 matches
- import copy
- import math
- import numpy as np
- from mne.filter import filter_data
- from scipy.signal import hilbert, argrelextrema
- from scipy.stats import linregress
- def gaus2d(x=0, y=0, mx=0, my=0, sx=1, sy=1):
- """
- Two-dimensional gaussian function
- :param x: x grid
- :param y: y grid
- :param mx: mean in x dimension
- :param my: mean in y dimension
- :param sx: standard deviation in x dimension
- :param sy: standard deviation in y dimension
- :return: Two-dimensional Gaussian distribution
- """
- return np.exp(-((x - mx) ** 2. / (2. * sx ** 2.) + (y - my) ** 2. / (2. * sy ** 2.)))
- def overlap(a, b):
- """
- Find if two ranges overlap
- :param a: first range [low, high]
- :param b: second range [low, high]
- :return: True if ranges overlap, false otherwise
- """
- return a[0] <= b[0] <= a[1] or b[0] <= a[0] <= b[1]
- def fwhm_burst_norm(tf, peak):
- """
- Find two-dimensional FWHM
- :param tf: TF spectrum
- :param peak: peak of activity [freq, time]
- :return: right, left, up, down limits for FWM
- """
- right_loc = np.nan
- # Find right limit (values to right of peak less than half value at peak)
- cand = np.where(tf[peak[0], peak[1]:] <= tf[peak] / 2)[0]
- # If any found, take the first one
- if len(cand):
- right_loc = cand[0]
- up_loc = np.nan
- # Find up limit (values above peak less than half value at peak)
- cand = np.where(tf[peak[0]:, peak[1]] <= tf[peak] / 2)[0]
- # If any found, take the first one
- if len(cand):
- up_loc = cand[0]
- left_loc = np.nan
- # Find left limit (values below peak less than half value at peak)
- cand = np.where(tf[peak[0], :peak[1]] <= tf[peak] / 2)[0]
- # If any found, take the last one
- if len(cand):
- left_loc = peak[1] - cand[-1]
- down_loc = np.nan
- # Find down limit (values below peak less than half value at peak)
- cand = np.where(tf[:peak[0], peak[1]] <= tf[peak] / 2)[0]
- # If any found, take the last one
- if len(cand):
- down_loc = peak[0] - cand[-1]
- # Set arms equal if only one found
- if down_loc is np.nan:
- down_loc = up_loc
- if up_loc is np.nan:
- up_loc = down_loc
- if left_loc is np.nan:
- left_loc = right_loc
- if right_loc is np.nan:
- right_loc = left_loc
- # Use the minimum arm in each direction (forces Gaussian to be symmetric in each dimension)
- horiz = np.nanmin([left_loc, right_loc])
- vert = np.nanmin([up_loc, down_loc])
- right_loc = horiz
- left_loc = horiz
- up_loc = vert
- down_loc = vert
- return right_loc, left_loc, up_loc, down_loc
- def extract_bursts_single_trial(raw_trial, tf, times, search_freqs, band_lims, aperiodic_spectrum, sfreq, w_size=.26):
- """
- Extract bursts from epoched data
- :param raw_trial: raw data for trial (time)
- :param tf: time-frequency decomposition for trial (freq x time)
- :param times: time steps
- :param search_freqs: frequency limits to search within for bursts (should be wider than band_lims)
- :param band_lims: keep bursts whose peak frequency falls within these limits
- :param aperiodic_spectrum: aperiodic spectrum
- :param sfreq: sampling rate
- :param w_size: window size to extract burst waveforms
- :return: disctionary with waveform, peak frequency, relative peak amplitude, absolute peak amplitude, peak
- time, peak adjustment, FWHM in frequency, FWHM in time, and polarity for each detected burst
- """
- bursts = {
- 'waveform': [],
- 'peak_freq': [],
- 'peak_amp_iter': [],
- 'peak_amp_base': [],
- 'peak_time': [],
- 'peak_adjustment': [],
- 'fwhm_freq': [],
- 'fwhm_time': [],
- 'polarity': [],
- 'waveform_times': []
- }
- # Grid for computing 2D Gaussians
- x_idx, y_idx = np.meshgrid(range(len(times)), range(len(search_freqs)))
- # Window size in points
- wlen = int(w_size * sfreq)
- half_wlen = int(wlen * .5)
- # Subtract 1/f
- trial_tf = tf - aperiodic_spectrum
- trial_tf[trial_tf < 0] = 0
- # Skip trial if no peaks above aperiodic
- if (trial_tf == 0).all():
- print("All values equal 0 after aperiodic subtraction")
- return bursts
- # TF for iterating
- trial_tf_iter = copy.copy(trial_tf)
- while True:
- # Compute noise floor
- thresh = 2 * np.std(trial_tf_iter)
- # Find peak
- [peak_freq_idx, peak_time_idx] = np.unravel_index(np.argmax(trial_tf_iter), trial_tf.shape)
- peak_freq = search_freqs[peak_freq_idx]
- peak_amp_iter = trial_tf_iter[peak_freq_idx, peak_time_idx]
- peak_amp_base = trial_tf[peak_freq_idx, peak_time_idx]
- # Stop if no peak above threshold
- if peak_amp_iter < thresh:
- break
- # Fit 2D Gaussian and subtract from TF
- rloc, lloc, uloc, dloc = fwhm_burst_norm(trial_tf_iter, (peak_freq_idx, peak_time_idx))
- # Detect degenerate Gaussian (limits not found)
- vert_isnan = any(np.isnan([uloc, dloc]))
- horiz_isnan = any(np.isnan([rloc, lloc]))
- if vert_isnan:
- v_sh = int((search_freqs.shape[0] - peak_freq_idx) / 2)
- if v_sh <= 0:
- v_sh = 1
- uloc = v_sh
- dloc = v_sh
- elif horiz_isnan:
- h_sh = int((times.shape[0] - peak_time_idx) / 2)
- if h_sh <= 0:
- h_sh = 1
- rloc = h_sh
- lloc = h_sh
- hv_isnan = any([vert_isnan, horiz_isnan])
- # Compute FWHM and convert to SD
- fwhm_f_idx = uloc + dloc
- fwhm_f = (search_freqs[1] - search_freqs[0]) * fwhm_f_idx
- fwhm_t_idx = lloc + rloc
- fwhm_t = (times[1] - times[0]) * fwhm_t_idx
- sigma_t = fwhm_t_idx / 2.355
- sigma_f = fwhm_f_idx / 2.355
- # Fitted Gaussian
- z = peak_amp_iter * gaus2d(x_idx, y_idx, mx=peak_time_idx, my=peak_freq_idx, sx=sigma_t, sy=sigma_f)
- # Subtract fitted Gaussian for next iteration
- new_trial_tf_iter = trial_tf_iter - z
- # If detected peak is within band limits and not degenerate
- if all([peak_freq >= band_lims[0], peak_freq <= band_lims[1], not hv_isnan]):
- # Bandpass filter within frequency range of burst
- freq_range = [
- np.max([0, peak_freq_idx - dloc]),
- np.min([len(search_freqs) - 1, peak_freq_idx + uloc])
- ]
- filtered = filter_data(raw_trial.reshape(1, -1), sfreq, search_freqs[freq_range[0]], search_freqs[freq_range[1]],
- verbose=False)
- # Hilbert transform
- analytic_signal = hilbert(filtered)
- # Get phase
- instantaneous_phase = np.unwrap(np.angle(analytic_signal)) % math.pi
- # Find local phase minima with negative deflection closest to TF peak
- # If no minimum is found, the error is caught and no burst is added
- min_phase_pts = argrelextrema(instantaneous_phase.T, np.less)[0]
- new_peak_time_idx = peak_time_idx
- try:
- new_peak_time_idx = min_phase_pts[np.argmin(np.abs(peak_time_idx - min_phase_pts))]
- adjustment = (new_peak_time_idx - peak_time_idx) * 1 / sfreq
- except:
- adjustment = 1
- # Keep if adjustment less than 30ms
- if np.abs(adjustment) < .03:
- # If burst won't be cutoff
- if new_peak_time_idx >= half_wlen and new_peak_time_idx + half_wlen <= len(times):
- peak_time = times[new_peak_time_idx]
- overlapped = False
- # Check for overlap
- for b_idx in range(len(bursts['peak_time'])):
- o_t = bursts['peak_time'][b_idx]
- o_fwhm_t = bursts['fwhm_time'][b_idx]
- if overlap([peak_time - .5 * fwhm_t, peak_time + .5 * fwhm_t],
- [o_t - .5 * o_fwhm_t, o_t + .5 * o_fwhm_t]):
- overlapped = True
- break
- if not overlapped:
- # Get burst
- burst = raw_trial[new_peak_time_idx - half_wlen:new_peak_time_idx + half_wlen]
- # Remove DC offset
- burst = burst - np.mean(burst)
- bursts['waveform_times'] = times[new_peak_time_idx - half_wlen:new_peak_time_idx + half_wlen] - \
- times[new_peak_time_idx]
- # Flip if positive deflection
- peak_dists = np.abs(argrelextrema(filtered.T, np.greater)[0] - new_peak_time_idx)
- trough_dists = np.abs(argrelextrema(filtered.T, np.less)[0] - new_peak_time_idx)
- polarity = 0
- if len(trough_dists) == 0 or (
- len(peak_dists) > 0 and np.min(peak_dists) < np.min(trough_dists)):
- burst *= -1.0
- polarity = 1
- bursts['waveform'].append(burst)
- bursts['peak_freq'].append(peak_freq)
- bursts['peak_amp_iter'].append(peak_amp_iter)
- bursts['peak_amp_base'].append(peak_amp_base)
- bursts['peak_time'].append(peak_time)
- bursts['peak_adjustment'].append(adjustment)
- bursts['fwhm_freq'].append(fwhm_f)
- bursts['fwhm_time'].append(fwhm_t)
- bursts['polarity'].append(polarity)
- trial_tf_iter = new_trial_tf_iter
- bursts['waveform'] = np.array(bursts['waveform'])
- bursts['peak_freq'] = np.array(bursts['peak_freq'])
- bursts['peak_amp_iter'] = np.array(bursts['peak_amp_iter'])
- bursts['peak_amp_base'] = np.array(bursts['peak_amp_base'])
- bursts['peak_time'] = np.array(bursts['peak_time'])
- bursts['peak_adjustment'] = np.array(bursts['peak_adjustment'])
- bursts['fwhm_freq'] = np.array(bursts['fwhm_freq'])
- bursts['fwhm_time'] = np.array(bursts['fwhm_time'])
- bursts['polarity'] = np.array(bursts['polarity'])
- return bursts
- def extract_bursts(raw_trials, tf, times, search_freqs, band_lims, aperiodic_spectrum, sfreq, w_size=.26):
- """
- Extract bursts from epoched data
- :param raw_trials: raw data for each trial (trial x time)
- :param tf: time-frequency decomposition for each trial (trial x freq x time)
- :param times: time steps
- :param search_freqs: frequency limits to search within for bursts (should be wider than band_lims)
- :param band_lims: keep bursts whose peak frequency falls within these limits
- :param aperiodic_spectrum: aperiodic spectrum
- :param sfreq: sampling rate
- :param w_size: window size to extract burst waveforms
- :return: disctionary with trial, waveform, peak frequency, relative peak amplitude, absolute peak amplitude, peak
- time, peak adjustment, FWHM in frequency, FWHM in time, and polarity for each detected burst
- """
- bursts = {
- 'trial': [],
- 'waveform': [],
- 'peak_freq': [],
- 'peak_amp_iter': [],
- 'peak_amp_base': [],
- 'peak_time': [],
- 'peak_adjustment': [],
- 'fwhm_freq': [],
- 'fwhm_time': [],
- 'polarity': [],
- 'waveform_times': []
- }
- # Compute event-related signal
- erf = np.mean(raw_trials, axis=0)
- # Iterate through trials
- for t_idx, tr_tf in enumerate(tf):
- # Regress out ERF
- slope, intercept, r, p, se = linregress(erf, raw_trials[t_idx, :])
- raw_trial = raw_trials[t_idx, :] - (intercept + slope * erf)
- trial_bursts=extract_bursts_single_trial(raw_trial, tr_tf, times, search_freqs, band_lims, aperiodic_spectrum,
- sfreq, w_size=w_size)
- n_trial_bursts=len(trial_bursts['peak_time'])
- bursts['trial'].extend([int(t_idx) for i in range(n_trial_bursts)])
- bursts['waveform'].extend(trial_bursts['waveform'])
- bursts['peak_freq'].extend(trial_bursts['peak_freq'])
- bursts['peak_amp_iter'].extend(trial_bursts['peak_amp_iter'])
- bursts['peak_amp_base'].extend(trial_bursts['peak_amp_base'])
- bursts['peak_time'].extend(trial_bursts['peak_time'])
- bursts['peak_adjustment'].extend(trial_bursts['peak_adjustment'])
- bursts['fwhm_freq'].extend(trial_bursts['fwhm_freq'])
- bursts['fwhm_time'].extend(trial_bursts['fwhm_time'])
- bursts['polarity'].extend(trial_bursts['polarity'])
- if len(trial_bursts['waveform_times']):
- bursts['waveform_times'] = trial_bursts['waveform_times']
- bursts['trial'] = np.array(bursts['trial'])
- bursts['waveform'] = np.array(bursts['waveform'])
- bursts['peak_freq'] = np.array(bursts['peak_freq'])
- bursts['peak_amp_iter'] = np.array(bursts['peak_amp_iter'])
- bursts['peak_amp_base'] = np.array(bursts['peak_amp_base'])
- bursts['peak_time'] = np.array(bursts['peak_time'])
- bursts['peak_adjustment'] = np.array(bursts['peak_adjustment'])
- bursts['fwhm_freq'] = np.array(bursts['fwhm_freq'])
- bursts['fwhm_time'] = np.array(bursts['fwhm_time'])
- bursts['polarity'] = np.array(bursts['polarity'])
- return bursts
burst_detection.py at commit 91fe424, no license · at the source
Overview
- Marc Jeannerod Institute of Cognitive Sciences, ISC, CNRS UMR 5229, Lyon, France
- Université Claude Bernard Lyon 1, Université de Lyon, Lyon, France
- Department of Psychiatry and Psychotherapy, Faculty of Medicine, University of Tübingen, Tübingen, Germany
- MEG Departement, CERMEP-Imagerie du Vivant, 59 Bd Pinel, 69677, Bron, France
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.
Repositories
Its files are read in the Code ↔ Paper reader above, with 10 matches between paragraphs and lines of code.
danclab/burst_detection
91fe42487dc701a1f60f7b6ef821c97b86ce506e, 8 February 2024Availability: 1 check, the latest on 26 September 2026: the link answers
- 26 September 2026: the link answers
10 files
- matlab/
extract_bursts.m , MATLAB, 78 lines, 1 match - matlab/
extract_bursts_single_tr , MATLAB, 188 lines, 2 matchesial.m - matlab/
fwhm_burst_norm.m , MATLAB, 64 lines - matlab/
gaus2d.m , MATLAB, 11 lines - matlab/
overlap.m , MATLAB, 7 lines - python/
burst_detection.py , Python, 330 lines, 3 matches - python/
pca_analysis_tutorial.ip , Jupyter, 106 linesynb - python/
superlet_burst_detection , Jupyter, 144 lines_example.ipynb - python/
tests.py , Python, 67 lines - README.md, Text, 178 lines
danclab/explicit_implicit_bursts
c234164e733830a0d576a62d136da1bd0a77480e, 14 September 2026Availability: 1 check, the latest on 30 September 2026: the link answers
- 30 September 2026: the link answers
19 files
- 01_plot_behavior.ipynb, Jupyter, 1,032 lines
- 02_behav_stats.R, R, 90 lines, 1 match
- 03_plot_beta_power_and_o
verall_burst_rate.ipynb , Jupyter, 1,439 lines - 04_plot_burst_features.i
pynb , Jupyter, 967 lines - 05_burst_feature_stats.R
, R, 27 lines - 06_plot_burst_PC_quartil
e_rate.ipynb , Jupyter, 1,756 lines - 07_export_burst_PC_quart
ile_rate-behav.ipynb , Jupyter, 338 lines - 08a_burst_PC_quartile_ra
te-behav.R , R, 350 lines - 08b_burst_rate-behav.R, R, 320 lines
- 08c_beta_power-behav.R, R, 320 lines
- 09a_plot_burst_PC_quarti
le_rate-behav.ipynb , Jupyter, 553 lines - 09b_plot_overall_burst_r
ate-behav.ipynb , Jupyter, 374 lines - 09c_plot_beta_power-beha
v.ipynb , Jupyter, 390 lines - pipeline_10f_motor_beta_
average.py , Python, 122 lines - tmp_script.R, R, 25 lines
- utils.R, R, 65 lines
- xx_beta_power_lmms.ipynb
, Jupyter, 730 lines, 1 match - xx_bursts_lmms.ipynb, Jupyter, 3,001 lines, 2 matches
- xx_moving_means_plots.ip
ynb , Jupyter, 3,093 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;
- 28 scripts, each with its path and the digest of its content;
- 10 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.
Code and data availability statement
The paper has a code and data 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: danclab/
explicit_implicit_bursts
Read it in the paper: doi.org/10.64898/2026.03.06.710026.
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, 30 September 2026: the first record
Recorded: type, journal, dates, 5 authors, 1 funder, 52 references.
Cite
This paper
Moreau, Q., Szul, M. J., Daligaut, S., Schwartz, D., & Bonaiuto, J. J. (2026). Distinct beta burst motifs exhibit opposing error relationships during motor adaptation. bioRxiv (preprint). https://
BibTeX
@article{moreau2026disti
author = {Moreau, Quentin and Szul, Maciej J. and Daligaut, Sébastien and Schwartz, Denis and Bonaiuto, James J.},
title = {{Distinct beta burst motifs exhibit opposing error relationships during motor adaptation}},
journal = {bioRxiv (preprint)},
year = {2026},
month = mar,
publisher = {bioRxiv},
issn = {2692-8205},
doi = {10.64898/
url = {https://
}
RIS
TY - JOUR
AU - Moreau, Quentin
AU - Szul, Maciej J.
AU - Daligaut, Sébastien
AU - Schwartz, Denis
AU - Bonaiuto, James J.
TI - Distinct beta burst motifs exhibit opposing error relationships during motor adaptation
T2 - bioRxiv (preprint)
J2 - bioRxiv
PY - 2026
DA - 2026/
SN - 2692-8205
PB - bioRxiv
DO - 10.64898/
UR - https://
ER -
CSL-JSON
{
"id": "10.64898/
"type": "article",
"title": "Distinct beta burst motifs exhibit opposing error relationships during motor adaptation",
"container-title": "bioRxiv (preprint)",
"author": [
{
"family": "Moreau",
"given": "Quentin"
},
{
"family": "Szul",
"given": "Maciej J."
},
{
"family": "Daligaut",
"given": "Sébastien"
},
{
"family": "Schwartz",
"given": "Denis"
},
{
"family": "Bonaiuto",
"given": "James J."
}
],
"container-title-short":
"DOI": "10.64898/
"ISSN": "2692-8205",
"publisher": "bioRxiv",
"URL": "https://
"issued": {
"date-parts": [
[
2026,
3,
6
]
]
}
}
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.1162/imag.a.1040 [code]
- Novel 4 He-OPMs support waveform-specific beta burst analysis comparable to SQUID-MEGJournal: n/aIn common: specparam (formerly FOOOF), FieldTrip, MNE-Python, 7 other tools, 7 references, author Denis Schwartz
- [2] doi:10.1162/imag.a.1226 [code]
- A neuroscientist's guide to neural burst detection.Journal: Imaging neuroscience (Cambridge, Mass.)In common: specparam (formerly FOOOF), FieldTrip, MNE-Python, 8 other tools, 8 references
- [3] doi:10.1162/imag.a.1169 [code]
- Diazepam alters the shape of alpha oscillations recorded from human cortex using EEG.Journal: Imaging neuroscience (Cambridge, Mass.)In common: specparam (formerly FOOOF), car, emmeans, 7 other tools, 4 references
- [4] doi:10.1016/j.nicl.2026.104012 [code]
- Structural-functional multilayer brain network properties and outcome of combined repetitive transcranial magnetic stimulation and psychotherapy for obsessive-compulsive disorder.Journal: NeuroImage. ClinicalIn common: specparam (formerly FOOOF), car, lmerTest, 11 other tools
- [5] doi:10.1093/cercor/bhag113 [code]
- Long-term reliability and stability of parameterized resting state EEG: evidence from a five-year follow-up.Journal: Cerebral cortex (New York, N.Y. : 1991)In common: specparam (formerly FOOOF), emmeans, MNE-Python, 9 other tools, 2 references
- [6] doi:10.7554/elife.107088 [code]
- Development of auditory and spontaneous movement responses to music over the first postnatal year.Journal: eLifeIn common: car, FieldTrip, emmeans, 11 other tools
- [7] doi:10.1016/j.isci.2026.115375 [code]
- Bursts of regional cortical inhibition during smartphone use.Journal: iScienceIn common: Signal Processing Toolbox, Statistics and Machine Learning Toolbox, scikit-learn, 3 other tools, 7 references
- [8] doi:10.1093/nc/niag029 [code]
- A data-driven approach to identifying and evaluating connectivity-based neural correlates of conscious visual perception.Journal: Neuroscience of consciousnessIn common: car, emmeans, MNE-Python, 10 other tools, 1 reference
- [9] doi:10.34133/csbj.0042 [code]
- Using Steady-State Visual Evoked Potentials to Characterize Wide-Ranging Retinopathy Linked to &
lt;i& gt;CRB1& lt;/ i& gt;: Implications for Clinical Trials. Journal: Computational and structural biotechnology journalIn common: car, emmeans, MNE-Python, 10 other tools - [10] doi:10.1162/imag.a.1321 [code]
- Phase similarity between similar objects indicates representational merging across retrieval training but not sleep.Journal: Imaging neuroscience (Cambridge, Mass.)In common: car, emmeans, MNE-Python, 9 other tools, 1 reference
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, 28 scripts, and 10 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:f8f05ec074f801d8…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
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: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
