OSCR

Predicting individual differences of fear and cognitive learning and extinction.

Code ↔ Paper

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

9 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 11 matches · 1 of them tie a paragraph to a whole file without given lines: a weak match, whose lines are not tinted
  1. [1] § Results › Acquisition ↔ scripts/11. pipeline_modelling.r, lines 105 to 148 · score 0.95 · lACC, lCEB, lPFC, rAMY, rPFC, lAMY · block oscr:b:XG52BB0CASPWH-A · Report a mismatch
  2. [2] § Results › Acquisition ↔ scripts/12. pipeline_generalisability.r, lines 106 to 149 · score 0.95 · lACC, lCEB, lPFC, rAMY, rPFC, lAMY · block oscr:b:JYPDT9BPW0TB0-8 · Report a mismatch
  3. [3] § Methods › Functional connectivity (FC) ↔ scripts/06. pipeline_FC.py, lines 286 to 391 · score 0.94 · wavelet coherence, Euclidean distance, Manhattan distance, Wasserstein distance, mutual information, cross correlation · block oscr:b:V00KG2XXVTKZN-R · Report a mismatch
  4. [4] § Results › Extinction ↔ scripts/11. pipeline_modelling.r, lines 105 to 148 · score 0.88 · lCEB, lPFC, rAMY, lAMY, lHIP, rACC · block oscr:b:XG52BB0CASPWH-A · Report a mismatch
  5. [5] § Results › Extinction ↔ scripts/12. pipeline_generalisability.r, lines 106 to 149 · score 0.88 · lCEB, lPFC, rAMY, lAMY, lHIP, rACC · block oscr:b:JYPDT9BPW0TB0-8 · Report a mismatch
  6. [6] § Methods › Structural connectivity (SC) › Learning measures › SCR measures ↔ scripts/09b. pipeline_EDA_DCM.m, lines 17 to 82 · score 0.68 · CS interval, CS onset, latency, flexible, events, linear · block oscr:b:PB4A4GNYGNB3C-W · Report a mismatch
  7. [7] § Methods › Preprocessing of neuroimaging data ↔ scripts/03. pipeline_denoising.py, lines 91 to 151 · score 0.60 · global signals, Satterthwaite, WM, CSF, denoising, regressors · block oscr:b:EKPP53NW9D3CH-Z · Report a mismatch
  8. [8] § Results › Learning measures ↔ scripts/10. pipeline_learning.r, lines 93 to 168 · score 0.58 · linear mixed, learning scores, behavioural, CS, renewal, extinction · block oscr:b:KGZRG1TFABKAY-5 · Report a mismatch
  9. [9] § Methods › Behavioural responses › Predicting individual differences ↔ scripts/12. pipeline_generalisability.r, lines 191 to 230 · score 0.54 · nested cross validation, fold, trained, split, LASSO, predict · block oscr:b:J2A371BVFQB0B-T · Report a mismatch
  10. [10] § Methods › ROI extraction ↔ scripts/05. pipeline_SUIT.m, the whole file · a weak match · score 0.54 · cerebellar nuclei, ACPC, FreeSurfer, atlas, T1w, space · block oscr:b:MNTE4WRXMEJ5H-M · Report a mismatch
  11. [11] § Methods › Behavioural responses › Predicting individual differences ↔ scripts/11. pipeline_modelling.r, lines 191 to 230 · score 0.54 · nested cross validation, fold, trained, split, LASSO, predict · block oscr:b:0Y57RX06TFKMT-0 · 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

R · 310 lines · 10 KB · no license · 3 matches

  1. library(dplyr)
  2. library(tidyr)
  3. library(tibble)
  4. library(glmnet)
  5. library(caret)
  6. library(emmeans)
  7. library(car)
  8. require(doMC)
  9. # Set-Up and Configuration
  10. cl <- parallel::makeCluster(24)
  11. doParallel::registerDoParallel(cl)
  12. norm = 1
  13. tasK = "AC"
  14. cutoff = 50
  15. root_dir = "E:"
  16. base_dir = file.path(root_dir, "data")
  17. group_dir = file.path(base_dir, "group")
  18. fig_dir = file.path(root_dir,"figures")
  19. # load helper functions: normData, scale2, composite_score, etc.
  20. source(file.path(base_dir,"scripts","misc_funs.R"))
  21. # Data Loading and Preprocessing
  22. dat_learn_EDA = read.csv(file.path(base_dir, "datasets", "stat-bf_desc-EDA_df.csv"), sep='\t')
  23. dat_learn_beh = read.csv(file.path(base_dir, "datasets", "stat-logit_desc-beh_df.tsv"), sep='\t')
  24. dat_learn = bind_rows(dat_learn_EDA, dat_learn_beh) %>% filter(!is.na(learning))
  25. covariates = c("age","sex")
  26. demographics = read.csv2(file.path(base_dir, "datasets", "demographics.csv"), sep='\t')
  27. comb_AG = gen_combs(unique(dat_learn$AG))
  28. comb_AG = list(
  29. # c("A08"), # PL
  30. # c("A03"), # FLr
  31. # c("A03","A05"), # FLc
  32. # c("A03","A05","A09"),# FLs
  33. # c("A02","A03","A05","A09"), # FLel
  34. # c("A03","A05","A09","A12"), # FLst
  35. # c("A02","A03","A05","A09","A12"), # FL
  36. c("A02","A03","A05","A08","A09","A12")) # All
  37. # dupls = read.csv(file.path(base_dir, "desc-duplicates_df.tsv"), sep='\t')
  38. # excl_subs = dupls[dupls$keep==0,c("participant","AG","study")]
  39. # dat_learn = anti_join(dat_learn, excl_subs, by=c("participant","AG","study"))
  40. dat_learn_corrs = dat_learn %>% group_by(AG,study,task) %>% group_modify(~ normData(.x))
  41. df_learndemo = demographics %>%
  42. right_join(dat_learn, by=c("participant","AG","study","task"), multiple='all')
  43. # dat_excl_conn = read.csv(file.path(base_dir, "desc-ExcludeSubsConn_table.tsv"), sep='\t')
  44. # Connectivity Data Handling
  45. dat_FC = read.csv(file.path(base_dir, "datasets", "desc-FC_df.tsv"), sep='\t')
  46. # dat_FC = subset(dat_FC, !(participant %in% dat_excl_conn[dat_excl_conn$pipeline=="FC",]$participant_id))
  47. dat_DTI = read.csv(file.path(group_dir, "SC", "desc-SC_df.tsv"), sep='\t')
  48. dat_DTI = subset(dat_DTI, !(participant %in% dat_excl_conn[dat_excl_conn$pipeline=="DTI",]$participant_id))
  49. dat_spDCM = read.csv(file.path(group_dir,"EC","desc-EC_df.tsv"), sep='\t')
  50. dat_spDCM = subset(dat_spDCM, !(participant %in% dat_excl_conn[dat_excl_conn$pipeline=="spDCM",]$participant_id))
  51. df_comb = data.frame(); df_coefs = data.frame(); df_pred = data.frame(); df_counts = data.frame()
  52. # Group-wise and Modality-wise Processing
  53. l = list(FC=dat_FC, SC=dat_DTI, EC=dat_spDCM)
  54. l = list(FC=dat_FC)
  55. for (nAG in 1:length(comb_AG)) {
  56. AGs = comb_AG[[nAG]]
  57. for (n in 1:length(l)) {
  58. if (names(l[n]) == 'FC') {
  59. metric = c('corrLW','xcorr','EuclideanDist','ManhattanDist','WassersteinDist','dtw','MI','mscohe','wavcohe')
  60. inv = c('EuclideanDist','ManhattanDist','WassersteinDist','dtw')
  61. absl = c('corrLW')
  62. dat_conn = dat_FC
  63. pair='pair_und'
  64. } else if (names(l[n]) == 'SC') {
  65. metric = 'streamlines'
  66. dat_conn = dat_DTI
  67. pair='pair_und'
  68. } else {
  69. metric = 'spDCM'
  70. dat_conn = dat_spDCM
  71. pair='pair_dir'
  72. }
  73. dat_conn = subset(dat_conn, hemisphere!="bilateral")
  74. df_join = right_join(df_learndemo, dat_conn, by=c("participant","AG","study"), multiple='all')
  75. ####### CHOOSE WHICH AGs TO INCLUDE IN THE ANALYSIS HERE #######
  76. df_join = df_join %>% subset(AG %in% AGs)
  77. if (dim(df_join)[1]==0) {next}
  78. ################################################################
  79. df_sel = df_join %>% group_by(participant, AG, study) %>%
  80. filter(if_all(!!metric, ~ all(!is.na(.x))))
  81. # df_sel will contain the final sample - that is, excluding subs with any NAs
  82. # Calculate the composite score
  83. if (names(l[n]) == 'FC') {
  84. df_sel = composite_score(df_sel, cols=metric, inv=inv, absl=absl, keep_ori="corrLW")
  85. metric = "composite"
  86. }
  87. selvars = unique(c("participant","AG","study","task",pair,metric,"learning",covariates))
  88. # Standardisation of Learning/connectivity Estimates
  89. df = df_sel[selvars] %>% group_by(AG,study,task,across(all_of(pair))) %>% group_modify(~ normData(.x)) %>%
  90. pivot_wider(names_from=all_of(pair), values_from=all_of(metric), values_fn=mean) %>% ungroup()
  91. if (names(l[n]) == 'EC') {
  92. mVp = df_sel %>% group_by(participant, AG, study) %>% mutate(mVp=mean(spDCM_Var)) %>%
  93. select(participant, AG, study, mVp) %>% distinct()
  94. mVp$mVp = 1-range01(mVp$mVp)
  95. df = left_join(df, select(mVp, mVp))
  96. }
  97. df$const <- factor(rep(1, each=length(df$participant)))
  98. df_acq = subset(df, task == "acquisition")
  99. df_ext = subset(df, task == "extinction")
  100. df_ren = subset(df, task == "renewal")
  101. if (tasK=="AC") {
  102. mdf = df_acq
  103. } else if (tasK=="EX") {
  104. mdf = df_ext
  105. } else {
  106. mdf = df_ren
  107. }
  108. pairs = colnames(mdf %>% dplyr::select(starts_with(
  109. c('AMY','CEB','HIP','ACC','PFC','lAMY','lCEB','lHIP','lACC','lPFC','rAMY','rCEB','rHIP','rACC','rPFC'))))
  110. # LASSO Regression Model Setup
  111. y <- mdf$learning
  112. xx <- mdf %>% ungroup() %>% dplyr::select(all_of(c(pairs,covariates)))
  113. x = data.matrix(makeX(xx, na.impute = TRUE))
  114. myalpha = 1
  115. if (!is.null(covariates)) {
  116. force.vars = as.integer(!Reduce('|', lapply(covariates, function(y) startsWith(as.character(colnames(x)), y))))
  117. } else {
  118. force.vars = rep(1, ncol(xx))
  119. }
  120. # Cross-Validation and Lambda Optimization
  121. tymea = "mse"
  122. lambda_max <- max(abs(colSums(x*y,na.rm=T)))/nrow(x)
  123. epsilon <- .0001
  124. K <- 1000
  125. lambdapath <- round(exp(seq(log(lambda_max), log(lambda_max*epsilon), length.out = K)), digits = 10)
  126. lbpath = lambdapath
  127. ls = foreach(i = 1:100, .combine='rbind', .packages="glmnet") %dopar% {
  128. fit <- cv.glmnet(x, y, alpha=myalpha, nfolds=10, standardize=T, penalty.factor=force.vars,
  129. type.measure=tymea, parallel=T, lambda=lbpath)
  130. errors = data.frame(fit$lambda,fit$cvm)
  131. }
  132. ls <- aggregate(ls[, 2], list(ls$fit.lambda), mean)
  133. bestindex = which(ls[2]==min(ls[2]))[1]
  134. lbd = ls[bestindex,1]
  135. if (names(l[n]) == 'EC') {
  136. ws = 1-mdf$mVp
  137. } else {ws = NULL}
  138. # df_res = dataf(x,y,lbd,force.vars,tymea,ws,names(l[n]),df_pred)
  139. # final_fit = rbind(df_comb,df_res)
  140. # Custom Nested Cross-Validation
  141. fit_lasso_cus = function (x, y, lambda, penalty.factor, type.measure, weights) {
  142. results = data.frame()
  143. final_df = data.frame()
  144. pred_df = data.frame()
  145. for (i in 1:10) {
  146. cv_folds <- vfold_cv(data.frame(x), v = 10)
  147. for (j in seq_along(cv_folds$splits)) {
  148. split <- cv_folds$splits[[j]]
  149. train_data <- analysis(split)
  150. test_data <- assessment(split)
  151. x_train <- data.matrix(train_data)
  152. y_train <- y[as.integer(rownames(train_data))]
  153. x_test <- data.matrix(test_data)
  154. test_idx <- as.integer(rownames(test_data))
  155. y_test <- y[test_idx]
  156. # Fit model
  157. fit <- glmnet(x_train, y_train, alpha = 1, lambda = lambda, penalty.factor = penalty.factor,
  158. type.measure=type.measure, weights=weights)
  159. # Predict on test set
  160. y_pred <- predict(fit, newx = x_test)
  161. # Save predictions
  162. pred_df = bind_rows(pred_df,
  163. data.frame(
  164. iteration = i,
  165. fold = j,
  166. subject = test_idx,
  167. y_true = y_test,
  168. y_pred = as.vector(y_pred)
  169. )
  170. )
  171. # Save coefficients
  172. coefs = coef(fit)
  173. coef_df = as.data.frame(as.matrix(coefs)) %>%
  174. rownames_to_column("connection") %>%
  175. rename(coefficient = 2) %>%
  176. filter(coefficient != 0) %>%
  177. mutate(iteration = i, fold = j)
  178. final_df <- bind_rows(final_df, coef_df)
  179. }
  180. }
  181. group_df = final_df %>%
  182. group_by(connection) %>%
  183. summarise(
  184. times_selected = n(),
  185. avg_coefficient = mean(coefficient)
  186. ) %>%
  187. arrange(desc(times_selected))
  188. return(group_df)
  189. }
  190. ffit = fit_lasso_cus(x,y,lbpath,force.vars,tymea,ws) %>% filter(times_selected > cutoff)
  191. ffit$mod=names(l[n])
  192. ffit$group=paste(AGs,collapse='_')
  193. # Poisson regression
  194. # Set-Up and Parallelized Simulation
  195. tp = foreach(niter = 1:10, .combine='rbind', .packages=c("dplyr","doMC","tibble","glmnet")) %dopar% {
  196. mdf2 = mdf[sample(nrow(mdf), 80),]
  197. lambda_max <- max(abs(colSums(x*y,na.rm=T)))/nrow(x)
  198. lbpath <- round(exp(seq(log(lambda_max), log(lambda_max*epsilon), length.out = K)), digits = 10)
  199. # LASSO Regression and Feature Selection
  200. ls = foreach(i = 1:100, .combine='rbind', .packages="glmnet") %dopar% {
  201. fit <- cv.glmnet(x, y, alpha=myalpha, nfolds=10, standardize=T, penalty.factor=force.vars,
  202. type.measure=tymea, parallel=T, lambda=lbpath)
  203. errors = data.frame(fit$lambda,fit$cvm)
  204. }
  205. ls <- aggregate(ls[, 2], list(ls$fit.lambda), mean)
  206. bestindex = which(ls[2]==min(ls[2]))[1]
  207. lbd = ls[bestindex,1]
  208. if (names(l[n]) == 'EC') {
  209. ws = 1-mdf2$mVp
  210. } else {ws = NULL}
  211. fit.lasso = glmnet(x=x,y=y,lambda=lbd, alpha=myalpha, penalty.factor=force.vars, type.measure=tymea,
  212. weights=ws)
  213. results = coef(fit.lasso)
  214. df_res = as.data.frame(as.matrix(results)) %>% rownames_to_column(var="connection")
  215. preds = df_res$connection
  216. # Feature Region Analysis
  217. df_tempc = data.frame(G = niter, AMY=length(grep("AMY", preds)), ACC=length(grep("ACC", preds)), HIP=length(grep("HIP", preds)), PFC=length(grep("PFC", preds)),
  218. CEB=length(grep("CEB", preds)), mod=names(l[n]))
  219. }
  220. df_counts = rbind(df_counts,tp)
  221. }
  222. }
  223. # Statistical Comparison
  224. m = df_counts %>% pivot_longer(cols = -c(G,mod)) %>% group_by(G,name)
  225. model <- glmer(value ~ name + (1|G), family=poisson, data=subset(m, mod==mg))
  226. summary(model)
  227. em = emmeans(model, pairwise ~ name, adjust="fdr")

11. pipeline_modelling.r at commit fee4711, no license · at the source

Overview

Authors: C. A. Gomes1,2,3,4, D. R. Bach5,6, A. Razi5,7,8,9, G. Batsikadze2,3,4, S. Elsenbruch10, H. Engler3,11, T. M. Ernst2,3,4, M. C. Fellner1, C. Fraenz12, E. Genç12, A. Klass13, F. Labrenz10, S. Lissek13, C. J. Merz14, D. Metzen15, A. Nostadt13,16, R. J. Pawlik2,3, J. E. Schneider1,17, M. Tegenthoff13, A. Thieme2,3
and 7 other authorsO. T. Wolf14, O. Güntürkün4,18,19, H. H. Quick4,20, R. Kumsta17, D. Timmann2,3,4, T. Spisak3, N. Axmacher1,4
20 affiliations
  1. Department of Neuropsychology, Ruhr University Bochum,Bochum, Germany
  2. Department of Neurology, University Hospital Essen,Essen, Germany
  3. Center for Translational Neuro- and Behavioral Sciences, University Hospital Essen, University of Duisburg-Essen,Essen, Germany
  4. Erwin L. Hahn Institute for Magnetic Resonance Imaging, University of Duisburg-Essen,Essen, Germany
  5. Department of Imaging Neuroscience, UCL Queen Square Institute of Neurology, University College London,London, UK
  6. University of Bonn, Transdisciplinary Research Area “Life & Health”, Centre for Artificial Intelligence and Neuroscience,Bonn, Germany
  7. Turner Institute for Brain and Mental Health, School of Psychological Sciences, Monash University,Clayton, Australia
  8. Monash Biomedical Imaging, Monash University,Clayton, Australia
  9. CIFAR Azrieli Global Scholars Program, CIFAR,Toronto, Canada
  10. Department of Medical Psychology & Medical Sociology, Ruhr University Bochum,Bochum, Germany
  11. Institute of Medical Psychology and Behavioral Immunobiology, University Hospital Essen,Essen, Germany
  12. Department of Psychology and Neurosciences, Leibniz Research Centre for Working Environment and Human Factors at the Technical University of Dortmund (IfADo),Dortmund, Germany
  13. Department of Neurology, BG University Hospital Bergmannsheil, Ruhr University Bochum,Bochum, Germany
  14. Department of Cognitive Psychology, Ruhr University Bochum,Bochum, Germany
  15. Institute of Psychology, Department of Educational Sciences and Psychology, TU Dortmund University,Dortmund, Germany
  16. Department of Psychiatry and Psychotherapy, Center for Mind, Brain and Behavior, Philipps-Universität Marburg,Marburg, Germany
  17. Genetic Psychology Lab, Ruhr University Bochum,Bochum, Germany
  18. Department of Biopsychology, Ruhr University Bochum,Bochum, Germany
  19. Research Center One Health Ruhr, Bochum, Germany
  20. High Field and Hybrid MR Imaging, University Hospital Essen,Essen, Germany
Journal: Nature communications, volume 17, issue 1, article 3780
Dates: received 24 July 2025; accepted 30 March 2026; published online 23 April 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1038/s41467-026-71830-0 · PMID 42026055 · PMCID PMC13109375 · OpenAlex W4410092460
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: human (organism), cognitive (subfield)
Methods: Connectivity, Statistics, Smoothing, state filtering, decompositions, Machine learning, fMRI & imaging
Keywords: Extinction, Human behaviour
MeSH: Cognition*, Extinction, Psychological*, Fear*, Individuality*, Learning*, Adult, Amygdala, Brain, Brain Mapping, Female, Gyrus Cinguli, Hippocampus, Humans, Magnetic Resonance Imaging, Male, Prefrontal Cortex, Young Adult (* major topic)
Topic: Cultural Differences and Values (Social Psychology, Psychology), according to OpenAlex
Funding: Deutsche Forschungsgemeinschaft (DFG SFB 1280 “Extinction Learning” (Project Nr. 316803389))
Citations: not cited yet (Europe PMC); 89 references in the paper

Abstract

The ability to acquire new information and to modify previously learned knowledge are critical in an ever-changing world. However, the efficacy of learning is notably variable among individuals, with extinction learning being the epitome of such variability. Abundant studies have identified a core network of brain regions including the amygdala, hippocampus, dorsal anterior cingulate cortex (ACC), ventromedial prefrontal cortex (PFC) and, more recently, the cerebellum, as key players in learning and extinction. Yet, the precise interactions within this network and their relationship to individual learning abilities and extinction have remained largely unexplored. In the present study, we examined how functional (FC), effective (EC), and structural (SC) connectivity patterns in the core learning network allow the prediction of individual differences in the efficacy of learning, extinction, and renewal. Analysing a large dataset of over 500 participants across a multitude of paradigms, our results revealed that FC predicted better acquisition, with a central role of ACC and hippocampus, whereas SC, involving ACC and amygdala, predicted higher levels of extinction learning. EC results suggested a predominantly inhibitory coupling among core learning network nodes, with paradigm-specific EC connectivity patterns predicting learning. Our predictions not only generalised between fear and cognitive predictive learning paradigms but were also successful in predicting learning from task-related FC and simulated data. Together, these results describe the multimodal neural determinants of learning, extinction, and renewal, and may inform individualised interventions for affective disorders based on neural connectivity patterns.

Reproduced under the paper's license (CC BY), from the paper cited above.

Repository

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

caadgomes/extinction-learning-study

License: none: the authors keep all their rights
State: the link answers, verified on 29 September 2026
Evidence: files inventoried
Commit: fee4711f283aecc8a70bc17eb87db3336a2a5874, 28 February 2026
Languages: Python (7), MATLAB (5), R (5)
Size: 73 files, 17 scripts
Software Heritage: not archived
Found in: “Code availability”
Holds: README, environment (requirements.txt)
Not found: license file, CITATION.cff, tests, continuous integration, documentation
Tools: pandas (7 files), NumPy (6 files), NiBabel (5 files), Nipype (5 files), FreeSurfer (4 files), FSL (4 files), tidyverse (4 files), Nilearn (3 files), SciPy (3 files), SPM (3 files), AFNI (2 files), ANTs (2 files), car (2 files), caret (2 files), emmeans (2 files), glmnet (2 files), scikit-learn (2 files), Brain Connectivity Toolbox (1 file), broom (1 file), ggplot2 (1 file), lmerTest (1 file), MNE-Python (1 file), MRtrix3 (1 file), pydicom (1 file)
Availability: 1 check, the latest on 29 September 2026: the link answers
  • 29 September 2026: the link answers
18 files

Code availability

The code for data preprocessing and analysis is available at https://github.com/caadgomes/extinction-learning-study.

Reproduced under the paper's license (CC BY), from the paper cited above.

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

Public sharing of the raw data is not permitted because participant consent and ethics approvals do not allow unrestricted public data sharing, and the datasets are subject to institutional and legal data-sharing agreements across the contributing institutions. Raw data are available from the corresponding author upon reasonable request and subject to approval by the contributing institutions and a data-sharing agreement where required. Access will be granted to qualified researchers for non-commercial scientific research purposes; decisions are typically made within 4–6 weeks. Source data are provided with this paper.

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

Recorded: type, language, journal, volume, issue, pages, dates, 27 authors, 2 keywords, 17 MeSH terms, 1 funder, 87 references.

Cite

This paper

Gomes, C. A., Bach, D. R., Razi, A., Batsikadze, G., Elsenbruch, S., Engler, H., Ernst, T. M., Fellner, M. C., Fraenz, C., Genç, E., Klass, A., Labrenz, F., Lissek, S., Merz, C. J., Metzen, D., Nostadt, A., Pawlik, R. J., Schneider, J. E., Tegenthoff, M., . . . Axmacher, N. (2026). Predicting individual differences of fear and cognitive learning and extinction. Nature communications, 17(1), 3780. https://doi.org/10.1038/s41467-026-71830-0

BibTeX

@article{gomes2026predicting,
author = {Gomes, C. A. and Bach, D. R. and Razi, A. and Batsikadze, G. and Elsenbruch, S. and Engler, H. and Ernst, T. M. and Fellner, M. C. and Fraenz, C. and Genç, E. and Klass, A. and Labrenz, F. and Lissek, S. and Merz, C. J. and Metzen, D. and Nostadt, A. and Pawlik, R. J. and Schneider, J. E. and Tegenthoff, M. and Thieme, A. and Wolf, O. T. and Güntürkün, O. and Quick, H. H. and Kumsta, R. and Timmann, D. and Spisak, T. and Axmacher, N.},
title = {{Predicting individual differences of fear and cognitive learning and extinction}},
journal = {Nature communications},
year = {2026},
month = apr,
volume = {17},
number = {1},
pages = {3780},
publisher = {Nature Publishing Group},
issn = {2041-1723},
doi = {10.1038/s41467-026-71830-0},
url = {https://doi.org/10.1038/s41467-026-71830-0},
pmid = {42026055},
pmcid = {PMC13109375}
}

RIS

TY - JOUR
AU - Gomes, C. A.
AU - Bach, D. R.
AU - Razi, A.
AU - Batsikadze, G.
AU - Elsenbruch, S.
AU - Engler, H.
AU - Ernst, T. M.
AU - Fellner, M. C.
AU - Fraenz, C.
AU - Genç, E.
AU - Klass, A.
AU - Labrenz, F.
AU - Lissek, S.
AU - Merz, C. J.
AU - Metzen, D.
AU - Nostadt, A.
AU - Pawlik, R. J.
AU - Schneider, J. E.
AU - Tegenthoff, M.
AU - Thieme, A.
AU - Wolf, O. T.
AU - Güntürkün, O.
AU - Quick, H. H.
AU - Kumsta, R.
AU - Timmann, D.
AU - Spisak, T.
AU - Axmacher, N.
TI - Predicting individual differences of fear and cognitive learning and extinction
T2 - Nature communications
J2 - Nat Commun
PY - 2026
DA - 2026/04/23
VL - 17
IS - 1
SP - 3780
SN - 2041-1723
PB - Nature Publishing Group
DO - 10.1038/s41467-026-71830-0
UR - https://doi.org/10.1038/s41467-026-71830-0
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s41467-026-71830-0",
"type": "article-journal",
"title": "Predicting individual differences of fear and cognitive learning and extinction",
"container-title": "Nature communications",
"author": [
{
"family": "Gomes",
"given": "C. A."
},
{
"family": "Bach",
"given": "D. R."
},
{
"family": "Razi",
"given": "A."
},
{
"family": "Batsikadze",
"given": "G."
},
{
"family": "Elsenbruch",
"given": "S."
},
{
"family": "Engler",
"given": "H."
},
{
"family": "Ernst",
"given": "T. M."
},
{
"family": "Fellner",
"given": "M. C."
},
{
"family": "Fraenz",
"given": "C."
},
{
"family": "Genç",
"given": "E."
},
{
"family": "Klass",
"given": "A."
},
{
"family": "Labrenz",
"given": "F."
},
{
"family": "Lissek",
"given": "S."
},
{
"family": "Merz",
"given": "C. J."
},
{
"family": "Metzen",
"given": "D."
},
{
"family": "Nostadt",
"given": "A."
},
{
"family": "Pawlik",
"given": "R. J."
},
{
"family": "Schneider",
"given": "J. E."
},
{
"family": "Tegenthoff",
"given": "M."
},
{
"family": "Thieme",
"given": "A."
},
{
"family": "Wolf",
"given": "O. T."
},
{
"family": "Güntürkün",
"given": "O."
},
{
"family": "Quick",
"given": "H. H."
},
{
"family": "Kumsta",
"given": "R."
},
{
"family": "Timmann",
"given": "D."
},
{
"family": "Spisak",
"given": "T."
},
{
"family": "Axmacher",
"given": "N."
}
],
"container-title-short": "Nat Commun",
"volume": "17",
"issue": "1",
"page": "3780",
"DOI": "10.1038/s41467-026-71830-0",
"PMID": "42026055",
"PMCID": "PMC13109375",
"ISSN": "2041-1723",
"publisher": "Nature Publishing Group",
"URL": "https://doi.org/10.1038/s41467-026-71830-0",
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
23
]
]
}
}

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-025-63078-x [code]
Neural correlates of human fear conditioning and sources of variability in 2199 individuals.
Journal: Nature communications
In common: FSL, NiBabel, scikit-learn, 3 other tools, 3 references, 4 authors
[2] doi:10.1038/s41562-025-02268-5 [code]
Representational dynamics during extinction of fear memories in the human brain.
Journal: Nature human behaviour
In common: FreeSurfer, 9 references, 3 authors
[3] doi:10.1016/j.neuroimage.2021.118843 [code]
Functional brain network community structure in childhood: Unfinished territories and fuzzy boundaries.
Journal: NeuroImage
In common: Nipype, pydicom, Brain Connectivity Toolbox, 14 other tools, 2 references
[4] doi:10.1016/j.nicl.2026.103987 [code]
Remote cortical degeneration related to structural connectivity following recent small subcortical infarcts.
Journal: NeuroImage. Clinical
In common: MRtrix3, Nipype, pydicom, 14 other tools, 1 reference
[5] doi:10.7554/elife.105126 [code]
Distinct representational properties of cues and contexts shape fear and reversal learning.
Journal: eLife
In common: emmeans, lmerTest, Nilearn, 4 other tools, 4 references, 2 authors
[6] doi:10.1002/hbm.26144 [code]
Benchmarking the generalizability of brain age models: Challenges posed by scanner variance and prediction bias.
Journal: Human brain mapping
In common: MRtrix3, Nipype, caret, 13 other tools
[7] doi:10.1162/netn_a_00330 [code]
The human brain connectome weighted by the myelin content and total intra-axonal cross-sectional area of white matter tracts.
Journal: Network neuroscience (Cambridge, Mass.)
In common: MRtrix3, Nipype, Brain Connectivity Toolbox, 12 other tools, 2 references
[8] doi:10.1038/s41467-023-42053-4 [code]
Enhanced brain structure-function tethering in transmodal cortex revealed by high-frequency eigenmodes.
Journal: Nature communications
In common: MRtrix3, glmnet, Nipype, 10 other tools, 2 references
[9] doi:10.1038/s41598-023-47704-6
Dopaminergic D2-like receptor stimulation affects attention on contextual information and modulates BOLD activation of extinction-related brain areas.
Journal: Scientific reports
In common: cognitive, 5 references, 2 authors
[10] doi:10.1038/s41467-026-68698-5 [code]
The network architecture of general intelligence in the human connectome.
Journal: Nature communications
In common: MRtrix3, glmnet, caret, 12 other tools

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

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

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