SPIDER: spatially integrated denoising via embedding regularization with single cell supervision.
4 blocks of code here have a permanent identifier (oscr:b:…), listed with the matches below: citable for good, with a page of its own. Select a match and press Cite to copy it. What a block identifier is.
The 7 matches
- [1] § 2 Methods › 2.2 Overview of the SPIDER framework ↔ SPIDER-main.zip/SPIDER/model.py, lines 62 to 86 · score 0.77 · zero inflation probability, Zero Inflated Negative, dispersion, Binomial, ZINB, loss · block
oscr:b:YS1D61STNR87A-H· Report a mismatch - [2] § 3 Experiments and results › 3.2 SPIDER generates denoised ST expression for accurate clustering ↔ SPIDER-main.zip/train.py, lines 10 to 55 · score 0.72 · Homogeneity Score, Adjusted Rand, Normalized Mutual, PCA, mclust, ARI · block
oscr:b:6YDP4HFRT06R7-6· Report a mismatch - [3] § 3 Experiments and results › 3.2 SPIDER generates denoised ST expression for accurate clustering ↔ SPIDER-main.zip/tutorial.ipynb, lines 38 to 42 · score 0.68 · Homogeneity Score, Adjusted Rand, Normalized Mutual, mclust, ARI, HS · Report a mismatch
- [4] § 2 Methods › 2.4 Modeling and training › 2.4.2 Training › 2.4.3 Gene expression reconstruction ↔ SPIDER-main.zip/SPIDER/model.py, lines 62 to 86 · score 0.60 · zero inflation probability, dispersion, ZINB, predict, model, loss · block
oscr:b:YS1D61STNR87A-H· Report a mismatch - [5] § 2 Methods › 2.2 Overview of the SPIDER framework ↔ SPIDER-main.zip/SPIDER/trainer.py, lines 39 to 170 · score 0.60 · cross entropy loss, predict, ratios, MMD, trained, graphs · block
oscr:b:0X0ESZBR7JJY9-X· Report a mismatch - [6] § 2 Methods › 2.4 Modeling and training › 2.4.2 Training › 2.4.6 Overall objective function ↔ SPIDER-main.zip/SPIDER/trainer.py, lines 39 to 170 · score 0.59 · gradient clipping, Adam, weighting, optimized, loss, Model · block
oscr:b:0X0ESZBR7JJY9-X· Report a mismatch - [7] § 2 Methods › 2.2 Overview of the SPIDER framework ↔ SPIDER-main.zip/SPIDER/utils.py, lines 167 to 220 · score 0.53 · nearest neighbors, spatial graph, distance, spot · block
oscr:b:0XVYP560K28T8-T· 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
Python · 300 lines · 12 KB · CC-BY-4.0 · 2 matches
- import numpy as np, random
- from tqdm import tqdm
- import torch
- import torch.nn.functional as F
- import torch.nn as nn
- import random
- from typing import Union, Tuple, Optional
- from torch_geometric.typing import (OptPairTensor, Adj, Size, NoneType,
- OptTensor)
- from torch import Tensor
- from torch.nn import Parameter
- from torch_sparse import SparseTensor, set_diag
- from torch_geometric.nn.dense.linear import Linear
- from torch_geometric.nn.conv import MessagePassing
- from torch_geometric.utils import remove_self_loops, add_self_loops, softmax
- def mean_act(x):
- return torch.clamp(torch.exp(x), 1e-5, 1e6)
- def disp_act(x):
- return torch.clamp(F.softplus(x), 1e-4, 1e4)
- def pi_act(x):
- return torch.sigmoid(x)
- class RBF(nn.Module):
- def __init__(self, n_kernels=5, mul_factor=2.0, bandwidth=None, device='cuda:0'):
- super().__init__()
- self.device = device
- self.bandwidth_multipliers = mul_factor ** (torch.arange(n_kernels, device=self.device) - n_kernels // 2)
- self.bandwidth = bandwidth
- def get_bandwidth(self, L2_distances):
- if self.bandwidth is None:
- n_samples = L2_distances.shape[0]
- return L2_distances.sum() / (n_samples ** 2 - n_samples)
- return self.bandwidth
- def forward(self, X):
- X = X.to(self.device)
- L2_distances = torch.cdist(X, X) ** 2
- bw = self.get_bandwidth(L2_distances)
- bw = torch.tensor(bw, device=self.device) if not isinstance(bw, torch.Tensor) else bw.to(self.device)
- K = torch.exp(-L2_distances[None, ...] / (bw * self.bandwidth_multipliers)[:, None, None])
- return K.sum(dim=0)
- class MMDLoss(nn.Module):
- def __init__(self, kernel=None, device='cuda:0'):
- super().__init__()
- self.device = device
- self.kernel = kernel if kernel is not None else RBF(device=self.device)
- def forward(self, X, Y):
- X = X.to(self.device)
- Y = Y.to(self.device)
- K = self.kernel(torch.vstack([X, Y]))
- X_size = X.shape[0]
- XX = K[:X_size, :X_size].mean()
- XY = K[:X_size, X_size:].mean()
- YY = K[X_size:, X_size:].mean()
- return XX - 2 * XY + YY
- def ZINB_loss(y_true, mean, disp, pi, device):
- """
- Computes the Zero-Inflated Negative Binomial (ZINB) loss.
- Args:
- y_true (torch.Tensor): Ground truth tensor.
- mean (torch.Tensor): Predicted mean tensor.
- disp (torch.Tensor): Predicted dispersion tensor.
- pi (torch.Tensor): Predicted zero-inflation probability tensor.
- device (torch.device): Device to perform the computation on.
- Returns:
- torch.Tensor: Computed ZINB loss.
- """
- eps = 1e-10
- r = torch.minimum(disp, torch.tensor(1e6, device=device))
- t1 = torch.lgamma(r + eps) + torch.lgamma(y_true + 1.0) - torch.lgamma(y_true + r + eps)
- t2 = (r + y_true) * torch.log(1.0 + (mean / (r + eps))) + (y_true * (torch.log(r + eps) - torch.log(mean + eps)))
- NB = t1 + t2 - torch.log(1 - pi + eps)
- z1 = torch.pow(r / (mean + r + eps), r)
- zero_inf = -torch.log(pi + (1 - pi) * z1 + eps)
- return torch.mean(torch.where(y_true < 1e-8, zero_inf, NB))
- class GATConv(MessagePassing):
- r"""The graph attentional operator from the `"Graph Attention Networks"
- <https://arxiv.org/abs/1710.10903>`_ paper
- Args:
- in_channels (int or tuple): Size of each input sample, or :obj:`-1` to
- derive the size from the first input(s) to the forward method.
- A tuple corresponds to the sizes of source and target
- dimensionalities.
- out_channels (int): Size of each output sample.
- heads (int, optional): Number of multi-head-attentions.
- (default: :obj:`1`)
- concat (bool, optional): If set to :obj:`False`, the multi-head
- attentions are averaged instead of concatenated.
- (default: :obj:`True`)
- negative_slope (float, optional): LeakyReLU angle of the negative
- slope. (default: :obj:`0.2`)
- dropout (float, optional): Dropout probability of the normalized
- attention coefficients which exposes each node to a stochastically
- sampled neighborhood during training. (default: :obj:`0`)
- add_self_loops (bool, optional): If set to :obj:`False`, will not add
- self-loops to the input graph. (default: :obj:`True`)
- bias (bool, optional): If set to :obj:`False`, the layer will not learn
- an additive bias. (default: :obj:`True`)
- **kwargs (optional): Additional arguments of
- :class:`torch_geometric.nn.conv.MessagePassing`.
- """
- _alpha: OptTensor
- def __init__(self, in_channels: Union[int, Tuple[int, int]],
- out_channels: int, heads: int = 1, concat: bool = True,
- negative_slope: float = 0.2, dropout: float = 0.0,
- add_self_loops: bool = True, bias: bool = True, **kwargs):
- kwargs.setdefault('aggr', 'add')
- super(GATConv, self).__init__(node_dim=0, **kwargs)
- self.in_channels = in_channels
- self.out_channels = out_channels
- self.heads = heads
- self.concat = concat
- self.negative_slope = negative_slope
- self.dropout = dropout
- self.add_self_loops = add_self_loops
- self.lin_src = nn.Parameter(torch.zeros(size=(in_channels, out_channels)))
- nn.init.xavier_normal_(self.lin_src.data, gain=1.414)
- self.lin_dst = self.lin_src
- self.att_src = Parameter(torch.Tensor(1, heads, out_channels))
- self.att_dst = Parameter(torch.Tensor(1, heads, out_channels))
- nn.init.xavier_normal_(self.att_src.data, gain=1.414)
- nn.init.xavier_normal_(self.att_dst.data, gain=1.414)
- self._alpha = None
- self.attentions = None
- def forward(self, x: Union[Tensor, OptPairTensor], edge_index: Adj,
- size: Size = None, return_attention_weights=None, attention=True, tied_attention = None):
- r"""
- Args:
- return_attention_weights (bool, optional): If set to :obj:`True`,
- will additionally return the tuple
- :obj:`(edge_index, attention_weights)`, holding the computed
- attention weights for each edge. (default: :obj:`None`)
- """
- H, C = self.heads, self.out_channels
- if isinstance(x, Tensor):
- assert x.dim() == 2, "Static graphs not supported in 'GATConv'"
- x_src = x_dst = torch.mm(x, self.lin_src).view(-1, H, C)
- else:
- x_src, x_dst = x
- assert x_src.dim() == 2, "Static graphs not supported in 'GATConv'"
- x_src = self.lin_src(x_src).view(-1, H, C)
- if x_dst is not None:
- x_dst = self.lin_dst(x_dst).view(-1, H, C)
- x = (x_src, x_dst)
- if not attention:
- return x[0].mean(dim=1)
- if tied_attention == None:
- alpha_src = (x_src * self.att_src).sum(dim=-1)
- alpha_dst = None if x_dst is None else (x_dst * self.att_dst).sum(-1)
- alpha = (alpha_src, alpha_dst)
- self.attentions = alpha
- else:
- alpha = tied_attention
- if self.add_self_loops:
- if isinstance(edge_index, Tensor):
- num_nodes = x_src.size(0)
- if x_dst is not None:
- num_nodes = min(num_nodes, x_dst.size(0))
- num_nodes = min(size) if size is not None else num_nodes
- edge_index, _ = remove_self_loops(edge_index)
- edge_index, _ = add_self_loops(edge_index, num_nodes=num_nodes)
- elif isinstance(edge_index, SparseTensor):
- edge_index = set_diag(edge_index)
- out = self.propagate(edge_index, x=x, alpha=alpha, size=size)
- alpha = self._alpha
- assert alpha is not None
- self._alpha = None
- if self.concat:
- out = out.view(-1, self.heads * self.out_channels)
- else:
- out = out.mean(dim=1)
- if isinstance(return_attention_weights, bool):
- if isinstance(edge_index, Tensor):
- return out, (edge_index, alpha)
- elif isinstance(edge_index, SparseTensor):
- return out, edge_index.set_value(alpha, layout='coo')
- else:
- return out
- def message(self, x_j: Tensor, alpha_j: Tensor, alpha_i: OptTensor,
- index: Tensor, ptr: OptTensor,
- size_i: Optional[int]) -> Tensor:
- alpha = alpha_j if alpha_i is None else alpha_j + alpha_i
- alpha = torch.sigmoid(alpha)
- alpha = softmax(alpha, index, ptr, size_i)
- self._alpha = alpha
- alpha = F.dropout(alpha, p=self.dropout, training=self.training)
- return x_j * alpha.unsqueeze(-1)
- def __repr__(self):
- return '{}({}, {}, heads={})'.format(self.__class__.__name__,
- self.in_channels,
- self.out_channels, self.heads)
- class SPIDER(nn.Module):
- """
- SPIDER: SPIDER: Spatially Integrated Denoising via Embedding Regularization with Single-Cell Supervision
- Args:
- hidden_dims (list): List of dimensions for input, hidden, and output layers.
- """
- def __init__(self, hidden_dims,num_classes,alpha=1.5):
- super(SPIDER, self).__init__()
- [in_dim, num_hidden, out_dim] = hidden_dims
- self.conv1 = GATConv(in_dim, num_hidden, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.conv2 = GATConv(num_hidden, out_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.conv3 = GATConv(out_dim*2, num_hidden, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.disp = GATConv(num_hidden, in_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.mean = GATConv(num_hidden, in_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.pi = GATConv(num_hidden, in_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.alpha = alpha
- self.conv_gene_psd1 = GATConv(in_dim, num_hidden, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.conv_gene_psd2 = GATConv(num_hidden, out_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.conv_gene_std1 = GATConv(in_dim, num_hidden, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.conv_gene_std2 = GATConv(num_hidden, out_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.conv_gene3 = GATConv(out_dim, num_hidden, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.disp_gene = GATConv(num_hidden, in_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.mean_gene = GATConv(num_hidden, in_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.pi_gene = GATConv(num_hidden, in_dim, heads=1, concat=False,
- dropout=0, add_self_loops=False, bias=False)
- self.mlp_classifier = nn.Sequential(
- nn.Linear(hidden_dims[-1], num_classes),
- nn.Softmax(dim=1)
- )
- def forward(self, features, featpsd, edge_index, edge_index_std, edge_index_psd, scale_factor):
- h1 = F.elu(self.conv1(features, edge_index))
- h2 = self.conv2(h1, edge_index)
- p1 = F.elu(self.conv_gene_psd1(featpsd, edge_index_psd))
- p2 = self.conv_gene_psd2(p1, edge_index_psd)
- cell_type_ratio = self.mlp_classifier(p2)
- s1 = F.elu(self.conv_gene_std1(features, edge_index_std))
- s2 = self.conv_gene_std2(s1, edge_index_std)
- h2s2 = torch.cat([h2,s2],dim=1)
- h3 = F.elu(self.conv3(h2s2, edge_index, attention=True,
- tied_attention=self.conv1.attentions))
- pi = pi_act(self.pi(h3, edge_index))
- disp = disp_act(self.disp(h3, edge_index))
- mean = mean_act(self.mean(h3, edge_index))
- mean = (mean.T * scale_factor).T
- return mean, disp, pi, h2, s2, p2, h2s2, cell_type_ratio
model.py, under CC-BY-4.0 · at the source
Overview
Abstract
Motivation: Spatial transcriptomics (ST) technologies profile gene expression while preserving tissue architecture, enabling the study of spatial cellular organization and microenvironmental interactions. However, raw ST data are heavily affected by technical noise, sparsity, and dropout events, which obscure true biological signals and hinder downstream analyses. While recent denoising methods incorporate spatial neighborhood information, they lack explicit supervision due to missing cell-type annotations in ST data. To address this challenge, we introduce SPIDER, a semi-supervised framework that leverages independently generated, annotated single-cell RNA-seq (scRNA-seq) references to guide ST denoising. SPIDER synthesizes pseudo-ST data from scRNA-seq to inject cell-type information without requiring paired measurements. The method constructs three graphs capturing spatial proximity, transcriptional similarity in real-ST data, and transcriptional structure in pseudo-ST data. Graph encoders map these representations into a shared latent space, and a domain-alignment module transfers biologically meaningful structure from pseudo-ST to real-ST embeddings. A graph-attention decoder with a zero-inflated negative binomial objective reconstructs denoised ST expression profiles.
Results: We benchmark SPIDER on human dorsolateral prefrontal cortex and breast cancer datasets. SPIDER consistently enhances spatial gene expression patterns, recovers known tissue structures, and achieves superior clustering performance compared to existing approaches. Marker gene analyses demonstrate improved spatial continuity and clearer anatomical organization. By directly producing denoised expression matrices, SPIDER improves both accuracy and interpretability, providing a generalizable solution for robust ST data denoising.
Availability and implementation: The source code and dataset is available at: (https://
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.
Zenodo 20613921
Availability: 1 check, the latest on 26 September 2026: the link answers (HTTP 200)
- 26 September 2026: the link answers (HTTP 200)
11 files
- SPIDER-main.zip/
SPIDER/ , Python, 13 lines__init__.py - SPIDER-main.zip/
SPIDER/ , Python, 300 lines, 2 matchesmodel.py - SPIDER-main.zip/
SPIDER/ , Python, 170 lines, 2 matchestrainer.py - SPIDER-main.zip/
SPIDER/ , Python, 240 lines, 1 matchutils.py - SPIDER-main.zip/
create_environment.sh , Shell, 14 lines - SPIDER-main.zip/
preprocess_data.py , Python, 86 lines - SPIDER-main.zip/
setup.py , Python, 25 lines - SPIDER-main.zip/
train.py , Python, 58 lines, 1 match - SPIDER-main.zip/
tutorial.ipynb , Jupyter, 45 lines, 1 match - SPIDER-main.zip/
LICENSE , License, 21 lines - SPIDER-main.zip/
README.md , Text, 104 lines
Availability and implementation
The source code and dataset is available at: (https://
Reproduced under the paper's license (CC BY), from the paper cited above.
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;
- 9 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
The data underlying this article are available in Zenodo at DOI: 10.5281/
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, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 3 authors, 6 MeSH terms, 1 funder, 19 references.
Cite
This paper
Ansari, M. I., Alif, M. N., & Zhang, W. (2026). SPIDER: spatially integrated denoising via embedding regularization with single cell supervision. Bioinformatics (Oxford, England), 42(Suppl 2), btag430. https://
BibTeX
@article{ansari2026spide
author = {Ansari, Md Istiaq and Alif, Muhtasim Noor and Zhang, Wei},
title = {{SPIDER: spatially integrated denoising via embedding regularization with single cell supervision}},
journal = {Bioinformatics (Oxford, England)},
year = {2026},
month = aug,
volume = {42},
number = {Suppl 2},
pages = {btag430},
publisher = {Oxford University Press},
issn = {1367-4803},
doi = {10.1093/
url = {https://
pmid = {42635216},
pmcid = {PMC13501285}
}
RIS
TY - JOUR
AU - Ansari, Md Istiaq
AU - Alif, Muhtasim Noor
AU - Zhang, Wei
TI - SPIDER: spatially integrated denoising via embedding regularization with single cell supervision
T2 - Bioinformatics (Oxford, England)
J2 - Bioinformatics
PY - 2026
DA - 2026/
VL - 42
IS - Suppl 2
SP - btag430
SN - 1367-4803
PB - Oxford University Press
DO - 10.1093/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1093/
"type": "article-journal",
"title": "SPIDER: spatially integrated denoising via embedding regularization with single cell supervision",
"container-title": "Bioinformatics (Oxford, England)",
"author": [
{
"family": "Ansari",
"given": "Md Istiaq"
},
{
"family": "Alif",
"given": "Muhtasim Noor"
},
{
"family": "Zhang",
"given": "Wei"
}
],
"container-title-short":
"volume": "42",
"issue": "Suppl 2",
"page": "btag430",
"DOI": "10.1093/
"PMID": "42635216",
"PMCID": "PMC13501285",
"ISSN": "1367-4803",
"publisher": "Oxford University Press",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
8,
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.1038/s41592-026-03194-8 [code]
- Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering.Journal: Nature methodsIn common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 7 references
- [2] doi:10.1093/bib/bbag298 [code]
- Empowering multifaceted analysis of spatial transcriptomics data with RGAST.Journal: Briefings in bioinformaticsIn common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 7 references
- [3] doi:10.1093/bib/bbaf316 [code]
- TriCLFF: a multi-modal feature fusion framework using contrastive learning for spatial domain identification.Journal: Briefings in bioinformaticsIn common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 7 references
- [4] doi:10.1186/s12864-024-10469-x [code]
- HyperGCN: an effective deep representation learning framework for the integrative analysis of spatial transcriptomics data.Journal: BMC genomicsIn common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 6 references
- [5] doi:10.1038/s41592-026-03034-9 [code]
- 3d-OT: a deep geometry-aware framework for heterogeneous slices alignment of spatial multi-omics.Journal: Nature methodsIn common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 6 references
- [6] doi:10.21203/rs.3.rs-9676637/v1 [code]
- A Comprehensive Benchmarking of Spatial Deconvolution and Domain Detection Methods across Diverse Tissues and Spatial Transcriptomic TechnologiesJournal: Research Square (preprint)In common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 6 references
- [7] doi:10.1038/s41467-023-44367-9 [code]
- MENDER: fast and scalable tissue structure identification in spatial omics data.Journal: Nature communicationsIn common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 6 references
- [8] doi:10.1002/advs.77003 [code]
- SemanticST: A Scalable Multi-Contextual Graph Learning Framework for Uncovering Spatial Niches and Robust Multi-Sample Integration in Spatial Transcriptomics.Journal: Advanced science (Weinheim, Baden-Wurttemberg, Germany)In common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 6 references
- [9] doi:10.1093/bib/bbaf657 [code]
- SpaTM: topic models for inferring spatially informed transcriptional programs.Journal: Briefings in bioinformaticsIn common: PyTorch Geometric, rpy2, anndata, 7 other tools, genetics / omics, 5 references
- [10] doi:10.1371/journal.pcbi.1013912 [code]
- AugGCL: Multimodal graph learning for spatial transcriptomics analysis with enhanced gene and morphological data.Journal: PLoS computational biologyIn common: PyTorch Geometric, rpy2, Scanpy, 6 other tools, genetics / omics, 7 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: 1 repository of the authors' code, each at its verified commit and with its license, 9 scripts, and 7 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:8af5102c12690877…
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.1093/bioinformatics/btag430)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.1093/bioinformatics/btag430.svg
:target: https://openscicode.org/badge/doi/10.1093/bioinformatics/btag430
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1093/bioinformatics/btag430"><img src="https://openscicode.org/badge/doi/10.1093/bioinformatics/btag430.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->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)
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
