OSCR

Parvalbumin-positive neurons in the medial septum participate in the formation of hippocampal-dependent spatial memory.

Code ↔ Paper

6 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.

The 6 matches · 1 of them tie a paragraph to a whole file without given lines: a weak match, whose lines are not tinted
  1. [1] § Methods › In vivo electrophysiology › LFP analysis ↔ Coherence.m, lines 26 to 60 · score 0.84 · 12–30 Hz, 4–12 Hz, 30–50 Hz, 50–100 Hz, 1–4 Hz, PSD · Report a mismatch
  2. [2] § Methods › In vivo electrophysiology › LFP analysis ↔ getPSD.m, the whole file · a weak match · score 0.75 · 30–50 Hz, 50–100 Hz, beta, mtspectrumsegc, 1–4 Hz, delta · Report a mismatch
  3. [3] § Methods › In vivo electrophysiology › LFP analysis ↔ FindRipples.m, lines 1 to 45 · score 0.70 · peak normalized power, standard deviations, discarded, intervals, ripple, band · Report a mismatch
  4. [4] § Methods › In vivo electrophysiology › Testing optogenetic response ↔ optotagging_forpv.m, lines 11 to 69 · score 0.65 · peak half height, Zeta, onset, stimulation, crossing, tagging · Report a mismatch
  5. [5] § Methods › In vivo electrophysiology › Data acquisition and processing ↔ FindRipples.m, lines 1 to 45 · score 0.55 · standard deviations, Hz, noise, signals, filter, thresholding · Report a mismatch
  6. [6] § Results › Enhanced MS PV+ neuronal firing during object exploration ↔ optotagging_forpv.m, lines 11 to 69 · score 0.53 · peak half height, row, Raster, stimulus, median, traces · 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 · 322 lines · 11 KB · no license · 2 matches

  1. function [ripples,sd,bad] = FindRipples(filtered,varargin)
  2. %FindRipples - Find hippocampal ripples (100~200Hz oscillations).
  3. %
  4. % USAGE
  5. %
  6. % [ripples,stdev,noise] = FindRipples(filtered,<options>)
  7. %
  8. % Ripples are detected using the normalized squared signal (NSS) by
  9. % thresholding the baseline, merging neighboring events, thresholding
  10. % the peaks, and discarding events with excessive duration.
  11. % Thresholds are computed as multiples of the standard deviation of
  12. % the NSS. Alternatively, one can use explicit values, typically obtained
  13. % from a previous call.
  14. %
  15. % filtered ripple-band filtered LFP (one channel).
  16. % <options> optional list of property-value pairs (see table below)
  17. %
  18. % =========================================================================
  19. % Properties Values
  20. % -------------------------------------------------------------------------
  21. % 'thresholds' thresholds for ripple beginning/end and peak, in multiples
  22. % of the stdev (default = [2 5])
  23. % 'durations' min inter-ripple interval, max ripple duration and min ripple duration, in ms
  24. % (default = [30 100 20])
  25. % 'baseline' interval used to compute normalization (default = all)
  26. % 'restrict' same as 'baseline' (for backwards compatibility)
  27. % 'frequency' sampling rate (in Hz) (default = 1250Hz)
  28. % 'stdev' reuse previously computed stdev
  29. % 'show' plot results (default = 'off')
  30. % 'noise' noisy ripple-band filtered channel used to exclude ripple-
  31. % like noise (events also present on this channel are
  32. % discarded)
  33. % =========================================================================
  34. %
  35. % OUTPUT
  36. %
  37. % ripples for each ripple, [start_t peak_t end_t peakNormalizedPower]
  38. % stdev standard deviation of the NSS (can be reused subsequently)
  39. % noise ripple-like activity recorded simultaneously on the noise
  40. % channel (for debugging info)
  41. %
  42. % SEE
  43. %
  44. % See also FilterLFP, RippleStats, SaveRippleEvents, PlotRippleStats.
  45. % Copyright (C) 2004-2011 by Michaël Zugaro, initial algorithm by Hajime Hirase
  46. %
  47. % This program is free software; you can redistribute it and/or modify
  48. % it under the terms of the GNU General Public License as published by
  49. % the Free Software Foundation; either version 3 of the License, or
  50. % (at your option) any later version.
  51. % Default values
  52. frequency = 1250;
  53. show = 'off';
  54. restrict = [];
  55. sd = [];
  56. stdev=1
  57. lowThresholdFactor = 2; % Ripple envoloppe must exceed lowThresholdFactor*stdev
  58. highThresholdFactor = 5; % Ripple peak must exceed highThresholdFactor*stdev
  59. minInterRippleInterval = 30; % in ms
  60. maxRippleDuration = 100; % in ms
  61. minRippleDuration = 20; % in ms
  62. noise = [];
  63. % Check number of parameters
  64. if nargin < 1 | mod(length(varargin),2) ~= 0,
  65. error('Incorrect number of parameters (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  66. end
  67. % Check parameter sizes
  68. if ~isdmatrix(filtered) | size(filtered,2) ~= 2,
  69. error('Parameter ''filtered'' is not a Nx2 matrix (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  70. end
  71. % Parse parameter list
  72. for i = 1:2:length(varargin),
  73. if ~ischar(varargin{i}),
  74. error(['Parameter ' num2str(i+2) ' is not a property (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).']);
  75. end
  76. switch(lower(varargin{i})),
  77. case 'thresholds',
  78. thresholds = varargin{i+1};
  79. if ~isivector(thresholds,'#2','>0'),
  80. error('Incorrect value for property ''thresholds'' (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  81. end
  82. lowThresholdFactor = thresholds(1);
  83. highThresholdFactor = thresholds(2);
  84. case 'durations',
  85. durations = varargin{i+1};
  86. if ~isivector(durations,'#3','>0'),
  87. error('Incorrect value for property ''durations'' (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  88. end
  89. minInterRippleInterval = durations(1);
  90. maxRippleDuration = durations(2);
  91. minRippleDuration = durations(3);
  92. case 'frequency',
  93. frequency = varargin{i+1};
  94. if ~isdscalar(frequency,'>0'),
  95. error('Incorrect value for property ''frequency'' (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  96. end
  97. case 'show',
  98. show = varargin{i+1};
  99. if ~isstring(show,'on','off'),
  100. error('Incorrect value for property ''show'' (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  101. end
  102. case {'baseline','restrict'},
  103. restrict = varargin{i+1};
  104. if ~isempty(restrict) & ~isdvector(restrict,'#2','<'),
  105. error('Incorrect value for property ''restrict'' (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  106. end
  107. case 'stdev',
  108. sd = varargin{i+1};
  109. if ~isdscalar(sd,'>0'),
  110. error('Incorrect value for property ''stdev'' (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  111. end
  112. case 'noise',
  113. noise = varargin{i+1};
  114. if ~isdmatrix(noise) | size(noise,1) ~= size(filtered,1) | size(noise,2) ~= 2,
  115. error('Incorrect value for property ''noise'' (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).');
  116. end
  117. otherwise,
  118. error(['Unknown property ''' num2str(varargin{i}) ''' (type ''help <a href="matlab:help FindRipples">FindRipples</a>'' for details).']);
  119. end
  120. end
  121. % Parameters
  122. windowLength = round(frequency/1250*11);
  123. % Square and normalize signal
  124. signal = filtered(:,2);
  125. squaredSignal = signal.^2;
  126. window = ones(windowLength,1)/windowLength;
  127. keep = [];
  128. if ~isempty(restrict),
  129. keep = filtered(:,1)>=restrict(1)&filtered(:,1)<=restrict(2);
  130. end
  131. [normalizedSquaredSignal,sd] = unity(Filter0(window,sum(squaredSignal,2)),sd,keep);
  132. % Detect ripple periods by thresholding normalized squared signal
  133. thresholded = normalizedSquaredSignal > lowThresholdFactor;
  134. start = find(diff(thresholded)>0);
  135. stop = find(diff(thresholded)<0);
  136. % Exclude last ripple if it is incomplete
  137. if length(stop) == length(start)-1,
  138. start = start(1:end-1);
  139. end
  140. % Exclude first ripple if it is incomplete
  141. if length(stop)-1 == length(start),
  142. stop = stop(2:end);
  143. end
  144. % Correct special case when both first and last ripples are incomplete
  145. if start(1) > stop(1),
  146. stop(1) = [];
  147. start(end) = [];
  148. end
  149. firstPass = [start,stop];
  150. if isempty(firstPass),
  151. disp('Detection by thresholding failed');
  152. return
  153. else
  154. disp(['After detection by thresholding: ' num2str(length(firstPass)) ' events.']);
  155. end
  156. % Merge ripples if inter-ripple period is too short
  157. minInterRippleSamples = minInterRippleInterval/1000*frequency;
  158. secondPass = [];
  159. ripple = firstPass(1,:);
  160. for i = 2:size(firstPass,1)
  161. if firstPass(i,1) - ripple(2) < minInterRippleSamples,
  162. % Merge
  163. ripple = [ripple(1) firstPass(i,2)];
  164. else
  165. secondPass = [secondPass ; ripple];
  166. ripple = firstPass(i,:);
  167. end
  168. end
  169. secondPass = [secondPass ; ripple];
  170. if isempty(secondPass),
  171. disp('Ripple merge failed');
  172. return
  173. else
  174. disp(['After ripple merge: ' num2str(length(secondPass)) ' events.']);
  175. end
  176. % Discard ripples with a peak power < highThresholdFactor
  177. thirdPass = [];
  178. peakNormalizedPower = [];
  179. for i = 1:size(secondPass,1)
  180. [maxValue,maxIndex] = max(normalizedSquaredSignal([secondPass(i,1):secondPass(i,2)]));
  181. if maxValue > highThresholdFactor,
  182. thirdPass = [thirdPass ; secondPass(i,:)];
  183. peakNormalizedPower = [peakNormalizedPower ; maxValue];
  184. end
  185. end
  186. if isempty(thirdPass),
  187. disp('Peak thresholding failed.');
  188. return
  189. else
  190. disp(['After peak thresholding: ' num2str(length(thirdPass)) ' events.']);
  191. end
  192. % Detect negative peak position for each ripple
  193. peakPosition = zeros(size(thirdPass,1),1);
  194. for i=1:size(thirdPass,1),
  195. [minValue,minIndex] = min(signal(thirdPass(i,1):thirdPass(i,2)));
  196. peakPosition(i) = minIndex + thirdPass(i,1) - 1;
  197. end
  198. % Discard ripples that are way too long
  199. time = filtered(:,1);
  200. ripples = [time(thirdPass(:,1)) time(peakPosition) time(thirdPass(:,2)) peakNormalizedPower];
  201. duration = ripples(:,3)-ripples(:,1);
  202. ripples(duration>maxRippleDuration/1000,:) = [];
  203. disp(['After max duration test: ' num2str(size(ripples,1)) ' events.']);
  204. %Discard ripples that are way too short
  205. duration = ripples(:,3)-ripples(:,1);
  206. ripples(duration<minRippleDuration/1000,:) = [];
  207. disp(['After min duration test: ' num2str(size(ripples,1)) ' events.']);
  208. % If a noisy channel was provided, find ripple-like events and exclude them
  209. bad = [];
  210. if ~isempty(noise),
  211. % Square and pseudo-normalize (divide by signal stdev) noise
  212. squaredNoise = noise(:,2).^2;
  213. window = ones(windowLength,1)/windowLength;
  214. normalizedSquaredNoise = unity(Filter0(window,sum(squaredNoise,2)),sd,[]);
  215. excluded = logical(zeros(size(ripples,1),1));
  216. % Exclude ripples when concomittent noise crosses high detection threshold
  217. previous = 1;
  218. for i = 1:size(ripples,1),
  219. j = FindInInterval(noise,[ripples(i,1),ripples(i,3)],previous);
  220. previous = j(2);
  221. if any(normalizedSquaredNoise(j(1):j(2))>(highThresholdFactor)), %Changed to highThresholdFactor-2 to increase sensitivity of noise channel
  222. excluded(i) = 1;
  223. end
  224. end
  225. bad = ripples(excluded,:);
  226. ripples = ripples(~excluded,:);
  227. disp(['After noise removal: ' num2str(size(ripples,1)) ' events.']);
  228. end
  229. % Optionally, plot results
  230. if strcmp(show,'on'),
  231. figure;
  232. if ~isempty(noise),
  233. MultiPlotXY([time signal],[time squaredSignal],[time normalizedSquaredSignal],[time noise(:,2)],[time squaredNoise],[time normalizedSquaredNoise]);
  234. nPlots = 6;
  235. subplot(nPlots,1,3);
  236. ylim([0 highThresholdFactor*1.1]);
  237. subplot(nPlots,1,6);
  238. ylim([0 highThresholdFactor*1.1]);
  239. else
  240. MultiPlotXY([time signal],[time squaredSignal],[time normalizedSquaredSignal]);
  241. % MultiPlotXY(time,signal,time,squaredSignal,time,normalizedSquaredSignal);
  242. nPlots = 3;
  243. subplot(nPlots,1,3);
  244. ylim([0 highThresholdFactor*1.1]);
  245. end
  246. for i = 1:nPlots,
  247. subplot(nPlots,1,i);
  248. hold on;
  249. yLim = ylim;
  250. for j=1:size(ripples,1),
  251. plot([ripples(j,1) ripples(j,1)],yLim,'g-');
  252. plot([ripples(j,2) ripples(j,2)],yLim,'k-');
  253. plot([ripples(j,3) ripples(j,3)],yLim,'r-');
  254. if i == 3,
  255. plot([ripples(j,1) ripples(j,3)],[ripples(j,4) ripples(j,4)],'k-');
  256. end
  257. end
  258. for j=1:size(bad,1),
  259. plot([bad(j,1) bad(j,1)],yLim,'k-');
  260. plot([bad(j,2) bad(j,2)],yLim,'k-');
  261. plot([bad(j,3) bad(j,3)],yLim,'k-');
  262. if i == 3,
  263. plot([bad(j,1) bad(j,3)],[bad(j,4) bad(j,4)],'k-');
  264. end
  265. end
  266. if mod(i,3) == 0,
  267. plot(xlim,[lowThresholdFactor lowThresholdFactor],'k','linestyle','--');
  268. plot(xlim,[highThresholdFactor highThresholdFactor],'k-');
  269. end
  270. end
  271. end
  272. function y = Filter0(b,x)
  273. if size(x,1) == 1,
  274. x = x(:);
  275. end
  276. if mod(length(b),2) ~= 1,
  277. error('filter order should be odd');
  278. end
  279. shift = (length(b)-1)/2;
  280. [y0 z] = filter(b,1,x);
  281. y = [y0(shift+1:end,:) ; z(1:shift,:)];
  282. function [U,stdA] = unity(A,sd,restrict)
  283. if ~isempty(restrict),
  284. meanA = mean(A(restrict));
  285. stdA = std(A(restrict));
  286. else
  287. meanA = mean(A);
  288. stdA = std(A);
  289. end
  290. if ~isempty(sd),
  291. stdA = sd;
  292. end
  293. U = (A - meanA)/stdA;

FindRipples.m at commit ba5a476, no license · at the source

Overview

Authors: Yawen Zheng1, Jifu Tong1, Yuanwei Xing1, Shan Shao1, Naizheng Liu1, Shuting Liu1, Jiao Wu1, Wang Yin1, Jiaxin Wang1, Shulu Yuan1, Kun Cui1, Xuetao Qi1, Shuang Cui1, You Wan1,2,3,4, Ming Yi1,2,5
  1. Neuroscience Research Institute and Department of Neurobiology, School of Basic Medical Sciences, Peking University, Beijing, 100083 China
  2. Key Laboratory for Neuroscience, Ministry of Education/National Health Commission, Peking University, Beijing, 100083 China
  3. Beijing Life Science Academy, Beijing, 102209 China
  4. Co-innovation Center of Neuroregeneration, Nantong University, Nantong, 226007 China
  5. Medical Innovation Center (Taizhou)of Peking University, Taizhou, 225316 China
Institutions: Peking University (China); Nantong University (China)
Journal: Nature communications, volume 17, issue 1, article 4259
Dates: received 21 September 2024; accepted 23 February 2026; published online 20 March 2026
Type: Research article · Language: English
License: CC BY-NC-ND
Identifiers: DOI 10.1038/s41467-026-70268-8 · PMID 41862484 · PMCID PMC13168293 · OpenAlex W7138880311
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: mouse (organism), cognitive (subfield)
Methods: Preprocessing, Statistics, Machine learning, Spectral & time-frequency, Connectivity, Evoked potentials, fMRI & imaging, Single-unit activity, calcium imaging, Physiology & signal measures
Keywords: Spatial memory, Cognitive control
MeSH: Hippocampus*, Neurons*, Parvalbumins*, Septal Nuclei*, Spatial Memory*, Animals, CA1 Region, Hippocampal, Male, Mice, Mice, Inbred C57BL, Optogenetics, Septum of Brain (* major topic)
Topic: Memory and Neural Mechanisms (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Funding: National Natural Science Foundation of China (National Science Foundation of China) (32371049, 32271053)
Citations: not cited yet (Europe PMC); 70 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.

Repository

Its files are read in the Code ↔ Paper reader above, with 6 matches between paragraphs and lines of code.

evelynzyw/evelyn_PV_analysis

License: none: the authors keep all their rights
State: the link answers, verified on 30 September 2026
Evidence: files inventoried
Commit: ba5a4761f8bc928803e623b33ce8c7af89d3f5ba, 26 January 2026
Languages: MATLAB (9)
Size: 9 files, 9 scripts
Software Heritage: not archived
Found in: “Code availability”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Tools: Chronux (2 files)
Availability: 1 check, the latest on 30 September 2026: the link answers
  • 30 September 2026: the link answers
9 files

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:

Read it in the paper: doi.org/10.1038/s41467-026-70268-8.

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;
  • 9 scripts, each with its path and the digest of its content;
  • 6 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

Code and data availability statement

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

Read it in the paper: doi.org/10.1038/s41467-026-70268-8.

Versions

The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.

Version 1, 30 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 15 authors, 2 keywords, 12 MeSH terms, 1 funder, 68 references.

Cite

This paper

Zheng, Y., Tong, J., Xing, Y., Shao, S., Liu, N., Liu, S., Wu, J., Yin, W., Wang, J., Yuan, S., Cui, K., Qi, X., Cui, S., Wan, Y., & Yi, M. (2026). Parvalbumin-positive neurons in the medial septum participate in the formation of hippocampal-dependent spatial memory. Nature communications, 17(1), 4259. https://doi.org/10.1038/s41467-026-70268-8

BibTeX

@article{zheng2026parvalbumin,
author = {Zheng, Yawen and Tong, Jifu and Xing, Yuanwei and Shao, Shan and Liu, Naizheng and Liu, Shuting and Wu, Jiao and Yin, Wang and Wang, Jiaxin and Yuan, Shulu and Cui, Kun and Qi, Xuetao and Cui, Shuang and Wan, You and Yi, Ming},
title = {{Parvalbumin-positive neurons in the medial septum participate in the formation of hippocampal-dependent spatial memory}},
journal = {Nature communications},
year = {2026},
month = mar,
volume = {17},
number = {1},
pages = {4259},
publisher = {Nature Publishing Group},
issn = {2041-1723},
doi = {10.1038/s41467-026-70268-8},
url = {https://doi.org/10.1038/s41467-026-70268-8},
pmid = {41862484},
pmcid = {PMC13168293}
}

RIS

TY - JOUR
AU - Zheng, Yawen
AU - Tong, Jifu
AU - Xing, Yuanwei
AU - Shao, Shan
AU - Liu, Naizheng
AU - Liu, Shuting
AU - Wu, Jiao
AU - Yin, Wang
AU - Wang, Jiaxin
AU - Yuan, Shulu
AU - Cui, Kun
AU - Qi, Xuetao
AU - Cui, Shuang
AU - Wan, You
AU - Yi, Ming
TI - Parvalbumin-positive neurons in the medial septum participate in the formation of hippocampal-dependent spatial memory
T2 - Nature communications
J2 - Nat Commun
PY - 2026
DA - 2026/03/20
VL - 17
IS - 1
SP - 4259
SN - 2041-1723
PB - Nature Publishing Group
DO - 10.1038/s41467-026-70268-8
UR - https://doi.org/10.1038/s41467-026-70268-8
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s41467-026-70268-8",
"type": "article-journal",
"title": "Parvalbumin-positive neurons in the medial septum participate in the formation of hippocampal-dependent spatial memory",
"container-title": "Nature communications",
"author": [
{
"family": "Zheng",
"given": "Yawen"
},
{
"family": "Tong",
"given": "Jifu"
},
{
"family": "Xing",
"given": "Yuanwei"
},
{
"family": "Shao",
"given": "Shan"
},
{
"family": "Liu",
"given": "Naizheng"
},
{
"family": "Liu",
"given": "Shuting"
},
{
"family": "Wu",
"given": "Jiao"
},
{
"family": "Yin",
"given": "Wang"
},
{
"family": "Wang",
"given": "Jiaxin"
},
{
"family": "Yuan",
"given": "Shulu"
},
{
"family": "Cui",
"given": "Kun"
},
{
"family": "Qi",
"given": "Xuetao"
},
{
"family": "Cui",
"given": "Shuang"
},
{
"family": "Wan",
"given": "You"
},
{
"family": "Yi",
"given": "Ming"
}
],
"container-title-short": "Nat Commun",
"volume": "17",
"issue": "1",
"page": "4259",
"DOI": "10.1038/s41467-026-70268-8",
"PMID": "41862484",
"PMCID": "PMC13168293",
"ISSN": "2041-1723",
"publisher": "Nature Publishing Group",
"URL": "https://doi.org/10.1038/s41467-026-70268-8",
"language": "en",
"issued": {
"date-parts": [
[
2026,
3,
20
]
]
}
}

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.1002/advs.202416480
Long-Term Memory Updating Parallels Altered Awake and Sleep Hippocampal Replays.
Journal: Advanced science (Weinheim, Baden-Wurttemberg, Germany)
In common: cognitive, 5 references, 3 authors
[2] doi:10.1038/s41467-023-41746-0 [code]
The medial septum controls hippocampal supra-theta oscillations.
Journal: Nature communications
In common: 11 references
[3] doi:10.1073/pnas.2122141119
Action-driven remapping of hippocampal neuronal populations in jumping rats.
Journal: Proceedings of the National Academy of Sciences of the United States of America
In common: 8 references
[4] doi:10.1126/sciadv.adu4899 [code]
Adaptation of hippocampal spatial and contextual representations to task structure.
Journal: Science advances
In common: cognitive, mouse, 7 references
[5] doi:10.1038/s41467-023-35825-5 [code]
Optogenetic frequency scrambling of hippocampal theta oscillations dissociates working memory retrieval from hippocampal spatiotemporal codes.
Journal: Nature communications
In common: Chronux, 5 references
[6] doi:10.1038/s41593-025-01930-5 [code]
Mechanisms of experience-dependent place-cell referencing in hippocampal area CA1.
Journal: Nature neuroscience
In common: mouse, 7 references
[7] doi:10.1038/s41467-024-52243-3 [code]
A distinct neuronal ensemble of prelimbic cortex mediates spontaneous pain in rats with peripheral inflammation.
Journal: Nature communications
In common: 3 references, author You Wan
[8] doi:10.1016/j.isci.2024.110076
Sleep-dependent decorrelation of hippocampal spatial representations.
Journal: iScience
In common: cognitive, 6 references
[9] doi:10.1038/s41467-025-63229-0 [code]
Spatial coding dysfunction and network instability in the aging medial entorhinal cortex.
Journal: Nature communications
In common: mouse, 6 references
[10] doi:10.7554/elife.87356 [code]
A dynamical computational model of theta generation in hippocampal circuits to study theta-gamma oscillations during neurostimulation.
Journal: eLife
In common: Chronux, 4 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-70268-8.svg)](https://openscicode.org/badge/doi/10.1038/s41467-026-70268-8)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

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

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