OSCR

Spatial and network principles behind neural generation of locomotion.

Code ↔ Paper

3 matches between paragraphs of the paper and lines of its authors' code, computed by the harvester (lexical-v1). Click a colored paragraph or line to see its counterpart.

3 blocks of code here have a permanent identifier (oscr:b:…), listed with the matches below: citable for good, with a page of its own. Select a match and press Cite to copy it. What a block identifier is.

The 3 matches · 2 of them tie a paragraph to a whole file without given lines: weak matches, whose lines are not tinted
  1. [1] § Results › Emergent locomotor activity ↔ 02_HelperFunctions/PlotAnimatedNetworkEmgandPC.m, lines 1 to 92 · score 0.57 · biceps femoris, tibialis anterior, PC, vastus · block oscr:b:F65461XH4GQMV-4 · Report a mismatch
  2. [2] § Methods › Estimation of 2D spatial cell type distributions ↔ 00_SpinalNetworkModel/@Network/GetGenesDiffExpSingleCell.m, the whole file · a weak match · score 0.56 · log fold change, genetic, cell, populations, model · block oscr:b:RN9WHGZV43R7T-W · Report a mismatch
  3. [3] § Methods › Estimation of 2D spatial cell type distributions ↔ 00_SpinalNetworkModel/@Network/GetNeuronsInDiffGeneExpSingleCell.m, the whole file · a weak match · score 0.56 · log fold change, genetic, cell, populations, model · block oscr:b:5HPCBTDR1WNAV-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 · 289 lines · 9.7 KB · CC0-1.0 · 1 match

  1. function PlotAnimatedNetworkEmgandPC(N,varargin)
  2. screensize = get(groot,'ScreenSize');
  3. Save = 0;
  4. W = N.ConnMat;
  5. Save = 0;
  6. RS = 1;
  7. VA =[-130,50];
  8. EPos = nan;
  9. CC = nan;
  10. trail = 300;
  11. noiselevel= 0.2;
  12. pad = 750;
  13. srt = 1;
  14. M = 10 ;
  15. P = 0:size(N.Rates,2)-1;
  16. Proj = 0;
  17. Source = true(1,size(N.Rates,2));
  18. UoI = true(1,size(N.ConnMat,1));
  19. Moi = categorical({'Iliopsoas','Quadriceps','Vastus Lateralis','Biceps Femoris','Tibialis Anterior','Gastrocnemius'});
  20. for ii = 1:2:length(varargin)
  21. switch varargin{ii}
  22. case 'SavePath'
  23. SavePath = varargin{ii+1};
  24. Save = 1;
  25. case 'SaveName'
  26. Name = varargin{ii+1};
  27. case 'MN'
  28. Moi = categorical(varargin{ii+1})';
  29. case 'sort'
  30. srt = varargin{ii+1};
  31. case 'UoI'
  32. UoI = varargin{ii+1};
  33. case 'ElectrodePos'
  34. EPos =varargin{ii+1};
  35. case 'Cluster_chan'
  36. CC = varargin{ii+1};
  37. case 'Source'
  38. Source = varargin{ii+1};
  39. case 'Project'
  40. Proj = varargin{ii+1};
  41. end
  42. end
  43. if (Save)
  44. if ~exist(SavePath, 'dir')
  45. mkdir(SavePath)
  46. end
  47. v = VideoWriter([SavePath '/ ' Name],"MPEG-4");
  48. v.FrameRate = 30;
  49. v.Quality = 60;
  50. open(v);
  51. end
  52. if(isempty(N.EstimatedRates))
  53. N.ComputeEstimatedRates;
  54. end
  55. if(isempty(N.PC))
  56. N.ComputePC('Estimated',1,'Source',Source);
  57. end
  58. DorPop = unique(N.Types(N.Layers == 'DRG'|N.Layers == '1Sp'| N.Layers == '2Sp0' | N.Layers == '2SpI' | N.Layers == '3Sp' | N.Layers == '4Sp'),'sorted');
  59. VentrPop = unique(N.Types(N.Layers == '5Spm'|N.Layers == '5SpL'| N.Layers == '6SpM' | N.Layers == '6SL' | N.Layers == '7Sp' | N.Layers == '8Sp' | N.Layers == 'D' | N.Layers == '10Sp' | N.Layers == 'Ps9'),'sorted');
  60. MN = unique(N.MnID(~isundefined(N.MnID)));
  61. cmapdorsal = fliplr(autumn(length(DorPop)));
  62. cmapventralex = flipud(cool(length(VentrPop)));
  63. cmapventralin = cool(length(VentrPop));
  64. cmapmn = sky(length(MN));
  65. C = zeros(size(N.ConnMat,1),3);
  66. for T = 1:length(DorPop)
  67. whr = N.Types == DorPop(T);
  68. C(whr,:) = repmat(cmapdorsal(T,:),[nnz(whr),1]);
  69. end
  70. for T = 1:length(VentrPop)
  71. whr = N.Types == VentrPop(T);
  72. if(mean(N.Transmit(whr)) < 0)
  73. C(whr,:) = repmat(cmapventralin(T,:),[nnz(whr),1]);
  74. else
  75. C(whr,:) = repmat(cmapventralex(T,:),[nnz(whr),1]);
  76. end
  77. end
  78. for T = 1:length(MN)
  79. whr = N.MnID == MN(T);
  80. C(whr,:) = repmat(cmapmn(T,:),[nnz(whr),1]);
  81. end
  82. %% Compute EMG signal
  83. jj = 1;
  84. EMG = [];
  85. MoI = categorical();
  86. Col = [];
  87. for ii = fliplr(Moi)
  88. ix = N.MnID==ii & N.Latera > 0;
  89. if(~nnz(ix))
  90. continue
  91. end
  92. MoI(jj) = ii;
  93. Col(jj,:) = mean(C(ix,:),1);
  94. prob = sum(N.Rates(:,ix),2);
  95. sig = randn(size(prob))*noiselevel.*binornd(1,normcdf(normalize(prob,'zscore')));
  96. sig = sig.*prob/5 + (randn(size(prob))*noiselevel) ;
  97. EMG(:,jj) = [(randn(1,pad)*noiselevel) (sig*noiselevel)'] + 10*jj;
  98. jj = jj+1;
  99. end
  100. %% Compute Raster
  101. if(srt)
  102. ix = ComputeFiringPhaseSorting(N.Rates(Source,:));
  103. else
  104. [~,ix] = sort(N.Position(:,3));
  105. end
  106. UoI = UoI(ix);
  107. RI = N.Rates(1:end,ix);
  108. RIsp = ((RI-min(RI,[],1)));
  109. RIsp = RIsp./(max(RIsp,[],1));
  110. Poiss = poissrnd(RIsp/40,size(RIsp));
  111. SpikeTrain = [zeros(pad,size(Poiss,2)); logical(Poiss)];
  112. Rates = GetGaussianFiring(SpikeTrain,50,1000);
  113. RatesS = Rates(pad+1:end,:);
  114. RatesS(RatesS==0) = nan;
  115. SpikeTrain = SpikeTrain(:,UoI);
  116. location = N.Position(ix,:);
  117. if(any(~isnan(CC),"all")&&any(~isnan(EPos),"all")&&Proj)
  118. CC = CC(ix);
  119. location = [EPos(CC,1) EPos(CC,2) EPos(CC,3)];
  120. end
  121. if(Proj)
  122. UoIp = UoI;
  123. else
  124. UoIp = true(1,size(N.ConnMat,1));
  125. end
  126. %% Compute online gain
  127. L = round(range(N.Position(:,2)),-2);
  128. edges = [-L:250:L];
  129. tau_V = ones(size(N.ConnMat,1),1)*50;% Slower Excitation
  130. tau_V(sum(N.ConnMat,1) < 0 & ~(N.Types=='MN')',:) = 25; % Faster Inhibition
  131. g = abs(diff(movmean(RatesS,10,1),1,1));
  132. g = movmean(g,500,1);
  133. g = flipud(movmean(flipud(g),500,1));
  134. g = (100./tau_V').*g;
  135. ConnMat= N.ConnMat;
  136. ConnMatIpsiOr(N.Latera < 0,N.Latera > 0) = 0;
  137. ConnMatIpsiOr(N.Latera > 0,N.Latera < 0) = 0;
  138. ConnMatContraOr = N.ConnMat;
  139. ConnMatContraOr(N.Latera > 0,N.Latera > 0) = 0;
  140. ConnMatContraOr(N.Latera < 0,N.Latera < 0) = 0;
  141. %%
  142. fig = figure(Color=Colors().BergBlack,Position=screensize);
  143. %% Define Ax1
  144. ax1 = subplot(3,3,[1 2 4 5 7 8]); % For the 3D
  145. axis off equal tight
  146. box on
  147. view(VA(1),VA(2))
  148. hold on
  149. %% Define Ax2
  150. ax2 = subplot(3,3,3); % For the PC
  151. axis off equal
  152. box off
  153. set(ax2,'Color','none')
  154. xlim([min(N.PC(:,1)) max(N.PC(:,1))]);
  155. ylim([min(N.PC(:,2)) max(N.PC(:,2))]);
  156. zlim([min(N.PC(:,3)) max(N.PC(:,3))]);
  157. view(-20,-30)
  158. hold on
  159. plot3(ax2,[ax2.XLim(1) ax2.XLim(1)],[ax2.YLim(1) ax2.YLim(1)],[ax2.ZLim]-(ax2.ZLim(1)),'Color',Colors().BergWhite,'LineWidth',2);
  160. plot3(ax2,[ax2.XLim(1) ax2.XLim(1)],[ax2.YLim],[0 0],'Color',Colors().BergWhite,'LineWidth',2);
  161. plot3(ax2,[ax2.XLim],[ax2.YLim(1) ax2.YLim(1)],[0 0],'Color',Colors().BergWhite,'LineWidth',2);
  162. title('PCA','FontSize',20,'FontWeight','bold','Color',Colors().BergWhite)
  163. %% Definee Ax4
  164. ax4 = subplot(3,3,6); % For the EMG
  165. axis on square
  166. set(ax4,'Color','none')
  167. set(ax4,'YColor',Colors().BergWhite)
  168. box on
  169. hold on
  170. xlim([0 2*pad]);
  171. ylim([-15 nnz(UoI)+15]);
  172. plot(ax4,[pad pad],ax4.YLim,'Color',Colors().BergWhite,'LineWidth',2);
  173. jj = 1;
  174. yticks([]);
  175. title('Raster','FontSize',20,'FontWeight','bold','Color',Colors().BergWhite)
  176. %% Definee Ax3
  177. ax3 = subplot(3,3,9); % For the EMG
  178. axis on square
  179. set(ax3,'Color','none')
  180. set(ax3,'YColor',Colors().BergWhite)
  181. box on
  182. hold on
  183. xlim([0 1500]);
  184. ylim([-15 10*size(EMG,2)+15]);
  185. plot(ax3,[750 750],ax3.YLim,'Color',Colors().BergWhite,'LineWidth',2);
  186. jj = 1;
  187. yticks([1:length(MoI)]*10);
  188. yticklabels(MoI);
  189. title('EMG','FontSize',20,'FontWeight','bold','Color',Colors().BergWhite)
  190. % %% Define Ax5
  191. % ax5 = subplot(3,3,7);
  192. % xlim([-L L])
  193. % ylim([-300 300])
  194. % axis off
  195. % hold on
  196. % %% Define Ax6
  197. % ax6 = subplot(3,3,8);
  198. % axis off
  199. % hold on
  200. % linkaxes([ax5 ax6]);
  201. %%
  202. if(~isnan(EPos))
  203. scatter3(ax1,EPos(:,1),EPos(:,2),EPos(:,3),20,'Marker','square','MarkerEdgeColor',Colors().BergWhite,'MarkerFaceColor',Colors().BergGray05,'MarkerFaceAlpha',0.4,'LineWidth',0.01,'MarkerEdgeAlpha',0.4);
  204. hold on
  205. end
  206. scatter3(ax1,N.Geometry.Position(N.Geometry.Type=="WM",1),N.Geometry.Position(N.Geometry.Type=="WM",2),N.Geometry.Position(N.Geometry.Type=="WM",3),'filled','MarkerFaceAlpha',0.05,'MarkerEdgeColor','none','MarkerFaceColor',Colors().BergGray02);
  207. for nn = 1:5
  208. for ii = 1:33:size(RatesS,1)
  209. f1 = scatter3(ax1,location(UoIp,1),location(UoIp,2),location(UoIp,3),2*RatesS(ii,UoIp),C(UoIp,:),'filled','MarkerFaceAlpha',0.75);
  210. f2 = plot3(ax2,N.PC(max(1,ii-trail):ii,1),N.PC(max(1,ii-trail):ii,2),N.PC(max(1,ii-trail):ii,3),'LineWidth',4,'Color',sky(1));
  211. f3 = plot(ax3,circshift(EMG,-ii));
  212. ConnMatIspi = g(ii,:).*ConnMatIpsiOr;
  213. % ConnMatContra = g(ii,:).*ConnMatContraOr;
  214. % diffipsi = GeneratePlot(N,ConnMatIspi,edges);
  215. % diffcontra= GeneratePlot(N,ConnMatContra,edges);
  216. % p1 = plot(ax5,edges(1:end-1),diffipsi,'Color',[Colors().BergWhite 0.2],'LineWidth',2);
  217. % p2 = plot(ax6,edges(1:end-1),diffcontra,'Color',[Colors().BergWhite 0.2],'LineWidth',2);
  218. if(~isempty(Col))
  219. colororder(ax3,Col);
  220. end
  221. ST = circshift(SpikeTrain,-ii)';
  222. [ri,ci] = find(ST(:,1:2*pad));
  223. f4 = scatter(ax4,ci,ri,M,'MarkerFaceColor',Colors().BergGray02,'MarkerFaceAlpha',0.9,'MarkerEdgeColor','none');
  224. drawnow;
  225. if(Save)
  226. f = getframe(fig);
  227. writeVideo(v,f);
  228. else
  229. pause(0.033/RS);
  230. end
  231. delete(f1);
  232. delete(f2);
  233. delete(f3);
  234. delete(f4);
  235. % delete(p1);
  236. % delete(p2);
  237. end
  238. end
  239. if(Save)
  240. f = getframe(fig);
  241. writeVideo(v,f);
  242. close(v)
  243. end
  244. end
  245. function difference = GeneratePlot(N,ConnMat,edges)
  246. Ex = N.Transmit > 0;
  247. In = N.Transmit < 0;
  248. Dist = bsxfun(@minus,N.Position(:,2),N.Position(:,2)');
  249. ProjEx = ConnMat(:,Ex);
  250. ProjIn = ConnMat(:,In);
  251. DistEx = Dist(:,Ex);
  252. DistIn = Dist(:,In);
  253. yin = discretize(DistIn(ProjIn~= 0), edges);
  254. yex = discretize(DistEx(ProjEx~= 0), edges);
  255. [GnIn,Min,Cin] = grpstats(ProjIn(ProjIn~=0), yin,["gname","mean","numel"]);
  256. [GnEx,Mex,Cex] = grpstats(ProjEx(ProjEx~=0), yex,["gname","mean","numel"]);
  257. MInZ = zeros(length(edges)-1,1);
  258. MExZ = zeros(length(edges)-1,1);
  259. CInZ = zeros(length(edges)-1,1);
  260. CExZ = zeros(length(edges)-1,1);
  261. MInZ(str2double(GnIn)) = Min;
  262. MExZ(str2double(GnEx)) = Mex;
  263. CInZ(str2double(GnIn)) = Cin;
  264. CExZ(str2double(GnEx)) = Cex;
  265. difference = abs(MExZ.*CExZ)-abs(MInZ.*CInZ);
  266. end

PlotAnimatedNetworkEmgandPC.m at commit 0f04204, under CC0-1.0 · at the source

Overview

Authors: Salif Komi1, August Winther1, Grace A Houser1, Thomas Topilko1, RJF Sørensen1, Silas Dalum Larsen1, Madelaine C Adamsson Bonfils1, Guanghui Li1, Rune W Berg1
  1. Department of Neuroscience, Faculty of Health and Medical Sciences, University of Copenhagen, Copenhagen, Denmark
Institutions: University of Copenhagen (Denmark)
Journal: Nature communications, volume 17, issue 1, article 7525
Dates: received 10 July 2025; accepted 28 May 2026; published online 15 June 2026
Type: Research article · Language: English
License: CC BY-NC-ND
Identifiers: DOI 10.1038/s41467-026-74228-0 · PMID 42297824 · PMCID PMC13408478 · OpenAlex W4403118810
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: genetics / omics (modality), mouse (organism), cellular / molecular (subfield)
Methods: Smoothing, state filtering, decompositions, Connectivity, Evoked potentials, Single-unit activity, calcium imaging, Machine learning
Keywords: Spinal cord, Network models
MeSH: Locomotion*, Nerve Net*, Spinal Cord*, Animals, Mice, Models, Neurological, Motor Neurons, Neurons, Synapses (* major topic)
Topic: Neural Networks and Applications (Artificial Intelligence, Computer Science), according to OpenAlex
Funding: Novo Nordisk Fonden (NNF23OC0082192); Lundbeckfonden (Lundbeck Foundation) (R366-2021-233); Swiss National Science Foundation (SNF Postdoc.Mobility P500PB_206824, 206824)
Citations: cited by 2 papers (Europe PMC); 94 references in the paper

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 3 matches between paragraphs and lines of code.

albert597/TRAILMAP

License: MIT
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Commit: f1349df9e929be6d7d90f6fc2a2ecfbaff4f7347, 18 June 2026
Languages: Python (14)
Size: 371 files, 14 scripts
Software Heritage: not archived
Found in: the text, “Whole-spinal-cord segmentation of neuronal proje”
Holds: README, license file
Not found: CITATION.cff, environment file, tests, continuous integration, documentation
Tools: NumPy (4 files), Keras (3 files), OpenCV (3 files), TensorFlow (3 files), Pillow (2 files)
Availability: 1 check, the latest on 27 September 2026: the link answers
  • 27 September 2026: the link answers
16 files

BergLab/SpinalProjectome

License: CC0-1.0
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Commit: 0f042045ee2f6d93bbe482127ce2263ada07443f, 24 July 2025
Languages: MATLAB (60)
Size: 103 files, 60 scripts
Software Heritage: not archived
Found in: “Code availability”
Holds: README, license file
Not found: CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 27 September 2026: the link answers
  • 27 September 2026: the link answers
62 files

codeocean:9317742

License: none: the authors keep all their rights
State: cannot be verified, verified on 27 September 2026
Evidence: found in the paper
Software Heritage: not checked
Found in: “Code availability”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 27 September 2026: cannot be verified
  • 27 September 2026: cannot be verified
At the source:

Code availability statement

The paper has a code availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:

  • it points to the authors' code: codeocean:9317742, BergLab/SpinalProjectome
  • it says that the code is available on request

Read it in the paper: doi.org/10.1038/s41467-026-74228-0.

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:

  • 3 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 74 scripts, each with its path and the digest of its content;
  • 3 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

Data availability statement

The paper has a data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:

  • it says that the data are available on request

Read it in the paper: doi.org/10.1038/s41467-026-74228-0.

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, 27 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 9 authors, 2 keywords, 9 MeSH terms, 3 funders, 85 references.

Cite

This paper

Komi, S., Winther, A., Houser, G. A., Topilko, T., Sørensen, R., Larsen, S. D., Bonfils, M. C. A., Li, G., & Berg, R. W. (2026). Spatial and network principles behind neural generation of locomotion. Nature communications, 17(1), 7525. https://doi.org/10.1038/s41467-026-74228-0

BibTeX

@article{komi2026spatial,
author = {Komi, Salif and Winther, August and Houser, Grace A and Topilko, Thomas and Sørensen, RJF and Larsen, Silas Dalum and Bonfils, Madelaine C Adamsson and Li, Guanghui and Berg, Rune W},
title = {{Spatial and network principles behind neural generation of locomotion}},
journal = {Nature communications},
year = {2026},
month = jun,
volume = {17},
number = {1},
pages = {7525},
publisher = {Nature Portfolio},
issn = {2041-1723},
doi = {10.1038/s41467-026-74228-0},
url = {https://doi.org/10.1038/s41467-026-74228-0},
pmid = {42297824},
pmcid = {PMC13408478}
}

RIS

TY - JOUR
AU - Komi, Salif
AU - Winther, August
AU - Houser, Grace A
AU - Topilko, Thomas
AU - Sørensen, RJF
AU - Larsen, Silas Dalum
AU - Bonfils, Madelaine C Adamsson
AU - Li, Guanghui
AU - Berg, Rune W
TI - Spatial and network principles behind neural generation of locomotion
T2 - Nature communications
J2 - Nat Commun
PY - 2026
DA - 2026/06/15
VL - 17
IS - 1
SP - 7525
SN - 2041-1723
PB - Nature Portfolio
DO - 10.1038/s41467-026-74228-0
UR - https://doi.org/10.1038/s41467-026-74228-0
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s41467-026-74228-0",
"type": "article-journal",
"title": "Spatial and network principles behind neural generation of locomotion",
"container-title": "Nature communications",
"author": [
{
"family": "Komi",
"given": "Salif"
},
{
"family": "Winther",
"given": "August"
},
{
"family": "Houser",
"given": "Grace A"
},
{
"family": "Topilko",
"given": "Thomas"
},
{
"family": "Sørensen",
"given": "RJF"
},
{
"family": "Larsen",
"given": "Silas Dalum"
},
{
"family": "Bonfils",
"given": "Madelaine C Adamsson"
},
{
"family": "Li",
"given": "Guanghui"
},
{
"family": "Berg",
"given": "Rune W"
}
],
"container-title-short": "Nat Commun",
"volume": "17",
"issue": "1",
"page": "7525",
"DOI": "10.1038/s41467-026-74228-0",
"PMID": "42297824",
"PMCID": "PMC13408478",
"ISSN": "2041-1723",
"publisher": "Nature Portfolio",
"URL": "https://doi.org/10.1038/s41467-026-74228-0",
"language": "en",
"issued": {
"date-parts": [
[
2026,
6,
15
]
]
}
}

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.21203/rs.3.rs-9914946/v1 [code]
Neural manifolds in spinal networks that orchestrate walking and stopping
Journal: Research Square (preprint)
In common: Signal Processing Toolbox, Statistics and Machine Learning Toolbox, 11 references, 3 authors
[2] doi:10.1101/2025.11.08.687367 [code]
Neural manifolds that orchestrate walking and stopping
Journal: bioRxiv (preprint)
In common: Signal Processing Toolbox, Statistics and Machine Learning Toolbox, 13 references, 2 authors
[3] doi:10.1038/s41467-026-76522-3 [code]
Transcriptomic analysis of spinal V1 interneurons informs their multifunctional role in motor output.
Journal: Nature communications
In common: NumPy, genetics / omics, mouse, cellular / molecular, 19 references
[4] doi:10.1016/j.celrep.2025.115845 [code]
The spinal premotor network driving scratching flexor and extensor alternation.
Journal: Cell reports
In common: NumPy, mouse, 18 references
[5] doi:10.1523/jneurosci.1607-23.2024
Excitatory Spinal Lhx9-Derived Interneurons Modulate Locomotor Frequency in Mice.
Journal: The Journal of neuroscience : the official journal of the Society for Neuroscience
In common: mouse, 17 references
[6] doi:10.7554/elife.73424 [code]
The role of V3 neurons in speed-dependent interlimb coordination during locomotion in mice.
Journal: eLife
In common: mouse, 15 references
[7] doi:10.3389/fnhum.2021.719388 [code]
Why Firing Rate Distributions Are Important for Understanding Spinal Central Pattern Generators.
Journal: Frontiers in human neuroscience
In common: 11 references, author Rune W. Berg
[8] doi:10.1038/s41467-023-36587-w
Deconstructing the modular organization and real-time dynamics of mammalian spinal locomotor networks.
Journal: Nature communications
In common: mouse, 13 references
[9] doi:10.1038/s41586-022-05385-7 [code]
The neurons that restore walking after paralysis.
Journal: Nature
In common: NCBI GEO GSE184370, genetics / omics, mouse, 6 references, author Salif Komi
[10] doi:10.1126/sciadv.adk3229 [code]
Spinal inhibitory neurons degenerate before motor neurons and excitatory neurons in a mouse model of ALS.
Journal: Science advances
In common: mouse, 12 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.

Add the badge to the code's README

OSCR: the badge of this paper

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 -->
[![OSCR](https://openscicode.org/badge/doi/10.1038/s41467-026-74228-0.svg)](https://openscicode.org/badge/doi/10.1038/s41467-026-74228-0)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

.. image:: https://openscicode.org/badge/doi/10.1038/s41467-026-74228-0.svg
   :target: https://openscicode.org/badge/doi/10.1038/s41467-026-74228-0
   :alt: OSCR

.. oscr-badge:end
HTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1038/s41467-026-74228-0"><img src="https://openscicode.org/badge/doi/10.1038/s41467-026-74228-0.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.