OSCR

Action or Stimulus: Individual Beliefs About Learned Associations Influence the Processing of Immediate and Delayed Feedback.

Code ↔ Paper

7 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 7 matches · 2 of them tie a paragraph to a whole file, not to given lines: weak matches, whose lines are not tinted
  1. [1] § Method › Data Analysis › Behavioral Data Analyses › PE Modelling ↔ MATLAB Scripts/PE_2Alphas6Q_based_on_responses_AI.m, lines 1–46 · score 0.61 · best fitting model, stimulus pairs, unchosen, expectations, hlinger, Albrecht
  2. [2] § Method › Data Analysis › EEG Data Analyses › Preprocessing ↔ MATLAB Scripts/create_single_trial_v1.m, lines 1–67 · score 0.54 · peak latencies, 140 ms, 250 ms, electrodes, amplitudes
  3. [3] § Method › Data Analysis › EEG Data Analyses › Preprocessing ↔ MATLAB Scripts/create_single_trial_v1_diff.m, lines 1–62 · score 0.54 · peak latencies, 140 ms, 250 ms, electrodes, amplitudes
  4. [4] § Method › Data Analysis › EEG Data Analyses › Preprocessing ↔ MATLAB Scripts/create_single_trial_v1.m, lines 1–67 · score 0.51 · peak latency, segments, 200 ms, 400 ms, electrodes, amplitudes
  5. [5] § Method › Data Analysis › EEG Data Analyses › Preprocessing ↔ MATLAB Scripts/create_single_trial_v1_diff.m, lines 1–62 · score 0.51 · peak latency, segments, 200 ms, 400 ms, electrodes, amplitudes
  6. [6] § Method › Participants ↔ MATLAB Scripts/export_peak_max.m, the whole file · a weak match · score 0.50 · Heinrich Heine University, sseldorf, psychological
  7. [7] § Method › Participants ↔ MATLAB Scripts/export_peak_max_end_dyn.m, the whole file · a weak match · score 0.50 · Heinrich Heine University, sseldorf, psychological

Paper

Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC

The paper is loaded when this pane is shown.

The authors' code

MATLAB · 279 lines · 12 KB · no license · 2 matches

  1. function create_single_trial_v1(folder)
  2. %before starting, it is important to define the length of the segment
  3. %in ms and at what time the event happens (aka point 0)
  4. segmentlength = 1000;
  5. beforemarker = 200;
  6. %this is where I define the conditions (names should be as in the
  7. %filenames used in BVA export) and electrodes. For the BVA export, I
  8. %use txt export and include electrode names as column names.
  9. conditions = {'Immediate_Negative','Immediate_Positive','NoSoundDelayed_Negative','NoSoundDelayed_Positive','WithSoundDelayed_Negative','WithSoundDelayed_Positive'};
  10. electrodes = {'FzFC1FCzFC2Cz','P7','P8'};
  11. pools = {{'Fz','FC1','FCz','FC2','Cz'}};
  12. windows = {'200_400','140_250'};
  13. %this reads in the single-trial data
  14. restructure_Matrices_st(folder,conditions,electrodes,'',segmentlength,beforemarker,pools);
  15. subjects = string(evalin('base','subjects'));
  16. %here I define some things about the output table
  17. output_name = 'st_data.xlsx';
  18. header = {'Subject','Condition','SegmentNum','Electrode','TimeWindow','pospeak','negpeak','peaktopeak'};
  19. assignin('base','dependentvariables',[]);
  20. row = {};
  21. %this adds rows (calculates the ST-values) for each subject (in German:
  22. %Versuchsperson, so "vp" in short)
  23. for i = 1:size(subjects,1)
  24. subjects(i,:)
  25. for j = 1:size(conditions,2)
  26. % %this function is "where the magic happens" so where the values
  27. % %are exported. The last number that is given to the function is
  28. % %"around" and that defines in what area around the peak latency
  29. % %the amplitudes should be exported. If it is set to 0, it is
  30. % %just the latency itself. If it is set to 10, it includes 10ms
  31. % %before and 10ms after the latency.
  32. addrows(conditions{j},electrodes,segmentlength,subjects(i,:),10,windows);
  33. end
  34. end
  35. %now I just combine behavioral and EEG data...
  36. dependentvariables = evalin('base','dependentvariables');
  37. deptable = cell2table(dependentvariables,'VariableNames',header);
  38. deptable.Subject = str2num(str2mat(deptable.Subject));
  39. behavioral = evalin('base','behavioral');
  40. behavioral.Condition = cellstr(behavioral.Condition);
  41. %check if there are any vps in deptable, but not in behavioral or other
  42. %way around
  43. % subjects_behavioral = string(evalin('base','subjects_behavioral'));
  44. % for i = 1:size(subjects,1)
  45. % if ~ismember(subjects(i,:),subjects_behavioral)
  46. % rows = ~(strcmp(deptable.Subject,subjects(i)));
  47. % deptable = deptable(rows,:);
  48. % end
  49. % end
  50. % for i = 1:size(subjects_behavioral,1)
  51. % if ~ismember(subjects_behavioral(i,:),subjects)
  52. % rows = (~strcmp(behavioral.Subject,subjects_behavioral(i,:)));
  53. % behavioral = behavioral(rows,:);
  54. % end
  55. % end
  56. % behavioral.Subject = string(behavioral.Subject);
  57. % deptable.Subject = string(deptable.Subject);
  58. assignin('base','deptable_eeg',deptable);
  59. assignin('base','beh',behavioral);
  60. alltab = join(deptable,behavioral);
  61. writetable(alltab,'dependentvariables_st_v1.xlsx');
  62. assignin('base', 'dependentvariables_st_v1', alltab);
  63. end
  64. function addrows(condition,electrodes,segmentlength,vp,around,windows)
  65. matrix = evalin('base',strcat(condition,'_st'));
  66. rows = (strcmp(matrix.vp,vp));
  67. matrix = matrix(rows,:);
  68. positivepeak = evalin('base','positivepeak');
  69. negativepeak = evalin('base','negativepeak');
  70. dependentvariables = evalin('base','dependentvariables');
  71. subjects = evalin('base','subjects');
  72. subjectindex = find(strcmp(subjects,vp));
  73. subjectindex = subjectindex(1)
  74. row = {};
  75. tempdep = [];
  76. for j = 1:(floor(size(matrix,1)/segmentlength))
  77. rows = (matrix.segmentNum == j);
  78. tempmatrix = matrix(rows,:);
  79. j
  80. %indexadd = Number of previous segments * segment length
  81. indexadd = (j-1) * segmentlength;
  82. peakvals = zeros(size(electrodes,2),3);
  83. countneg = 0;
  84. countpos = 0;
  85. for k = 1:size(peakvals,1)
  86. for m = 1:size(peakvals,2)
  87. peakvals(k,m) = 99999;
  88. end
  89. end
  90. for k = 1:size(electrodes,2)
  91. for m = 1:size(windows,2)
  92. colname = strcat(electrodes{k},'_',condition,'_',windows{m},'_latency');
  93. if ismember(colname,positivepeak.Properties.VariableNames)
  94. if positivepeak{subjectindex,colname} < 99999
  95. rows = (tempmatrix.ms >= positivepeak{subjectindex,colname}-around);
  96. tempmatrix_pos = tempmatrix(rows,:);
  97. rows = (tempmatrix_pos.ms <= positivepeak{subjectindex,colname}+around);
  98. tempmatrix_pos = table2array(tempmatrix_pos(rows,electrodes{k}));
  99. peakvals(k,1) = mean(tempmatrix_pos);
  100. end
  101. if negativepeak{subjectindex,colname} < 99999
  102. rows = (tempmatrix.ms >= negativepeak{subjectindex,colname}-around);
  103. tempmatrix_neg = tempmatrix(rows,:);
  104. rows = (tempmatrix_neg.ms <= negativepeak{subjectindex,colname}+around);
  105. tempmatrix_neg = table2array(tempmatrix_neg(rows,electrodes{k}));
  106. peakvals(k,2) = mean(tempmatrix_neg);
  107. end
  108. if peakvals(k,1) < 99999 && peakvals(k,2) < 99999
  109. peakvals(k,3) = peakvals(k,2) - peakvals(k,1);
  110. end
  111. row = {convertStringsToChars(vp)};
  112. row = [row,condition];
  113. row = [row,j,electrodes{k},windows{m},peakvals(k,1), peakvals(k,2), peakvals(k,3)];
  114. tempdep = [tempdep;row];
  115. end
  116. end
  117. end
  118. end
  119. dependentvariables = [dependentvariables;tempdep];
  120. assignin('base','dependentvariables',dependentvariables);
  121. end
  122. function restructure_Matrices_st(folder,conditions,electrodes,filesel,segmentlength,timebeforeevent,pools)
  123. % Include 'include' or exclude '/exclude' filename parts
  124. %conditions is an array with all conditions as strings. These need to
  125. %be equal as to what they are called in the file names (including upper
  126. %and lower case!)
  127. for i = 1:size(conditions,2)
  128. output_name = strcat(conditions{i},'_st');
  129. restructure(filenames(folder,conditions{i},'/AV','/Report','/08_','/12_','/20_','/23_','/29_','/39_','/47_','/Mast_','/FCz_'),output_name,folder,electrodes,segmentlength,timebeforeevent,pools);
  130. end
  131. end
  132. function restructure(currfilenames,varname,folder,electrodes,segmentlength,timebeforeevent,pools)
  133. subject_index = (1:2);
  134. %if contains( who('vps*') , 'vps' )
  135. % vps = evalin('base','vps');
  136. %else
  137. subjects = [];
  138. %end
  139. maxsize = 0;
  140. all_tab = [];
  141. for i = 1:length(currfilenames)
  142. i = i
  143. filename = strcat(folder,'/',currfilenames{i})
  144. temptab = readtable(filename,'Delimiter','space');
  145. size(pools)
  146. pools
  147. electrode_names = evalin('base','electrode_names_original');
  148. counter = 1;
  149. for j = 1:size(electrode_names,1)
  150. if strcmp(electrode_names{j},temptab.Properties.VariableNames{counter})
  151. counter = counter + 1;
  152. else
  153. temptab.new = NaN(size(temptab,1),1);
  154. variable_names = temptab.Properties.VariableNames;
  155. variable_names{size(variable_names,2)} = electrode_names{j};
  156. temptab.Properties.VariableNames = variable_names;
  157. end
  158. end
  159. for j = 1:size(pools,2)
  160. orwidth = width(temptab);
  161. temptab.pool = mean(temptab{:,pools{1,j}},2,"omitnan");
  162. colname = '';
  163. for k = 1:size(pools{1,j},2)
  164. colname = strcat(colname,pools{1,j}{1,k})
  165. end
  166. temptab.Properties.VariableNames{orwidth+1} = colname;
  167. end
  168. temptab = temptab(:,electrodes);
  169. subject = cell(size(temptab,1),1);
  170. subject(:) = cellstr(currfilenames{i}(subject_index));
  171. %segmentNum = cell(segmentlength,1);
  172. msNumTemp = (timebeforeevent*(-1):segmentlength-timebeforeevent-1);
  173. msNumTemp = num2cell(permute(msNumTemp,[2 1]));
  174. msNum = [];
  175. segmentNumTemp = cell(segmentlength,1);
  176. segmentNum = [];
  177. floor(size(temptab,1)/segmentlength)
  178. for j = 1:floor(size(temptab,1)/segmentlength)
  179. segmentNumTemp(:) = num2cell(j);
  180. if size(msNum,1) == 0
  181. msNum = msNumTemp;
  182. segmentNum = segmentNumTemp;
  183. else
  184. msNum = cat(1,msNum,msNumTemp);
  185. segmentNum = cat(1,segmentNum,segmentNumTemp);
  186. end
  187. end
  188. size(segmentNum)
  189. size(subject)
  190. size(msNum)
  191. size(temptab)
  192. temptab = [temptab subject msNum segmentNum];
  193. temptab.Properties.VariableNames{size(electrodes,2)+1} = 'vp';
  194. temptab.Properties.VariableNames{size(electrodes,2)+2} = 'ms';
  195. temptab.Properties.VariableNames{size(electrodes,2)+3} = 'segmentNum';
  196. if size(all_tab,1) == 0
  197. all_tab = temptab;
  198. else
  199. all_tab = [all_tab;temptab];
  200. end
  201. subjectcode = string(currfilenames{i}(subject_index))
  202. %if ~vps.includes(vpcode)
  203. subjects = [subjects; subjectcode]
  204. %end
  205. end
  206. assignin('base',varname,all_tab);
  207. assignin('base','subjects',subjects);
  208. end
  209. function [filenames]=filenames(folder, varargin)
  210. % Read filenames from a folder and output a cell with all names matching
  211. % the conditions set in varargin.
  212. % by Alexander Seidel - 2016
  213. %
  214. % INPUT
  215. % folder [string] Total or relative path to the folder.
  216. % varargin [string] Arbitrary amount of strings to specifiy
  217. % conditions. Condition strings starting with '/'
  218. % are used to exclude entries from the file name
  219. % list, all others are form a requirement each
  220. % entry must meet. Each entry must meet all
  221. % requirements set by the conditions.
  222. %
  223. % OUTPUT
  224. % files [cell] vertical cell array with all filenames that
  225. % meet the specified conditions.
  226. % Read filenames and remove all entries that are folders
  227. filenames = dir(folder);
  228. filenames = {filenames([filenames.isdir] == 0).name}';
  229. if isempty(filenames)
  230. error('The Folder is empty.');
  231. end
  232. % Remove entries not matching the conditions
  233. if ~isempty(varargin)
  234. for i=1:length(varargin)
  235. if varargin{i}(1) == '/'
  236. rows = ~strfindl(filenames,varargin{i}(2:end));
  237. else
  238. rows = strfindl(filenames,varargin{i});
  239. end
  240. filenames = filenames(rows);
  241. end
  242. end
  243. if isempty(filenames)
  244. error('No files matching the criteria were found.');
  245. end
  246. end
  247. function xlsoverwrite(filename,data)
  248. % Overwrites an excel file instead of just changing
  249. % fields in an existing one
  250. if exist(filename, 'file')
  251. delete (filename);
  252. end
  253. xlswrite(filename,data);
  254. end
  255. function index=strfindl(str, pattern)
  256. %% A logical version of strfind
  257. strfound = strfind(str,pattern);
  258. index = cell2mat(cellfun(@(x) ~isempty(x),strfound,'uni', false));
  259. end

create_single_trial_v1.m, no license · at the source

Overview

Authors: Christine Albrecht1, Marta Ghio1, Christian Bellebaum1
  1. Faculty of Mathematics and Natural Sciences Heinrich Heine University Düsseldorf Düsseldorf Germany
Journal: The European journal of neuroscience, volume 63, issue 5, article e70451
Dates: received 22 April 2025; accepted 19 February 2026; published online 6 March 2026; in print March 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1111/ejn.70451 · PMID 41793036 · PMCID PMC12966775 · OpenAlex W7134124835
Open access: hybrid, a free copy (OpenAlex)
Status: code verified
Categories: EEG (modality), human (organism), cognitive (subfield)
Methods: Smoothing, state filtering, decompositions, Preprocessing, Evoked potentials, Statistics, Physiology & signal measures
Keywords: feedback delay, feedback‐association types, FRN/N2, N170, prediction error
MeSH: Association Learning*, Brain*, Feedback, Psychological*, Adult, Electroencephalography, Evoked Potentials, Female, Humans, Male, Reward, Young Adult (* major topic)
Topic: Neural and Behavioral Psychology Studies (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Citations: cited by 1 paper (Europe PMC); 74 references in the paper

Abstract

Feedback learning seems to involve two systems, the striatal reward system and the medial temporal lobe (MTL), which have both been linked to event‐related potential (ERP) components such as the feedback‐related negativity (FRN)/N2, overlapped by a reward positivity (RewP), and the N170, respectively. In this study, we tested the hypothesis that the former system is more involved in associating the feedback with previous actions and the latter in associating the feedback with previous stimuli. More specifically, we hypothesized that the engagement of these systems depends on individual beliefs in credit assignment, that is, whether participants linked the feedback they received to actions or stimuli, possibly modulated by feedback timing. Electroencephalography (EEG) data were recorded from 43 participants performing an ambiguous feedback–learning task, in which feedback could be attributed to either a performed action or a selected stimulus, according to the instruction. As revealed by an Action Index derived from behavioral data, the focus on stimulus–feedback associations was generally stronger than that on action–feedback associations. We found that both FRN/N2 and N170 were influenced by individual beliefs about learned associations, with the FRN/N2 showing stronger feedback valence coding across feedback delays when participants took action–feedback associations into account. Also prediction error coding in the N170 was more pronounced for stronger action–feedback association learning. The results seem to suggest that both learning systems are recruited, at least to some extent, when action–feedback and stimulus–feedback associations are considered simultaneously.

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 7 matches between paragraphs and lines of code.

OSF f3r42

License: none: the authors keep all their rights
State: the link answers, verified on 30 September 2026
Evidence: files inventoried
Languages: MATLAB (30), R (6)
Size: 327 files, 36 scripts
Software Heritage: not checked
Found in: “Data Availability Statement”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Tools: Optimization Toolbox (6 files), car (1 file), ggplot2 (1 file), ggpubr (1 file), lme4 (1 file), lmerTest (1 file), reshape2 (1 file), tidyverse (1 file)
Availability: 1 check, the latest on 30 September 2026: the link answers (HTTP 200)
  • 30 September 2026: the link answers (HTTP 200)
36 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;
  • 36 scripts, each with its path and the digest of its content;
  • 7 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 Statement

The study was preregistered on 10.17605/OSF.IO/Z9MPA (https://doi.org/10.17605/OSF.IO/Z9MPA). The data that support the findings of this study and all analysis scripts are openly accessible through the Open Science Framework at 10.17605/OSF.IO/F3R42 (https://doi.org/10.17605/OSF.IO/F3R42).

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

Recorded: type, language, journal, volume, issue, pages, dates, 3 authors, 5 keywords, 11 MeSH terms, 1 funder, 71 references.

Cite

This paper

Albrecht, C., Ghio, M., & Bellebaum, C. (2026). Action or Stimulus: Individual Beliefs About Learned Associations Influence the Processing of Immediate and Delayed Feedback. The European journal of neuroscience, 63(5), e70451. https://doi.org/10.1111/ejn.70451

BibTeX

@article{albrecht2026action,
author = {Albrecht, Christine and Ghio, Marta and Bellebaum, Christian},
title = {{Action or Stimulus: Individual Beliefs About Learned Associations Influence the Processing of Immediate and Delayed Feedback}},
journal = {The European journal of neuroscience},
year = {2026},
month = mar,
volume = {63},
number = {5},
pages = {e70451},
publisher = {Wiley},
issn = {0953-816X},
doi = {10.1111/ejn.70451},
url = {https://doi.org/10.1111/ejn.70451},
pmid = {41793036},
pmcid = {PMC12966775}
}

RIS

TY - JOUR
AU - Albrecht, Christine
AU - Ghio, Marta
AU - Bellebaum, Christian
TI - Action or Stimulus: Individual Beliefs About Learned Associations Influence the Processing of Immediate and Delayed Feedback
T2 - The European journal of neuroscience
J2 - Eur J Neurosci
PY - 2026
DA - 2026/03/01
VL - 63
IS - 5
SP - e70451
SN - 0953-816X
PB - Wiley
DO - 10.1111/ejn.70451
UR - https://doi.org/10.1111/ejn.70451
LA - en
ER -

CSL-JSON

{
"id": "10.1111/ejn.70451",
"type": "article-journal",
"title": "Action or Stimulus: Individual Beliefs About Learned Associations Influence the Processing of Immediate and Delayed Feedback",
"container-title": "The European journal of neuroscience",
"author": [
{
"family": "Albrecht",
"given": "Christine"
},
{
"family": "Ghio",
"given": "Marta"
},
{
"family": "Bellebaum",
"given": "Christian"
}
],
"container-title-short": "Eur J Neurosci",
"volume": "63",
"issue": "5",
"page": "e70451",
"DOI": "10.1111/ejn.70451",
"PMID": "41793036",
"PMCID": "PMC12966775",
"ISSN": "0953-816X",
"publisher": "Wiley",
"URL": "https://doi.org/10.1111/ejn.70451",
"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.1111/psyp.70306 [code]
From Feedback-Learning to Semantic Memory: Can Feedback-Related Brain Activity Predict Object-Word Associations?
Journal: Psychophysiology
In common: car, lmerTest, lme4, 4 other tools, EEG, cognitive, 29 references, author Christine Albrecht
[2] doi:10.1038/s41598-026-58046-4 [code]
Dissecting the interplay of model-based control, impulsivity and compulsivity on self-control in daily life.
Journal: Scientific reports
In common: car, lme4, ggplot2, 1 other tool, EEG, cognitive, 7 references
[3] doi:10.1007/s00221-026-07365-z
Effects of augmented feedback delay on neural correlates of feedback processing in motor practice.
Journal: Experimental brain research
In common: EEG, 9 references
[4] doi:10.1162/imag.a.105 [code]
Right posterior theta reflects human parahippocampal phase resetting by salient cues during goal-directed navigation
Journal: n/a
In common: car, lmerTest, lme4, 3 other tools, EEG, cognitive, 3 references
[5] doi:10.1016/j.neuroimage.2026.122115 [code]
Midfrontal theta power relates to response speeding following frustrative nonreward.
Journal: NeuroImage
In common: car, lmerTest, lme4, 4 other tools, EEG, cognitive, 2 references
[6] doi:10.7554/elife.103566 [code]
Effort produces after-effects costly for others but valued for self.
Journal: eLife
In common: lmerTest, lme4, ggpubr, 2 other tools, EEG, 4 references
[7] doi:10.1371/journal.pone.0353990 [code]
Positive mood enhances accessibility of unrelated concepts in the first language but not in the foreign language.
Journal: PloS one
In common: car, lmerTest, lme4, 4 other tools, EEG, cognitive, 1 reference
[8] doi:10.1017/s0033291726103249 [code]
Inefficient integration between effort and reward in anhedonia.
Journal: Psychological medicine
In common: lmerTest, lme4, ggplot2, 1 other tool, EEG, cognitive, 4 references
[9] doi:10.1162/imag.a.1363 [code]
Social approach-avoidance conflict: Behavioural, emotional, and neural correlates along a depression-social anxiety spectrum.
Journal: Imaging neuroscience (Cambridge, Mass.)
In common: car, lmerTest, lme4, 4 other tools, cognitive, 1 reference
[10] doi:10.1111/psyp.70265 [code]
Neurocognitive Dynamics of Translating Information From a Spatial Map Into Action.
Journal: Psychophysiology
In common: car, lmerTest, lme4, 3 other tools, EEG, cognitive, 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.

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.