SE-SNN: Squeeze-and-Excitation-Enhanced Spiking Neural Networks with Learnable Neuron Dynamics for Event-Based Vision.
3 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 4 matches
- [1] § 4. Experiments › 4.1. Dataset and Setup ↔ sesnn.py, lines 227 to 346 · score 0.91 · cosine annealing, AdamW, weight decay, PyTorch, clipping, class · block
oscr:b:KK8GGXY8YFMAS-7· Report a mismatch - [2] § 4. Experiments › 4.1. Dataset and Setup ↔ sesnn.py, lines 227 to 346 · score 0.69 · AdamW, weight decay, neuron parameters, Optimization · block
oscr:b:KK8GGXY8YFMAS-7· Report a mismatch - [3] § 4. Experiments › 4.1. Dataset and Setup ↔ sesnn.py, lines 202 to 206 · score 0.55 · Random horizontal flip, crop · block
oscr:b:4D6CJ7P8ZDPWE-F· Report a mismatch - [4] § 4. Experiments › 4.5. Ablation Study ↔ sesnn.py, lines 41 to 69 · score 0.54 · Excitation blocks, SE blocks, Squeeze, channel, spiking · block
oscr:b:2V8078VKKTFHM-K· 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 · 349 lines · 13 KB · no license · 4 matches
- import torch
- import torch.nn as nn
- from spikingjelly.activation_based import neuron, functional, layer, surrogate
- from spikingjelly.datasets.cifar10_dvs import CIFAR10DVS
- from torch.utils.data import DataLoader, random_split, Dataset
- from torchvision import transforms
- import torch.optim as optim
- from torch.optim.lr_scheduler import CosineAnnealingLR, LinearLR, SequentialLR
- from torch.amp import GradScaler, autocast
- import os
- import gc
- import numpy as np
- import copy
- # ----------------------------
- # 🔧 配置:高性能模式
- # ----------------------------
- device = 'cuda:0' if torch.cuda.is_available() else 'cpu'
- batch_size = 16
- epochs = 300
- base_lr = 4e-4
- T = 16
- root_dir = './data/CIFAR10DVS'
- # 早停参数
- patience = 20
- min_delta = 0.0
- print(f"🚀 Device: {device} | VRAM: {torch.cuda.get_device_properties(0).total_memory / 1e9:.1f} GB")
- print(f"⚙️ Config: Batch={batch_size}, T={T}, LR={base_lr}, Strategy=SE-Net+Mixup+Warmup")
- # ----------------------------
- # 🧠 1. 可学习 PLIF + SE Block (已修复)
- # ----------------------------
- class RobustPLIF(neuron.LIFNode):
- def __init__(self, tau=10.0, v_threshold=0.5, *args, **kwargs):
- super().__init__(tau=tau, v_threshold=v_threshold, surrogate_function=surrogate.ATan(alpha=2.0), detach_reset=True, *args, **kwargs)
- self.tau = nn.Parameter(torch.as_tensor(float(self.tau), dtype=torch.float))
- self.v_threshold = nn.Parameter(torch.as_tensor(float(self.v_threshold), dtype=torch.float))
- class SEBlock(nn.Module):
- """Squeeze-and-Excitation Block for SNN (Fixed)"""
- def __init__(self, channels, reduction=16):
- super().__init__()
- self.avg_pool = layer.AdaptiveAvgPool2d(1)
- # 注意:这里使用 nn.Sequential 包含普通的 Linear 和 Sigmoid
- # 因为 SE 生成的是权重系数 (0-1 浮点数),不需要发放脉冲
- self.fc = nn.Sequential(
- layer.Linear(channels, channels // reduction, bias=False),
- # 中间层加一个 ReLU 或 Sigmoid 都可以,这里用 ReLU 保持非负,或者用 LIF 也可以但没必要
- # 为了简单有效,中间层用 ReLU (普通神经网络激活) 或者 恒等映射
- # 但 layer 模块里主要是 SNN 层。我们直接用 nn.ReLU 配合普通 Linear?
- # SpikingJelly 的 layer.Linear 输出是膜电位,可以直接接 nn.ReLU
- nn.ReLU(inplace=True),
- layer.Linear(channels // reduction, channels, bias=False),
- nn.Sigmoid() # 【修复】使用 torch.nn.Sigmoid 生成 0-1 之间的权重
- )
- def forward(self, x):
- # x shape: (N, C, H, W) - 单时间步的膜电位
- b, c, h, w = x.shape
- y = self.avg_pool(x) # (N, C, 1, 1)
- y = layer.Flatten()(y) # (N, C)
- y = self.fc(y) # (N, C) - 输出是 0-1 的浮点数
- y = y.view(b, c, 1, 1)
- # 将权重乘回原特征图 (逐元素相乘)
- return x * y
- # ----------------------------
- # 🏗️ 2. SE-ResNet 架构
- # ----------------------------
- class SEResidualBlock(nn.Module):
- def __init__(self, in_channels, out_channels, stride=1, dropout=0.1, use_se=True):
- super().__init__()
- self.conv1 = layer.Conv2d(in_channels, out_channels, 3, stride=stride, padding=1, bias=False)
- self.bn1 = layer.BatchNorm2d(out_channels)
- self.lif1 = RobustPLIF(tau=10.0, v_threshold=0.4)
- self.dropout1 = layer.Dropout(dropout) if dropout > 0 else None
- self.conv2 = layer.Conv2d(out_channels, out_channels, 3, stride=1, padding=1, bias=False)
- self.bn2 = layer.BatchNorm2d(out_channels)
- self.lif2 = RobustPLIF(tau=10.0, v_threshold=0.4)
- self.use_se = use_se
- if self.use_se:
- self.se = SEBlock(out_channels)
- self.downsample = None
- if stride != 1 or in_channels != out_channels:
- self.downsample = nn.Sequential(
- layer.Conv2d(in_channels, out_channels, 1, stride=stride, bias=False),
- layer.BatchNorm2d(out_channels)
- )
- def forward(self, x):
- identity = x
- out = self.conv1(x)
- out = self.bn1(out)
- out = self.lif1(out)
- if self.dropout1: out = self.dropout1(out)
- out = self.conv2(out)
- out = self.bn2(out)
- if self.use_se:
- out = self.se(out)
- if self.downsample is not None:
- identity = self.downsample(x)
- out = out + identity
- out = self.lif2(out)
- return out
- class SESNN(nn.Module):
- def __init__(self, num_classes=10, T=16):
- super().__init__()
- self.T = T
- base_channels = 64
- self.init_conv = nn.Sequential(
- layer.Conv2d(2, base_channels, 3, padding=1, bias=False),
- layer.BatchNorm2d(base_channels),
- RobustPLIF(tau=10.0, v_threshold=0.4),
- layer.MaxPool2d(2, 2)
- )
- self.layer1 = self._make_layer(base_channels, base_channels, 2, stride=1, dropout=0.1)
- self.layer2 = self._make_layer(base_channels, base_channels*2, 2, stride=2, dropout=0.2)
- self.layer3 = self._make_layer(base_channels*2, base_channels*4, 2, stride=2, dropout=0.3)
- self.layer4 = self._make_layer(base_channels*4, base_channels*8, 2, stride=2, dropout=0.3)
- self.avgpool = layer.AdaptiveAvgPool2d((4, 4))
- self.fc = nn.Sequential(
- layer.Flatten(),
- layer.Dropout(0.5),
- layer.Linear(base_channels*8 * 4 * 4, 1024),
- RobustPLIF(tau=5.0, v_threshold=0.5),
- layer.Dropout(0.5),
- layer.Linear(1024, num_classes)
- )
- def _make_layer(self, in_channels, out_channels, num_blocks, stride, dropout=0.0):
- layers = []
- layers.append(SEResidualBlock(in_channels, out_channels, stride, dropout))
- for _ in range(1, num_blocks):
- layers.append(SEResidualBlock(out_channels, out_channels, 1, dropout))
- return nn.Sequential(*layers)
- def forward(self, x):
- N, T_in, C, H, W = x.shape
- output_list = []
- for t in range(T_in):
- x_t = x[:, t, :, :, :]
- x_t = self.init_conv(x_t)
- x_t = self.layer1(x_t)
- x_t = self.layer2(x_t)
- x_t = self.layer3(x_t)
- x_t = self.layer4(x_t)
- x_t = self.avgpool(x_t)
- output_list.append(x_t)
- # 改进的时间整合:取最大值
- x = torch.stack(output_list, dim=1).max(dim=1)[0]
- x = self.fc(x)
- return x
- # ----------------------------
- # 🔄 数据加载 (Mixup + 改进归一化)
- # ----------------------------
- def mixup_data(x, y, alpha=0.2):
- if alpha > 0:
- lam = np.random.beta(alpha, alpha)
- else:
- lam = 1
- batch_size = x.size(0)
- index = torch.randperm(batch_size).to(x.device)
- mixed_x = lam * x + (1 - lam) * x[index, :]
- y_a, y_b = y, y[index]
- return mixed_x, y_a, y_b, lam
- class NormDataset(Dataset):
- def __init__(self, dataset, transform):
- self.dataset = dataset
- self.transform = transform
- def __len__(self):
- return len(self.dataset)
- def __getitem__(self, i):
- ev, tgt = self.dataset[i]
- if isinstance(ev, np.ndarray):
- ev = torch.from_numpy(ev).float()
- ev = self.transform(ev)
- if ev.max() > 0:
- ev = ev / (ev.max() + 1e-5)
- ev = torch.clamp(ev, 0, 1)
- return ev, tgt
- def get_train_transform():
- return transforms.Compose([
- transforms.RandomHorizontalFlip(p=0.5),
- transforms.RandomCrop(size=128, padding=4),
- ])
- def get_test_transform():
- return transforms.Compose([])
- def get_loaders():
- train_transform = get_train_transform()
- test_transform = get_test_transform()
- full_dataset = CIFAR10DVS(root_dir, data_type='frame', frames_number=T, split_by='time')
- train_ds = NormDataset(full_dataset, train_transform)
- train_size = int(0.9 * len(train_ds))
- test_size = len(train_ds) - train_size
- train_subset, test_subset = random_split(train_ds, [train_size, test_size], generator=torch.Generator().manual_seed(42))
- train_loader = DataLoader(train_subset, batch_size=batch_size, shuffle=True, num_workers=0, pin_memory=True, drop_last=True)
- test_loader = DataLoader(test_subset, batch_size=batch_size, shuffle=False, num_workers=0, pin_memory=True)
- return train_loader, test_loader
- # ----------------------------
- # 🚀 主训练流程
- # ----------------------------
- def main():
- train_loader, test_loader = get_loaders()
- model = SESNN(num_classes=10, T=T).to(device)
- ema_model = copy.deepcopy(model)
- ema_decay = 0.995
- param_count = sum(p.numel() for p in model.parameters())
- print(f"📊 Model Params: {param_count:,}")
- neuron_params = []
- normal_params = []
- for name, param in model.named_parameters():
- if 'tau' in name or 'v_threshold' in name:
- neuron_params.append(param)
- else:
- normal_params.append(param)
- optimizer = optim.AdamW([
- {'params': normal_params, 'lr': base_lr},
- {'params': neuron_params, 'lr': base_lr * 0.5}
- ], weight_decay=5e-4, betas=(0.9, 0.999))
- warmup_epochs = 10
- scheduler_warmup = LinearLR(optimizer, start_factor=0.1, end_factor=1.0, total_iters=warmup_epochs)
- scheduler_cosine = CosineAnnealingLR(optimizer, T_max=epochs - warmup_epochs, eta_min=1e-7)
- scheduler = SequentialLR(optimizer, schedulers=[scheduler_warmup, scheduler_cosine], milestones=[warmup_epochs])
- scaler = GradScaler('cuda')
- criterion = nn.CrossEntropyLoss(label_smoothing=0.1)
- best_acc = 0.0
- best_state = None
- wait = 0
- def update_ema(model, ema_model, decay):
- with torch.no_grad():
- for (name_ms, ms), (name_mes, mes) in zip(model.state_dict().items(), ema_model.state_dict().items()):
- if ms.dtype.is_floating_point:
- mes.mul_(decay)
- mes.add_(ms, alpha=1.0 - decay)
- else:
- mes.copy_(ms)
- for epoch in range(epochs):
- model.train()
- train_correct, train_total = 0, 0
- for data, target in train_loader:
- data, target = data.to(device), target.to(device)
- mixed_data, y_a, y_b, lam = mixup_data(data, target, alpha=0.2)
- functional.reset_net(model)
- optimizer.zero_grad()
- with autocast('cuda'):
- output = model(mixed_data)
- loss = lam * criterion(output, y_a) + (1 - lam) * criterion(output, y_b)
- scaler.scale(loss).backward()
- scaler.unscale_(optimizer)
- torch.nn.utils.clip_grad_norm_(model.parameters(), max_norm=1.0)
- scaler.step(optimizer)
- scaler.update()
- update_ema(model, ema_model, ema_decay)
- with torch.no_grad():
- for name, param in model.named_parameters():
- if 'tau' in name: param.clamp_(1.0, 20.0)
- elif 'v_threshold' in name: param.clamp_(0.2, 0.8)
- for name, param in ema_model.named_parameters():
- if 'tau' in name: param.clamp_(1.0, 20.0)
- elif 'v_threshold' in name: param.clamp_(0.2, 0.8)
- _, pred = output.max(1)
- train_correct += pred.eq(target).sum().item()
- train_total += target.size(0)
- scheduler.step()
- ema_model.eval()
- test_correct, test_total = 0, 0
- with torch.no_grad():
- for data, target in test_loader:
- data, target = data.to(device), target.to(device)
- functional.reset_net(ema_model)
- output = ema_model(data)
- _, pred = output.max(1)
- test_correct += pred.eq(target).sum().item()
- test_total += target.size(0)
- train_acc = 100.0 * train_correct / train_total
- test_acc = 100.0 * test_correct / test_total
- if test_acc > best_acc + min_delta:
- best_acc = test_acc
- best_state = copy.deepcopy(ema_model.state_dict())
- wait = 0
- print(f"💾 New Best (EMA)! Test Acc: {best_acc:.2f}%")
- torch.save(best_state, "best_se_snn_fixed.pth")
- else:
- wait += 1
- if wait >= patience:
- print(f"⏹️ Early Stopping triggered at Epoch {epoch+1}. Best Acc: {best_acc:.2f}%")
- break
- print(f"Epoch {epoch+1}/{epochs} | Train: {train_acc:.2f}% | Test(EMA): {test_acc:.2f}% | Wait: {wait}/{patience}")
- if epoch % 10 == 0:
- gc.collect()
- torch.cuda.empty_cache()
- if best_state is not None:
- ema_model.load_state_dict(best_state)
- print(f"✅ Training finished. Loaded best model with Acc: {best_acc:.2f}%")
- if __name__ == "__main__":
- main()
sesnn.py at commit 2577e77, no license · at the source
Overview
Abstract
Spiking neural networks (SNNs) have emerged as a promising paradigm for energy-efficient neuromorphic computing, particularly when processing asynchronous event streams from dynamic vision sensors (DVSs). However, SNNs often suffer from limited representational capacity and suboptimal feature recalibration compared to their artificial counterparts. To address these challenges, we propose SE-SNN, a novel architecture that integrates Squeeze-and-Excitation (SE) blocks into deep residual SNNs, enabling channel-wise attention without spike generation. Furthermore, we introduce a Robust Parametric Leaky Integrate-and-Fire (RobustPLIF) neuron model with learnable membrane time constant (τ) and firing threshold (vth), allowing adaptive temporal dynamics in each layer. Our model is trained on the CIFAR10-DVS dataset.The experimental results demonstrate that SE-SNN achieves an accuracy of 78.8 % on CIFAR10-DVS with 16 time steps, outperforming baseline SNNs while maintaining biological plausibility and hardware efficiency. Ablation studies confirm the individual contributions of the SE blocks and learnable neuron parameters to the performance gains.
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 4 matches between paragraphs and lines of code.
chuang-liu-cn/code
2577e77fc0c9eaacda9e9fda29ad554e06ab1836, 26 March 2026Availability: 1 check, the latest on 28 September 2026: the link answers
- 28 September 2026: the link answers
29 files
- Indicator_calculation/
CR_calculation.m , MATLAB, 32 lines - Indicator_calculation/
Hypervolume_calculation. , MATLAB, 23 linesm - Indicator_calculation/
IGD_calculation.m , MATLAB, 23 lines - MM_testfunctions/
functions/ , MATLAB, 8 linesMMF1.m - MM_testfunctions/
functions/ , MATLAB, 16 linesMMF10.m - MM_testfunctions/
functions/ , MATLAB, 17 linesMMF11.m - MM_testfunctions/
functions/ , MATLAB, 18 linesMMF12.m - MM_testfunctions/
functions/ , MATLAB, 16 linesMMF13.m - MM_testfunctions/
functions/ , MATLAB, 34 linesMMF14.m - MM_testfunctions/
functions/ , MATLAB, 29 linesMMF14_a.m - MM_testfunctions/
functions/ , MATLAB, 38 linesMMF15.m - MM_testfunctions/
functions/ , MATLAB, 38 linesMMF15_a.m - MM_testfunctions/
functions/ , MATLAB, 15 linesMMF1_e.m - MM_testfunctions/
functions/ , MATLAB, 41 linesMMF1_z.m - MM_testfunctions/
functions/ , MATLAB, 11 linesMMF2.m - MM_testfunctions/
functions/ , MATLAB, 34 linesMMF3.m - MM_testfunctions/
functions/ , MATLAB, 10 linesMMF4.m - MM_testfunctions/
functions/ , MATLAB, 10 linesMMF5.m - MM_testfunctions/
functions/ , MATLAB, 25 linesMMF6.m - MM_testfunctions/
functions/ , MATLAB, 8 linesMMF7.m - MM_testfunctions/
functions/ , MATLAB, 10 linesMMF8.m - MM_testfunctions/
functions/ , MATLAB, 14 linesMMF9.m - MM_testfunctions/
functions/ , MATLAB, 18 linesOmni_test.m - MM_testfunctions/
functions/ , MATLAB, 34 linesSYM_PART_rotated.m - MM_testfunctions/
functions/ , MATLAB, 31 linesSYM_PART_simple.m - main.m, MATLAB, 398 lines
- mem.m, MATLAB, 270 lines
- sesnn.py, Python, 349 lines, 4 matches
- README.md, Text, 7 lines
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;
- 28 scripts, each with its path and the digest of its content;
- 4 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
Restrictions apply to the availability of these data. Data were obtained from third party and are available [from the authors/
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, 28 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 2 authors, 6 keywords, 3 funders, 40 references.
Cite
This paper
Liu, C., & Chen, Y. (2026). SE-SNN: Squeeze-and-Excitation-E
BibTeX
@article{liu2026se,
author = {Liu, Chuang and Chen, Yang},
title = {{SE-SNN: Squeeze-and-Excitation-E
journal = {Biomimetics (Basel, Switzerland)},
year = {2026},
month = may,
volume = {11},
number = {5},
pages = {359},
publisher = {Multidisciplinary Digital Publishing Institute (MDPI)},
issn = {2313-7673},
doi = {10.3390/
url = {https://
pmid = {42187426},
pmcid = {PMC13204279}
}
RIS
TY - JOUR
AU - Liu, Chuang
AU - Chen, Yang
TI - SE-SNN: Squeeze-and-Excitation-E
T2 - Biomimetics (Basel, Switzerland)
J2 - Biomimetics (Basel)
PY - 2026
DA - 2026/
VL - 11
IS - 5
SP - 359
SN - 2313-7673
PB - Multidisciplinary Digital Publishing Institute (MDPI)
DO - 10.3390/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.3390/
"type": "article-journal",
"title": "SE-SNN: Squeeze-and-Excitation-E
"container-title": "Biomimetics (Basel, Switzerland)",
"author": [
{
"family": "Liu",
"given": "Chuang"
},
{
"family": "Chen",
"given": "Yang"
}
],
"container-title-short":
"volume": "11",
"issue": "5",
"page": "359",
"DOI": "10.3390/
"PMID": "42187426",
"PMCID": "PMC13204279",
"ISSN": "2313-7673",
"publisher": "Multidisciplinary Digital Publishing Institute (MDPI)",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
5,
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.1038/s41598-025-22430-3 [code]
- BIASNN: a biologically inspired attention mechanism in spiking neural networks for image classification.Journal: Scientific reportsIn common: NumPy, computational, 6 references
- [2] doi:10.3389/fnins.2024.1516868
- Fourier or Wavelet bases as counterpart self-attention in spikformer for efficient visual classification.Journal: Frontiers in neuroscienceIn common: computational, 5 references
- [3] doi:10.1038/s41467-025-63771-x [code]
- Efficient and robust temporal processing with neural oscillations modulated spiking neural networks.Journal: Nature communicationsIn common: PyTorch, NumPy, computational, 4 references
- [4] doi:10.3389/fnins.2023.1167134 [code]
- Spiking neural network with working memory can integrate and rectify spatiotemporal features.Journal: Frontiers in neuroscienceIn common: PyTorch, NumPy, 4 references
- [5] doi:10.3389/fnins.2022.1079357 [code]
- STSC-SNN: Spatio-Temporal Synaptic Connection with temporal convolution and attention for spiking neural networks.Journal: Frontiers in neuroscienceIn common: PyTorch, NumPy, 4 references
- [6] doi:10.3389/fncom.2024.1508297
- Spike-HAR++: an energy-efficient and lightweight parallel spiking transformer for event-based human action recognition.Journal: Frontiers in computational neuroscienceIn common: computational, 4 references
- [7] doi:10.1038/s41467-025-62251-6 [code]
- A multisynaptic spiking neuron for simultaneously encoding spatiotemporal dynamics.Journal: Nature communicationsIn common: PyTorch, NumPy, 3 references
- [8] doi:10.1038/s41598-025-34046-8 [code]
- Enhancing time scalability of spiking neural networks with dynamic time constants.Journal: Scientific reportsIn common: PyTorch, NumPy, computational, 2 references
- [9] doi:10.3390/brainsci13020319 [code]
- Constrain Bias Addition to Train Low-Latency Spiking Neural Networks.Journal: Brain sciencesIn common: PyTorch, NumPy, computational, 2 references
- [10] doi:10.1038/s41598-023-31110-z [code]
- Multitask computation through dynamics in recurrent spiking neural networks.Journal: Scientific reportsIn common: PyTorch, NumPy, computational, 2 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, 28 scripts, and 4 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:80eed1bbe09dd8ed…
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.3390/biomimetics11050359)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.3390/biomimetics11050359.svg
:target: https://openscicode.org/badge/doi/10.3390/biomimetics11050359
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.3390/biomimetics11050359"><img src="https://openscicode.org/badge/doi/10.3390/biomimetics11050359.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.
