Papers
Topics
Authors
Recent
Search
2000 character limit reached

SPICED: Multi-Domain Research Artifacts

Updated 12 July 2026
  • SPICED is a term representing distinct, domain-specific artifacts in software engineering, autonomous driving, circuit security, and science communication.
  • In software engineering, SPICED benchmarks use an automated SPICE labeling pipeline to drastically reduce manual curation costs and improve annotation reliability.
  • In autonomous driving, circuit security, and NLP, SPICED employs self-play learning, LLM-enhanced detection, and paraphrase benchmarks to advance domain-specific research.

Searching arXiv for papers related to “SPICED” and “SPICE” to ground the article. SPICED is a research term with multiple, domain-specific meanings rather than a single unified concept. In recent arXiv usage, it denotes at least four distinct artifacts: SPICE-labeled software-engineering benchmark data derived from an automated labeling pipeline; “Spiced Self-Play Reinforcement Learning” for autonomous driving; “Syntactical Bug and Trojan Pattern Identification in A/MS Circuits using LLM-Enhanced Detection” for analog and mixed-signal circuit security; and the “Scientific Paraphrase and Information ChangE Dataset” for modeling information change in science communication (Bhatia et al., 12 Jul 2025, Cornelisse et al., 11 Jun 2026, Chaudhuri et al., 2024, Wright et al., 2022).

1. Terminological scope and disambiguation

The principal contemporary usages of SPICED differ in objective, methodology, and evaluation regime. In software engineering, the term is used informally for data or benchmarks produced by the SPICE labeling system rather than as a separate acronym. In autonomous driving and analog-circuit security, SPICED is an explicit acronym naming a method or framework. In NLP for science communication, SPICED names a benchmark dataset.

Usage Domain Expansion or meaning
SPICED via SPICE Software engineering SPICE-labeled SWE-bench-style data
SPICED Autonomous driving Spiced Self-Play Reinforcement Learning
SPICED A/MS circuit security Syntactical Bug and Trojan Pattern Identification in A/MS Circuits using LLM-Enhanced Detection
SPICED Science communication NLP Scientific Paraphrase and Information ChangE Dataset

A common source of confusion is that these usages are not methodologically related. Their only shared feature is nomenclature. This suggests that SPICED functions more as a local acronym family than as a stable cross-disciplinary term.

2. SPICED in software-engineering benchmark curation

In software engineering, SPICED refers to data or benchmarks produced by SPICE, an automated labeling pipeline for SWE-bench-style datasets that annotates issue clarity, test coverage, and effort estimation (Bhatia et al., 12 Jul 2025). The motivation is the high cost and low reproducibility of manual curation. The paper reports that manually building SWE-bench Verified took about 2,265.32{,}265.3 engineer-hours for 500 instances, with a cost exceeding \$170,000, and that a separate seven-week annotation effort over 840 SWE-Gym instances by seven experienced software engineering researchers never exceeded the reliability threshold of about $0.67$ in Krippendorff’s alpha. Reported agreement ranges were $0.24$ to $0.46$ for ICA and 0.012-0.012 to $0.39$ for TCA; the paper also cites public SWE-V agreement of about $0.24$ for issue clarity and $0.41$ for test adequacy. The pipeline is therefore framed as a response to subjectivity, repository specificity, and poor scalability.

SPICE targets the same principal dimensions used in SWE-bench Verified: Issue Clarity Assessment and Test Coverage Assessment, with effort estimation retained as supplementary annotation. The paper states the binary filtering rule as

ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}

and

TCAlabel={Adequate,if score{0,1} Inadequate,if score{2,3}\text{TCAlabel} = \begin{cases} \text{Adequate}, & \text{if score} \in \{0,1\}\ \text{Inadequate}, & \text{if score} \in \{2,3\} \end{cases}

with retention only when $0.67$0 and $0.67$1. Architecturally, the system combines context-aware code navigation, rationale-driven prompting, and multi-pass consensus. The ICA pipeline cleans the issue title and body, removes distracting formatting, and applies a rationale-informed prompt derived from recurring patterns in high-agreement human rationales. The TCA pipeline uses Aider and its RepoMap algorithm, narrows context to files from the gold patch and test patch via read-only file references, and then parses structured model output into a final TCA score. Each instance is labeled three times; SPICE takes majority vote, and if no majority exists, it uses the median.

Evaluation was conducted on a 110-instance SWE-V set sampled by quota, with comparison against majority-vote labels derived from individual human annotations rather than moderated final labels. The best ICA result was $0.67$2 accuracy using GPT-4o-mini, and the best TCA result was $0.67$3 using DeepSeek Reasoner. In a manual agreement-based evaluation with four annotators reviewing SPICE outputs and rationales, SPICE was judged correct on ICA $0.67$4 of the time and on TCA $0.67$5 of the time. A confidence signal also emerged: when human reviewers disagreed with a TCA label, agreement among SPICE’s three rationale generations was $0.67$6, whereas it was $0.67$7 when reviewers agreed. The released SPICE Bench contains 6,802 SPICE-labeled instances curated from 291 open-source projects in SWE-Gym, described as over 13 times larger than SWE-bench Verified’s human-labeled subset of 500 instances. Cost estimates for 1,000 instances are about \$0.67$85.10 for SPICE’s default configuration, with a corresponding $0.67$9 cost reduction and roughly $0.24$0 speedup from about $0.24$1 engineer-hours to about 25 hours (Bhatia et al., 12 Jul 2025).

3. SPICED as human-regularized self-play for autonomous driving

In autonomous driving, SPICED stands for “Spiced Self-Play Reinforcement Learning,” a method that treats human demonstrations as a regularization objective on top of a minimal safe goal-reaching reward (Cornelisse et al., 11 Jun 2026). The paper’s central claim is that pure self-play can learn effective but alien driving conventions, while large-scale imitation learning is data-intensive and reward engineering is brittle and labor-intensive. SPICED addresses this by training a behavioral cloning anchor $0.24$2 on a small subset $0.24$3 of Waymo Open Motion Dataset logs and then freezing that anchor while learning an RL policy $0.24$4 with PPO and an on-policy KL penalty:

$0.24$5

The reward is intentionally sparse: $0.24$6 for reaching the goal, $0.24$7 for collision or off-road, and $0.24$8 otherwise, with the appendix specifying a goal condition of reaching within $0.24$9 before episode end.

The amount of human data is a defining feature. The paper studies anchors built from roughly 10 minutes, 30 minutes, 3 hours, and 30 hours of self-driving car demonstrations, and emphasizes that 30 minutes of human demonstrations already provides a useful anchor. It claims that this is only $0.46$0 of the full WOMD training set and about $0.46$1 less human data than comparable imitation-learning baselines. The rationale is that self-play supplies the main competence signal through 20 billion synthetic transitions, roughly 63 years of simulated driving at 10 Hz, while the human data only needs to nudge the policy away from alien equilibria.

Experimentally, regularization preserves self-play success while materially improving coordination with held-out human trajectories. Table 1 reports an unregularized self-play score of $0.46$2 with human-replay at-fault collision rate $0.46$3, versus $0.46$4 and $0.46$5 for regularized self-play with 30 minutes of human data. The paper describes this as about a $0.46$6 reduction in at-fault collisions while preserving near-perfect task success, and also reports an $0.46$7 reduction in at-fault collisions and a $0.46$8 reduction in self-play collision rate relative to SMART in that low-data regime. Additional analyses show WOSAC realism increasing from $0.46$9 to $-0.012$0, mean $-0.012$1 dropping from $-0.012$2 to $-0.012$3, max $-0.012$4 from $-0.012$5 to $-0.012$6, severe collisions above 15 mph from $-0.012$7 to $-0.012$8, and substantial reductions in longitudinal L2 error, lateral L2 error, and time-aligned ADE. Policies train in about 15 hours on a single consumer-grade GPU, with PufferDrive reaching about 390k steps/sec on an RTX 5090 in the appendix. The paper nonetheless notes limitations: in curated hard cases, at-fault collision rates rise to around $-0.012$9–$0.39$0, evaluation uses human-replay and IDM proxies, and anchor quality remains a bottleneck (Cornelisse et al., 11 Jun 2026).

4. SPICED for analog and mixed-signal circuit security

In analog and mixed-signal hardware security, SPICED denotes “Syntactical Bug and Trojan Pattern Identification in A/MS Circuits using LLM-Enhanced Detection” (Chaudhuri et al., 2024). The framework is designed to detect and localize both syntactical bugs in SPICE netlists and stealthy analog Trojans without hardware modification, explicit training, or area overhead. The paper explicitly positions it as the first LLM-aided framework for detecting and localizing syntactical bugs and analog Trojans in circuit netlists, and reports zero area overhead because all analysis is performed in software on netlists, specifications, and HSPICE simulation logs.

The workflow has two branches. For syntactical bug detection, the system uses an instruction-following refinement loop over SPICE syntax rules. The LLM identifies bug type and bug location; false positives trigger manual refinement of the syntax rules in the prompt. The benchmark includes 18 bugs across easy, medium, and difficult categories, including missing transistor node, missing .[END](https://www.emergentmind.com/topics/eccentric-nuclear-disk-end), missing model name, floating node, extra transistor node, wrong resistor format, incorrect .PRINT, wrong current source definition, incorrect parameter definition, and missing .DC increment. For Trojan detection and localization, SPICED uses prompt-based anomaly-detection rules grounded in observable Trojan symptoms. Rule 1 labels Trojan-Activation Input when output voltage exceeds specification. Rule 2 compares intermediate-node voltage deviations between Normal Input and Trojan-Activation Input ranges, with two alternatives for final suspect-node selection: union or intersection. Rule 3 inspects MOSFET current anomalies and flags devices whose currents spike under Trojan-Activation Inputs. The model is prompted with supervised-learning rules, few-shot examples, and chain-of-thought-style explanations.

Evaluation uses analog benchmarks from AMSNet and GitHub/adsbenchmark, including differential amplifiers, inverters, OPAMPs, bandgap filters, current mirrors, switched-capacitor circuits, NMOS transistor circuits, and common-source amplifiers. The main Trojan is A2, described as a stealthy analog malicious hardware Trojan with small footprint, embedded at netlist level and triggered internally by an intermediate node. The reported experimental setup uses GPT-3.5-turbo on an NVIDIA A100 GPU, with a max context window of 16,385 tokens and average inference time of 9.2 seconds per Trojan-identification case. Across all Trojan cases, rules plus few-shot prompting performs best, with average Trojan coverage $0.39$1, Precision $0.39$2, and Recall or true positive rate $0.39$3; few-shot only and rules only achieve average Trojan coverage $0.39$4 and $0.39$5, respectively. The paper also states that highlighted cases achieved 100% accuracy with zero false positives. For syntactical bug detection, examples include $0.39$6 bug coverage and $0.39$7 bug resolved for a common-source amplifier, $0.39$8 and $0.39$9 for an NMOS transistor circuit, and $0.24$0 bug coverage with $0.24$1 bug resolved for an OPAMP. The method’s limitations are largely prompt- and log-dependent: false positives decrease only after rule refinement, Trojan localization relies on anomalous voltage and current behavior appearing in logs, and the reported scope is limited to selected benchmark analog circuits and A2-like Trojans (Chaudhuri et al., 2024).

5. SPICED as a dataset for information change in science communication

In NLP, SPICED stands for the “Scientific Paraphrase and Information ChangE Dataset,” a benchmark designed to quantify how faithfully scientific findings are communicated across papers, news, and tweets (Wright et al., 2022). The central target is not ordinary semantic textual similarity but the degree of information change between paired statements about scientific findings. The dataset contains 6,000 scientific finding pairs, of which 3,600 are manually annotated and 2,400 automatically labeled from extreme cases. It is drawn from four fields that receive the most media attention in the study: Medicine, Biology, Computer science, and Psychology.

Dataset construction begins from Altmetric with 17,668 scientific papers, 41,388 paired news articles, and 733,755 tweets. To extract candidate findings, the authors fine-tune RoBERTa as a sentence classifier over PubMed abstract sentences labeled BACKGROUND, OBJECTIVE, METHODS, RESULTS, and CONCLUSIONS. The classifier achieves $0.24$2 F1 on a held-out set; for news, manual inspection of 100 extracted conclusions yields precision $0.24$3. This produces 45.7M potential $0.24$4news, paper$0.24$5 finding pairs and 35.6M potential $0.24$6tweet, paper$0.24$7 finding pairs. A pilot sample of 400 pairs, evenly sampled across SBERT cosine-similarity bins of width 0.05 and annotated as matching or not matching, yields Krippendorff’s alpha $0.24$8. The resulting sampling policy is: below 0.4 automatically unmatched, above 0.9 with Jaccard index $0.24$9 automatically matched, and 0.4 to 0.9 sampled for human annotation.

The final annotation target is the 5-point Information Matching Score: 1 completely different, 2 mostly different, 3 somewhat similar, 4 mostly the same, and 5 completely the same. The authors report that Likert annotation gave better agreement than binary annotation, with Krippendorff’s alpha $0.41$0 versus $0.41$1, and after MACE-based filtering and replacement of high-disagreement outliers the final inter-annotator agreement is $0.41$2 for CS, $0.41$3 for Medicine, $0.41$4 for Biology, and $0.41$5 for Psychology. The task is explicitly harder than standard similarity benchmarks: mean normalized edit distance for matching pairs is $0.41$6 in SPICED versus $0.41$7 for STSB and $0.41$8 for SNLI, with news and tweet subsets at $0.41$9 and ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}0, respectively.

Modeling results show that zero-shot paraphrase and NLI transfer are weak, while models fine-tuned on SPICED improve substantially. The paper identifies MPNet-FT and MiniLM-FT as the best overall systems, with fine-tuning yielding up to 3.9 points gain in Pearson correlation and about 0.3 reduction in MSE when comparing MPNet to MPNet-FT. Downstream evidence retrieval improves on both CoVERT and COVID-Fact: for example, on CoVERT, MiniLM improves from MAP ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}1 and MRR ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}2 to ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}3 and ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}4 after fine-tuning, while on COVID-Fact MPNet improves from ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}5 and ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}6 to ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}7 and ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}8. Using MPNet-FT, the authors then analyze about 1.1 million matched news-paper or tweet-paper pairs with IMS ICAlabel={Well-specified,if score{0,1} Underspecified,if score{2,3}\text{ICAlabel} = \begin{cases} \text{Well-specified}, & \text{if score} \in \{0,1\}\ \text{Underspecified}, & \text{if score} \in \{2,3\} \end{cases}9. They report that Press Releases and Science & Technology outlets are more faithful than General News, that organizational Twitter accounts tend to be more faithful while verified accounts and accounts with more followers tend to change information more, and that findings discussed in limitations sections are more likely to be exaggerated or overstated (Wright et al., 2022).

Because SPICED coexists with several near-homonymous terms, terminological precision matters. “SPICE-U” is an image-captioning metric that augments SPICE with a uniqueness term and reports a Pearson correlation of TCAlabel={Adequate,if score{0,1} Inadequate,if score{2,3}\text{TCAlabel} = \begin{cases} \text{Adequate}, & \text{if score} \in \{0,1\}\ \text{Inadequate}, & \text{if score} \in \{2,3\} \end{cases}0 with human judgments versus TCAlabel={Adequate,if score{0,1} Inadequate,if score{2,3}\text{TCAlabel} = \begin{cases} \text{Adequate}, & \text{if score} \in \{0,1\}\ \text{Inadequate}, & \text{if score} \in \{2,3\} \end{cases}1 for SPICE, while also motivating mutual-information reranking for more unique captions (Wang et al., 2020). “SPICEPilot” is a Python-centered workflow for SPICE/PySpice circuit code generation, validation, simulation, dataset construction, and benchmarking; its enhanced benchmark contains 60 unique circuits and uses Pass@k as the main evaluation standard (Vungarala et al., 2024). “SPIDE” is a purely spike-based method for training feedback spiking neural networks via spike-based implicit differentiation on the equilibrium state, not a SPICED variant (Xiao et al., 2023). In fusion research, “SPI” denotes shattered pellet injection and appears in work on 3D resistive MHD validation against DIII-D experiments, again without relation to any SPICED usage (Kim et al., 2023).

A common misconception is therefore to treat SPICED as a single framework spanning software engineering, autonomous driving, hardware security, and NLP. The literature does not support that reading. Instead, each SPICED instantiation is embedded in a distinct methodological lineage: LLM-based benchmark curation in software engineering, KL-regularized self-play in control, prompt-engineered anomaly detection for analog netlists, and supervised semantic matching for science communication. A plausible implication is that future references to SPICED require explicit domain qualification to avoid collisions with the broader SPICE/SPICED acronym family.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to SPICED.