Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning.
The 21 matches
- [1] § STAR★Methods › Quantification and statistical analysis › Time-domain analyses ↔ S05_01_01_compute_erf.m, lines 156–197 · score 0.89 · full width half, 170–250 ms, 300–500 ms, peak latencies, 170 ms, FWHM
- [2] § STAR★Methods › Quantification and statistical analysis › Data preprocessing ↔ S02_01_02_preprocessing.m, lines 147–214 · score 0.86 · SQUID jumps, 2–15 Hz, artifact detection, cutoff, ICA, EOG
- [3] § STAR★Methods › Method details › Stimuli ↔ S00_03_01_lexicons.py, lines 8–24 · score 0.85 · native German speakers, phonological feature, German corpus, lowest, phonemic, bigram
- [4] § STAR★Methods › Method details › Stimuli ↔ S00_02_01_prosody.py, lines 34–38 · score 0.84 · Bo kennt Sue, die sehr stinkt, prosodically marked, weak, sentence, prosody
- [5] § STAR★Methods › Quantification and statistical analysis › Source analyses ↔ S07_01_01_sourceanalysis.m, lines 183–255 · score 0.80 · covariance matrix, 150–1000 ms, common filter, recognition phase, 150 ms, part words
- [6] § STAR★Methods › Method details › Procedure ↔ S01_00_00_neuraltrack.m, lines 78–170 · score 0.76 · 1.5–2 s, 1–1.5 s, mini block, jittered, breaks, phase
- [7] § STAR★Methods › Method details › Stimuli ↔ S00_03_01_lexicons.py, lines 8–24 · score 0.75 · Levenshtein distance, phonotactic constraint, artificial lexicons, phonemic, part word, transitioned
- [8] § STAR★Methods › Method details › Stimuli ↔ S00_01_01_syllables.py, lines 8–17 · score 0.70 · binary matrix, phonological feature, German corpus, consonant, vowel, phoneme
- [9] § STAR★Methods › Method details › Stimuli ↔ S00_01_01_syllables.py, lines 8–17 · score 0.67 · consonant vowel, long vowels, German corpus, phonological, phoneme, uniformize
- [10] § STAR★Methods › Quantification and statistical analysis › Data preprocessing ↔ S02_01_02_preprocessing.m, lines 54–100 · score 0.66 · 0.1–30 Hz, detrended, demeaned, FieldTrip, MaxFilterTM, preprocessing
- [11] § STAR★Methods › Quantification and statistical analysis › Data preprocessing ↔ S02_01_03_cleaning.m, lines 227–270 · score 0.66 · independent component, rejected trials, std, ICA, artifacts, preprocessing
- [12] § Results › M200 and M400 fields are sensitive to violations of PR or TP patterns ↔ S05_01_01_compute_erf.m, lines 156–197 · score 0.64 · 170–250 ms, 300–500 ms, 170 ms, FWHM, M200, M400
- [13] § STAR★Methods › Method details › Procedure ↔ S00_05_01_stimset.m, lines 118–162 · score 0.62 · balanced Latin square, counterbalanced, mini, prosody, blocks, lexicon
- [14] § STAR★Methods › Quantification and statistical analysis › Frequency-domain analyses ↔ S03_01_02_analyze_pow.m, lines 34–87 · score 0.59 · baseline power, neighboring frequencies, ratio, channels, block
- [15] § Results ↔ S07_01_01_sourceanalysis.m, lines 183–255 · score 0.58 · inter trial phase, recognition phase, coherence, ITPC, ERF, pseudowords
- [16] § Results ↔ S05_01_01_compute_erf.m, lines 1–53 · score 0.56 · event related field, recognition phase, ERF, M200, M400, MEG
- [17] § Results › PR and TP patterns are both needed for learning pseudowords ↔ S08_01_02_lme_behavior.R, lines 144–210 · score 0.54 · behavioral accuracy, history, PR, TP
- [18] § STAR★Methods › Quantification and statistical analysis › Frequency-domain analyses ↔ S04_01_01_compute_itc.m, lines 42–128 · score 0.54 · artifact free trials, wavelet, Fourier, channels, chunk
- [19] § STAR★Methods › Quantification and statistical analysis › Source analyses ↔ S05_01_01_compute_erf.m, lines 55–130 · score 0.52 · 150–1000 ms, 150 ms, pre, part words, ERF, latencies
- [20] § STAR★Methods › Quantification and statistical analysis › Behavioral analyses ↔ S00_05_01_stimset.m, lines 118–162 · score 0.52 · balanced Latin square, stimuli, PR, TP
- [21] § Results › PR and TP patterns modulate neural tracking of syllables and chunks ↔ S03_01_02_analyze_pow.m, lines 34–87 · score 0.51 · baseline power, neighboring frequencies, ratio
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
MATLAB · 234 lines · 8.8 KB · no license · 4 matches
- %% Setup
- % Clear the workspace
- clearvars
- close all
- clc
- % Set paths
- project_dir = '/data/pt_02740/neuraltrack';
- expdata_dir = [project_dir filesep 'data'];
- results_dir = [project_dir filesep 'results'];
- figures_dir = [project_dir filesep 'figures' filesep 'evoked'];
- ft_defaults
- % Set parameters
- testID = {'Main effect PR';
- 'Main effect TP'}; % Labels of effects of interest
- condID = {'PR- TP-';
- 'PR- TP+';
- 'PR+ TP-';
- 'PR+ TP+'}; % Labels of conditions in the exposure phase
- typeID = {'Pseudowords';
- 'Part-words'}; % Labels of "word" types in the recognition phase
- ERFsID = {'M200';
- 'M400'}; % Labels of event-related fields (ERFs) of interest
- timeID = linspace(-150, 1000, 1151); % Time array for analyses of ERFs
- nStart = 40; % Start number of participants
- nSubjs = 32; % Total number of participants
- nBlock = 8; % Total number of blocks
- fSampl = 1000; % MEG sampling frequency
- nConds = length(condID); % Number of conditions
- nTypes = length(typeID); % Number of word type
- nPeaks = length(ERFsID); % Number of ERFs
- nTimes = length(timeID); % Epoch length
- % Set filenames
- subject_num = cellstr(string((1:nSubjs) + nStart));
- subject_lst = strcat('nt', subject_num, 'a');
- trldata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
- repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
- repmat({'_trl.mat'}, [nSubjs nBlock]));
- predata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
- repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
- repmat({'_dat.mat'}, [nSubjs nBlock]));
- erfdata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
- repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
- repmat({'_erf.mat'}, [nSubjs nBlock]));
- avgdata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
- repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
- repmat({'_avg.mat'}, [nSubjs nBlock]));
- rawdata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
- repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
- repmat({'_raw.mat'}, [nSubjs nBlock]));
- %% Compute timelock analysis
- % Initialize
- AVG = cell(nSubjs, nConds, nTypes);
- % Loop through subjects
- for i_subj = 1:nSubjs
- % Define directories
- expdata_sub = [expdata_dir filesep subject_lst{i_subj}];
- expdata_pre = [expdata_sub filesep '02_preproc'];
- expdata_erf = [expdata_sub filesep '05_evoked'];
- if ~isfolder(expdata_erf)
- mkdir(expdata_erf)
- end
- % Loop through blocks
- for i_blck = 2:2:nBlock
- % Load data
- expdata_art = fullfile(expdata_pre, artdata_lst{i_subj, i_blck});
- expdata_dat = fullfile(expdata_pre, predata_lst{i_subj, i_blck});
- load(expdata_art, 'art')
- load(expdata_dat, 'dat')
- % Reject trials with visual artifacts
- cfg = art.xxx.cfg;
- data = ft_rejectartifact(cfg, dat);
- % Split trials by condition
- i_trig = data.trialinfo(:, 1);
- i_cond = floor(i_trig(1)/20);
- idxs_A = i_trig - i_cond * 20 < 5; % pseudowords
- idxs_B = i_trig - i_cond * 20 > 5; % part-words
- trlAll = 1:length(data.trial);
- trls_A = trlAll(idxs_A);
- trls_B = trlAll(idxs_B);
- trlCnd = {trls_A, trls_B};
- % Filtering and baseline correction
- cfg = [];
- cfg.baselinewindow = [-0.15 0];
- cfg.demean = 'yes';
- cfg.hpfreq = 1;
- cfg.hpfilter = 'yes';
- cfg.hpfilttype = 'firws';
- data = ft_preprocessing(cfg, data);
- erf = data;
- % Compute average over trials (AVG)
- cfg = [];
- cfg.trials = trlCnd{1};
- cfg.latency = [-0.15 1];
- avg{1} = ft_timelockanalysis(cfg, data);
- cfg.trials = trlCnd{2};
- avg{2} = ft_timelockanalysis(cfg, data);
- % Compute RAW difference of AVG over trials
- cfg = [];
- cfg.parameter = 'avg';
- cfg.operation = 'x2-x1';
- raw = ft_math(cfg, avg{1}, avg{2});
- % Store ERF avg by condition
- AVG{i_subj, i_cond, 1} = avg{1};
- AVG{i_subj, i_cond, 2} = avg{2};
- % Save data
- erfdata_erf = fullfile(expdata_erf, erfdata_lst{i_subj, i_blck});
- erfdata_avg = fullfile(expdata_erf, avgdata_lst{i_subj, i_blck});
- erfdata_raw = fullfile(expdata_erf, rawdata_lst{i_subj, i_blck});
- save(erfdata_erf, 'erf');
- save(erfdata_avg, 'avg');
- save(erfdata_raw, 'raw');
- end
- end
- %% Compute grand averages
- % Compute grand average ERF by condition
- Grand_Avg_ERF = cell(nConds, nTypes);
- for i_type = 1:nTypes
- for i_cond = 1:nConds
- Grand_Avg_ERF{i_cond, i_type} = ft_timelockgrandaverage([], AVG{:, i_cond, i_type});
- end
- end
- % Compute grand average ERF and RMS across channels
- Grand_AVG_ERF_across_channels = zeros(nConds, nTypes, nTimes);
- Grand_AVG_RMS_across_channels = zeros(nConds, nTypes, nTimes);
- for i_type = 1:nTypes
- for i_cond = 1:nConds
- Grand_AVG_ERF_across_channels(i_cond, i_type, :) = mean(Grand_Avg_ERF{i_cond, i_type}.avg);
- Grand_AVG_RMS_across_channels(i_cond, i_type, :) = rms(Grand_Avg_ERF{i_cond, i_type}.avg);
- end
- end
- % Compute grand average ERF and RMS across participants and word types
- GRAND_AVG_ERF = squeeze(mean(Grand_AVG_ERF_across_channels, [1 2]));
- GRAND_AVG_RMS = squeeze(mean(Grand_AVG_RMS_across_channels, [1 2]));
- %% Extract peak latencies
- % Windows of interest
- M200 = [0.170 0.250];
- M400 = [0.300 0.500];
- ERFs = [M200; M400];
- TOIs = zeros(nPeaks, 2);
- Peak = zeros(size(ERFs, 1), 1);
- % Loop through ERFs
- for i_peak = 1:nPeaks
- % Extract time boundaries for the current component
- l_bound = find(timeID == ERFs(i_peak, 1) * fSampl);
- r_bound = find(timeID == ERFs(i_peak, 2) * fSampl);
- % Restrict timecourse to time of interest
- rms_erf = GRAND_AVG_RMS(l_bound:r_bound);
- % Find maximum amplitude in the time window
- [m, ix] = max(rms_erf);
- peakLat = ix + l_bound;
- % Compute full width half max (FWHM) around the peak
- l_flank = fliplr(GRAND_AVG_RMS(1 : peakLat - 1)');
- r_flank = GRAND_AVG_RMS(peakLat + 1: end);
- l_nadir = find(diff(l_flank) > 0, 1);
- r_nadir = find(diff(r_flank) > 0, 1);
- bs_mean = mean([l_flank(l_nadir) r_flank(r_nadir)]);
- halfMax = m/2 + bs_mean;
- l_bound = find(l_flank < halfMax, 1);
- r_bound = find(r_flank < halfMax, 1);
- fwhm_ix = ((peakLat - l_bound : peakLat + r_bound) - 150) / fSampl;
- % Extrcat latency around the peak based on FWHM
- TOIs(i_peak, :) = [fwhm_ix(1) fwhm_ix(end)];
- Peak(i_peak) = (peakLat - 150) / 1000;
- end
- % Summarize
- RMS_latency = {TOIs, Peak, ERFs, ERFsID};
- RMS_average = GRAND_AVG_RMS;
- %% Save results
- % Save results
- save(fullfile(results_dir, 'RMS_latency.mat'), 'RMS_latency')
- save(fullfile(results_dir, 'RMS_average.mat'), 'RMS_average')
- %% Plot grand average rms
- % Open figure
- figure;
- % Plot grand average rms across all trials
- toi = TOIs(1, :) * 1000 - 150;
- lat = find(timeID >= toi(1) & timeID <= toi(2));
- l_bound = lat(1);
- r_bound = lat(end);
- rectangle('Position', [l_bound, 0, r_bound - l_bound, 50], ...
- 'FaceColor', [.9 .9 .9], 'EdgeColor', [.5 .5 .5], ...
- 'HandleVisibility', 'off'); hold on
- toi = TOIs(2, :) * 1000 - 150;
- lat = find(timeID >= toi(1) & timeID <= toi(2));
- l_bound = lat(1);
- r_bound = lat(end);
- rectangle('Position', [l_bound, 0, r_bound - l_bound, 50], ...
- 'FaceColor', [.9 .9 .9], 'EdgeColor', [.5 .5 .5], ...
- 'HandleVisibility', 'off');
- plot(timeID, GRAND_AVG_RMS * 1e15, 'black-', 'LineWidth', 2);
- title('Grand Average RMS', 'FontSize', 12, 'FontName', 'Arial', 'FontWeight', 'bold'); ylim([0 50])
- xlabel('Time (ms)', 'FontSize', 10, 'FontName', 'Arial', 'FontWeight', 'normal');
- ylabel('Magnetic field strength (fT)', 'FontSize', 10, 'FontName', 'Arial', 'FontWeight', 'normal');
- % Save figure
- fname = fullfile(figures_dir, 'grand_avg_rms.eps');
- exportgraphics(gcf, fname, 'ContentType', 'vector')
- fname = fullfile(figures_dir, 'grand_avg_rms.tiff');
- saveas(gcf, fname)
S05_01_01_compute_erf.m, no license · at the source
Overview
- Max Planck Research Group Language Cycles, Max Planck Institute for Human Cognitive and Brain Sciences, Leipzig, Germany
- Methods and Development Group Brain Networks, Max Planck Institute for Human Cognitive and Brain Sciences, Leipzig, Germany
- Department of English and Linguistics, Johannes Gutenberg University Mainz, Mainz, Germany
- Clinic for Phoniatrics and Pedaudiology, University Hospital Münster, Münster, Germany
Abstract
Neural tracking of prosodic and statistical patterns supports speech segmentation and word learning. Yet, acoustic and abstract patterns have proven difficult to dissociate empirically. Our study employs an artificial language learning paradigm generated with a method that orthogonalizes acoustic and statistical patterns in auditory stimuli. MEG recordings from 32 human adults who had been exposed to continuous syllable streams reveal distinct brain sources tracking periodic acoustic, prosodic, and statistical patterns. After encoding, M200 and M400 field responses to isolated trisyllabic chunks show that participants retained both prosodic and statistical patterns for learning pseudowords from the syllable streams. Behavioral data extend our findings, suggesting not only that integrating both acoustic and abstract patterns is critical to learning, but also that prior knowledge of the pseudowords is sufficient for recognition. The findings advance our understanding of the neural sources that encode and integrate acoustic and statistical patterns during and after language learning.
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 21 matches between paragraphs and lines of code.
OSF qtrz9
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
- 27 September 2026: the link answers (HTTP 200)
32 files
- S00_00_01_corpus.py, Python, 32 lines
- S00_00_02_corpus.m, MATLAB, 655 lines
- S00_01_01_syllables.py, Python, 107 lines, 2 matches
- S00_01_02_syllables.R, R, 55 lines
- S00_02_01_prosody.py, Python, 45 lines, 1 match
- S00_02_02_prosody.R, R, 40 lines
- S00_03_01_lexicons.py, Python, 1,076 lines, 2 matches
- S00_04_01_trials.py, Python, 204 lines
- S00_04_03_trials.m, MATLAB, 91 lines
- S00_05_01_stimset.m, MATLAB, 281 lines, 2 matches
- S01_00_00_neuraltrack.m, MATLAB, 1,070 lines, 1 match
- S01_01_01_epoching.m, MATLAB, 311 lines
- S02_01_02_preprocessing.
m , MATLAB, 214 lines, 2 matches - S02_01_03_cleaning.m, MATLAB, 270 lines, 1 match
- S03_01_01_compute_pow.m, MATLAB, 78 lines
- S03_01_02_analyze_pow.m, MATLAB, 203 lines, 2 matches
- S03_01_03_plot_pow.m, MATLAB, 178 lines
- S04_01_01_compute_itc.m, MATLAB, 128 lines, 1 match
- S04_01_02_analyze_itc.m, MATLAB, 358 lines
- S04_01_03_plot_itc.m, MATLAB, 231 lines
- S04_01_04_lme_itc.R, R, 64 lines
- S05_01_01_compute_erf.m, MATLAB, 234 lines, 4 matches
- S05_01_02_analyze_erf.m, MATLAB, 401 lines
- S05_01_03_plot_erf.m, MATLAB, 217 lines
- S06_01_01_headmodel.m, MATLAB, 156 lines
- S06_01_02_sourcemodel.m, MATLAB, 244 lines
- S06_01_03_leadfield.m, MATLAB, 83 lines
- S06_01_04_atlas_roi.m, MATLAB, 267 lines
- S07_01_01_sourceanalysis
.m , MATLAB, 255 lines, 2 matches - S07_01_02_sourceplots.m, MATLAB, 445 lines
- S08_01_01_behavior.m, MATLAB, 210 lines
- S08_01_02_lme_behavior.R
, R, 210 lines, 1 match
milosen/alparc
8b83adc0848439bff86897eb412c1b8a693e37c5, 29 April 2026Availability: 1 check, the latest on 27 September 2026: the link answers
- 27 September 2026: the link answers
26 files
- publication/
data_and_stats_from_the_ , Jupyter, 213 linespaper.ipynb - publication/
plots_from_paper.ipynb , Jupyter, 726 lines - publication/
worked_example.ipynb , Jupyter, 91 lines - src/
alparc/ , Python, 335 lines__init__.py - src/
alparc/ , Python, 134 linescorpus.py - src/
alparc/ , Jupyter, 103 linesdata/ data_cleanup.ipynb - src/
alparc/ , Python, 1 linedata/ phonecodes/ __init__.py - src/
alparc/ , Python, 569 linesdata/ phonecodes/ phonecode_tables.py - src/
alparc/ , Python, 211 linesdata/ phonecodes/ phonecodes.py - src/
alparc/ , Python, 308 linesdata/ phonecodes/ pronlex.py - src/
alparc/ , Python, 206 linesdisplay.py - src/
alparc/ , Python, 180 lineslexicons.py - src/
alparc/ , Python, 382 linesstreams.py - src/
alparc/ , Python, 179 linessyllables.py - src/
alparc/ , Python, 182 linestypes.py - src/
alparc/ , Python, 275 lineswords.py - tests/
__init__.py , Python, 1 line - tests/
test_corpus.py , Python, 84 lines - tests/
test_lexicons.py , Python, 102 lines - tests/
test_pipeline.py , Python, 205 lines - tests/
test_streams.py , Python, 235 lines - tests/
test_syllables.py , Python, 126 lines - tests/
test_types.py , Python, 183 lines - tests/
test_words.py , Python, 137 lines - LICENSE, License, 19 lines
- README.md, Text, 179 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;
- 56 scripts, each with its path and the digest of its content;
- 21 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
Datasets cited
- zenodo:17990155, at Zenodo; found in “Data and code availability”
Data and code availability
• The original data reported in this study cannot be deposited in a public repository because of ethical restrictions. The aggregated data and summary statistics have been deposited at Zenodo and are publicly available as of the date of publication at: https://
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 2, 28 September 2026
- Authors: added Lorenzo Titone (0009-0004-6442-6980); removed Lorenzo Titone
Version 1, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 3 authors, 4 keywords, 2 funders, 77 references.
Cite
This paper
Titone, L., Maess, B., & Meyer, L. (2026). Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning. iScience, 29(7), 116458. https://
BibTeX
@article{titone2026neura
author = {Titone, Lorenzo and Maess, Burkhard and Meyer, Lars},
title = {{Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning}},
journal = {iScience},
year = {2026},
month = jun,
volume = {29},
number = {7},
pages = {116458},
publisher = {Elsevier},
issn = {2589-0042},
doi = {10.1016/
url = {https://
pmid = {42389590},
pmcid = {PMC13320337}
}
RIS
TY - JOUR
AU - Titone, Lorenzo
AU - Maess, Burkhard
AU - Meyer, Lars
TI - Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning
T2 - iScience
J2 - iScience
PY - 2026
DA - 2026/
VL - 29
IS - 7
SP - 116458
SN - 2589-0042
PB - Elsevier
DO - 10.1016/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1016/
"type": "article-journal",
"title": "Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning",
"container-title": "iScience",
"author": [
{
"family": "Titone",
"given": "Lorenzo"
},
{
"family": "Maess",
"given": "Burkhard"
},
{
"family": "Meyer",
"given": "Lars"
}
],
"container-title-short":
"volume": "29",
"issue": "7",
"page": "116458",
"DOI": "10.1016/
"PMID": "42389590",
"PMCID": "PMC13320337",
"ISSN": "2589-0042",
"publisher": "Elsevier",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
6,
24
]
]
}
}
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/nol.a.249 [code]
- How Low-Frequency Neural Activity Structures Language in Time.Journal: Neurobiology of language (Cambridge, Mass.)In common: FieldTrip, emmeans, lme4, 2 other tools, cognitive, 13 references
- [2] doi:10.1002/aur.70312 [code]
- Aberrant Neural Entrainment to Word-Level Speech Patterns in Fragile X Syndrome: Evidence for a Statistical Learning Deficit.Journal: Autism research : official journal of the International Society for Autism ResearchIn common: Statistics and Machine Learning Toolbox, cognitive, 13 references
- [3] doi:10.7554/elife.108408 [code]
- Frequency and laminar profile of feature-specific visual activity revealed by interleaved EEG-fMRI.Journal: eLifeIn common: Pingouin, FieldTrip, Statistics and Machine Learning Toolbox, 5 other tools, 5 references
- [4] doi:10.1093/cercor/bhag077 [code]
- The longitudinal development of intrinsic timescales in infancy and their relation to alpha brain rhythm.Journal: Cerebral cortex (New York, N.Y. : 1991)In common: Pingouin, FieldTrip, lmerTest, 8 other tools, 2 references
- [5] doi:10.1162/imag.a.105 [code]
- Right posterior theta reflects human parahippocampal phase resetting by salient cues during goal-directed navigationJournal: n/aIn common: Pingouin, lmerTest, lme4, 8 other tools, cognitive, 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: FieldTrip, emmeans, lme4, 8 other tools, 2 references
- [7] doi:10.1038/s41593-026-02228-w [code]
- Circuit response to neuromodulation characterized with simultaneous deep brain stimulation and precision neuroimaging in humans.Journal: Nature neuroscienceIn common: Pingouin, emmeans, lmerTest, 8 other tools, 1 reference
- [8] doi:10.1162/imag.a.1245 [code]
- Towards precision EEG connectomics: Evaluating the benefits of dense sampling.Journal: Imaging neuroscience (Cambridge, Mass.)In common: Pingouin, FieldTrip, lmerTest, 9 other tools
- [9] doi:10.1038/s41593-026-02345-6 [code]
- Human hippocampal ripples tune cortical responses based on predicted uncertainty.Journal: Nature neuroscienceIn common: FieldTrip, emmeans, lme4, 2 other tools, cognitive, 5 references
- [10] doi:10.1038/s41597-026-07350-9 [code]
- An open multi-center MEG-EEG dataset for studying conscious visual perception.Journal: Scientific dataIn common: Pingouin, emmeans, lmerTest, 8 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, 56 scripts, and 21 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:1088b3a06fc982e2…
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.
