Antagonism shapes social maps in the human brain.
The 1 match · it ties a paragraph to a whole file, not to given lines: a weak match, whose lines are not tinted
- [1] § Methods › Whole-brain Searchlight RSA ↔ RSA/functions/ACF_noiseSim.m, the whole file · a weak match · score 0.68 · Mahalanobis distances, dissimilarity matrices, noise, RDMs, searchlight
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 · 54 lines · 2.2 KB · no license · 1 match
- function ACF_noiseSim(save_folder, sub_num)
- % ACF_noiseSim - Calculates SAC between adjacent searchlight RDMs via random simulation and saves the result
- % Syntax:
- % ACF_noiseSim(save_folder, sub_num)
- %
- % Inputs:
- % save_folder - Path to the directory where the result (SAC.mat) will be saved (string)
- % sub_num - Number of subjects to be used in the simulation (scalar)
- %
- % Outputs (Saved File):
- % <save_folder>/SAC.mat
- % SAC - The average correlation coefficient between two adjacent
- % searchlight RDMs, obtained from 10,000 simulation iterations (scalar)
- %
- % Created by Ryo Ishibashi, updated by Isato Chikazawa 2026/04/06
- clusterSize = [208 257];
- num_items = 8;
- num_iterations = 10000;
- % Preallocate array for speed
- corval = zeros(1, num_iterations);
- for cycle = 1:num_iterations % Number of iterations
- for sub = 1:sub_num
- % Generate random numbers for all voxels and items simultaneously
- D = randn(clusterSize(2), num_items);
- D2 = D;
- % Update non-overlapping part with new random numbers
- num_update_voxels = clusterSize(2) - clusterSize(1) + 1;
- D2(clusterSize(1):clusterSize(2), :) = randn(num_update_voxels, num_items);
- % The Mahalanobis distance of random numbers following a standard normal distribution is equal to the Euclidean distance
- if sub == 1
- % Calculate dissimilarity using Euclidean distance
- dissimA = pdist(D', 'euclidean'); % Euclidean distance for D
- dissimB = pdist(D2', 'euclidean'); % Euclidean distance for D2
- else
- dissimA = [dissimA; pdist(D', 'euclidean')]; % Concatenate distances across all subjects
- dissimB = [dissimB; pdist(D2', 'euclidean')]; % Concatenate distances for D2 similarly
- end
- end
- corval(cycle) = corr2(dissimA, dissimB); % Correlation between the two dissimilarity matrices
- end
- SAC = mean(corval);
- % Save the results
- save(fullfile(save_folder, 'SAC.mat'), 'SAC');
- end
ACF_noiseSim.m, no license · at the source
Overview
- Graduate School of Frontiers Bioscience, The University of Osaka, Suita, Japan
- Center for Information and Neural Networks (CiNet), National Institute of Information and Communications Technology (NICT), Koganei, Japan
- Graduate School of Information and Science Technology, The University of Osaka, Suita, Japan
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.
Repository
Its files are read in the Code ↔ Paper reader above, with 1 match between paragraphs and lines of code.
OSF ygde3
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
- 27 September 2026: the link answers (HTTP 200)
16 files
- RSA/
functions/ , MATLAB, 54 lines, 1 matchACF_noiseSim.m - RSA/
functions/ , MATLAB, 74 linesappend_atlas_labels.m - RSA/
functions/ , MATLAB, 95 linesappend_lme_ci_to_table.m - RSA/
functions/ , MATLAB, 85 linesextract_cluster_data.m - RSA/
functions/ , MATLAB, 56 linesgetceth.m - RSA/
functions/ , MATLAB, 77 linesgetresels.m - RSA/
main.m , MATLAB, 399 lines - RSA_old/
functions/ , MATLAB, 54 linesACF_noiseSim.m - RSA_old/
functions/ , MATLAB, 76 linesapply_cluster_thresholdi ng.m - RSA_old/
functions/ , MATLAB, 186 linesclusterthresholding.m - RSA_old/
functions/ , MATLAB, 61 linesfit_lme_models.m - RSA_old/
functions/ , MATLAB, 56 linesgetceth.m - RSA_old/
functions/ , MATLAB, 77 linesgetresels.m - RSA_old/
functions/ , MATLAB, 70 linessave_thresholded_maps.m - RSA_old/
functions/ , MATLAB, 77 linessave_unthresholded_maps. m - RSA_old/
main.m , MATLAB, 34 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: OSF ygde3
Read it in the paper: doi.org/10.1038/s44271-026-00491-y.
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;
- 16 scripts, each with its path and the digest of its content;
- 1 match 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/s44271-026-00491-y.
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, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 3 authors, 2 keywords, 1 funder, 24 references.
Cite
This paper
Chikazawa, I., Ishibashi, R., & Nakano, T. (2026). Antagonism shapes social maps in the human brain. Communications psychology, 4(1), 100. https://
BibTeX
@article{chikazawa2026an
author = {Chikazawa, Isato and Ishibashi, Ryo and Nakano, Tamami},
title = {{Antagonism shapes social maps in the human brain}},
journal = {Communications psychology},
year = {2026},
month = jul,
volume = {4},
number = {1},
pages = {100},
publisher = {Nature Publishing Group},
issn = {2731-9121},
doi = {10.1038/
url = {https://
pmid = {42410040},
pmcid = {PMC13338177}
}
RIS
TY - JOUR
AU - Chikazawa, Isato
AU - Ishibashi, Ryo
AU - Nakano, Tamami
TI - Antagonism shapes social maps in the human brain
T2 - Communications psychology
J2 - Commun Psychol
PY - 2026
DA - 2026/
VL - 4
IS - 1
SP - 100
SN - 2731-9121
PB - Nature Publishing Group
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Antagonism shapes social maps in the human brain",
"container-title": "Communications psychology",
"author": [
{
"family": "Chikazawa",
"given": "Isato"
},
{
"family": "Ishibashi",
"given": "Ryo"
},
{
"family": "Nakano",
"given": "Tamami"
}
],
"container-title-short":
"volume": "4",
"issue": "1",
"page": "100",
"DOI": "10.1038/
"PMID": "42410040",
"PMCID": "PMC13338177",
"ISSN": "2731-9121",
"publisher": "Nature Publishing Group",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
7,
6
]
]
}
}
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.cub.2026.05.068 [code]
- An abstract relational map emerges in the human medial prefrontal cortex with consolidation.Journal: Current biology : CBIn common: SPM, Image Processing Toolbox, Statistics and Machine Learning Toolbox, 7 references
- [2] doi:10.1371/journal.pbio.3003755 [code]
- Action information is integrated into entorhinal representations of conceptual space and is reflected in eye movements.Journal: PLoS biologyIn common: cognitive, 7 references
- [3] doi:10.1002/hbm.70492 [code]
- Brain Bases for Navigating Acoustic Features.Journal: Human brain mappingIn common: Parallel Computing Toolbox, SPM, Image Processing Toolbox, cognitive, 3 references
- [4] doi:10.1038/s42256-026-01254-4 [code]
- Neural sampling from cognitive maps enables goal-directed imagination and planning.Journal: Nature machine intelligenceIn common: cognitive, 5 references
- [5] 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 communicationsIn common: Parallel Computing Toolbox, SPM, Image Processing Toolbox, 1 other tool, cognitive, 1 reference
- [6] doi:10.1038/s41467-026-75345-6 [code]
- Hippocampal ripples initiate cortical dimensionality expansion for memory retrieval.Journal: Nature communicationsIn common: Parallel Computing Toolbox, SPM, Image Processing Toolbox, 1 other tool, cognitive
- [7] doi:10.1038/s41467-026-74565-0 [code]
- The functional neurobiology of dispositions towards negative emotions.Journal: Nature communicationsIn common: Parallel Computing Toolbox, SPM, Image Processing Toolbox, 1 other tool, cognitive
- [8] doi:10.1038/s41467-026-71151-2 [code]
- Common and distinct neural correlates of social interaction processing and theory of mind in narratives.Journal: Nature communicationsIn common: Parallel Computing Toolbox, SPM, Image Processing Toolbox, 1 other tool, cognitive
- [9] doi:10.1016/j.isci.2026.117391
- Context-dependent abstraction of temporal relationships during naturalistic episodic memory.Journal: iScienceIn common: cognitive, 4 references
- [10] doi:10.1038/s41467-026-75841-9 [code]
- Model-based semantic distance reveals adaptive coordination of distinct cognitive systems in flexible knowledge retrieval.Journal: Nature communicationsIn common: Parallel Computing Toolbox, SPM, Statistics and Machine Learning Toolbox, 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.
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: 1 repository of the authors' code, each at its verified commit and with its license, 16 scripts, and 1 match 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:ea2929361c5343f4…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[.
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.
