Weave: Verified Netlist-to-Schematic Conversion via Layered Graph Layout

• URL: http://arxiv.org/abs/2607.03835v1
• Date: Sat, 04 Jul 2026 11:58:29 GMT
• Title: Weave: Verified Netlist-to-Schematic Conversion via Layered Graph Layout
• Abstract summary: We present Weave, a deterministic converter that turns a SPICE netlist into an LTspice.<n>asc schematic using a layered (Sugiyama-style) graph layout.<n>We achieve 100% compilation and 100% round-trip-verified connectivity equivalence.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Converting a SPICE netlist into a human-readable schematic is a longstanding problem in electronic design automation: simulators and machine-learning pipelines readily produce netlists, but designers reason about circuits through diagrams. Recent learning-based approaches translate netlists into schematics probabilistically, yet they provide no guarantee that the generated drawing preserves the original connectivity, and their accuracy degrades sharply as circuits grow. We present Weave, a deterministic converter that turns a SPICE netlist into an LTspice .asc schematic using a layered (Sugiyama-style) graph layout, and that certifies every output by a round-trip connectivity check: the generated schematic is re-parsed into a netlist and compared, net for net, against the input. A result is reported as correct only when the two partitions are identical, giving a binary correctness certificate rather than a similarity score. Weave runs entirely client-side as a single dependency-free file and embeds a pin table for 5093 LTspice symbols. On the identical public Circuits-LTSpice test set used by the state-of-the-art LLM converter Schemato (117 circuits, netlisted with LTspice itself), Weave achieves 100% compilation and 100% round-trip-verified connectivity equivalence, compared with Schemato's reported 76% compilation and a graph-edit-distance similarity of 0.35; notably, 73% of that set exceeds the five-component threshold beyond which Schemato reports losing connectivity accuracy. On a larger and harder corpus, the 3460 netlistable circuits of the official Analog Devices LTspice demo collection, Weave verifies exact connectivity for 88.4% of circuits, with the remaining failures concentrated in a single, well-characterized class of dense multi-pin power modules.

Related papers

• Generating Workflow DAGs from Natural Language with Non-Reasoning LLMs [0.08537603362277842]
  We show that neuro-symbolic decomposition enables lower-cost, non-reasoning large language models to generate complex workflow DAGs.<n>We show that the method improves judge validity by 24 percentage points and achieves statistical equivalence to a reasoning model's out-of-the-box quality.
  arXiv  Detail & Related papers  (2026-08-31T05:01:29Z)
• Constrained Decoding for Diffusion Language Models via Efficient Inference over Finite Automata [57.27430779838529]
  We present an exact and tractable algorithm for sampling from the constrained mean-field posterior under any constraint expressible as a finite automaton.<n>The approach guarantees constraint satisfaction by construction, supports both greedy and sampling-based decoding, and is compatible with parallel and block-wise decoding.<n> Empirical evaluations on Dream-7B and LLaDA-8 show substantial accuracy gains across various tasks.
  arXiv  Detail & Related papers  (2026-07-08T05:48:57Z)
• SINA: A Fully Automated Circuit Schematic Image to Netlist Generator Using Artificial Intelligence [0.0]
  We propose SINA, an open-source circuit schematic image-to-netlist generator.<n> SINA handles both IC- and PCB-level schematics and incorporates dedicated crossing-wires detection.<n>Our experiments demonstrate an overall netlist generation accuracy of 96.67%, which is 2.72x higher compared to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2026-07-02T02:24:00Z)
• Low-power analogue neural networks with trainable nonlinear connections for continuous control [54.59241649882409]
  Physical neural networks promise low-power machine learning by computing directly with analogue device physics.<n>We place trainable nonlinear functions on the connections, making each physical connection a learnable computational element.<n>We find that the benefit is task-dependent and follows from the smoothness of the physical basis.
  arXiv  Detail & Related papers  (2026-06-21T15:55:23Z)
• CircuitFormer: A Circuit Language Model for Analog Topology Design from Natural Language Prompt [2.9943388961167705]
  We present the largest annotated dataset of analog circuit netlists to date, comprising 31,341 netlist-natural language description pairs.<n>We also propose Circuit Tokenizer (CKT), a novel circuit graph tokenizer designed to encode netlist connectivity by explicitly mining frequent subcircuits.
  arXiv  Detail & Related papers  (2026-05-07T07:04:36Z)
• WISV: Wireless-Informed Semantic Verification for Distributed Speculative Decoding in Device-Edge LLM Inference [56.297697169678095]
  WISV (Wireless-Informed Semantic Verification) is a novel distributed speculative decoding framework.<n>We show that WISV achieves up to a 60.8% increase in accepted length, a 37.3% reduction in interaction rounds, and a 31.4% improvement in end-to-end latency.<n>We validate WISV on a hardware testbed comprising an NVIDIA Jetson AGX Orin and an A40-equipped server.
  arXiv  Detail & Related papers  (2026-04-20T01:29:56Z)
• Certified Circuits: Stability Guarantees for Mechanistic Circuits [80.30622018787835]
  Certified Circuits provides provable stability guarantees for circuit discovery.<n>On ImageNet and OOD datasets, certified circuits achieve up to 91% higher accuracy.
  arXiv  Detail & Related papers  (2026-02-26T13:07:31Z)
• GNN-ACLP: Graph Neural Networks Based Analog Circuit Link Prediction [10.741445394687378]
  We propose GNN-ACLP, a graph neural networks (GNNs) based method featuring three innovations to tackle these challenges.<n>First, we introduce the SEAL (learning from Subgraphs, Embeddings, and Attributes for Link prediction) framework and achieve port-level accuracy in circuit link prediction.<n>Second, we propose Netlist Babel Fish, a netlist format conversion tool leveraging retrieval-augmented generation (RAG) with a large language model (LLM) to improve the compatibility of netlist formats.
  arXiv  Detail & Related papers  (2025-04-14T14:02:09Z)
• Schemato - An LLM for Netlist-to-Schematic Conversion [5.419903684361424]
  We present a large language model (LLM) for netlist-to-schematic conversion.<n>In particular, we consider our approach in converting netlists to.asc files, text-based schematic description used in LTSpice.<n>Experiments show thatSpiceto generates schematics with an average graph edit distance score and mean structural similarity index measure, scaled by the compilation success rate that are 1.8x and 4.3x higher than the best performing LLMs respectively.
  arXiv  Detail & Related papers  (2024-11-21T07:21:59Z)
• CktGNN: Circuit Graph Neural Network for Electronic Design Automation [67.29634073660239]
  This paper presents a Circuit Graph Neural Network (CktGNN) that simultaneously automates the circuit topology generation and device sizing. We introduce Open Circuit Benchmark (OCB), an open-sourced dataset that contains $10$K distinct operational amplifiers. Our work paves the way toward a learning-based open-sourced design automation for analog circuits.
  arXiv  Detail & Related papers  (2023-08-31T02:20:25Z)
• Convolutional Dynamic Alignment Networks for Interpretable Classifications [108.83345790813445]
  We introduce a new family of neural network models called Convolutional Dynamic Alignment Networks (CoDA-Nets) Their core building blocks are Dynamic Alignment Units (DAUs), which linearly transform their input with weight vectors that dynamically align with task-relevant patterns. CoDA-Nets model the classification prediction through a series of input-dependent linear transformations, allowing for linear decomposition of the output into individual input contributions.
  arXiv  Detail & Related papers  (2021-03-31T18:03:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.