Cannabinoid modulation of central amygdala population dynamics during threat investigation.
The 11 matches · 3 of them tie a paragraph to a whole file without given lines: weak matches, whose lines are not tinted
- [1] § Methods › Calcium signal acquisition and analysis ↔ Population metrics.m, the whole file · a weak match · score 0.80 · cumulative variance, Mahalanobis distance, concatenated, trajectory, iterative, space · Report a mismatch
- [2] § Methods › Calcium signal acquisition and analysis ↔ Spontaneous activity event analysis.m, the whole file · a weak match · score 0.79 · event amplitude, Calcium traces, event frequency, OASIS, deconvolved, curve · Report a mismatch
- [3] § Results › CP55940 enhances location-behavior co-representation in CeA SOM neurons ↔ activation_probability_selectivity.m, lines 217 to 234 · score 0.71 · immobility selective cells, mobile selective, activation probability, near odor, quantify · Report a mismatch
- [4] § Methods › Calcium signal acquisition and analysis ↔ SVM Decoder Analysis.m, lines 1 to 23 · score 0.69 · support vector machine, SVM, decoder, permuted, decoded, trained · Report a mismatch
- [5] § Methods › Calcium signal acquisition and analysis ↔ data analysis-decoding analysis.m, lines 1 to 24 · score 0.68 · SVM classifier, support vector, kernel, decoded, linear, trained · Report a mismatch
- [6] § Results › CP55940 enhances location-behavior co-representation in CeA SOM neurons ↔ activation_probability_selectivity.m, lines 178 to 208 · score 0.66 · mobility selective, zone selectivity, activation probabilities, near odor, deviation, median · Report a mismatch
- [7] § Results › CP55940 modulation of neuronal population vector trajectories associated with threat-related behavior ↔ Population metrics.m, the whole file · a weak match · score 0.64 · trajectory lengths, Mahalanobis distance, space, shorter, dimensionality, population · Report a mismatch
- [8] § Results › CP55940 enhances location-behavior co-representation in CeA SOM neurons ↔ activation_probability_selectivity.m, lines 178 to 208 · score 0.59 · activation probabilities, far odor, near odor, deviation, mobility, zone · Report a mismatch
- [9] § Results › CP55940 modulation of SOM neural dynamics associated with threat investigation ↔ Behaviour_aligned_timestamps_and_velocity.m, lines 96 to 137 · score 0.58 · flee events, freezing bouts, freeze onset, odor, behavioral · Report a mismatch
- [10] § Methods › Calcium signal acquisition and analysis ↔ Clustering code.m, lines 45 to 90 · score 0.52 · reduce dimensionality, component, variance, PCA, Flee, traces · Report a mismatch
- [11] § Methods › Calcium signal acquisition and analysis ↔ Clustering code.m, lines 92 to 136 · score 0.52 · hierarchical clustering, optimal, gap, correlation, PCA, distance · Report a mismatch
Paper
Loaded from Europe PMC by your browser; OSCR does not store it: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
MATLAB · 243 lines · 8.8 KB · no license · 3 matches
- %% NEURAL ACTIVITY SELECTIVITY ANALYSIS
- % Analyzes calcium imaging data (dF/F) to compute cell activation probabilities
- % and behavioral selectivity indices across multiple behavioral states.
- %
- % REQUIREMENTS:
- % - dF/F data in Excel file (rows=timepoints, cols=cells)
- % - Cell status column (row 2): 'accepted' or 'rejected'
- % - position_binned: logical matrix (timepoints x behaviors) from Anymaze
- % - Anymaze.Txt: structure array with behavior labels
- %
- % OUTPUT:
- % - n_o_index: zone selectivity (near odor - far from odor)
- % - mobility_index: mobility selectivity (mobile - immobile)
- % - cell_probabilities: activation rates by behavioral state
- % - behavior_sorted: cell categorization (-1, 0, 1) based on selectivity
- %
- %% USER SETTINGS
- shuffle_behavior = false; % Set to true to randomize behavior markers (for null distribution)
- z_threshold = 1.96; % Z-score threshold for activation (95% confidence)
- remove_initial_frames = 10;% Number of initial frames to exclude before analysis
- %% STEP 1: LOAD DATA
- fprintf('Loading dF/F data...\n');
- current_dir = uigetdir('', 'Select directory containing dF/F file');
- if isequal(current_dir, 0)
- error('User cancelled directory selection.');
- end
- cd(current_dir);
- [file_name, file_path] = uigetfile('*.xlsx', 'Select Excel file with dF/F data');
- if isequal(file_name, 0)
- error('User cancelled file selection.');
- end
- file_full_path = fullfile(file_path, file_name);
- [numeric_data, text_data] = xlsread(file_full_path);
- % Parse spreadsheet
- cell_ids = text_data(1, 2:end);
- cell_status_raw = text_data(2, 2:end);
- df_over_f_raw = numeric_data(1:end, 2:end);
- times = numeric_data(1:end, 1);
- fprintf('Loaded data: %d timepoints, %d cells\n', size(df_over_f_raw, 1), size(df_over_f_raw, 2));
- %% STEP 2: FILTER CELLS BY ACCEPTANCE STATUS
- % Use strcmp for robust string comparison
- accepted_logical = false(1, numel(cell_status_raw));
- for m = 1:numel(cell_status_raw)
- if strcmp(strtrim(cell_status_raw{m}), 'accepted')
- accepted_logical(m) = true;
- end
- end
- num_accepted = sum(accepted_logical);
- fprintf('Accepted cells: %d / %d\n', num_accepted, numel(cell_status_raw));
- df_over_f = df_over_f_raw(:, accepted_logical);
- cell_ids_accepted = cell_ids(accepted_logical);
- %% STEP 3: PREPROCESSING - REMOVE NaNs AND NORMALIZE TIME
- % Convert time units (multiply by 10 after rounding)
- times = round(times, 1) * 10;
- % Remove timepoints with NaN in first column (assumes first column indicates valid timepoints)
- valid_idx = ~isnan(df_over_f(:, 1));
- df_over_f = df_over_f(valid_idx, :);
- times = times(valid_idx);
- fprintf('Valid timepoints after NaN removal: %d\n', size(df_over_f, 1));
- %% STEP 4: NORMALIZATION
- % Peak normalization
- df_max = max(df_over_f, [], 1); % Max per cell
- df_norm = df_over_f ./ df_max; % Normalize by peak
- % Z-score normalization (whole session)
- df_mean = mean(df_over_f, 1);
- df_std = std(df_over_f, 0, 1); % Sample std (divide by N-1)
- z_score = (df_over_f - df_mean) ./ df_std;
- % Remove initial frames (after Z-scoring to avoid biasing statistics)
- z_score(1:remove_initial_frames, :) = [];
- times(1:remove_initial_frames) = [];
- fprintf('After removing initial %d frames: %d timepoints remain\n', remove_initial_frames, size(z_score, 1));
- %% STEP 5: LOAD AND PROCESS BEHAVIORAL DATA
- % NOTE: position_binned and Anymaze must be loaded in workspace before running this script
- if ~exist('position_binned', 'var') || ~exist('Anymaze', 'var')
- error('position_binned and/or Anymaze not found in workspace. Please load behavioral data first.');
- end
- fprintf('Loading behavioral data from Anymaze...\n');
- % Extract behavior states
- mobile_idx = find(string(Anymaze.Txt) == 'Mobile');
- near_odor_idx = find(string(Anymaze.Txt) == 'InSubstrateZonePeriphery');
- far_odor_idx = find(string(Anymaze.Txt) == 'InEmptyZonePeriphery');
- mobile_binned = logical(position_binned(:, mobile_idx));
- near_odor_binned = logical(position_binned(:, near_odor_idx));
- far_binned = logical(position_binned(:, far_odor_idx));
- % Optional: shuffle behavior markers for null hypothesis testing
- if shuffle_behavior
- fprintf('Shuffling behavior markers...\n');
- mobile_binned = mobile_binned(randperm(length(mobile_binned)));
- near_odor_binned = near_odor_binned(randperm(length(near_odor_binned)));
- far_binned = far_binned(randperm(length(far_binned)));
- end
- %% STEP 6: ALIGN NEURAL AND BEHAVIORAL DATA
- % Ensure neural and behavioral data have same length
- min_length = min(size(z_score, 1), size(position_binned, 1));
- z_score = z_score(1:min_length, :);
- times = times(1:min_length);
- mobile_binned = mobile_binned(1:min_length);
- near_odor_binned = near_odor_binned(1:min_length);
- far_binned = far_binned(1:min_length);
- fprintf('Aligned neural and behavioral data to %d timepoints\n', min_length);
- %% STEP 7: SEGMENT NEURAL DATA BY BEHAVIOR
- mobile_z = z_score(mobile_binned, :);
- immobile_z = z_score(~mobile_binned, :);
- near_odor_z = z_score(near_odor_binned, :);
- far_odor_z = z_score(far_binned, :);
- %% STEP 8: COMPUTE ACTIVATION PROBABILITIES
- % Activation = Z-score >= threshold
- z_binary = z_score >= z_threshold;
- z_p = sum(z_binary, 1) ./ size(z_score, 1);
- % By behavioral state
- ne_binary = far_odor_z >= z_threshold;
- ne_p = sum(ne_binary, 1) ./ size(far_odor_z, 1);
- no_binary = near_odor_z >= z_threshold;
- no_p = sum(no_binary, 1) ./ size(near_odor_z, 1);
- mo_binary = mobile_z >= z_threshold;
- mo_p = sum(mo_binary, 1) ./ size(mobile_z, 1);
- im_binary = immobile_z >= z_threshold;
- im_p = sum(im_binary, 1) ./ size(immobile_z, 1);
- fprintf('Activation probabilities computed (threshold Z >= %.2f)\n', z_threshold);
- %% STEP 9: COMPUTE SELECTIVITY INDICES (Single animal)
- n_o_index = no_p - ne_p; % Near odor vs far odor
- mobility_index = mo_p - im_p; % Mobile vs immobile
- % Compile cell probabilities for export
- cell_probabilities = [z_p; ne_p; no_p; mo_p; im_p]';
- behavior_labels = {'Overall', 'FarOdor', 'NearOdor', 'Mobile', 'Immobile'};
- %% STEP 10: POPULATION ANALYSIS (pooled across animals)
- fprintf('\n--- POPULATION ANALYSIS (pooled data) ---\n');
- fprintf('Enter pooled selectivity indices from all animals.\n');
- behavior_code_total = zeros(2, 1); % Preallocate
- try
- behavior_code_total(1, :) = input('Input zone selectivity indices [1 x N array]: ');
- behavior_code_total(2, :) = input('Input mobility selectivity indices [1 x N array]: ');
- catch
- error('Failed to parse input. Please provide numeric arrays.');
- end
- behavior_code_total = behavior_code_total'; % Transpose to [N x 2]
- num_pooled_cells = size(behavior_code_total, 1);
- fprintf('Loaded %d cells from pooled dataset\n', num_pooled_cells);
- %% STEP 11: THRESHOLD SELECTIVITY BY MEDIAN ABSOLUTE DEVIATION
- % Compute MAD for each selectivity measure
- mad_threshold = mad(behavior_code_total, 1); % MAD across cells for each measure
- fprintf('Zone selectivity MAD threshold: %.4f\n', mad_threshold(1));
- fprintf('Mobility selectivity MAD threshold: %.4f\n', mad_threshold(2));
- % Categorize cells: -1 (low), 0 (intermediate), +1 (high)
- behavior_sorted = zeros(2, num_pooled_cells);
- % Zone selectivity
- for i = 1:num_pooled_cells
- if behavior_code_total(i, 1) <= -mad_threshold(1)
- behavior_sorted(1, i) = -1; % Far odor preferring
- elseif behavior_code_total(i, 1) >= mad_threshold(1)
- behavior_sorted(1, i) = 1; % Near odor preferring
- else
- behavior_sorted(1, i) = 0; % Non-selective
- end
- end
- % Mobility selectivity
- for i = 1:num_pooled_cells
- if behavior_code_total(i, 2) <= -mad_threshold(2)
- behavior_sorted(2, i) = -1; % Immobile preferring
- elseif behavior_code_total(i, 2) >= mad_threshold(2)
- behavior_sorted(2, i) = 1; % Mobile preferring
- else
- behavior_sorted(2, i) = 0; % Non-selective
- end
- end
- %% STEP 12: DEFINE RESPONSIVE CELL POPULATIONS
- % Extract binary responses based on selectivity categories
- near_resp = behavior_sorted(1, :) == 1; % Near odor selective
- far_resp = behavior_sorted(1, :) == -1; % Far odor selective
- mobile_resp = behavior_sorted(2, :) == 1; % Mobile selective
- immobile_resp = behavior_sorted(2, :) == -1; % Immobile selective
- %% STEP 13: COMPUTE SET OVERLAPS
- % Quantify cells with multiple selectivities
- A = far_resp; % A = near_resp; for near-odor selectivity
- B = immobile_resp; % Immobile selective cells
- C = mobile_resp; % Mobile selective cells
- % Cardinality
- n_A = sum(A);
- n_B = sum(B);
- n_C = sum(C);
- % Pairwise intersections
- n_AB = sum(A & B);
- n_BC = sum(B & C);
- n_AC = sum(A & C);
- % Triple intersection
- n_ABC = sum(A & B & C);
- %% OUTPUT SUMMARY
- fprintf('\n=== ANALYSIS COMPLETE ===\n');
- fprintf('Key outputs:\n');
- fprintf(' n_o_index: zone selectivity (near odor - far odor)\n');
- fprintf(' mobility_index: mobility selectivity (mobile - immobile)\n');
- fprintf(' cell_probabilities: [N x 5] activation rates\n');
- fprintf(' behavior_sorted: [2 x N] cell categorization\n');
- fprintf(' behavior_code_total: [N x 2] pooled selectivity indices\n');
activation_probability_selectivity.m at commit 80d175e, no license · at the source
Overview
Abstract
The abstract is not reproduced here: the paper's license (CC BY-NC-ND) does not allow it. Read it in the paper, at the publisher or on Europe PMC.
Repositories
Its files are read in the Code ↔ Paper reader above, with 11 matches between paragraphs and lines of code.
figshare 21956801
Availability: 1 check, the latest on 5 October 2026: the link answers (HTTP 200)
- 5 October 2026: the link answers (HTTP 200)
12 files
- behavior training-FearConditionin
g.m , MATLAB, 112 lines - behavior training-GoNoGoSucroseQu
inine.m , MATLAB, 427 lines - behavior training-RewardPunishmen
tCondition_csus.m , MATLAB, 176 lines - behavior training-RewardPunishmen
tCondition_csus_Unexpect , MATLAB, 183 linesReward.m - behavior training-Reward_2AFC_Ima
ging.m , MATLAB, 314 lines - data analysis-DLC_Freezing_An
alyze_R1.m , MATLAB, 76 lines - data analysis-clustering code.m, MATLAB, 56 lines
- data analysis-coding direction.m, MATLAB, 41 lines
- data analysis-decoding analysis.m, MATLAB, 112 lines, 1 match
- data analysis-licking data analysis.m, MATLAB, 30 lines
- data analysis-photometryanaly
sis_Reward_Laser.m , MATLAB, 396 lines - data analysis-pupil size.m, MATLAB, 54 lines
luisrosasvidal/Rosas-Vidal2025
e61af6fe4943f1d4d2e8e49db9a1653f79a2d0c3, 13 March 2025Availability: 1 check, the latest on 5 October 2026: the link answers
- 5 October 2026: the link answers
6 files
- Clustering_with_rescalin
g.m , MATLAB, 95 lines - DeltaFoverFBlocksOfN.m, MATLAB, 137 lines
- EventResponsiveZ.m, MATLAB, 74 lines
- SelectivityIndexCode.m, MATLAB, 81 lines
- LICENSE, License, 674 lines
- README.md, Text, 1 line
fyasmin09/yasmin_et_al_2026
80d175e4f19507609510c2191c208e39b8f5a11a, 16 June 2026Availability: 1 check, the latest on 5 October 2026: the link answers
- 5 October 2026: the link answers
7 files
- Behaviour_aligned_timest
amps_and_velocity.m , MATLAB, 227 lines, 1 match - Clustering code.m, MATLAB, 300 lines, 2 matches
- Population metrics.m, MATLAB, 80 lines, 2 matches
- SVM Decoder Analysis.m, MATLAB, 149 lines, 1 match
- Spontaneous activity event analysis.m, MATLAB, 150 lines, 1 match
- activation_probability_s
electivity.m , MATLAB, 243 lines, 3 matches - README.md, Text, 15 lines
Code availability statement
The paper has a code availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- it points to the authors' code: figshare 21956801, fyasmin09/
yasmin_et_al_2026 , luisrosasvidal/Rosas-Vidal2025
Read it in the paper: doi.org/10.1038/s41467-026-77957-4.
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:
- 3 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 22 scripts, each with its path and the digest of its content;
- 11 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
No dataset and no data link were found in the paper.
Data availability statement
The paper has a data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- no repository, dataset or request procedure was recognized in it
Read it in the paper: doi.org/10.1038/s41467-026-77957-4.
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, 6 October 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 7 authors, 3 keywords, 12 MeSH terms, 1 funder, 83 references.
Cite
This paper
Yasmin, F., Naskar, S., Zaidi, D., Kandil, I., Kwon, M., Rosas-Vidal, L. E., & Patel, S. (2026). Cannabinoid modulation of central amygdala population dynamics during threat investigation. Nature communications, 17(1), 10127. https://
BibTeX
@article{yasmin2026canna
author = {Yasmin, Farhana and Naskar, Saptarnab and Zaidi, Danyal and Kandil, Isaac and Kwon, Michelle and Rosas-Vidal, Luis E. and Patel, Sachin},
title = {{Cannabinoid modulation of central amygdala population dynamics during threat investigation}},
journal = {Nature communications},
year = {2026},
month = oct,
volume = {17},
number = {1},
pages = {10127},
publisher = {Nature Publishing Group},
issn = {2041-1723},
doi = {10.1038/
url = {https://
pmid = {42827137},
pmcid = {PMC13633270}
}
RIS
TY - JOUR
AU - Yasmin, Farhana
AU - Naskar, Saptarnab
AU - Zaidi, Danyal
AU - Kandil, Isaac
AU - Kwon, Michelle
AU - Rosas-Vidal, Luis E.
AU - Patel, Sachin
TI - Cannabinoid modulation of central amygdala population dynamics during threat investigation
T2 - Nature communications
J2 - Nat Commun
PY - 2026
DA - 2026/
VL - 17
IS - 1
SP - 10127
SN - 2041-1723
PB - Nature Publishing Group
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Cannabinoid modulation of central amygdala population dynamics during threat investigation",
"container-title": "Nature communications",
"author": [
{
"family": "Yasmin",
"given": "Farhana"
},
{
"family": "Naskar",
"given": "Saptarnab"
},
{
"family": "Zaidi",
"given": "Danyal"
},
{
"family": "Kandil",
"given": "Isaac"
},
{
"family": "Kwon",
"given": "Michelle"
},
{
"family": "Rosas-Vidal",
"given": "Luis E."
},
{
"family": "Patel",
"given": "Sachin"
}
],
"container-title-short":
"volume": "17",
"issue": "1",
"page": "10127",
"DOI": "10.1038/
"PMID": "42827137",
"PMCID": "PMC13633270",
"ISSN": "2041-1723",
"publisher": "Nature Publishing Group",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
10,
2
]
]
}
}
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.1016/j.isci.2022.105497 [code]
- Neuronal cell types, projections, and spatial organization of the central amygdala.Journal: iScienceIn common: cellular / molecular, 11 references
- [2] doi:10.7554/elife.84262 [code]
- Multimodal mapping of cell types and projections in the central nucleus of the amygdala.Journal: eLifeIn common: mouse, cellular / molecular, 10 references
- [3] doi:10.7554/elife.101980 [code]
- Valence and salience encoding in the central amygdala.Journal: eLifeIn common: mouse, 10 references
- [4] doi:10.1126/sciadv.adf6521
- Transcriptomics reveals amygdala neuron regulation by fasting and ghrelin thereby promoting feeding.Journal: Science advancesIn common: 9 references
- [5] doi:10.1038/s41467-023-35826-4
- Topographic representation of current and future threats in the mouse nociceptive amygdala.Journal: Nature communicationsIn common: mouse, 9 references
- [6] doi:10.1016/j.celrep.2024.114669
- Cells and circuits for amygdala neuroplasticity in the transition to chronic pain.Journal: Cell reportsIn common: mouse, cellular / molecular, 8 references
- [7] doi:10.1016/j.isci.2024.110886
- Divergent input patterns to the central lateral amygdala play a duet in fear memory formation.Journal: iScienceIn common: 8 references
- [8] doi:10.1016/j.celrep.2023.113027 [code]
- Endocannabinoid release at ventral hippocampal-amygdala synapses regulates stress-induced behavioral adaptation.Journal: Cell reportsIn common: Statistics and Machine Learning Toolbox, cellular / molecular, 2 references, author Sachin Patel
- [9] doi:10.1073/pnas.2522768123 [code]
- A neural circuit basis for reward-induced suppression of fear generalization and enhancement of fear extinction.Journal: Proceedings of the National Academy of Sciences of the United States of AmericaIn common: mouse, 6 references
- [10] doi:10.1126/sciadv.abq1637 [code]
- Disynaptic specificity of serial information flow for conditioned fear.Journal: Science advancesIn common: 6 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.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 3 repositories of the authors' code, each at its verified commit and with its license, 22 scripts, and 11 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:d0852e6125f5571b…
Add the badge to the code's README
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 -->
[](https://openscicode.org/badge/doi/10.1038/s41467-026-77957-4)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.1038/s41467-026-77957-4.svg
:target: https://openscicode.org/badge/doi/10.1038/s41467-026-77957-4
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1038/s41467-026-77957-4"><img src="https://openscicode.org/badge/doi/10.1038/s41467-026-77957-4.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.
