OSCR

GSP Cochlea: A graph signal processing approach for studying sound encoding.

Code ↔ Paper

The paper beside its authors' code: matches between them have not been computed for this paper yet.

Paper

Loaded from Europe PMC by your browser; OSCR does not store it: doi.org · Europe PMC

The paper is loaded when this pane is shown.

The authors' code

MATLAB · 433 lines · 16 KB · GPL-3.0

  1. %% GRAPH SIGNAL PROCESSING ANALYSIS OF SOUND PROCESSING IN THE COCHLEA
  2. % Melia E. Bonomo, Santiago Segarra, Robert M. Raphael
  3. % Rice University, 2026
  4. % This code is freely distributed under the GNU General Public License.
  5. % http://www.gnu.org/licenses/gpl-3.0.html
  6. % PATIENT GROUPS
  7. % 32 patients spread across 7 levels of hearing loss severity
  8. % FOR EACH PATIENT GROUP
  9. % FOR EACH PATIENT (i.e., AUDIOGRAM)
  10. % 1. Input audiogram to UR_EAR model [1] to determine impairment
  11. % 2. Run UR_EAR model on N randomly sample stimuli
  12. % SAVE: voltage signals (VIHC) for each stimulus
  13. % 3. Run gsp on N signals for the 100 nodes
  14. % SAVE: graph adjacency matrix (W) for the patient
  15. % External scripts needed:
  16. % - UR_EAR toolbox [1]
  17. % - GSPBOX toolbox [2]
  18. % External data:
  19. % - full audiogram dataset [3]
  20. % - stimulus files [1,4,5]
  21. % Included files:
  22. % - stimulus_log_filenames.txt
  23. % - audiogram_%s.csv' (randomly sampled, each %s level of hearing loss)
  24. % - CF_position.mat (determined from [6])
  25. % References:
  26. %
  27. % [1] M. S. Zilany, I. C. Bruce, L. H. Carney, Updated parameters and
  28. % expanded simulation options for a model of the auditory periphery.
  29. % The Journal of the Acoustical Society of America, 135, (2014).
  30. % [2] N. Perraudin et al., GSPBOX: A toolbox for signal processing on
  31. % graphs. arXiv [Preprint] (2016). https://arxiv.org/abs/1408.5781
  32. % [3] J. A. Germiller et al., AudGenDB: A Public, Internet-Based,
  33. % Audiologic/Otologic/Genetic Database for Pediatric Hearing Research.
  34. % Otolaryngology–Head and Neck Surgery, 145, P235-P236 (2011).
  35. % [4] L. Fritts et al., Data from “Musical Instrument Samples.” University
  36. % of Iowa. Available at https://theremin.music.uiowa.edu/MIS.html.
  37. % [5] J. Hillenbrand, R. A. Houde, Vowel recognition: Formants, spectral
  38. % peaks, and spectral shape. The Journal of the Acoustical Society of
  39. % America, 98, 2949-2949 (1995).
  40. % [6] M. Pietsch et al., Spiral form of the human cochlea results from
  41. % spatial constraints. Scientific reports, 7, 7500 (2017).
  42. %
  43. %% Options
  44. clear
  45. start_date = 'DD-MM-YYY'; % For saving filename of GS and W
  46. general_model_mode = false;
  47. % true: Runs a perfect audiogram
  48. % false: Runs patient audiograms
  49. % Autosave options
  50. save_orig_signals = false; % GS-orig (raw signals)
  51. save_norm_signals = false; % GS (normalized signals)
  52. save_W_matrices = false; % W (connectivity matrix)
  53. % Plotting steps along the pipeline
  54. plot_patient = 1;
  55. plot_audiogram = false;
  56. plot_stim = false;
  57. plot_VIHC = false;
  58. plot_GS = false;
  59. plot_graph = false;
  60. % Network size
  61. CF_num = 100; % number of graph nodes
  62. total_stim = 1000; % number of graph signals to generate
  63. % Initialize random number generator (gsp)
  64. seed = 15;
  65. rng(seed)
  66. %% File Locations
  67. main_folder = '/LOCATION';
  68. data_folder = 'folder';
  69. %% Patient data information
  70. % Patient audiograms from AudGenDB
  71. if general_model_mode == true
  72. groups = {'gen'};
  73. else
  74. groups = {'1','2','3','4','5','6','7'};
  75. end
  76. num_groups = size(groups,2);
  77. data_type = '.csv';
  78. if general_model_mode == true
  79. num_patients_each_group = [1];
  80. else
  81. num_patients_each_group = [32,32,32,32,32,32,32];
  82. end
  83. total_patients = sum(num_patients_each_group);
  84. %% UR_EAR model parameters
  85. species = 2; % 1 for cat (2 for human with Shera et al. tuning; 3 for human with Glasberg & Moore tuning)
  86. % Characteristic Frequency Range (Hz)
  87. % Must be between 125 Hz and 20 kHz for human model
  88. minCF = 125; % original range 200 Hz
  89. maxCF = 8000; % original range 3000 Hz
  90. CF_range = [minCF, maxCF];
  91. CFs = logspace(log10(CF_range(1)),log10(CF_range(2)),CF_num); % set range and resolution of CFs here
  92. CFs([1 end]) = CF_range; % force end points to be exact
  93. num_iters = length(CFs);
  94. % Hearing loss in dB, to determine Cohc and Cihc for model using
  95. % function from Bruce and Zilany models, as in Bruce et al 2018 code.
  96. %ag_fs = [250 500 1e3 2e3 4e3]; % audiometric frequencies
  97. ag_fs_ALL = [125 250 500 750 1e3 1.5e3 2e3 3e3 4e3 6e3 8e3]; % audiometric frequencies
  98. % Stimulus Parameters
  99. spl = 65; % Sound Level (dB SPL)
  100. Pref = 20e-6; % reference pressure in pascals
  101. %from UR_EAR, line 226
  102. % Model sampling rate (must be 100k, 200k or 500k for AN model):
  103. Fs = 100e3; % samples/sec
  104. RsFs = 10e3; % resample rate for time_freq surface plots
  105. nrep = 1;
  106. % Load in stimulus randomly sampled list
  107. input_stim_name = sprintf('%s/results/%s/stimulus_log_filenames.txt',main_folder,data_folder);
  108. stimulus_log_filenames = readtable(input_stim_name,'Delimiter','tab','ReadVariableNames', false, 'TextType','string'); % dummy delimeter
  109. %% GSP BOX Parameters
  110. params.maxit = 50000;
  111. params.step_size = 0.1;
  112. params.verbosity = 1;
  113. params.tol = 1e-5;
  114. gsp_reset_seed(0);
  115. % GSP method
  116. method = 1; %1 = logarithmic prior, 2 = L-2 prior
  117. % Optimization model
  118. if method == 1
  119. % Learn weighted adjacency matrix from pairwise distances using
  120. % negative log prior on nodes degrees
  121. s = sqrt(2*(CF_num-1))/2 / 3;
  122. else
  123. % Learn weighted adjacency matrix from pairwise distances using
  124. % l2 prior on nodes degrees
  125. s = 1/2/sqrt(2);
  126. end
  127. %% Running the model
  128. iPatient_overall = 0;
  129. for iGroup = 1:num_groups
  130. nPatient = num_patients_each_group(iGroup);
  131. if general_model_mode == false
  132. input_data_name = sprintf('%s/data/audiogram_%s%s',main_folder,groups{iGroup},data_type);
  133. % Specify variable data types before import
  134. types = {'uint16','categorical','categorical','categorical','categorical','uint32','categorical','categorical','double','double','double','double','double','double','double','double','double','double','double','uint32','logical','logical','uint32','uint32','datetime','double','uint32','string','uint8','categorical'};
  135. opts = detectImportOptions(input_data_name);
  136. opts = setvartype(opts,types);
  137. data_audiograms = readtable(input_data_name,opts);
  138. data_audiograms = renamevars(data_audiograms,'Var1','index');
  139. % Extract patient identifiers & audiograms
  140. patient_index = data_audiograms.index;
  141. patient_id = data_audiograms.patient_id;
  142. audiograms = table2array(data_audiograms(:,9:19));
  143. else
  144. % Generic cochlea graph
  145. patient_index = [000];
  146. patient_id = [000];
  147. audiograms = zeros(nPatient,size(ag_fs_ALL,2));
  148. end
  149. tic
  150. for iPatient = 1:nPatient
  151. iPatient_overall = iPatient_overall + 1;
  152. %% Run UR_EAR
  153. % Audiogram Processing
  154. ag_dbloss_ALL = audiograms(iPatient,:);
  155. freqs = ~isnan(ag_dbloss_ALL);
  156. ag_dbloss = ag_dbloss_ALL(freqs);
  157. ag_fs = ag_fs_ALL(freqs);
  158. if plot_audiogram == true
  159. if iPatient == plot_patient
  160. figure
  161. plot(ag_fs,ag_dbloss,'o-k','LineWidth',1.75)
  162. set(gca, 'YDir','reverse')
  163. set(gca, 'FontSize', 20)
  164. ylim([-10,90])
  165. ylabel('Hearing Level in Decibels (dB)')
  166. xlabel('Frequency (Hz)')
  167. title('Audiogram')
  168. end
  169. end
  170. dbloss = interp1(ag_fs,ag_dbloss,CFs,'linear','extrap');
  171. [cohc_vals,cihc_vals] = fitaudiogram2(CFs,dbloss,species);
  172. if cohc_vals(1) == 0
  173. % Only set to 1 if coch_vals(2) == 1
  174. if cohc_vals(2) == 1
  175. % For a very low CF, a 0 may be returned by Bruce et al. fit
  176. % audiogram, but this is a bad default. Set it to 1 here.
  177. cohc_vals(1) = 1;
  178. end
  179. end
  180. if cihc_vals(1) == 0
  181. % Only set to 1 if coch_vals(2) == 1
  182. if cihc_vals(2) == 1
  183. % For a very low CF, a 0 may be returned, but this is a bad default.
  184. % Set it to 1 here.
  185. cihc_vals(1) = 1;
  186. end
  187. end
  188. VIHC_signals = nan(CF_num,total_stim);
  189. VIHC_signals_orig = nan(CF_num,total_stim);
  190. % Run stimulus
  191. for iStim = 1:total_stim
  192. in_stim_name = sprintf('%s/stimuli_all/%s',main_folder,stimulus_log_filenames{iPatient_overall,iStim});
  193. info = audioinfo(in_stim_name);
  194. dur1 = info.Duration;
  195. stim_length_RsFs = round(RsFs * dur1);
  196. VIHC_population = nan(CF_num,stim_length_RsFs);
  197. % Load stimulus
  198. [stimulus,~] = audioread(in_stim_name);
  199. if plot_stim == true
  200. if iStim == plot_stim
  201. % plot the FFT of the stimulus
  202. % Get length of stimulus.
  203. N = length(stimulus);
  204. % Plot FFT
  205. figure
  206. f = (0:N-1)*(Fs/N); % frequency range
  207. power = abs(fft(stimulus)).^2/N;
  208. plot(f,power,'k-','LineWidth',1.75)
  209. xlabel('Frequency (Hz)')
  210. ylabel('Power')
  211. title(sprintf('%s',stimulus_log_filenames{iPatient,iStim}))
  212. xlim([0 4000])
  213. set(gca,'FontSize',15,'FontWeight','bold')
  214. ax = gca;
  215. ax.LineWidth = 1;
  216. end
  217. end
  218. % duration of waveform in sec
  219. dur2 = dur1 + 0.04;
  220. % Loop through CFs (within nconditions loop) in reverse order so
  221. % matrices don't have to be resized.
  222. for iCF = length(CFs):-1:1
  223. % Get iCF element of each array.
  224. CF = CFs(iCF); % CF in Hz;
  225. cohc = cohc_vals(iCF);
  226. cihc = cihc_vals(iCF);
  227. % Using ANModel_2014 (2-step process)
  228. vihc = model_IHC(stimulus',CF,nrep,1/Fs,dur2,cohc,cihc,species);
  229. % Save output waveform into matrices.
  230. vihc_resampled = resample(vihc,RsFs,Fs);
  231. resampled_length = size(vihc_resampled,2);
  232. VIHC_population(iCF,1:resampled_length) = vihc_resampled(1:resampled_length);
  233. end % end of CF loop
  234. if plot_VIHC == true
  235. if iPatient == plot_patient
  236. if iStim == plot_stim
  237. % plot the inner hair cell voltages
  238. end
  239. end
  240. end
  241. % Average VIHC time series to get the graph signals
  242. X_orig = squeeze(nanmean(VIHC_population,2));
  243. % Normalize
  244. X = normalize(X_orig,'range',[0 1]); %for 1000 signals
  245. % Save into graph signal variable
  246. VIHC_signals(:,iStim) = X;
  247. VIHC_signals_orig(:,iStim) = X_orig;
  248. if plot_GS == true
  249. if iPatient == plot_patient
  250. if iStim == plot_stim
  251. % plot the graph signals of nodes (IHC)
  252. end
  253. end
  254. end
  255. stat = sprintf('Finished running iStim = %d',iStim);
  256. disp(stat)
  257. end
  258. %% Save graph signals for patient
  259. if save_norm_signals == true
  260. out_GSnorm_data_name = sprintf('%s/results/%s/%s_%d_%d_GS_%s.txt',main_folder,data_folder,groups{iGroup},patient_index(iPatient),patient_id(iPatient),start_date);
  261. writematrix(VIHC_signals,out_GSnorm_data_name,'Delimiter','tab')
  262. end
  263. if save_orig_signals == true
  264. out_GS_data_name = sprintf('%s/results/%s/%s_%d_%d_GS-orig_%s.txt',main_folder,data_folder,groups{iGroup},patient_index(iPatient),patient_id(iPatient),start_date);
  265. writematrix(VIHC_signals_orig,out_GS_data_name,'Delimiter','tab')
  266. end
  267. toc % time to run UR_EAR
  268. %% Run GSP BOX
  269. % Compute the pairwise distances of the features of each signal
  270. % and learn a graph using them:
  271. Z = gsp_distanz(VIHC_signals').^2;
  272. if method == 1
  273. W = gsp_learn_graph_log_degrees(Z, s*2, s*1, params);
  274. else
  275. W = gsp_learn_graph_l2_degrees(Z, s*1, params);
  276. end
  277. W(W<1e-5) = 0;
  278. if plot_graph == true
  279. if iPatient == plot_patient
  280. %% Plot graph
  281. % Cochlea 3D coordinates determined from reference [6] for
  282. % 100 nodes spaced at given characteristic frequencies (CF)
  283. load('CF_position.mat')
  284. CF_position_rev = flip(CF_position,2);
  285. fprintf('Graph of %d signals: %d edges\n', total_stim,nnz(W)/2);
  286. G = gsp_graph(W / sum(W(:)) * CF_num, [CF_position_rev(1,:)', CF_position_rev(2,:)', CF_position_rev(3,:)']);
  287. params_plot.edge_size = 1;
  288. params_plot.show_edges = 1;
  289. G.plotting.vertex_size = 30;%5;
  290. investigate_boundary_effect = false;
  291. if investigate_boundary_effect == true
  292. box1 = 17;
  293. box2 = 71;
  294. bound_colors = ones(CF_num,3);
  295. for iNode = [1:box1,box2:CF_num]
  296. bound_colors(iNode,:) = [0 0 0];
  297. end
  298. [ki,kj] = find(G.W);
  299. num_edges = size(ki,1);
  300. % Variable containing the color assigned to each edge
  301. bound_edge_colors = nan(num_edges,3);
  302. for iEdge = 1:num_edges
  303. iNode = ki(iEdge);
  304. jNode = kj(iEdge);
  305. if iNode <= box1 && jNode >= box2
  306. % Edge between boundary nodes
  307. c = [0.8 0 0];
  308. elseif iNode >= box2 && jNode <= box1
  309. % Edge between boundary nodes
  310. c = [0.8 0 0];
  311. else
  312. % Edge between non-boundary nodes
  313. c = [0.6 0.6 0.6];
  314. end
  315. bound_edge_colors(iEdge,:) = c;
  316. end
  317. G.plotting.vertex_color = bound_colors;
  318. G.plotting.edge_color = bound_edge_colors;
  319. figure
  320. imagesc(W)
  321. colorbar
  322. set(gca,'FontSize',15,'FontWeight','bold')
  323. ax = gca;
  324. ax.XTick = [1 18 34 51 67 84 93 100]; %CF number
  325. ax.XTickLabel = {'125' '250' '500' '1k' '2k' '4k' '6k' '8k'}; %CF freq
  326. ax.YTick = [1 18 34 51 67 84 93 100];
  327. ax.YTickLabel = {'125' '250' '500' '1k' '2k' '4k' '6k' '8k'};
  328. ax.XAxisLocation='top';
  329. ax.Position = [0.1220 0.1100 0.7272 0.8150];
  330. end
  331. figure;
  332. gsp_plot_graph(G, params_plot);
  333. axis equal
  334. view([-90 90])
  335. end
  336. end
  337. %% Save W data for patient
  338. if save_W_matrices == true
  339. out_W_data_name = sprintf('%s/results/%s/%s_%d_%d_W_%s.txt',main_folder,data_folder,groups{iGroup},patient_index(iPatient),patient_id(iPatient),start_date);
  340. writematrix(W,out_W_data_name,'Delimiter','tab')
  341. end
  342. end
  343. end

GSPcochlea.m at commit d517533, under GPL-3.0 · at the source

Overview

  1. Department of Physics and Astronomy, Rice University, Houston, TX 77005, USA
  2. Department of Electrical and Computer Engineering, Rice University, Houston, TX 77005, USA
  3. Department of Bioengineering, Rice University, Houston, TX 77005, USA
Institutions: Rice University (United States)
Journal: PNAS nexus, volume 5, issue 5, article pgag134
Dates: received 22 August 2025; accepted 1 April 2026; published online 21 April 2026
Type: Brief report · Language: English
License: CC BY
Identifiers: DOI 10.1093/pnasnexus/pgag134 · PMID 42099576 · PMCID PMC13148644 · OpenAlex W7155086423
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: other condition (population), computational (subfield)
Keywords: cochlea, complex systems, graph signal processing, graph theory, hearing loss
Topic: Hearing, Cochlea, Tinnitus, Genetics (Sensory Systems, Neuroscience), according to OpenAlex
Citations: not cited yet (Europe PMC); 15 references in the paper

Abstract

Humans are able to hear in a variety of complicated acoustic environments. This feat begins in the peripheral auditory system, where the cochlea collects and transmits thousands of individual bits of sound data to the brain. Here, we introduce GSP Cochlea: a graph signal processing-based framework to investigate and visualize sound encoding. We show that a cochlea graph with a mesh topology provides a mechanism of denoising, efficient information transfer, and modular processing. We demonstrate an application to assess hearing loss as more than just a decibel loss at particular frequencies of sound but also a significant change to the cochlea graph architecture. GSP Cochlea is a generalized approach that provides new insight into the higher-level functional activity of the inner ear.

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

Repository

Its files are read in the Code ↔ Paper reader above.

meliabonomo/GSPcochlea

License: GPL-3.0
State: the link answers, verified on 29 September 2026
Evidence: files inventoried
Commit: d517533f31d166e162a55745fe8ad12ebf43c1d9, 15 April 2026
Languages: MATLAB (1)
Size: 5 files, 1 script
Software Heritage: not archived
Found in: “Data availability”
Holds: README, license file
Not found: CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 29 September 2026: the link answers
  • 29 September 2026: the link answers
3 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;
  • 1 script, each with its path and the digest of its content;
  • no match between paragraphs and code yet;
  • 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

Computer codes written for the GSP Cochlea formulation presented here are available at https://github.com/meliabonomo/GSPcochlea.

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, 3 authors, 5 keywords, 2 funders, 8 references.

Cite

This paper

Bonomo, M. E., Segarra, S., & Raphael, R. M. (2026). GSP Cochlea: A graph signal processing approach for studying sound encoding. PNAS nexus, 5(5), pgag134. https://doi.org/10.1093/pnasnexus/pgag134

BibTeX

@article{bonomo2026gsp,
author = {Bonomo, Melia E and Segarra, Santiago and Raphael, Robert M},
title = {{GSP Cochlea: A graph signal processing approach for studying sound encoding}},
journal = {PNAS nexus},
year = {2026},
month = apr,
volume = {5},
number = {5},
pages = {pgag134},
publisher = {Oxford University Press},
issn = {2752-6542},
doi = {10.1093/pnasnexus/pgag134},
url = {https://doi.org/10.1093/pnasnexus/pgag134},
pmid = {42099576},
pmcid = {PMC13148644}
}

RIS

TY - JOUR
AU - Bonomo, Melia E
AU - Segarra, Santiago
AU - Raphael, Robert M
TI - GSP Cochlea: A graph signal processing approach for studying sound encoding
T2 - PNAS nexus
J2 - PNAS Nexus
PY - 2026
DA - 2026/04/21
VL - 5
IS - 5
SP - pgag134
SN - 2752-6542
PB - Oxford University Press
DO - 10.1093/pnasnexus/pgag134
UR - https://doi.org/10.1093/pnasnexus/pgag134
LA - en
ER -

CSL-JSON

{
"id": "10.1093/pnasnexus/pgag134",
"type": "article-journal",
"title": "GSP Cochlea: A graph signal processing approach for studying sound encoding",
"container-title": "PNAS nexus",
"author": [
{
"family": "Bonomo",
"given": "Melia E"
},
{
"family": "Segarra",
"given": "Santiago"
},
{
"family": "Raphael",
"given": "Robert M"
}
],
"container-title-short": "PNAS Nexus",
"volume": "5",
"issue": "5",
"page": "pgag134",
"DOI": "10.1093/pnasnexus/pgag134",
"PMID": "42099576",
"PMCID": "PMC13148644",
"ISSN": "2752-6542",
"publisher": "Oxford University Press",
"URL": "https://doi.org/10.1093/pnasnexus/pgag134",
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
21
]
]
}
}

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.1073/pnas.2207466120 [code]
Nonquantal transmission at the vestibular hair cell-calyx synapse: K<sub>LV</sub> currents modulate fast electrical and slow K<sup>+</sup> potentials.
Journal: Proceedings of the National Academy of Sciences of the United States of America
In common: author Robert M Raphael
[2] doi:10.1162/netn_a_00223 [code]
Efficient coding in the economics of human brain connectomics.
Journal: Network neuroscience (Cambridge, Mass.)
In common: Statistics and Machine Learning Toolbox, computational, 2 references
[3] doi:10.1177/23312165241246596 [code]
Extending Subcortical EEG Responses to Continuous Speech to the Sound-Field.
Journal: Trends in hearing
In common: 2 references
[4] doi:10.1523/jneurosci.1104-25.2026 [code]
Timbre Encoding in the Inferior Colliculus.
Journal: The Journal of neuroscience : the official journal of the Society for Neuroscience
In common: Statistics and Machine Learning Toolbox, computational, 1 reference
[5] doi:10.7554/elife.85300 [code]
Homophilic wiring principles underpin neuronal network topology in vitro.
Journal: eLife
In common: Statistics and Machine Learning Toolbox, 2 references
[6] doi:10.1162/imag.a.31 [code]
Brain wiring economics, network organisation and population-level genomics.
Journal: Imaging neuroscience (Cambridge, Mass.)
In common: Statistics and Machine Learning Toolbox, 2 references
[7] doi:10.1523/jneurosci.0802-24.2025 [code]
Association of Bidirectional Network Cores in the Brain with Perceptual Awareness and Cognition.
Journal: The Journal of neuroscience : the official journal of the Society for Neuroscience
In common: Statistics and Machine Learning Toolbox, 2 references
[8] doi:10.1093/braincomms/fcae010 [code]
Dysfunctions of multiscale dynamic brain functional networks in subjective cognitive decline.
Journal: Brain communications
In common: Statistics and Machine Learning Toolbox, 2 references
[9] doi:10.1002/hbm.26258 [code]
Using graph theory as a common language to combine neural structure and function in models of healthy cognitive performance.
Journal: Human brain mapping
In common: Statistics and Machine Learning Toolbox, 2 references
[10] doi:10.1371/journal.pone.0319031 [code]
SPectral graph theory And Random walK (SPARK) toolbox for static and dynamic characterization of (di)graphs: A tutorial.
Journal: PloS one
In common: Statistics and Machine Learning Toolbox, 1 reference

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.1093/pnasnexus/pgag134.svg)](https://openscicode.org/badge/doi/10.1093/pnasnexus/pgag134)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

.. image:: https://openscicode.org/badge/doi/10.1093/pnasnexus/pgag134.svg
   :target: https://openscicode.org/badge/doi/10.1093/pnasnexus/pgag134
   :alt: OSCR

.. oscr-badge:end
HTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1093/pnasnexus/pgag134"><img src="https://openscicode.org/badge/doi/10.1093/pnasnexus/pgag134.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.