OSCR

The hippocampal CA3 area implements sequence learning of discontinuous episodes.

Code ↔ Paper

2 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 2 matches
  1. [1] § Methods › Simulation methods ↔ encoding.m, lines 51–99 · score 0.70 · exponential decay, synaptic delay, reset, arrive, pre, post
  2. [2] § Results › Simulation of sequence learning in the presence of intervening place cell firings ↔ showFigS4.m, lines 11–17 · score 0.52 · reward areas, place field, S4B, MF

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 · 237 lines · 7.1 KB · no license · 1 match

  1. clear
  2. set(0, 'DefaultFigureWindowStyle', 'docked');
  3. readprm;
  4. prepenc;
  5. initenc;
  6. %%
  7. %************************************************
  8. % Encoding Simulation Main
  9. %************************************************
  10. tic
  11. for t = 2:encnt
  12. % read izp from t and TppM (=Tmidpp)
  13. tdiff = Tmi; %Tp =Tm = interval btwn episodes
  14. for idx=1:nzm
  15. newdiff = abs(t-TppM(idx));
  16. if tdiff > newdiff
  17. tdiff = newdiff;
  18. izp = idx;
  19. end
  20. end
  21. %% take care fired neurons
  22. jf = find(v > 30); %just firing
  23. %if ~isempty(jf)
  24. nfire = length(jf);
  25. % append the list of newly firing neurons to [firings]
  26. firings = [firings; t*ones(nfire,1), jf]; %for storing the whole firing history, X(justfired,t) = 1;
  27. ejf = jf(jf < Ne+1); ijf = jf(jf > Ne);
  28. v(ejf) = Vrete; v(ijf) = Vreti;
  29. if bLIF == 1
  30. dvth(jf) = dVth;
  31. else
  32. uiz(ejf)=uiz(ejf)+ude; uiz(ijf)=uiz(ijf)+udi;
  33. end
  34. % ion conc
  35. dca(ejf) = 1;
  36. %end
  37. dzn = bzn.*(tmf<TmfZn);
  38. bzn(dzn==1) = 0; % bzn = 0 (zn in cleft disappear) if dzn ==1
  39. ca = ca + dca; zn = zn + dzn;
  40. %% A/C STDP
  41. stdpac = circshift(stdpac, [0 -1]); %left-shift of columns
  42. stdpac(:,Dlye+1) = dsac*stdpac(:,Dlye); %exponential decay of stdp
  43. stdpac(ejf,Dlye+1) = Adwac; %reset stdp of fired neurons
  44. dsw = zeros(Ne, Ne); %reset of dsw (= delta of synaptic weight)
  45. % STDP forward: ejf as a post -----------------------------
  46. nejf = length(ejf);
  47. if nejf > 0 %isempty(ejf)
  48. for idx=1:nejf
  49. dsw(ejf(idx),:) = stdpac(:,1)'; %forward synapse pre->ejf
  50. end
  51. end
  52. % consider synaptic delay ---------------------------
  53. pf = firings(firings(:,1)==t-Dlye,2); %pf = prevfired
  54. epfdx = pf < Ne+1;
  55. epf = pf(epfdx); %epf = exc_prevfired
  56. pf = firings(firings(:,1)==t-Dlyi,2);
  57. ipfdx = pf > Ne;
  58. ipf = pf(ipfdx); %ipf = inh_prevfired
  59. % STDP reverse: epf as a pre (epf AP just arrived)-------
  60. nepf = length(epf);
  61. if nepf > 0 %isempty(ejf)
  62. for idx=1:nepf
  63. dsw(:,epf(idx)) = dsw(:,epf(idx))+stdpac(:,end); %reverse synapse epf->pre; Note that end = Dlye+1
  64. end
  65. end
  66. dsw = 1 + dsw*nRepeat;
  67. Jee = min(Jee.*dsw, Gacmax);
  68. WJee = Jee.*Wee;
  69. WJe = [WJee; WJie];
  70. % update Gsyn (ge & gi)
  71. ge = dke*ge;
  72. ge(:,epf) = ge(:,epf) + WJe(:,epf)*AchFactor;
  73. gesum(:,1) = sum(ge,2); % row sum of ge
  74. ipf = ipf - Ne;
  75. gi = dki*gi;
  76. gi(:, ipf) = gi(:, ipf) + WJi(:, ipf);
  77. gisum(:,1) = sum(gi,2); %gi = row sum of gi1
  78. %% PP synapse stdp ----------------------------------
  79. %decay of stdp
  80. stdppa = stdppa*dsppa; %stdp pp -> firing
  81. stdppb = stdppb*dsppb; %stdp firing -> pp
  82. if ~isempty(ejf)
  83. Jpp(ejf,izp) = Jpp(ejf,izp).*(stdppa(ejf)+1);
  84. stdppb(ejf) = Bdwpp;
  85. end
  86. ZppOn = find(Zpp(:,t));
  87. ZeppOn = find(Zpp(1:Ne,t));
  88. ZippOn = find(Zpp(Ne+1:Nt,t));
  89. if ~isempty(ZeppOn)
  90. Jpp(ZeppOn,izp) = Jpp(ZeppOn,izp).*(stdppb(ZeppOn)+1);
  91. stdppa(ZeppOn) = Adwpp;
  92. end
  93. Jpp = min(Gppmax, Jpp);
  94. %% update Gsyn (gmf and gpp)
  95. % gmf = mf input = zeros(Nt,1) -------------------
  96. gmf = gmf*dkmf;
  97. ZmfeOn = find(Zmf(1:Ne,t) == 1);
  98. ZmfiOn = find(Zmf(Ne+1:Nt,t) == 1)+Ne;
  99. gmf(ZmfeOn) = gmf(ZmfeOn) + Gmfe;
  100. gmf(ZmfiOn) = gmf(ZmfiOn) + Gmfi;
  101. bzn(ZmfeOn) = 1;
  102. tmf(ZmfeOn) = 0;
  103. gpp = gpp*dkpp;
  104. gpp(ZeppOn) = gpp(ZeppOn) + Jpp(ZeppOn,izp);
  105. gpp(ZippOn) = gpp(ZippOn) + Gppi;
  106. %% D-spike current
  107. % d-spike occurs if PP input arrives and IE>0.3
  108. Ids = zeros(Nt,1); %dvds = zeros(Nt,1);
  109. preT = max(1, t-150); % D spike occurs when more than 2 pp inputs arrive within 60 ms
  110. ZdsOn = find((IE(:,t-1)>0.5).*Zpp(1:Ne,t).*(sum(Zpp(1:Ne, preT:t), 2)>2).*(Idsidx>Rfrds)); % ZdsOn = ZppOn(IE(ZppOn, t)>0.5);
  111. Idsidx(ZdsOn) = 1;
  112. % dt should not be larger than tauds1(=0.1). To circumvent it, I repeat Ids calculations by ndtds times (= dt/dtds)
  113. for tdx=1:ndtds
  114. Idsidx = min(Idsidx+1, ntids);
  115. Ids(1:Ne,1) = Ids(1:Ne,1) + IdsTmplt(Idsidx); %Ids = IdsTmplt(Idsidx); % Ids = somatic current inj d/t dendritic spike
  116. % dvds = dvds + dtds*Ids/cm;
  117. end
  118. Ids = Ids/ndtds;
  119. % dsrec(:,t) = Ids; %dvds;
  120. %% calc vm
  121. if bLIF == 1
  122. Isyn(:,t) = (gesum + gmf + gpp + Go).*(v-Ere) + gisum.*(v-Eri) - Ids; % nS*mV = pA
  123. v = v - Km.*((v - Vleak) + Rm.* Isyn(:,t)); % + dvds; % GOhm*pA = mV
  124. else % izh
  125. %{
  126. dv/dt [mV/ms]= Gs[nS] dE[mV] / Cm[pF] = [A/F] = [V/s] = [mV/ms]
  127. Since Cm [pF] = Tm [ms] Gm [nS],
  128. dv/dt [mV/ms] = (Gs/Gm) dE(mV) / Tm (ms)
  129. For izh, Cm is equivalent to Tm, and cminv = 1/Tm = 0.01
  130. %}
  131. Isyn(:,t) = cminv.*((gesum + gmf + gpp).*(v-Ere) + gisum.*(v-Eri)-Ids); % nS*mV / pF = pA/pF = V/s = mV/ms
  132. v=v+dthalf*(((0.04*v+5).*v+140-uiz)- Isyn(:,t));
  133. v=v+dthalf*(((0.04*v+5).*v+140-uiz)- Isyn(:,t));
  134. uiz=uiz+dt*aiz.*(biz.*v-uiz);
  135. %v = max(Vmin, v); %to suppress rebound AP firing by inh inputs
  136. end
  137. %% take care impending fire
  138. if bLIF == 1
  139. dvth = dvth.*dkrfp;
  140. v(v > (Vth+dvth) ) = 35;
  141. else
  142. v(v > Vth) = 35;
  143. end
  144. venc(:,t) = v;
  145. %% update IE & ions
  146. bIE(((ca>CaTh1).*(zn>ZnTh))==1) = 1;
  147. bIE(((ca>CaTh2).*(zn<ZnTh))==1) = 0;
  148. cIEdx = find(bIE==1);
  149. dIEdx = find(bIE==0);
  150. IE(cIEdx,t) = IE(cIEdx,t-1)*dincIE_ + dincIE;
  151. IE(dIEdx,t) = IE(dIEdx,t-1)*dkIE;
  152. ca = ca*dkca;
  153. zn = zn*dkzn;
  154. tmf = tmf + 1;
  155. dca(:) = 0;
  156. dzn(:) = 0;
  157. carec(:, t) = ca;
  158. znrec(:, t) = zn; %IErec(:,t) = IE;
  159. end
  160. toc
  161. beep;
  162. WJee_ = WJee;
  163. homeo;
  164. %or Rwmax=1/1.4; homeo2
  165. %% display
  166. Jpp = min(Gppmax, Jpp); %Jpp = max(0, Jpp);
  167. if app ~= 1
  168. JPP_ = zeros(Ne, nzm);
  169. for zpdx=1:nzm
  170. Zon = Zpcell{zpdx,1};
  171. JPP_(Zon,zpdx) = Jpp(Zon, zpdx);
  172. end
  173. Jpp = JPP_;
  174. clear JPP_;
  175. end
  176. figure(5); clf; image(Jpp, 'CdataMapping', 'scaled'); colorbar; caxis([0,Gppmax]); title('Jpp'); %ylim([0 Nam*nzm])
  177. showWJ %fig6
  178. showEnc %fig3,4
  179. ya = [1,Ne]; xa = [0, enctime];
  180. figure(7); clf; image(xa, ya, carec, 'CdataMapping', 'scaled'); title('Ca');
  181. colorbar; dcm = datacursormode(gcf); set(dcm,'DisplayStyle','window')
  182. xlabel("time (ms)"); ylabel("i.d. of neurons");
  183. figure(8); clf; image(xa, ya, znrec, 'CdataMapping', 'scaled'); title('Zn');
  184. colorbar;dcm = datacursormode(gcf); set(dcm,'DisplayStyle','window')
  185. xlabel("time (ms)"); ylabel("i.d. of neurons");
  186. figure(9); clf; image(xa, ya, IE, 'CdataMapping', 'scaled'); title('IE');
  187. colorbar; dcm = datacursormode(gcf); set(dcm,'DisplayStyle','window')
  188. xlabel("time (ms)"); ylabel("i.d. of neurons");

encoding.m at commit db17e7b, no license · at the source

Overview

Authors: Kisang Eom1,2,3, Yujin Kim1,2, Hyoung-Ro Lee1, Yolguk Lee2, Young-Eun Han1, Jiwoo Shin1,2, Jae Sung Lee4, Jung Ho Hyun3, Alan J. Park1, Suk-Ho Lee1,2
  1. Department of Physiology, Seoul National University College of Medicine,Seoul, Republic of Korea
  2. Department of Brain and Cognitive Science, Seoul National University College of Natural Science,Seoul, Republic of Korea
  3. Department of Brain Sciences, DGIST,Daegu, Republic of Korea
  4. Beth Israel Deaconess Medical Center, Howard Hughes Medical Institute,Boston, MA USA
Journal: Communications biology, volume 9, issue 1, article 1046
Dates: received 14 August 2025; accepted 2 April 2026; published online 11 May 2026
Type: Research article · Language: English
License: CC BY-NC-ND
Identifiers: DOI 10.1038/s42003-026-10064-8 · PMID 42115760 · PMCID PMC13443506 · OpenAlex W7160874317
Open access: gold, a free copy (OpenAlex)
Status: code verified
Categories: computational modeling (no new data) (modality), mouse (organism), cellular / molecular (subfield)
Methods: Statistics, Graphs
Keywords: Network models, Hippocampus
MeSH: CA3 Region, Hippocampal*, Learning*, Animals, Kv1.2 Potassium Channel, Male, Memory, Mice, Pyramidal Cells (* major topic)
Topic: Memory and Neural Mechanisms (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Funding: National Research Foundation of Korea (RS-2024-00333669, 2020R1A2C2006438, 2021R1I1A1A01059646)
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 2 matches between paragraphs and lines of code.

bobazok/Sequence-learning-in-the-hippocampal-CA3

License: none: the authors keep all their rights
State: the link answers, verified on 28 September 2026
Evidence: files inventoried
Commit: db17e7bafd4748edb4d7b49e9eaff18a081184d4, 27 March 2026
Languages: MATLAB (19)
Size: 24 files, 19 scripts
Software Heritage: not archived
Found in: “Data availability”
Holds: README
Not found: license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 28 September 2026: the link answers
  • 28 September 2026: the link answers
20 files

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;
  • 19 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.

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/s42003-026-10064-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, 28 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 10 authors, 2 keywords, 8 MeSH terms, 1 funder, 69 references.

Cite

This paper

Eom, K., Kim, Y., Lee, H.-R., Lee, Y., Han, Y.-E., Shin, J., Lee, J. S., Hyun, J. H., Park, A. J., & Lee, S.-H. (2026). The hippocampal CA3 area implements sequence learning of discontinuous episodes. Communications biology, 9(1), 1046. https://doi.org/10.1038/s42003-026-10064-8

BibTeX

@article{eom2026hippocampal,
author = {Eom, Kisang and Kim, Yujin and Lee, Hyoung-Ro and Lee, Yolguk and Han, Young-Eun and Shin, Jiwoo and Lee, Jae Sung and Hyun, Jung Ho and Park, Alan J. and Lee, Suk-Ho},
title = {{The hippocampal CA3 area implements sequence learning of discontinuous episodes}},
journal = {Communications biology},
year = {2026},
month = may,
volume = {9},
number = {1},
pages = {1046},
publisher = {Nature Publishing Group},
issn = {2399-3642},
doi = {10.1038/s42003-026-10064-8},
url = {https://doi.org/10.1038/s42003-026-10064-8},
pmid = {42115760},
pmcid = {PMC13443506}
}

RIS

TY - JOUR
AU - Eom, Kisang
AU - Kim, Yujin
AU - Lee, Hyoung-Ro
AU - Lee, Yolguk
AU - Han, Young-Eun
AU - Shin, Jiwoo
AU - Lee, Jae Sung
AU - Hyun, Jung Ho
AU - Park, Alan J.
AU - Lee, Suk-Ho
TI - The hippocampal CA3 area implements sequence learning of discontinuous episodes
T2 - Communications biology
J2 - Commun Biol
PY - 2026
DA - 2026/05/11
VL - 9
IS - 1
SP - 1046
SN - 2399-3642
PB - Nature Publishing Group
DO - 10.1038/s42003-026-10064-8
UR - https://doi.org/10.1038/s42003-026-10064-8
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s42003-026-10064-8",
"type": "article-journal",
"title": "The hippocampal CA3 area implements sequence learning of discontinuous episodes",
"container-title": "Communications biology",
"author": [
{
"family": "Eom",
"given": "Kisang"
},
{
"family": "Kim",
"given": "Yujin"
},
{
"family": "Lee",
"given": "Hyoung-Ro"
},
{
"family": "Lee",
"given": "Yolguk"
},
{
"family": "Han",
"given": "Young-Eun"
},
{
"family": "Shin",
"given": "Jiwoo"
},
{
"family": "Lee",
"given": "Jae Sung"
},
{
"family": "Hyun",
"given": "Jung Ho"
},
{
"family": "Park",
"given": "Alan J."
},
{
"family": "Lee",
"given": "Suk-Ho"
}
],
"container-title-short": "Commun Biol",
"volume": "9",
"issue": "1",
"page": "1046",
"DOI": "10.1038/s42003-026-10064-8",
"PMID": "42115760",
"PMCID": "PMC13443506",
"ISSN": "2399-3642",
"publisher": "Nature Publishing Group",
"URL": "https://doi.org/10.1038/s42003-026-10064-8",
"language": "en",
"issued": {
"date-parts": [
[
2026,
5,
11
]
]
}
}

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.1371/journal.pcbi.1014438 [code]
GATE: Adaptive learning with working memory by information gating in multi-lamellar hippocampal formation.
Journal: PLoS computational biology
In common: 6 references
[2] doi:10.1038/s41467-026-71914-x [code]
Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit.
Journal: Nature communications
In common: mouse, 5 references
[3] doi:10.1038/s41593-026-02231-1 [code]
The prefrontal cortex controls memory organization in the hippocampus.
Journal: Nature neuroscience
In common: mouse, 4 references
[4] doi:10.1073/pnas.2603114123 [code]
The human hippocampus can pattern separate memories by meaning.
Journal: Proceedings of the National Academy of Sciences of the United States of America
In common: 4 references
[5] doi:10.1038/s41586-026-10907-8 [code]
Procognitive restoration of PV neuron plasticity in neurodevelopmental disorders.
Journal: Nature
In common: author Jung Ho Hyun
[6] doi:10.1038/s41586-026-10537-0 [code]
Sparse-to-dense coding transformation between hippocampal areas CA3 and CA1.
Journal: Nature
In common: 3 references
[7] doi:10.1038/s41593-026-02357-2 [code]
Experience reorganizes content-specific memory traces in macaques.
Journal: Nature neuroscience
In common: 3 references
[8] doi:10.1016/j.celrep.2026.117793 [code]
Clustered inputs engage dendritic nonlinearities and calcium signaling to support efficient place-field formation in CA1 pyramidal neurons.
Journal: Cell reports
In common: computational modeling (no new data), cellular / molecular, 2 references
[9] doi:10.7554/elife.107905 [code]
Adult-neurogenesis allows for representational stability and flexibility in early olfactory system.
Journal: eLife
In common: computational modeling (no new data), 2 references
[10] doi:10.1371/journal.pcbi.1014575 [code]
Remembering the "when": Hebbian memory models for the time of past events.
Journal: PLoS computational biology
In common: computational modeling (no new data), 2 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.

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.