Song Familiarity Relies on Evidence Accumulation.
The 7 matches · 1 of them tie a paragraph to a whole file, not to given lines: a weak match, whose lines are not tinted
- [1] § Results › EEG Results › Parametric Regression ↔ analyze_songfamiliarity_06_statsandfigures.m, lines 319–385 · score 0.93 · 308–600 ms, 468–488 ms, 116 ms, 308 ms, 468 ms, 348 ms
- [2] § Method › Data Analysis › EEG Preprocessing ↔ private/dm_prep.m, the whole file · a weak match · score 0.88 · bandpass filter, Ocular components, EEGLAB, downsampling, iclabel, notch
- [3] § Method › Data Analysis › Event‐Related Analysis ↔ analyze_songfamiliarity_05_erps.m, lines 126–211 · score 0.84 · uf_designmat, uf_timeexpandDesignmat, rERPs, design matrix, rows, artifacts
- [4] § Method › Participants ↔ analyze_songfamiliarity_01_bidsify.m, lines 28–122 · score 0.76 · curly hair, MacEwan, age, ambidextrous, female, power
- [5] § Method › Data Analysis › Event‐Related Analysis ↔ analyze_songfamiliarity_05_erps.m, lines 126–211 · score 0.72 · cross validation, rERPs, pinv, lambda, matrix, Error
- [6] § Method › Statistics ↔ private/doPermTest2.m, lines 1–84 · score 0.67 · cluster mass, temporal cluster, permuted, waveforms, sum, permutation
- [7] § Method › Data Analysis › EEG Preprocessing ↔ analyze_songfamiliarity_01_eegprep.m, lines 1–79 · score 0.60 · 0.1–20 Hz, EEGLAB, ICA, filter, SD, Preprocessing
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 · 211 lines · 7.2 KB · MIT · 2 matches
- % Compute the the regression ERPs
- % Other m-files required:
- % EEGLAB toolbox: https://github.com/sccn/eeglab
- % Unfold toolbox: https://github.com/unfoldtoolbox/unfold
- % Author: Cameron Hassall, Department of Psychology, MacEwan University
- % email address: [email hidden]
- % Website: http://www.cameronhassall.com
- init_unfold();
- % Folders
- if ispc
- projectFolder = 'C:\Users\chass\OneDrive\Projects\2024_EEG_SongFamiliarity_Hassall\';
- dataFolder = 'F:\2024_EEG_SongFamiliarity_Hassall\bids';
- else
- projectFolder = '/Users/HassallC/Library/CloudStorage/OneDrive-Personal/Projects/2024_EEG_SongFamiliarity_Hassall';
- dataFolder = '/Volumes/T7 (Data)/2024_EEG_SongFamiliarity_Hassall/bids';
- end
- resultsFolder = fullfile(projectFolder,'analysis','results');
- % Set this flag to determine the analysis
- % whichAnalysis flag
- % 1: Note events for unfamiliar and familiar unrecognized. Response events.
- % 2: Note position as a parametric regressor
- % 3: Same as 2, but exclude songs that were recognized
- % 4: Same as 2, but split by ID'd and NonID'd
- % sufficient trial numbers)
- whichAnalysis = 2; % Analysis flag
- % Set this flag to determine whether we do cross validation (we do this
- % once to determine hyperparameters, which we use for all analyses)
- doCV = 0; % Cross-validation flag
- % Set this flag to determine whether we do regularization (should be set to
- % 1)
- doReg = 1; % Regularization flag
- % Excluded participants
- % sub-08: No EEG recorded
- % sub-18: No familiar songs
- % Included participants
- subjStrs = {'sub-01','sub-02','sub-03','sub-04','sub-05','sub-06' ,'sub-07','sub-09','sub-10','sub-11','sub-12','sub-13','sub-14','sub-15','sub-16','sub-17','sub-19','sub-20','sub-21','sub-22','sub-23','sub-24','sub-25','sub-26','sub-27','sub-28','sub-29','sub-30'};
- % Remove additional participants if they are unable to be analyzed
- if whichAnalysis == 3
- % sub-21: no "familiar unrecognized" notes
- % sub-23: no "familiar unrecognized" notes
- toRemove = {'sub-21','sub-23'};
- toRemoveI = find(contains(subjStrs,toRemove));
- subjStrs(toRemoveI) = [];
- end
- if whichAnalysis == 4
- % sub-20: no "recognized" notes
- % sub-21: no "familiar unrecognized" notes
- % sub-23: no "familiar unrecognized" notes
- toRemove = {'sub-20','sub-21','sub-23'};
- toRemoveI = find(contains(subjStrs,toRemove));
- subjStrs(toRemoveI) = [];
- end
- % Deal with cross-validation and regularization flags
- if doCV
- regPar = [];
- elseif doReg
- load(fullfile(resultsFolder,['regPar_1.mat']),'regPar');
- else
- regPar = zeros(size(subjStrs));
- end
- % Result variables
- allBeta = [];
- allERP = [];
- numEventTypes = [];
- allBadChannels = {};
- allArtifactProp = [];
- for i = 1:length(subjStrs)
- % Load EEG
- thisPrepFolder = fullfile(dataFolder,subjStrs{i},'derivatives','eegprep');
- thisPrepFile = [subjStrs{i} '_task-songfamiliarity_eegpreprelabel.mat'];
- load(fullfile(thisPrepFolder, thisPrepFile),'EEG');
- if doCV
- EEG = pop_resample(EEG,100); % For speed
- end
- % sub-01 recording started a bit late, so remove these events
- if strcmp(subjStrs{i},'sub-01')
- EEG.event(1:6) = [];
- end
- % Relabel notes
- % 'f' = familiar but not recognized
- % 'r' = familiar and recognized
- % 'u' = unfamiliar
- % '2' = response
- for j = 1:length(EEG.event)
- if contains(EEG.event(j).type,'u')
- EEG.event(j).type = 'u';
- elseif contains(EEG.event(j).type,'f')
- EEG.event(j).type = 'f';
- elseif contains(EEG.event(j).type,'r') && whichAnalysis ~= 3 && whichAnalysis ~= 4
- EEG.event(j).type = 'f'; % Count these as familiar
- elseif contains(EEG.event(j).type,'r') && whichAnalysis == 4
- EEG.event(j).type = 'r'; % Keep these as a seprate condition ('recognized familiar');
- elseif strcmp(EEG.event(j).type,'2') && whichAnalysis == 4 % Split responses by condition
- if contains(EEG.event(j-1).type,'f')
- EEG.event(j).type = '2f';
- elseif contains(EEG.event(j-1).type,'r')
- EEG.event(j).type = '2r';
- end
- end
- end
- % Remove "type" from chanlocs so we don't confuse uf_continuousArtifactDetect()
- for j = 1:31
- EEG.chanlocs(j).type = [];
- end
- % Construct design matrix
- switch whichAnalysis
- case 1
- EEG = uf_designmat(EEG,'eventtypes',{'u','f','2'},'formula',{'y ~ 1','y ~ 1','y ~ 1'});
- case {2,3}
- EEG = uf_designmat(EEG,'eventtypes',{'f','2'},'formula',{'y ~ 1+pos','y ~ 1'});
- case {4}
- EEG = uf_designmat(EEG,'eventtypes',{'f','r','2f','2r'},'formula',{'y ~ 1+pos','y ~ 1+pos','y ~ 1','y ~ 1'});
- end
- % Define time window
- ufTime = [-1.5 1.5];
- % Make design matrix
- EEG = uf_timeexpandDesignmat(EEG,'timelimits',ufTime);
- % Flag zero rows
- nonZero = any(EEG.unfold.Xdc,2);
- isZero = ~nonZero;
- % Artifact detection
- [winrej, chanrej, rejProp] = uf_continuousArtifactDetect(EEG,'amplitudeThreshold',75,'windowsize',1000,'stepsize',100,'combineSegments',[]);
- isArtifact = zeros(size(isZero));
- isArtifactByChannel = zeros(size(isZero,1),EEG.nbchan);
- toRemove = [];
- for j = 1:size(winrej,1)
- toRemove = [toRemove winrej(j,1):winrej(j,2)];
- isArtifactByChannel(winrej(j,1):winrej(j,2),chanrej(j,:)==1) = 1;
- end
- isArtifact(toRemove) = 1;
- % Reject by channel
- artifactPropByChannel = mean(isArtifactByChannel(~isZero,:),1);
- isBad = artifactPropByChannel > 0.10;
- badChannels = {EEG.chanlocs(isBad).labels};
- allBadChannels{i} = badChannels;
- % Number of artifact as a proportion of samples of interest
- allArtifactProp(i) = mean(isArtifact & ~isZero);
- % Remove artifacts and non-zero rows
- EEG.unfold.Xdc(isArtifact | isZero,:) = [];
- EEG.data(:,isArtifact | isZero) = [];
- EEG.pnts = size(EEG.data,2);
- % Determine where the breaks between rERPs are (Unfold smooshes
- % everything together)
- numPoints = (ufTime(2)-ufTime(1))*EEG.srate;
- switch whichAnalysis
- case 1
- breakpoints = int32([numPoints 2*numPoints]);
- case {2,3}
- breakpoints = int32([numPoints 2*numPoints]);
- case {4}
- breakpoints = int32([numPoints 2*numPoints 3*numPoints 4*numPoints 5*numPoints]);
- end
- % Do cross-validation
- if doCV
- regtype = 'onediff';
- lambdas = [0 1E1 1E2 1E3 1E4 1E5 1E6 1E7 1E8];
- k = 10;
- [allErrors,bestBeta] = doRegCV(EEG.data,EEG.unfold.Xdc,regtype,{1:size(EEG.unfold.Xdc,2)},{breakpoints},lambdas,k);
- figure();
- plot(allErrors);
- drawnow();
- [~,j] = min(allErrors);
- disp(lambdas(j));
- regPar(i) = lambdas(j);
- end
- % Solve GLM
- regtype = 'onediff';
- lambda = regPar(i);
- thisPDM = pinv_reg(EEG.unfold.Xdc,lambda,regtype,breakpoints);
- tempBeta = thisPDM * EEG.data';
- allBeta(i,:,:) = tempBeta';
- end
- if doCV
- save(fullfile(resultsFolder,['regPar_' num2str(whichAnalysis) '.mat']),'regPar');
- end
- save(fullfile(resultsFolder,['results_' num2str(whichAnalysis) '_' num2str(doReg) '.mat']));
analyze_songfamiliarity_05_erps.m at commit e98e9c8, under MIT · at the source
Overview
Abstract
Familiarity judgments are thought to involve evidence accumulation, a decision‐making process in which information is gathered over time until a threshold is reached. Previous work has identified a scalp‐recorded signature of evidence accumulation called the central‐parietal positivity (CPP). We built on this previous work and recorded electroencephalography while participants listened to several melodies, instructing participants to respond as soon as the song felt familiar. A prominent CPP was noted, time‐locked to decisions. We then used linear regression to unmix overlapping neural responses and observed a stimulus‐locked indicator of evidence accumulation that increased in amplitude just prior to a familiarity decision. This result suggests that song familiarity relies on evidence accumulation, with individual notes in a familiar song acting as “evidence”.
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 7 matches between paragraphs and lines of code.
chassall/songfamiliarity
e98e9c8e400430944ef925c00eed1468118f00ce, 25 August 2025Availability: 1 check, the latest on 26 September 2026: the link answers
- 26 September 2026: the link answers
15 files
- analyze_songfamiliarity_
01_bidsify.m , MATLAB, 255 lines, 1 match - analyze_songfamiliarity_
01_eegprep.m , MATLAB, 92 lines, 1 match - analyze_songfamiliarity_
02_beh.m , MATLAB, 129 lines - analyze_songfamiliarity_
04_labelnotes.m , MATLAB, 163 lines - analyze_songfamiliarity_
05_erps.m , MATLAB, 211 lines, 2 matches - analyze_songfamiliarity_
06_statsandfigures.m , MATLAB, 569 lines, 1 match - private/
dm_prep.m , MATLAB, 132 lines, 1 match - private/
doPermTest2.m , MATLAB, 260 lines, 1 match - private/
figset.m , MATLAB, 40 lines - private/
formatNBP.m , MATLAB, 34 lines - private/
makefigure.m , MATLAB, 28 lines - private/
pinv_reg.m , MATLAB, 84 lines - private/
subtightplot.m , MATLAB, 67 lines - LICENSE, License, 21 lines
- README.md, Text, 2 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:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 13 scripts, each with its path and the digest of its content;
- 7 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
- doi:10.18112/
openneuro.ds005876.v1.0. , at OpenNeuro; found in “Data Availability Statement”1
Data Availability Statement
EEG dataset is available 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 3, 28 September 2026
- Publisher: n/a → Wiley
Version 1, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 3 authors, 6 keywords, 11 MeSH terms, 1 funder, 69 references.
Cite
This paper
Girard, J. R., Bishop, A., & Hassall, C. D. (2026). Song Familiarity Relies on Evidence Accumulation. Psychophysiology, 63(8), e70370. https://
BibTeX
@article{girard2026song,
author = {Girard, Jared R. and Bishop, Aaron and Hassall, Cameron D.},
title = {{Song Familiarity Relies on Evidence Accumulation}},
journal = {Psychophysiology},
year = {2026},
month = aug,
volume = {63},
number = {8},
pages = {e70370},
publisher = {Wiley},
issn = {0048-5772},
doi = {10.1111/
url = {https://
pmid = {42538772},
pmcid = {PMC13428188}
}
RIS
TY - JOUR
AU - Girard, Jared R.
AU - Bishop, Aaron
AU - Hassall, Cameron D.
TI - Song Familiarity Relies on Evidence Accumulation
T2 - Psychophysiology
J2 - Psychophysiology
PY - 2026
DA - 2026/
VL - 63
IS - 8
SP - e70370
SN - 0048-5772
PB - Wiley
DO - 10.1111/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1111/
"type": "article-journal",
"title": "Song Familiarity Relies on Evidence Accumulation",
"container-title": "Psychophysiology",
"author": [
{
"family": "Girard",
"given": "Jared R."
},
{
"family": "Bishop",
"given": "Aaron"
},
{
"family": "Hassall",
"given": "Cameron D."
}
],
"container-title-short":
"volume": "63",
"issue": "8",
"page": "e70370",
"DOI": "10.1111/
"PMID": "42538772",
"PMCID": "PMC13428188",
"ISSN": "0048-5772",
"publisher": "Wiley",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
8,
1
]
]
}
}
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/s41598-026-47785-z [code]
- Modulations of the P3b effect as a function of bilingual language experience.Journal: Scientific reportsIn common: ICLabel, EEGLAB, Statistics and Machine Learning Toolbox, EEG, cognitive, 4 references
- [2] doi:10.1523/eneuro.0316-25.2026 [code]
- Neural Mechanisms of Self-Generated Action Sequences.Journal: eNeuroIn common: EEGLAB, Statistics and Machine Learning Toolbox, EEG, cognitive, 4 references
- [3] doi:10.7554/elife.107088 [code]
- Development of auditory and spontaneous movement responses to music over the first postnatal year.Journal: eLifeIn common: ICLabel, EEGLAB, Statistics and Machine Learning Toolbox, EEG, 3 references
- [4] doi:10.1371/journal.pone.0353990 [code]
- Positive mood enhances accessibility of unrelated concepts in the first language but not in the foreign language.Journal: PloS oneIn common: ICLabel, EEGLAB, EEG, cognitive, 3 references
- [5] doi:10.1162/nol.a.255 [code]
- Lexical Representations of the Native and Second Languages During L2 Word Reading in Chinese-English Bilinguals.Journal: Neurobiology of language (Cambridge, Mass.)In common: ICLabel, EEGLAB, Statistics and Machine Learning Toolbox, EEG, cognitive, 2 references
- [6] doi:10.1523/eneuro.0069-26.2026 [code]
- Electrophysiological Indices of Hierarchical Speech Processing Differentially Reflect the Comprehension of Speech in Noise.Journal: eNeuroIn common: ICLabel, EEGLAB, Statistics and Machine Learning Toolbox, EEG, cognitive, 2 references
- [7] doi:10.1016/j.neuroimage.2026.122115 [code]
- Midfrontal theta power relates to response speeding following frustrative nonreward.Journal: NeuroImageIn common: ICLabel, EEGLAB, Statistics and Machine Learning Toolbox, EEG, cognitive, 2 references
- [8] doi:10.1016/j.isci.2025.113806 [code]
- Beta-band frequency shifts signal decisions in human prefrontal cortexJournal: n/aIn common: Statistics and Machine Learning Toolbox, 6 references
- [9] doi:10.1093/braincomms/fcag351 [code]
- Time-resolved aperiodic dynamics in event segmentation in attention-deficit/
hyperactivity disorder. Journal: Brain communicationsIn common: ICLabel, EEGLAB, Statistics and Machine Learning Toolbox, EEG, cognitive, 2 references - [10] doi:10.1038/s41598-026-39420-8
- Eye movement dynamics are a key factor for intra-saccadic motion perception.Journal: Scientific reportsIn common: cognitive, 5 references
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
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, 13 scripts, and 7 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:f950764ffd81374d…
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.
