Anterior lateral motor cortex enables contextual decision-making via dynamic reconfiguration of local circuits.
One block of code here has a permanent identifier (oscr:b:…), listed with the matches below: citable for good, with a page of its own. Select a match and press Cite to copy it. What a block identifier is.
The 2 matches
- [1] § STAR★METHODS › QUANTIFICATION AND STATISTICAL ANALYSIS › Decoding and PCA analysis ↔ fitsvm8T_cos.m, lines 154 to 193 · score 0.77 · SVM weight vectors, sliding window, odor onset, matrix, cosine, bin · block
oscr:b:AKKFRJWMAQDNP-5· Report a mismatch - [2] § RESULTS › Generalization of context at the level of choice neurons ↔ fitsvm8T_cos.m, lines 154 to 193 · score 0.52 · SVM weight vectors, odor onset, cosine · block
oscr:b:AKKFRJWMAQDNP-5· 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
MATLAB · 420 lines · 15 KB · no license · 2 matches
- function [cors_ab,cors_cd,cors_sh] = fitsvm8T_cos(Ninput,ds0,data0,prm,fe)
- % train svm with lick triggered dataset
- % train the decode on A/B data and test on C/D
- Nfold = 50; %number of iteration
- fold = 0.8; % 5 fold cross-validation
- if length(ds0) ~= length(data0)
- disp('input cell dimension mismatch!')
- end
- n_ss = length(ds0);
- d_wd = prm.d_wd;
- stp = prm.stp; st = prm.st; en = prm.en; binsize = prm.binsize;
- d_bins = round((d_wd(1)-st)/stp+2):round((d_wd(2)-st)/stp+1);
- n_bins = length(d_bins);
- cors_ab = nan(n_ss,n_bins);
- errs_ab = nan(n_ss,n_bins);
- cors_cd = nan(n_ss,n_bins);
- errs_cd = nan(n_ss,n_bins);
- for i = 1 %n_ss
- % fprintf('computing roc for session #%d\n',i);
- ds = ds0{i}; data = data0{i};
- if size(data,1) ~= size(ds,1)
- disp('number of trials mismatch!')
- end
- N = size(data,3); % number of units in current session
- Nmax = Ninput;
- if Nmax == 0
- Nmax = N;
- fprintf('Session #%d has %d units\n',i,N);
- elseif Nmax <= N
- fprintf('Session #%d has %d units\n',i,N);
- elseif Nmax > N
- fprintf('Session #%d has %d units, skipped\n',i,N);
- continue;
- end
- sel = ds.correct==1; % correct trials only
- % % sel = ds.miss ~= 1; % remove miss trials
- % % ds.error = ds.error | ds.xSwitch; % treat switch trials as error
- % % sel = ds.miss == 0 | ds.xSwitch == 0; % remove miss and switch trials
- % if kp_el == 0 % exclude early licks
- % sel = sel & ds.early_lick==0; % no early lick trials
- % end
- ds = ds(sel,:);
- data = data(sel,:,:);
- ds_ab = ds(ds.tt<4,:);
- ds_cd = ds(ds.tt>=4,:);
- data_ab = data(ds.tt<4,:,:);
- data_cd = data(ds.tt>=4,:,:);
- P = size(ds_ab,1); % number of correct control trials
- Ptrain = floor(fold*P); % number of trials for training
- ds_ab.AasSample = ds_ab.tt<=1;
- ds_cd.CasSample = ds_cd.tt<=5;
- ds_ab.AasTest = ismember(ds_ab.tt,[0 3 4 7]);
- ds_cd.AasTest = ismember(ds_cd.tt,[0 3 4 7]);
- switch fe
- case 'sample'
- labels_ab = ds_ab.AasSample;
- labels_cd = ds_cd.CasSample;
- case 'match'
- labels_ab = ds_ab.match;
- labels_cd = ds_cd.match;
- case 'test'
- labels_ab = ds_ab.AasTest;
- labels_cd = ds_cd.AasTest;
- case 'choice'
- labels_ab = ds_ab.left;
- labels_cd = ds_cd.left;
- case 'trialtype'
- labels_ab = ds_ab.trial_type;
- labels_cd = ds_cd.trial_type - 4;
- % case 'correct'
- % labels = ds.correct;
- case 'context'
- labels_ab = ds_ab.context;
- labels_cd = ds_cd.context;
- end
- labels_ab = double(labels_ab);
- labels_cd = double(labels_cd);
- % fr = squeeze(mean(data(:,wd_bins,:),2));
- % Initialize weight storage
- svm_weights = nan(n_bins, Nmax,Nfold); % Store SVM weights over time bins
- for j = 1:n_bins
- fprintf('bin %d of %d\n',j,n_bins);
- bi_en = d_bins(j);
- bi_st = bi_en - round(binsize/stp) + 1;
- cur_data_ab = data_ab(:,bi_st:bi_en,:);
- cur_data_cd = data_cd(:,bi_st:bi_en,:);
- fr_ab = squeeze(mean(cur_data_ab,2));
- fr_cd = squeeze(mean(cur_data_cd,2));
- cur_cor_ab = zeros(Nfold,1);
- cur_err_ab = zeros(Nfold,1);
- cur_cor_cd = zeros(Nfold,1);
- cur_err_cd = zeros(Nfold,1);
- cur_cor_sh = zeros(Nfold,1);
- cur_err_sh = zeros(Nfold,1);
- for fi = 1:Nfold
- indtrain = randsample(P,Ptrain); %indices of trials to use for training
- indtest = setdiff(1:P,indtrain); %indices for testing
- labelstrain_ab = labels_ab(indtrain);
- datatrain_ab = fr_ab(indtrain,:);
- labelstest_ab = labels_ab(indtest);
- datatest_ab = fr_ab(indtest,:);
- labelshuffle = labels_ab(randperm(length(labels_ab))');
- labelstrain_shuffle = labelshuffle(indtrain);
- labelstest_shuffle = labelshuffle(indtest);
- if Nmax ~= N
- cellinds = randsample(N,Nmax);
- datatrain_ab = datatrain_ab(:,cellinds);
- datatest_ab = datatest_ab(:,cellinds);
- end
- model = train(labelstrain_ab,sparse(datatrain_ab),'-q');
- svm_weights(j, :,fi) = model.w; % Store the weight vector for this time bin
- predtest_ab = predict(ones(length(labelstest_ab),1),...
- sparse(datatest_ab),model,'-q');
- cur_cor_ab(fi) = mean(predtest_ab == labelstest_ab);
- cur_err_ab(fi) = mean(predtest_ab ~= labelstest_ab);
- pred_cd = predict(ones(length(labels_cd),1),...
- sparse(fr_cd),model,'-q');
- cur_cor_cd(fi) = mean(pred_cd == labels_cd);
- cur_err_cd(fi) = mean(pred_cd ~= labels_cd);
- model = train(labelstrain_shuffle,sparse(datatrain_ab),'-q');
- predtest_shuffle = predict(ones(length(labelstest_shuffle),1),...
- sparse(datatest_ab),model,'-q');
- cur_cor_sh(fi) = mean(predtest_shuffle == labelstest_shuffle);
- cur_err_sh(fi) = mean(predtest_shuffle ~= labelstest_shuffle);
- end %end loop over folds
- cors_ab(i,j) = mean(cur_cor_ab);
- errs_ab(i,j) = mean(cur_err_ab);
- cors_cd(i,j) = mean(cur_cor_cd);
- errs_cd(i,j) = mean(cur_err_cd);
- cors_sh(i,j) = mean(cur_cor_sh);
- errs_sh(i,j) = mean(cur_err_sh);
- end % end loop over bins
- disp('Done!')
- weights = squeeze(mean(svm_weights,3));
- peak_perf = find(cors_ab(i,:) > 0.9);
- % Define before and after odor bins
- test_odor_bin = 36; %find(d_bins == 0, 1); %the location of test odor bin starts, which is 42
- before_idx = 11:test_odor_bin-1; % cut the baseline, starts from sample onset
- after_idx = test_odor_bin:test_odor_bin+length(before_idx)-1;
- % Inputs:
- % - SVM_weights: [time_points x feature_dim] matrix of SVM weight vectors
- % - time: Vector of time points
- % - test_odor_time: Time of test odor onset
- before_plot_idx = intersect(before_idx, peak_perf);
- after_plot_idx = intersect(after_idx, peak_perf);
- window_size = 5; %Number of time bins to average over
- before_plot_idx = before_plot_idx - 11 - 4;
- after_plot_idx = after_plot_idx - 11 - 4;
- num_timepoints_before = length(before_idx);
- num_timepoints_after = length(after_idx);
- feature_dim = size(weights, 2);
- % Compute the number of sliding window steps
- num_windows_before = num_timepoints_before - window_size + 1;
- num_windows_after = num_timepoints_after - window_size + 1;
- % Initialize sliding window weight matrix
- windowed_weights_before = nan(num_windows_before, feature_dim); %nan(num_timepoints_before, feature_dim); %
- windowed_weights_after = nan(num_windows_after, feature_dim); %nan(num_timepoints_after, feature_dim); %
- % Apply sliding window averaging
- for w = 1:num_windows_before %num_timepoints_before %
- windowed_weights_before(w, :) = mean(weights(before_idx(w):before_idx(w+window_size-1), :), 1); %weights(before_idx(w), :) ;%
- end
- for w = 1:num_windows_before %num_timepoints_after
- windowed_weights_after(w, :) = mean(weights(after_idx(w):after_idx(w+window_size-1), :), 1); %weights(after_idx(w), :) ;%
- end
- % Initialize cosine similarity matrix
- combined_matrix_before = nan(num_windows_before, num_windows_before);
- combined_matrix_after = nan(num_windows_after, num_windows_after);
- combined_matrix = nan(num_windows_after+ num_windows_after, num_windows_after+ num_windows_after);
- % Function to compute cosine similarity
- cosine_sim = @(w1, w2) dot(w1, w2) / (norm(w1) * norm(w2));
- % Compute cosine similarity Before vs Before
- for w = 1:num_windows_before
- for x = w:num_windows_before
- combined_matrix(w, x) = cosine_sim(windowed_weights_before(w, :), windowed_weights_before(x, :));
- combined_matrix(x, w) = combined_matrix(w,x); % Symmetric
- end
- end
- % Compute cosine similarity After vs After
- for w = 1:num_windows_after
- for x = w:num_windows_after
- combined_matrix(num_windows_before+w, num_windows_before+x) = cosine_sim(windowed_weights_after(w, :), windowed_weights_after(x, :));
- combined_matrix(num_windows_before+x, num_windows_before+w) = combined_matrix(num_windows_before+w, num_windows_before+x);
- end
- end
- % Compute cosine similarity Before vs After
- for w = 1:num_windows_before
- for x = 1:num_windows_after
- combined_matrix(w, num_windows_before+x) = cosine_sim(windowed_weights_before(w, :), windowed_weights_after(x, :));
- combined_matrix(num_windows_before+x, w) = combined_matrix(w, num_windows_before+x);
- end
- end
- % Plot combined heatmap
- kernel_size = 1; % Adjust as needed
- % calculate the delta cosine similarity
- for c = 1:size(combined_matrix,2) %num_windows_before
- dcosim1 (c) = mean(combined_matrix(1:num_windows_before,c)) - mean(combined_matrix(num_windows_before+1:end,c));
- end
- for c = 1:size(combined_matrix,1)
- dcosim2 (c) = mean(combined_matrix(c,1:num_windows_before)) - mean(combined_matrix(c, num_windows_before+1:end));
- end
- figure
- plot(dcosim1)
- figure
- plot(dcosim2)
- % Apply Gaussian smoothing
- smoothed_matrix = imgaussfilt(combined_matrix, kernel_size);
- % try the smoothed matrix
- for c = 1:size(smoothed_matrix,2) %num_windows_before
- sdcosim1 (c) = mean(smoothed_matrix(1:num_windows_before,c)) - mean(smoothed_matrix(num_windows_before+1:end,c));
- end
- for c = 1:size(smoothed_matrix,1)
- sdcosim2 (c) = mean(smoothed_matrix(c,1:num_windows_before)) - mean(smoothed_matrix(c, num_windows_before+1:end));
- end
- figure
- plot(sdcosim1)
- figure
- plot(sdcosim2)
- figure;
- imagesc(smoothed_matrix);
- colorbar;
- xlabel('Time');
- ylabel('Time');
- title('Combined Cosine Similarity Matrix');
- figure;
- subplot(2,2,1)
- imagesc(smoothed_matrix(before_plot_idx, before_plot_idx));
- colorbar;
- xlabel('Time');
- ylabel('Time');
- title('Combined Cosine Similarity Matrix');
- subplot(2,2,2)
- imagesc(smoothed_matrix(before_plot_idx, after_plot_idx));
- colorbar;
- xlabel('Time');
- ylabel('Time');
- title('Combined Cosine Similarity Matrix');
- subplot(2,2,3)
- imagesc(smoothed_matrix((27:40),(27:40))) %(after_plot_idx, after_plot_idx));
- colorbar;
- xlabel('Time');
- ylabel('Time');
- title('Combined Cosine Similarity Matrix');
- subplot(2,2,4)
- imagesc(smoothed_matrix(after_plot_idx, before_plot_idx));
- colorbar;
- xlabel('Time');
- ylabel('Time');
- title('Combined Cosine Similarity Matrix');
- % Extract the relevant cosine similarity subsets from the smoothed matrix
- bef_bef = smoothed_matrix(before_plot_idx, before_plot_idx);
- bef_aft = smoothed_matrix(before_plot_idx, after_plot_idx);
- aft_aft = smoothed_matrix(after_plot_idx, after_plot_idx);
- % Flatten the upper triangle (excluding diagonal) of each block
- mask_upper = @(M) M(triu(true(size(M)), 1));
- sim_bef_bef = mask_upper(bef_bef);
- sim_bef_aft = bef_aft(:);
- sim_aft_aft = mask_upper(aft_aft);
- mean_bef_bef = mean(bef_bef);
- mean_bef_aft = mean(bef_aft);
- mean_aft_aft = mean(aft_aft);
- % Compute actual mean differences
- real_diff = mean(sim_bef_bef) - mean(sim_bef_aft);
- real_diff2 = mean(sim_aft_aft) - mean(sim_bef_aft);
- % Combine and prepare for permutation
- combined = [sim_bef_bef; sim_bef_aft];
- n_bef = length(sim_bef_bef);
- n_aft = length(sim_bef_aft);
- combined2 = [sim_aft_aft; sim_bef_aft];
- n_aa = length(sim_aft_aft);
- n_cross = length(sim_bef_aft);
- % Monte Carlo permutation test
- % n_perm = 1000;
- % perm_diffs = nan(n_perm, 1);
- % perm_diffs2 = nan(n_perm, 1);
- % for i = 1:n_perm
- % % Before-Before vs Before-After
- % perm = combined(randperm(length(combined)));
- % perm_diffs(i) = mean(perm(1:n_bef)) - mean(perm(n_bef+1:end));
- %
- % % After-After vs Before-After
- % perm2 = combined2(randperm(length(combined2)));
- % perm_diffs2(i) = mean(perm2(1:n_aa)) - mean(perm2(n_aa+1:end));
- % end
- %
- % % Calculate two-tailed p-values
- % p_val = mean(abs(perm_diffs) >= abs(real_diff));
- % p_val2 = mean(abs(perm_diffs2) >= abs(real_diff2));
- %
- % % Display results
- % fprintf('Monte Carlo p-value (Before-Before vs Before-After): %.4f\n', p_val);
- % fprintf('Monte Carlo p-value (After-After vs Before-After): %.4f\n', p_val2);
- % Plot null distributions
- % figure;
- % subplot(1,2,1);
- % histogram(perm_diffs, 30);
- % xline(real_diff, 'r', 'LineWidth', 2);
- % title('Null: Before-Before vs Before-After');
- % xlabel('\Delta Cosine Similarity'); ylabel('Count');
- %
- % subplot(1,2,2);
- % histogram(perm_diffs2, 30);
- % xline(real_diff2, 'r', 'LineWidth', 2);
- % title('Null: After-After vs Before-After');
- % xlabel('\Delta Cosine Similarity'); ylabel('Count');
- % % Add separation lines for before vs after
- % test_odor_idx = find(adjusted_time >= test_odor_time, 1);
- % hold on;
- % plot([test_odor_idx, test_odor_idx], ylim, 'k--', 'LineWidth', 1);
- % plot(xlim, [test_odor_idx, test_odor_idx], 'k--', 'LineWidth', 1);
- % hold off;
- % max_lag = 20;
- % cosine_sim_before = nan(length(before_idx), max_lag);
- % cosine_sim_after = nan(length(after_idx), max_lag);
- %
- % % Function to compute cosine similarity
- % cosine_sim = @(w1, w2) dot(w1, w2) / (norm(w1) * norm(w2));
- %
- % % Compute Cosine Similarity Before Odor
- % for t = 1:length(before_idx)
- % for lag = 1:max_lag
- % t_lag = t + lag;
- % if t_lag <= length(before_idx)
- % cosine_sim_before(t, lag) = cosine_sim(weights(before_idx(t), :), weights(before_idx(t_lag), :));
- % end
- % end
- % end
- %
- % % Compute Cosine Similarity After Odor
- % for t = 1:length(after_idx)
- % for lag = 1:max_lag
- % t_lag = t + lag;
- % if t_lag <= length(after_idx)
- % cosine_sim_after(t, lag) = cosine_sim(weights(after_idx(t), :), weights(after_idx(t_lag), :));
- % end
- % end
- % end
- % Plot results
- % figure;
- % subplot(1,2,1);
- % imagesc(1:max_lag, before_idx, cosine_sim_before);
- % colorbar;
- % xlabel('Lag (time bins)');
- % ylabel('Time (before odor onset)');
- % title('Cosine Similarity Before Test Odor');
- %
- % subplot(1,2,2);
- % imagesc(1:max_lag, after_idx, cosine_sim_after);
- % colorbar;
- % xlabel('Lag (time bins)');
- % ylabel('Time (after odor onset)');
- % title('Cosine Similarity After Test Odor');
- %
- % % Initialize matrix to store cosine similarity
- % cosine_sim_between = nan(length(before_idx), length(after_idx));
- %
- % % Function to compute cosine similarity
- % cosine_sim = @(w1, w2) dot(w1, w2) / (norm(w1) * norm(w2));
- %
- % % Compute cosine similarity between before and after odor onset
- % for be = 1:length(before_idx)
- % for af = 1:length(after_idx)
- % cosine_sim_between(be, af) = cosine_sim(weights(before_idx(be), :), weights(after_idx(af), :));
- % end
- % end
- %
- % % Plot heatmap of cosine similarity
- % figure;
- % imagesc(after_idx, before_idx, cosine_sim_between);
- % colorbar;
- % xlabel('Time (after odor onset)');
- % ylabel('Time (before odor onset)');
- % title('Cosine Similarity Between Before and After Odor');
- end % end loop over sessions
fitsvm8T_cos.m at commit 5e9d9ad, no license · at the source
Overview
- Mortimer B. Zuckerman Mind Brain Behavior Institute, Columbia University, New York, NY, USA
- Department of Neuroscience, Columbia University, New York, NY, USA
- Department of Biomedical Engineering, Columbia University, New York, NY, USA
- PhD Program in Computational Neuroscience, University of Chicago, Chicago, IL, USA
- The Kavli Institute for Brain Science, Columbia University, New York, NY, USA
- Nash Family Department of Neuroscience and Friedman Brain Institute, Icahn School of Medicine at Mount Sinai, New York, NY, USA
- Howard Hughes Medical Institute, Chevy Chase, MD, USA
- Grossman Center for the Statistics of the Mind, Columbia University, New York, NY, USA
- Lead contact
Abstract
Cognitive operations often require flexible implementation of stimulus-response contingencies, depending on context. We developed an olfactory task in which mice learned to associate a test odor with a directional lick response, conditional on a preceding context odor drawn from a different odor set. Two-photon imaging shows that the anterior lateral motor cortex (ALM) contains distinct populations encoding context, test odors, and choice. Optogenetic silencing during the context and delay periods impairs performance, suggesting that ALM contributes to configuring the appropriate contingency. Although context odors that instruct the same mapping are represented by separate populations, their influence converges at the level of choice-selective neurons. A subpopulation of these neurons exhibit dual selectivity for context and choice, forming what we term “contingency neurons.” These findings suggest that ALM supports flexible behavior not by abstracting over context cues but by dynamically reconfiguring local circuits to route sensory input to the appropriate motor output.
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 2 matches between paragraphs and lines of code.
Zenodo 19828551
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
- 27 September 2026: the link answers (HTTP 200)
4 files
- fitsvm8T.m, MATLAB, 146 lines
- fitsvm8T_cos.m, MATLAB, 420 lines
- image8T_master.m, MATLAB, 459 lines
- plt_pc3.m, MATLAB, 294 lines
asjessie/shadlen-lab
5e9d9ad46c52be5342924a38144ff5f59621566a, 27 April 2026Availability: 1 check, the latest on 27 September 2026: the link answers
- 27 September 2026: the link answers
4 files
- fitsvm8T.m, MATLAB, 146 lines
- fitsvm8T_cos.m, MATLAB, 420 lines, 2 matches
- image8T_master.m, MATLAB, 459 lines
- plt_pc3.m, MATLAB, 294 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;
- 8 scripts, each with its path and the digest of its content;
- 2 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
No dataset and no data link were found in the paper.
Data and code availability
All data reported in this paper will be shared by the lead contact upon request.
All original code has been deposited at GitHub/
Any additional information required to reanalyze the data reported in this paper is available from the lead contact upon request.
SUPPLEMENTAL INFORMATION
Supplemental information can be found online 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
- Publisher: n/a → Cell Press
Version 1, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 6 authors, 9 keywords, 9 MeSH terms, 9 funders, 35 references, 1 RRID.
Cite
This paper
Shen, J., Rungratsameetaweemana, N., Sharma, P., Peterka, D. S., Wu, H. Z., & Shadlen, M. N. (2026). Anterior lateral motor cortex enables contextual decision-making via dynamic reconfiguration of local circuits. Cell reports, 45(6), 117456. https://
BibTeX
@article{shen2026anterio
author = {Shen, Jia and Rungratsameetaweemana, Nuttida and Sharma, Prayshita and Peterka, Darcy S. and Wu, Herbert Zheng and Shadlen, Michael N.},
title = {{Anterior lateral motor cortex enables contextual decision-making via dynamic reconfiguration of local circuits}},
journal = {Cell reports},
year = {2026},
month = jun,
volume = {45},
number = {6},
pages = {117456},
publisher = {Cell Press},
issn = {2211-1247},
doi = {10.1016/
url = {https://
pmid = {42247294},
pmcid = {PMC13419430}
}
RIS
TY - JOUR
AU - Shen, Jia
AU - Rungratsameetaweemana, Nuttida
AU - Sharma, Prayshita
AU - Peterka, Darcy S.
AU - Wu, Herbert Zheng
AU - Shadlen, Michael N.
TI - Anterior lateral motor cortex enables contextual decision-making via dynamic reconfiguration of local circuits
T2 - Cell reports
J2 - Cell Rep
PY - 2026
DA - 2026/
VL - 45
IS - 6
SP - 117456
SN - 2211-1247
PB - Cell Press
DO - 10.1016/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1016/
"type": "article-journal",
"title": "Anterior lateral motor cortex enables contextual decision-making via dynamic reconfiguration of local circuits",
"container-title": "Cell reports",
"author": [
{
"family": "Shen",
"given": "Jia"
},
{
"family": "Rungratsameetaweemana",
"given": "Nuttida"
},
{
"family": "Sharma",
"given": "Prayshita"
},
{
"family": "Peterka",
"given": "Darcy S."
},
{
"family": "Wu",
"given": "Herbert Zheng"
},
{
"family": "Shadlen",
"given": "Michael N."
}
],
"container-title-short":
"volume": "45",
"issue": "6",
"page": "117456",
"DOI": "10.1016/
"PMID": "42247294",
"PMCID": "PMC13419430",
"ISSN": "2211-1247",
"publisher": "Cell Press",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
6,
4
]
]
}
}
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/s41467-026-73622-y [code]
- Contextual gating of whisker-evoked responses by frontal cortex supports flexible decision making.Journal: Nature communicationsIn common: Image Processing Toolbox, Statistics and Machine Learning Toolbox, mouse, 6 references
- [2] doi:10.1016/j.cell.2022.02.006 [code]
- A midbrain-thalamus-cortex
circuit reorganizes cortical dynamics to initiate movement. Journal: CellIn common: Image Processing Toolbox, Statistics and Machine Learning Toolbox, mouse, 6 references - [3] doi:10.1038/s41593-022-01171-w [code]
- Thalamus-driven functional populations in frontal cortex support decision-making.Journal: Nature neuroscienceIn common: Statistics and Machine Learning Toolbox, mouse, 7 references
- [4] doi:10.7554/elife.90859 [code]
- Direct observation of the neural computations underlying a single decision.Journal: eLifeIn common: shadedErrorBar, Statistics and Machine Learning Toolbox, 1 reference, author Michael N. Shadlen
- [5] doi:10.7554/elife.85442 [code]
- Cell type-specific connectome predicts distributed working memory activity in the mouse brain.Journal: eLifeIn common: mouse, 7 references
- [6] doi:10.1038/s41586-025-09805-2 [code]
- Building compositional tasks with shared neural subspaces.Journal: NatureIn common: shadedErrorBar, Image Processing Toolbox, Statistics and Machine Learning Toolbox, 4 references
- [7] doi:10.1371/journal.pbio.3001667 [code]
- Learning-related congruent and incongruent changes of excitation and inhibition in distinct cortical areas.Journal: PLoS biologyIn common: Image Processing Toolbox, Statistics and Machine Learning Toolbox, mouse, 5 references
- [8] doi:10.1038/s41586-024-07908-w [code]
- Brain-wide dynamics linking sensation to action during decision-making.Journal: NatureIn common: shadedErrorBar, Image Processing Toolbox, Statistics and Machine Learning Toolbox, mouse, 4 references
- [9] doi:10.7554/elife.109717 [code]
- Retrosplenial cortex enables context-dependent goal-directed sensorimotor transformation.Journal: eLifeIn common: Statistics and Machine Learning Toolbox, mouse, 6 references
- [10] doi:10.1038/s42003-024-06926-8 [code]
- Divergent subregional information processing in mouse prefrontal cortex during working memory.Journal: Communications biologyIn common: Statistics and Machine Learning Toolbox, mouse, 6 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: 2 repositories of the authors' code, each at its verified commit and with its license, 8 scripts, and 2 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:b13ab8aef6f77624…
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.1016/j.celrep.2026.117456)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.1016/j.celrep.2026.117456.svg
:target: https://openscicode.org/badge/doi/10.1016/j.celrep.2026.117456
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1016/j.celrep.2026.117456"><img src="https://openscicode.org/badge/doi/10.1016/j.celrep.2026.117456.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.
