OSCR

High-resolution electrophysiological mapping of effective connectivity of lateral prefrontal cortex.

Code ↔ Paper

9 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 9 matches
  1. [1] § Materials and methods › SEEG data ↔ compute_atlas_mats.py, lines 42–81 · score 0.70 · 0–100 ms, excluding LPFC, left LPFC, LPFC parcels, ipsilateral, lh
  2. [2] § Materials and methods › LPFC definition and parcellation ↔ compute_atlas_mats.py, lines 42–81 · score 0.69 · excluding LPFC, right LPFC, left LPFC, LPFC parcels, atlas, parcellations
  3. [3] § Materials and methods › SEEG data ↔ figures.py, lines 126–166 · score 0.67 · excluding LPFC, right hemisphere, Afferent connections, LPFC parcels, Efferent connections, ipsilateral
  4. [4] § Materials and methods › LPFC definition and parcellation ↔ figures.py, lines 70–124 · score 0.64 · Lausanne parcellation resolutions, LPFC definition, contacts, brain, stimulation, IFG
  5. [5] § Materials and methods › Statistical analysis ↔ tools/stats.py, lines 75–91 · score 0.62 · Agresti Coull, confidence intervals
  6. [6] § Materials and methods › LPFC definition and parcellation ↔ compute_atlas_mats.py, lines 83–125 · score 0.55 · Lausanne parcellation resolutions, coverage, definition, brain, stimulation, IFG
  7. [7] § Materials and methods › LPFC definition and parcellation ↔ compute_atlas/compute_atlas_brain_avg.py, lines 15–155 · score 0.54 · excluding LPFC, LPFC parcels, atlas, parcellations, Lausanne2008, definition
  8. [8] § Results › Connectivity from LPFC to brain functional networks ↔ Definitions.py, lines 308–384 · score 0.53 · fronto parietal, functional networks, limbic, rostral, posterior, frontal
  9. [9] § Materials and methods › SEEG data ↔ compute_atlas/compute_atlas_LPFC_Eff_Aff.py, lines 18–68 · score 0.51 · age, centres, pulses, intensity, aggregated, contact

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

Python · 340 lines · 25 KB · no license · 3 matches

  1. #Statistic correction and shaping of atlas matrices.
  2. #New version of 'compute_and_plot' independent of plotting.
  3. import os
  4. from numpy.core.defchararray import startswith
  5. import matrices
  6. import numpy as np
  7. import Definitions
  8. from parcellation2.parcellation2 import Parcellation2
  9. # %% DEFINITIONS - X rows ; Y columns of the matrix
  10. L_s = Definitions.L_s
  11. res33 = Definitions.res33
  12. res125 = Definitions.res125
  13. res250 = Definitions.res250 # FN analysis
  14. res500 = Definitions.res500
  15. # Parcellation labels
  16. labels_33 = Definitions.labels_33
  17. labels_125 = Definitions.labels_125
  18. labels_250 = Definitions.labels_250
  19. labels_500 = Definitions.labels_500
  20. # For plotting
  21. labels_path = Definitions.labels_path
  22. labels_path_33 = Definitions.labels_path_33
  23. labels_path_125 = Definitions.labels_path_125
  24. labels_path_250 = Definitions.labels_path_250
  25. labels_path_500 = Definitions.labels_path_500
  26. # Selection of labels in use
  27. # Labels 33 corrected in Definitions. If problems with no labels found or only subcortical you might be using a version with 'ctx-lh-' ...
  28. labels_rec_33 = [name for name in labels_33 if name.startswith("lh.") or name.startswith("rh.") or name == 'Left-Hippocampus' or name == 'Left-Amygdala' or name == 'Right-Hippocampus' or name == 'Right-Amygdala']
  29. p = Parcellation2(Definitions.parcellation_path, res33)
  30. index_33 = [p.get_index_by_name(i) for i in labels_33]
  31. index_rec_33 = np.transpose([p.get_index_by_name(i) for i in labels_rec_33])
  32. # index all (other parcellations with specific selections or none)
  33. p = Parcellation2(Definitions.parcellation_path, res125)
  34. index_125 = [p.get_index_by_name(i) for i in labels_125]
  35. p = Parcellation2(Definitions.parcellation_path, res250)
  36. index_250 = [p.get_index_by_name(i) for i in labels_250]
  37. p = Parcellation2(Definitions.parcellation_path, res500)
  38. index_500 = [p.get_index_by_name(i) for i in labels_500]
  39. def compute_mats (base_path, output_folder, collapse_conf_name ,N_thresh, N_imp_thresh, gral_tw = [0,100], dir_tw = [0,50], ind_tw = [100,400], min_cb_dir = 20, max_cb_dir= 35, min_cb_ind = 150, max_cb_ind = 200, max_vb_gral = 80, max_avg = 0.175, min_avg = 0.1, max_cb_p = 0.25, max_p_gral = 0.5, max_cb_N = 10000, min_cb_N = 50) :
  40. #, max_ci = 0.1, n_imp = 3, min_n_suc = 50, min_n_fail = 50, min_n_feat = 50
  41. # %% AVERAGE CONNECTIVITY :
  42. # LPFC to AVG BRAIN (FIG 2B)
  43. # AVG LPFC- AVG BRAIN (not ploted)
  44. # Using square matrix of LPFC parcellation (X-X). All LPFC merged as a block toward all the rest of the ipsilateral brain (excluding LPFC).
  45. # Analysis to prove general efferent-afferent values of the ROI as one. AVG done in compute_atlas_brain_avg
  46. path_output_avg_all = os.path.join(output_folder, 'AVG_LPFC_AVG_all');os.makedirs(path_output_avg_all, exist_ok=True)
  47. # Left LPFC
  48. path_mat_avg_lpfc_avg_all_L_eff = os.path.join(base_path, 'lh_AVG_LPFC_AVG_all_eff', collapse_conf_name[0])
  49. path_mat_avg_lpfc_avg_all_L_aff = os.path.join(base_path, 'lh_AVG_LPFC_AVG_all_aff', collapse_conf_name[0])
  50. mat_all_avg_eff, N_all_avg_eff , I_all_avg_eff = matrices.atlas_mat(path_mat_avg_lpfc_avg_all_L_eff, [0,], [0,],path_output_avg_all, 'avg_lLPFC_brain_all_eff', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  51. mat_all_avg_aff , N_all_avg_aff, I_all_avg_aff = matrices.atlas_mat(path_mat_avg_lpfc_avg_all_L_aff, [0,], [0,],path_output_avg_all, 'avg_lLPFC_brain_all_aff', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  52. # Right LPFC
  53. path_mat_avg_lpfc_avg_all_R_eff = os.path.join(base_path, 'rh_AVG_LPFC_AVG_all_eff', collapse_conf_name[0])
  54. path_mat_avg_lpfc_avg_all_R_aff = os.path.join(base_path, 'rh_AVG_LPFC_AVG_all_aff', collapse_conf_name[0])
  55. mat_all_avg_eff, N_all_avg_eff , I_all_avg_eff = matrices.atlas_mat(path_mat_avg_lpfc_avg_all_R_eff, [0,], [0,],path_output_avg_all, 'avg_rLPFC_brain_all_eff', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  56. mat_all_avg_aff , N_all_avg_aff, I_all_avg_aff = matrices.atlas_mat(path_mat_avg_lpfc_avg_all_R_aff, [0,], [0,],path_output_avg_all, 'avg_rLPFC_brain_all_aff', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  57. # AVG LPFC parcels (Lausanne125) - BRAIN (FIG 2B)
  58. # ROI (LPFC) parcelled according to Lausanne2008-X towards the rest of the ipsilateral brain (excluding the ROI) merged as one.
  59. # Use mat xx, with x parcellatioin of roi (for the exclusion of the roi to be possible)
  60. path_output_avg = os.path.join(output_folder, 'AVG');os.makedirs(path_output_avg, exist_ok=True)
  61. # Left LPFC - all
  62. path_mat_avg_lpfc_avg_all_L_eff = os.path.join(base_path, 'lh_AVG_eff', collapse_conf_name[0])
  63. path_mat_avg_lpfc_avg_all_L_aff = os.path.join(base_path, 'lh_AVG_aff', collapse_conf_name[0])
  64. l_LPFC = [l for l in Definitions.roi_dlpfc_ifg_125 if l.startswith('lh')]
  65. mat_all_avg_eff, N_all_avg_eff , I_all_avg_eff = matrices.atlas_mat(path_mat_avg_lpfc_avg_all_L_eff, np.arange(0,len(l_LPFC)), [0,],path_output_avg, 'lLPFC_brain_all_eff', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  66. mat_all_avg_aff , N_all_avg_aff, I_all_avg_aff = matrices.atlas_mat(path_mat_avg_lpfc_avg_all_L_aff, [0,], np.arange(0,len(l_LPFC)), path_output_avg, 'lLPFC_brain_all_aff', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  67. # Right LPFC
  68. path_mat_avg_lpfc_avg_all_R_eff = os.path.join(base_path, 'rh_AVG_eff', collapse_conf_name[0])
  69. path_mat_avg_lpfc_avg_all_R_aff = os.path.join(base_path, 'rh_AVG_aff', collapse_conf_name[0])
  70. r_LPFC = [l for l in Definitions.roi_dlpfc_ifg_125 if l.startswith('rh')]
  71. mat_all_avg_eff, N_all_avg_eff , I_all_avg_eff = matrices.atlas_mat(path_mat_avg_lpfc_avg_all_R_eff, np.arange(0,len(r_LPFC)), [0,],path_output_avg, 'rLPFC_brain_all_eff', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  72. mat_all_avg_aff , N_all_avg_aff, I_all_avg_aff = matrices.atlas_mat(path_mat_avg_lpfc_avg_all_R_aff, [0,], np.arange(0,len(r_LPFC)), path_output_avg, 'rLPFC_brain_all_aff', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  73. #%% PARCELLATION RESOLUTIONS (FIG1D-E-F)
  74. # Corrected p for square matrices of Lausanne parcellations 33, 125, 500.
  75. # Stimulation on selected DLPFC equivalent parcels
  76. path_resolutions = os.path.join(output_folder, 'Resolutions');os.makedirs(path_resolutions, exist_ok=True)
  77. #Resolution 1
  78. path_33_33 = os.path.join(base_path, res33 + '_' + res33)
  79. path_mats_33_33 = os.path.join(path_33_33, collapse_conf_name[0])
  80. label_stim = "lh.rostralmiddlefrontal" #Lau33 stim parcel
  81. p_33, N_33, I_33 = matrices.atlas_mat(path_mats_33_33, labels_rec_33.index(label_stim) , index_rec_33 , path_resolutions,f'stim33to33_{gral_tw[0]}_{gral_tw[1]}_ms', flag_delays= False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  82. p_stim_33, N_stim_33, I_stim_33= matrices.atlas_mat(path_mats_33_33, labels_rec_33.index(label_stim) , labels_rec_33.index(label_stim) , path_resolutions,f'stim33tostim33_{gral_tw[0]}_{gral_tw[1]}_ms', flag_delays= False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  83. #Resolution 3
  84. path_125_125 = os.path.join(base_path, res125 + '_' + res125)
  85. path_mats_125_125 = os.path.join(path_125_125, collapse_conf_name[0])
  86. label_stim = "lh.rostralmiddlefrontal_1" #Lau125 stim parcel
  87. p_125, N_125, I_125= matrices.atlas_mat(path_mats_125_125, labels_125.index(label_stim) , index_125 , path_resolutions,f'stim125to125_{gral_tw[0]}_{gral_tw[1]}_ms', flag_delays= False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  88. p_stim_125, N_stim_125, I_stim_125 = matrices.atlas_mat(path_mats_125_125, labels_125.index(label_stim) , labels_125.index(label_stim) , path_resolutions,f'stim125tostim125_{gral_tw[0]}_{gral_tw[1]}_ms', flag_delays= False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  89. #Resolution 5
  90. path_500_500 = os.path.join(base_path, res500 + '_' + res500)
  91. path_mats_500_500 = os.path.join(path_500_500, collapse_conf_name[0])
  92. label_stim = "lh.rostralmiddlefrontal_22" #Lau500 stim parcel
  93. p_500, N_500, I_500= matrices.atlas_mat(path_mats_500_500, labels_500.index(label_stim) , index_500 , path_resolutions,f'stim500to500_{gral_tw[0]}_{gral_tw[1]}_ms', flag_delays= False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  94. p_stim_500, N_stim_500, I_stim_500= matrices.atlas_mat(path_mats_500_500, labels_500.index(label_stim) , labels_500.index(label_stim) , path_resolutions,f'stim500tostim500_{gral_tw[0]}_{gral_tw[1]}_ms', flag_delays= False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  95. #%% EFFERENT CONNECTIVITY (FIG 2E and FIG 2C - first row) - CONNECTIVITY FROM X to Y
  96. # Matrices of combined resolution xy. Fine resolution x over roi and bigger resolution y over all the brain.
  97. # From the raw original matrix we take the lines of roi stimulated parcels towards columns of interest (in our case all cortical parcels + Amygdala and Hyppocampus)
  98. # This is in the matrix of parcellations x to y
  99. # We use xx matrix for stimulations to the roi recorded by the roi.
  100. path_125_33 = os.path.join(base_path, res125 + '_' + res33)
  101. path_mats_125_33 = os.path.join(path_125_33, collapse_conf_name[0])
  102. path_125_125 = os.path.join(base_path, res125 + '_' + res125)
  103. path_mats_125_125 = os.path.join(path_125_125, collapse_conf_name[0])
  104. path_folder_output = os.path.join(output_folder, res125 + '_' + res33);os.makedirs(path_folder_output, exist_ok=True)
  105. #p_xy, N_xy, I_xy, D_med_xy, D_mean_xy, quant25_xy, quant75_xy = matrices.atlas_mat(path_mats_125_33,Definitions.index_dlpfc_ifg,index_rec_33, path_folder_output,'125to33_' + gral_tw,flag_delays=True, min_n_suc=N,min_n_fail=N, min_n_feat=N,min_n_impl=n_imp, max_ci=max_ci)
  106. #p_xy, N_xy, I_xy= matrices.atlas_mat(path_mats_125_33,Definitions.index_dlpfc_ifg,index_rec_33, path_folder_output,f'125to33_{gral_tw[0]}_{gral_tw[1]}_ms',flag_delays=False, N_thresh=N)
  107. p_xy, N_xy, I_xy, D_med_xy, D_mean_xy= matrices.atlas_mat(path_mats_125_33, Definitions.index_dlpfc_ifg, index_rec_33,path_folder_output, f'125to33_{gral_tw[0]}_{gral_tw[1]}_ms',flag_delays=True, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  108. not_nan_xy = np.sum(~np.isnan(p_xy));coverage_xy = not_nan_xy / p_xy.size
  109. print("Coverage eff xy: ", coverage_xy)
  110. coverage_file_path = os.path.join(path_folder_output, 'coverage_xy.txt')
  111. with open(coverage_file_path, 'w') as f: f.write(f"Coverage: {coverage_xy:.6f}\n")
  112. #p_xx, N_xx, I_xx, D_med_xx, D_mean_xx, quant25_xx, quant75_xx = matrices.atlas_mat(path_mats_125_125,Definitions.index_dlpfc_ifg,Definitions.index_dlpfc_ifg,path_folder_output,'125to125_' + gral_tw,flag_delays=True, min_n_suc=N,min_n_fail=N, min_n_feat=N, min_n_impl=n_imp, max_ci=max_ci)
  113. #p_xx, N_xx, I_xx = matrices.atlas_mat(path_mats_125_125,Definitions.index_dlpfc_ifg,Definitions.index_dlpfc_ifg,path_folder_output,f'125to125_{gral_tw[0]}_{gral_tw[1]}_ms', flag_delays=False, N_thresh=N)
  114. p_xx, N_xx, I_xx,D_med_xx, D_mean_xx, = matrices.atlas_mat(path_mats_125_125, Definitions.index_dlpfc_ifg, Definitions.index_dlpfc_ifg,path_folder_output, f'125to125_{gral_tw[0]}_{gral_tw[1]}_ms',flag_delays=True, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  115. not_nan_xx = np.sum(~np.isnan(p_xx));coverage_xx = not_nan_xx / p_xx.size
  116. print("Coverage eff xx: ", coverage_xx)
  117. coverage_file_path = os.path.join(path_folder_output, 'coverage_xx.txt')
  118. with open(coverage_file_path, 'w') as f: f.write(f"Coverage: {coverage_xx:.6f}\n")
  119. # %% AFFERENT CONNECTIVITY (FIG 2E and FIG 2C - second row) - CONNECTIVITY FROM Y to X
  120. # From the raw original matrix we take the lines of roi recorded parcels of stimulations done on columns of interest on the rest of the brain
  121. path_33_125 = os.path.join(base_path, res33 + '_' + res125)
  122. path_mats_33_125 = os.path.join(path_33_125, collapse_conf_name[0])
  123. # The square ones (xx) are repeted from eff, but this way its independent
  124. path_125_125 = os.path.join(base_path, res125 + '_' + res125)
  125. path_mats_125_125 = os.path.join(path_125_125, collapse_conf_name[0])
  126. path_folder_output_aff = os.path.join(output_folder, res33 + '_' + res125)
  127. os.makedirs(path_folder_output_aff, exist_ok=True)
  128. # probability
  129. #p_yx, N_yx, I_yx, D_med_yx, D_mean_yx, quant25_yx, quant75_yx = matrices.atlas_mat(path_mats_33_125, index_rec_33,Definitions.index_dlpfc_ifg,path_folder_output_aff,'33to125_' + gral_tw,flag_delays=True, min_n_suc=N, min_n_fail=N, min_n_feat=N,min_n_impl=n_imp, max_ci=max_ci)
  130. #p_yx, N_yx, I_yx= matrices.atlas_mat(path_mats_33_125, index_rec_33,Definitions.index_dlpfc_ifg,path_folder_output_aff,f'33to125_{gral_tw[0]}_{gral_tw[1]}_ms',flag_delays=False, N_thresh=N)
  131. p_yx, N_yx, I_yx, D_med_yx, D_mean_yx = matrices.atlas_mat(path_mats_33_125, index_rec_33, Definitions.index_dlpfc_ifg,path_folder_output_aff, f'33to125_{gral_tw[0]}_{gral_tw[1]}_ms',flag_delays=True, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  132. not_nan_yx = np.sum(~np.isnan(p_yx));coverage_yx = not_nan_yx / p_yx.size
  133. print("Coverage aff xy: ", coverage_yx)
  134. coverage_file_path = os.path.join(path_folder_output_aff, 'coverage_yx.txt')
  135. with open(coverage_file_path, 'w') as f: f.write(f"Coverage: {coverage_yx:.6f}\n")
  136. #p_xx, N_xx, I_xx, D_med_xx, D_mean_xx, quant25_yx, quant75_xy = matrices.atlas_mat(path_mats_125_125,Definitions.index_dlpfc_ifg,Definitions.index_dlpfc_ifg,path_folder_output_aff,'125to125_' + gral_tw,flag_delays=True, min_n_suc=N,min_n_fail=N, min_n_feat=N,min_n_impl=n_imp, max_ci=max_ci)
  137. #p_xx, N_xx, I_xx= matrices.atlas_mat(path_mats_125_125,Definitions.index_dlpfc_ifg,Definitions.index_dlpfc_ifg,path_folder_output_aff,f'125to125_{gral_tw[0]}_{gral_tw[1]}_ms',flag_delays=False, N_thresh=N)
  138. p_xx, N_xx, I_xx, D_med_xx, D_mean_xx= matrices.atlas_mat(path_mats_125_125, Definitions.index_dlpfc_ifg, Definitions.index_dlpfc_ifg,path_folder_output_aff, f'125to125_{gral_tw[0]}_{gral_tw[1]}_ms',flag_delays=True, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  139. not_nan_xx = np.sum(~np.isnan(p_xx));coverage_xx = not_nan_xx / p_xx.size
  140. coverage_file_path = os.path.join(path_folder_output_aff, 'coverage_xx.txt')
  141. with open(coverage_file_path, 'w') as f: f.write(f"Coverage: {coverage_xx:.6f}\n")
  142. print("Coverage aff xx: ", coverage_xx)
  143. # %% MERGED ROIS: DLPFC & IFG. NUMBER of RECORDINGS (FIG 3A) DIRECT (FIG 3B) & INDIRECT (FIG 3C) CONNECTIVITY (probability and delays)
  144. # DLPFC merged (using Lausanne x) towards the rest of the brain in Lausanne y
  145. # DIRECT
  146. path_output_dlpfc = os.path.join(output_folder, 'Mean_ROI_Eff')
  147. os.makedirs(path_output_dlpfc, exist_ok=True)
  148. output_paths_dlpfc = os.path.join(path_output_dlpfc, f'Direct_connectivity_{dir_tw[0]}_{dir_tw[1]}_ms')
  149. os.makedirs(output_paths_dlpfc, exist_ok=True)
  150. # - DIRECT MATRICES
  151. #all
  152. path_dir_roi_33 = os.path.join(base_path, 'DLPFC_IFG_to_Lausanne2008-33')
  153. stim_parcels_merged = np.loadtxt(os.path.join(path_dir_roi_33, 'stim_parcels_merged.txt'), dtype=str) #stim parcels is roi merged (created when compute atlas : lh.dlpfc, rh.dlpfc, lh.ifg, rh.ifg
  154. stim_parcels_merged = stim_parcels_merged.tolist()
  155. index_stims = [stim_parcels_merged.index(i) for i in stim_parcels_merged]
  156. rec_parcels = np.loadtxt(os.path.join(path_dir_roi_33, 'rec_parcels_Lausanne2008-33.txt'), dtype=str)
  157. rec_parcels = rec_parcels.tolist()
  158. index_recs = [rec_parcels.index(i) for i in labels_rec_33] #only labels I need, index from real atlas list. #TODO: maybe compute directly only labels wanted
  159. # Mats
  160. path_dir_roi_33 = os.path.join(base_path, 'DLPFC_IFG_to_Lausanne2008-33', 'Direct', collapse_conf_name[1])
  161. # stim_parcels_merged_fig_names = [f'{l}_to_33' for l in stim_parcels_merged]
  162. p_xy_ldlpfc, N_xy_ldlpfc, I_xy_ldlpfc, D_med_xy_ldlpfc, D_mean_xy_ldlpfc = matrices.atlas_mat(path_dir_roi_33, index_stims,index_recs,output_paths_dlpfc,'roi_to_33', flag_delays=True, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  163. #local
  164. path_dir_roi_roi = os.path.join(base_path, 'DLPFC_IFG_to_DLPFC_IFG')
  165. stim_parcels_merged = np.loadtxt(os.path.join(path_dir_roi_roi,'stim_parcels_merged.txt'), dtype=str) # stim parcels is roi merged (created when compute atlas : lh.dlpfc, rh.dlpfc, lh.ifg, rh.ifg
  166. stim_parcels_merged = stim_parcels_merged.tolist()
  167. index_stims = [stim_parcels_merged.index(i) for i in stim_parcels_merged]
  168. rec_parcels = np.loadtxt(os.path.join(path_dir_roi_roi, 'rec_parcels_merged.txt'), dtype=str)
  169. rec_parcels = rec_parcels.tolist()
  170. index_recs = [rec_parcels.index(i) for i in rec_parcels] # just to avoid mistakes, it should be = to stim_parcels_merged
  171. path_dir_roi_roi = os.path.join(base_path, 'DLPFC_IFG_to_DLPFC_IFG', 'Direct', collapse_conf_name[1])
  172. # stim_parcels_merged_fig_names = [f'{l}_to_{l}' for l in stim_parcels_merged]
  173. p_xx_ldlpfc, N_xx_ldlpfc, I_xx_ldlpfc, D_med_xx_ldlpfc, D_mean_xx_ldlpfc = matrices.atlas_mat(path_dir_roi_roi,index_stims, index_stims, output_paths_dlpfc, 'roi_to_roi',flag_delays=True, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  174. # INDIRECT
  175. output_paths_dlpfc = os.path.join(path_output_dlpfc, f'Indirect_connectivity_{ind_tw[0]}_{ind_tw[1]}_ms')
  176. os.makedirs(output_paths_dlpfc, exist_ok=True)
  177. # all
  178. path_ind_roi_33 = os.path.join(base_path, 'DLPFC_IFG_to_Lausanne2008-33')
  179. stim_parcels_merged = np.loadtxt(os.path.join(path_ind_roi_33, 'stim_parcels_merged.txt'),dtype=str) # stim parcels is roi merged (created when compute atlas : lh.dlpfc, rh.dlpfc, lh.ifg, rh.ifg
  180. stim_parcels_merged = stim_parcels_merged.tolist()
  181. index_stims = [stim_parcels_merged.index(i) for i in stim_parcels_merged]
  182. rec_parcels = np.loadtxt(os.path.join(path_ind_roi_33, 'rec_parcels_Lausanne2008-33.txt'), dtype=str)
  183. rec_parcels = rec_parcels.tolist()
  184. index_recs = [rec_parcels.index(i) for i in labels_rec_33] # only labels I need, index from real atlas list. #TODO: maybe compute directly only labels wanted
  185. # Mats
  186. path_ind_roi_33 = os.path.join(base_path, 'DLPFC_IFG_to_Lausanne2008-33', 'Indirect', collapse_conf_name[2])
  187. # stim_parcels_merged_fig_names = [f'{l}_to_33' for l in stim_parcels_merged]
  188. p_xy_ldlpfc, N_xy_ldlpfc, I_xy_ldlpfc, D_med_xy_ldlpfc, D_mean_xy_ldlpfc = matrices.atlas_mat(path_ind_roi_33, index_stims,index_recs,output_paths_dlpfc, 'roi_to_33', flag_delays=True, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  189. # local
  190. path_ind_roi_roi = os.path.join(base_path, 'DLPFC_IFG_to_DLPFC_IFG')
  191. stim_parcels_merged = np.loadtxt(os.path.join(path_ind_roi_roi, 'stim_parcels_merged.txt'),dtype=str) # stim parcels is roi merged (created when compute atlas : lh.dlpfc, rh.dlpfc, lh.ifg, rh.ifg
  192. stim_parcels_merged = stim_parcels_merged.tolist()
  193. index_stims = [stim_parcels_merged.index(i) for i in stim_parcels_merged]
  194. rec_parcels = np.loadtxt(os.path.join(path_ind_roi_roi, 'rec_parcels_merged.txt'), dtype=str)
  195. rec_parcels = rec_parcels.tolist()
  196. index_recs = [rec_parcels.index(i) for i in rec_parcels] # just to avoid mistakes, it should be = to stim_parcels_merged
  197. path_ind_roi_roi = os.path.join(base_path, 'DLPFC_IFG_to_DLPFC_IFG', 'Indirect', collapse_conf_name[2])
  198. p_xx_ldlpfc, N_xx_ldlpfc, I_xx_ldlpfc, D_med_xx_ldlpfc, D_mean_xx_ldlpfc = matrices.atlas_mat(path_ind_roi_roi, index_stims, index_stims,output_paths_dlpfc,'roi_to_roi',flag_delays=True, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  199. # %% ROI CONNECTIVITY TO FUNCTIONAL NETWORKS (FIG 4C)
  200. # Connectivity from roi (Lausanne x) to functional networks as defined by Yeo et al. We compute the functional networks as mergeds of Lausanne 250 parcels.
  201. path_folder_funct = os.path.join(output_folder, 'Functional_Networks')
  202. os.makedirs(path_folder_funct, exist_ok=True)
  203. path_fn_data = os.path.join(base_path, 'Functional_Networks')
  204. stim_parcels = np.loadtxt(os.path.join(path_fn_data, 'stim_parcels.txt'),dtype=str)
  205. stim_parcels = stim_parcels.tolist()
  206. rec_fn = np.loadtxt(os.path.join(path_fn_data, 'rec_parcels_merged.txt'), dtype=str)
  207. rec_fn = rec_fn.tolist()
  208. path_fn_data = os.path.join(path_fn_data, collapse_conf_name[0])
  209. #Left fn
  210. index_stims_L = [stim_parcels.index(i) for i in stim_parcels if i.startswith('lh')]
  211. index_rec_fn_L = [i for i, name in enumerate(rec_fn) if name.startswith('lh.')]
  212. #_{gral_tw[0]}_{gral_tw[1]}ms - I used to save the tw it s computed with. But always general for fn
  213. p_net_eff, N_net_eff, I_net_eff = matrices.atlas_mat(path_fn_data, index_stims_L,index_rec_fn_L,path_folder_funct, 'Eff_roi_L_nets' , flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  214. #Right fn
  215. index_stims_R = [stim_parcels.index(i) for i in stim_parcels if i.startswith('rh')]
  216. index_rec_fn_R = [i for i, name in enumerate(rec_fn) if name.startswith('rh.')]
  217. p_net_eff, N_net_eff, I_net_eff = matrices.atlas_mat(path_fn_data, index_stims_R, index_rec_fn_R, path_folder_funct,'Eff_roi_R_nets', flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  218. #Segments
  219. path_folder_funct_segments = os.path.join(output_folder, 'Functional_Networks', 'Segmented_roi')
  220. os.makedirs(path_folder_funct_segments, exist_ok=True)
  221. path_fn_data_segments = os.path.join(base_path, 'Functional_Networks', 'Segmented_roi')
  222. stim_parcels_merged = np.loadtxt(os.path.join(path_fn_data_segments, 'stim_parcels_merged.txt'),dtype=str)
  223. stim_parcels = stim_parcels_merged.tolist()
  224. rec_fn = np.loadtxt(os.path.join(path_fn_data_segments, 'rec_parcels_merged.txt'), dtype=str)
  225. rec_fn = rec_fn.tolist()
  226. path_fn_data_segments = os.path.join(path_fn_data_segments, collapse_conf_name[0])
  227. #left and right, save on mat per segment (adapt to plot bars)
  228. for s_id in range(0, len(stim_parcels)) :
  229. stim_segment_tmp = stim_parcels[s_id]
  230. suffix = stim_segment_tmp.split('_')[-1] if '_' in stim_segment_tmp else stim_segment_tmp.split('.')[-1]
  231. #intra hemi p
  232. if stim_segment_tmp.startswith('lh.') :
  233. index_rec_fn = [i for i, name in enumerate(rec_fn) if name.startswith('lh.')]
  234. mat_name = 'l_'
  235. else :
  236. index_rec_fn = [i for i, name in enumerate(rec_fn) if name.startswith('rh.')]
  237. mat_name = 'r_'
  238. #mat_name
  239. if suffix == 'ifg' : mat_name = mat_name + 'IFG_nets'
  240. else: mat_name = mat_name + suffix + '_DLPFC_nets'
  241. p_segment_net, N_segment_net, I_segment_net = matrices.atlas_mat(path_fn_data_segments, [s_id,],index_rec_fn,path_folder_funct_segments, mat_name, flag_delays=False, N_thresh=N_thresh, N_imp_thresh=N_imp_thresh)
  242. def save_params_txt(output_folder,gral_tw,dir_tw,ind_tw,collapse_conf_name, N_thresh, N_imp_thresh, min_cb_dir, max_cb_dir,min_cb_ind,max_cb_ind,max_cb_gral,min_avg,max_avg,max_cb_p,max_p_gral,min_cb_N, max_cb_N):
  243. os.makedirs(output_folder, exist_ok=True)
  244. params_text = f"""
  245. Time Windows:
  246. General: {gral_tw}
  247. Direct: {dir_tw}
  248. Indirect: {ind_tw}
  249. Collapse Config Names:
  250. General: {collapse_conf_name[0]}
  251. Direct: {collapse_conf_name[1]}
  252. Indirect: {collapse_conf_name[2]}
  253. N recordings mask: {N_thresh}
  254. N implantations mask: {N_imp_thresh}
  255. Delays cb (ms):
  256. Direct min: {min_cb_dir}
  257. Direct max: {max_cb_dir}
  258. Indirect min: {min_cb_ind}
  259. Indirect max: {max_cb_ind}
  260. General max: {max_cb_gral}
  261. P avg cb:
  262. Min avg: {min_avg}
  263. Max avg: {max_avg}
  264. P thresholds:
  265. Max p for connections: {max_cb_p}
  266. Max p general: {max_p_gral}
  267. N cb:
  268. Min cb N: {min_cb_N}
  269. Max cb N: {max_cb_N}
  270. """
  271. with open(os.path.join(output_folder, 'params.txt'), 'w', encoding='utf-8') as f: f.write(params_text)
  272. def main():
  273. Zth = str(5)
  274. #Data : atlas generation output folders (containing matrices)
  275. base_path = r'F:\FTRACT\Data_LPFC_FTRACT'
  276. output_folder = os.path.join(base_path, f'Results_Zth{Zth}')
  277. gral_tw = [0,100] #'0_100ms'
  278. dir_tw = [0,50] #'0_50ms' # time window of 'direct connections'
  279. ind_tw = [100, 400] #'100_400ms' # time window of 'indirect connections'
  280. #collapse_conf_name general, direct, indirect
  281. collapse_conf_name = [f'max_peak_delay_{gral_tw[1]}__zth{Zth}___min_peak_delay_{gral_tw[0]}__zth{Zth}',f'max_peak_delay_{dir_tw[1]}__zth{Zth}___min_peak_delay_{dir_tw[0]}__zth{Zth}',f'max_peak_delay_{ind_tw[1]}__zth{Zth}___min_peak_delay_{ind_tw[0]}__zth{Zth}'] # Name of folder that saved the collapse, features inside.
  282. N_thresh= 50
  283. N_imp_thresh= 3
  284. # max_ci = 0.1 #not in use
  285. # delays
  286. # thresh_d = 20
  287. min_cb_dir = 20
  288. max_cb_dir = 35
  289. min_cb_ind = 150
  290. max_cb_ind = 200
  291. max_cb_gral = 80 # min 10
  292. # p avg
  293. max_avg = 0.175
  294. min_avg = 0.1
  295. # p
  296. max_cb_p = 0.25
  297. max_p_gral = 0.5
  298. # N
  299. max_cb_N = 10000
  300. min_cb_N = 50
  301. compute_mats(base_path, output_folder, collapse_conf_name, N_thresh, N_imp_thresh, gral_tw, dir_tw, ind_tw, min_cb_dir, max_cb_dir, min_cb_ind, max_cb_ind, max_cb_gral, max_avg, min_avg, max_cb_p, max_p_gral, max_cb_N, min_cb_N)
  302. save_params_txt(output_folder, gral_tw, dir_tw, ind_tw, collapse_conf_name, N_thresh, N_imp_thresh, min_cb_dir, max_cb_dir, min_cb_ind,max_cb_ind, max_cb_gral, min_avg, max_avg, max_cb_p, max_p_gral, min_cb_N, max_cb_N)
  303. if __name__ == "__main__":
  304. main()

compute_atlas_mats.py at commit 0589077, no license · at the source

Overview

  1. Aix Marseille Univ, INSERM, INS, Inst Neurosci Syst, Marseille 13005, France
  2. Université Grenoble Alpes, Inserm, U1216, Grenoble Institut Neurosciences, Grenoble 38000, France
  3. Department of Psychiatry & Behavioral Sciences, Stanford University School of Medicine, Stanford, CA 94305, USA
  4. Department of Radiology, Lausanne University Hospital and University of Lausanne (CHUV-UNIL), Lausanne 1011, Switzerland
  5. Faculty of Biology and Medicine, University of Lausanne, Lausanne 1015, Switzerland
  6. Wu Tsai Neurosciences Institute, Stanford University, Stanford, CA 94305, USA
  7. Veterans Affairs Palo Alto Healthcare System and Sierra Pacific Mental Illness, Research, Education and Clinical Center (MIRECC), Palo Alto, CA 94394, USA
  8. Department of Pediatric Neurosurgery, Fondation Lenval, Nice 06200, France
Journal: Brain : a journal of neurology, volume 149, issue 3, pages 963-975
Dates: received 19 February 2025; accepted 8 August 2025; published online 9 September 2025; in print March 2026
Type: Research article · Language: English
License: CC BY-NC
Identifiers: DOI 10.1093/brain/awaf317 · PMID 40924875 · PMCID PMC13016832 · OpenAlex W4414085794
Open access: hybrid, a free copy (OpenAlex)
Status: code verified
Categories: intracranial EEG (iEEG / ECoG / SEEG) (modality), human (organism), epilepsy (population), systems (subfield)
Methods: Spectral & time-frequency, Statistics, Preprocessing
Keywords: effective connectivity, brain stimulation, dorso-lateral prefrontal cortex, inferior frontal gyrus, stereoelectroencephalography (SEEG), cortico-cortical evoked potentials (CCEP)
MeSH: Brain Mapping*, Nerve Net*, Prefrontal Cortex*, Adolescent, Adult, Drug Resistant Epilepsy, Electrocorticography, Female, Humans, Male, Middle Aged, Neural Pathways, Young Adult (* major topic)
Topic: Functional Brain Connectivity Studies (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Citations: cited by 15 papers (Europe PMC); 76 references in the paper
Notices: A comment on this paper has been published (41672731, from Europe PMC)

Abstract

The lateral prefrontal cortex (LPFC) serves as a critical hub for higher-order cognitive and executive functions in the human brain, coordinating brain networks whose disruption has been implicated in many neurological and psychiatric disorders. While transcranial brain stimulation treatments often target the LPFC, our current understanding of connectivity profiles guiding these interventions based on electrophysiology remains limited.

Here, we present a high-resolution probabilistic map of bidirectional effective connectivity between the LPFC and widespread cortical and subcortical regions. This map is derived from intracranial evoked potential analysis of 48 797 intracranial direct electrical stimulation runs across 759 implantations in 724 patients with refractory epilepsy (368 male, 354 female, two unspecified; mean age ± standard deviation: 24 ± 13.5 years). We mapped probabilistic connectivity between brain parcels with adaptive resolution—higher resolution in the LPFC in the hemisphere of interest and lower elsewhere—maintaining statistical power while achieving 95% average confidence interval of ∼0.03 for connectivity probability estimates. In addition, the significance threshold (P-value) for probabilistic connectivity was obtained from surrogate distributions.

Overall, we observed remarkable symmetry between afferent and efferent connectivity patterns of the LPFC, with a slight preference for efferent connections (mean slope = 0.92 ± 0.09, mean R2 = 0.93 ± 0.025). For example, connections between the inferior frontal gyrus (IFG) and anterior cingulate showed notable directional asymmetry. The IFG strongly projected to most brain networks compared to other LPFC regions, with the strongest connectivity to the ventral attention network (0.26 ± 0.01 compared to values between 0.15 and 0.21 in other LPFC regions). Posterior dorso-lateral prefrontal cortex (DLPFC) demonstrated stronger connectivity to brain networks compared to anterior DLPFC regions (e.g. 0.21 ± 0.01 versus 0.15 ± 0.01 for connectivity to ventral attention network), with the exception of the limbic cortex. All LPFC subregions strongly projected to the fronto-parietal (greater than 0.17) and ventral attention (greater than 0.15) networks, with moderate connections to the default network (between 0.1 and 0.15, with the maximum corresponding to superior DLPFC). Finally, latency analysis suggested that the left LPFC's influence on ipsilateral emotion-related regions is primarily polysynaptic, with particularly strong pathways from IFG to amygdala (0.16 ± 0.02) and hippocampus (0.12 ± 0.01).

Taken together, these comprehensive connectivity maps provide a new detailed electrophysiological foundation for understanding the functional anatomy of LPFC and guiding targeted brain stimulation protocols.

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

Repository

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

ins-amu/LPFC_F-TRACT

License: none: the authors keep all their rights
State: the link answers, verified on 30 September 2026
Evidence: files inventoried
Commit: 0589077da765e9d33383a338fe0b3e7afce89808, 23 February 2026
Languages: Python (28), C/C++ (10), Shell (1)
Size: 5,538 files, 39 scripts
Software Heritage: archived
Found in: “Data availability”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Tools: NumPy (25 files), Matplotlib (13 files), SciPy (3 files), MNE-Python (2 files), pandas (1 file), Pillow (1 file), statsmodels (1 file)
Availability: 1 check, the latest on 30 September 2026: the link answers
  • 30 September 2026: the link answers
40 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;
  • 39 scripts, each with its path and the digest of its content;
  • 9 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

The numerical data at the atlas level and the code are available at https://github.com/ins-amu/LPFC_F-TRACT.

Reproduced under the paper's license (CC BY-NC), 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, 30 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 12 authors, 6 keywords, 13 MeSH terms, 6 funders, 73 references, 1 integrity notice.

Cite

This paper

Avalos-Alais, S., Jedynak, M., Boyer, A., Chanteloup-Forêt, B., Pinheiro, C., Cline, C. C., Parmigiani, S., Alemán-Gómez, Y., Hagmann, P., Keller, C. J., David, O., & the F-TRACT Consortium. (2026). High-resolution electrophysiological mapping of effective connectivity of lateral prefrontal cortex. Brain : a journal of neurology, 149(3), 963-975. https://doi.org/10.1093/brain/awaf317

BibTeX

@article{avalosalais2026high,
author = {Avalos-Alais, Sofia and Jedynak, Maciej and Boyer, Anthony and Chanteloup-Forêt, Blandine and Pinheiro, Cristiana and Cline, Christopher C and Parmigiani, Sara and Alemán-Gómez, Yasser and Hagmann, Patric and Keller, Corey J and David, Olivier and {the F-TRACT Consortium}},
title = {{High-resolution electrophysiological mapping of effective connectivity of lateral prefrontal cortex}},
journal = {Brain : a journal of neurology},
year = {2026},
month = mar,
volume = {149},
number = {3},
pages = {963--975},
publisher = {Oxford University Press},
issn = {0006-8950},
doi = {10.1093/brain/awaf317},
url = {https://doi.org/10.1093/brain/awaf317},
pmid = {40924875},
pmcid = {PMC13016832}
}

RIS

TY - JOUR
AU - Avalos-Alais, Sofia
AU - Jedynak, Maciej
AU - Boyer, Anthony
AU - Chanteloup-Forêt, Blandine
AU - Pinheiro, Cristiana
AU - Cline, Christopher C
AU - Parmigiani, Sara
AU - Alemán-Gómez, Yasser
AU - Hagmann, Patric
AU - Keller, Corey J
AU - David, Olivier
AU - the F-TRACT Consortium
TI - High-resolution electrophysiological mapping of effective connectivity of lateral prefrontal cortex
T2 - Brain : a journal of neurology
J2 - Brain
PY - 2026
DA - 2026/03/01
VL - 149
IS - 3
SP - 963
EP - 975
SN - 0006-8950
PB - Oxford University Press
DO - 10.1093/brain/awaf317
UR - https://doi.org/10.1093/brain/awaf317
LA - en
ER -

CSL-JSON

{
"id": "10.1093/brain/awaf317",
"type": "article-journal",
"title": "High-resolution electrophysiological mapping of effective connectivity of lateral prefrontal cortex",
"container-title": "Brain : a journal of neurology",
"author": [
{
"family": "Avalos-Alais",
"given": "Sofia"
},
{
"family": "Jedynak",
"given": "Maciej"
},
{
"family": "Boyer",
"given": "Anthony"
},
{
"family": "Chanteloup-Forêt",
"given": "Blandine"
},
{
"family": "Pinheiro",
"given": "Cristiana"
},
{
"family": "Cline",
"given": "Christopher C"
},
{
"family": "Parmigiani",
"given": "Sara"
},
{
"family": "Alemán-Gómez",
"given": "Yasser"
},
{
"family": "Hagmann",
"given": "Patric"
},
{
"family": "Keller",
"given": "Corey J"
},
{
"family": "David",
"given": "Olivier"
},
{
"literal": "the F-TRACT Consortium"
}
],
"container-title-short": "Brain",
"volume": "149",
"issue": "3",
"page": "963-975",
"DOI": "10.1093/brain/awaf317",
"PMID": "40924875",
"PMCID": "PMC13016832",
"ISSN": "0006-8950",
"publisher": "Oxford University Press",
"URL": "https://doi.org/10.1093/brain/awaf317",
"language": "en",
"issued": {
"date-parts": [
[
2026,
3,
1
]
]
}
}

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.1162/imag.a.1276 [code]
High-resolution whole-brain magnetic resonance spectroscopic imaging in youth at risk for psychosis.
Journal: Imaging neuroscience (Cambridge, Mass.)
In common: MNE-Python, Pillow, pandas, 3 other tools, 2 authors
[2] doi:10.1038/s42003-026-10270-4 [code]
Direct electrical stimulation of the human amygdala enhances recognition memory for objects but not scenes.
Journal: Communications biology
In common: MNE-Python, pandas, SciPy, 2 other tools, 4 references
[3] doi:10.1186/s12916-026-04903-y [code]
Structural connectome architecture and biological vulnerability shape cortical atrophy in cocaine use disorder.
Journal: BMC medicine
In common: statsmodels, pandas, SciPy, 2 other tools, 4 references
[4] doi:10.1038/s41467-026-70287-5 [code]
Cortical-limbic circuit dynamics of approach-avoidance conflict in humans.
Journal: Nature communications
In common: MNE-Python, statsmodels, pandas, 3 other tools, epilepsy, 1 reference
[5] doi:10.1038/s41467-026-75220-4 [code]
Causal Dynamics of Social Gaze in Primate Prefrontal-Amygdala Networks Revealed by Dynamic Bayesian Modeling.
Journal: Nature communications
In common: statsmodels, pandas, SciPy, 2 other tools, systems, 2 references
[6] doi:10.1016/j.nicl.2026.104012 [code]
Structural-functional multilayer brain network properties and outcome of combined repetitive transcranial magnetic stimulation and psychotherapy for obsessive-compulsive disorder.
Journal: NeuroImage. Clinical
In common: statsmodels, pandas, SciPy, 2 other tools, 3 references
[7] doi:10.1038/s41467-026-71568-9 [code]
Convergent and selective representations of pain, appetitive processes, aversive processes, and cognitive control in the insula.
Journal: Nature communications
In common: Pillow, statsmodels, pandas, 3 other tools, 2 references
[8] doi:10.3389/fncom.2026.1786996 [code]
Schumann-anchored golden ratio organization of human neural oscillations.
Journal: Frontiers in computational neuroscience
In common: MNE-Python, Pillow, statsmodels, 4 other tools, systems
[9] doi:10.1016/j.celrep.2026.117420 [code]
Neural population dynamics of direct electrical stimulation of neocortex.
Journal: Cell reports
In common: Pillow, statsmodels, pandas, 3 other tools, systems, 1 reference
[10] doi:10.1038/s41467-026-71961-4 [code]
Spatiotemporal asymmetries on brain energy landscape uncover system entrapment related to depression severity.
Journal: Nature communications
In common: Pillow, statsmodels, pandas, 3 other tools, 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.