Searcharxiv⌕ Search

arXiv · 2611.18148

Certificate-Based Verification of Pulsed Field Ablation Models

Abstract

Computational models of pulsed field ablation predict the lesion as the tissue where the electric field exceeds a lethal threshold. Their numerical error is rarely bounded, and automated pipelines increasingly run them without an expert checking each result. To verify each run, we separate the question "was the stated model solved correctly?" from the solver that answers it. An untrusted solver returns with its answer a certificate, consisting of a potential with the correct electrode and ground values and an exactly charge-conserving current. A small independent checker verifies the certificate against a written specification of the physics. Using the Prager-Synge hypercircle theorem evaluated in ball arithmetic, it turns the certificate into guaranteed two-sided bounds on the impedance and on the root-mean-square field of every tile of a lesion map, also over a range of blood/tissue conductivity ratios. A vectorized version of the checker takes about a tenth of the solve time. For a focal electrode in contact, the tile-resolved depth at 1000 V and 700 V/cm is proven to lie in 3.50-3.75 mm for every ratio from 1.7 to 3.75. For a bipolar catheter, certified depths overlap published in-vivo depths. Where they differ from a published reference model, the certificates prove that the difference is not numerical error in our computation. We compare the certificate with a grid convergence study on the same solver. On graded grids the study is sharper for local fields but remains an estimate. On uniform grids it fails to converge at the electrode edge, where the certificate still gives a valid bracket. Solvers that deliberately solve equations other than the specified ones pass the grid convergence study, but the certificates refute their claims or leave them unsupported.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Konstantinos Dovelos. 2026-11-13. Certificate-Based Verification of Pulsed Field Ablation Models. https://searcharxiv.com/abs/2611.18148

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Adaptive Finite State Projection with Quantile-Based Pruning for Solving the Chemical Master Equation

We present an adaptive Finite State Projection (FSP) method for efficiently solving the Chemical Master Equation (CME) with rigorous error control. Our approach integrates time-stepping with dynamic state-space truncation, balancing accuracy and computational cost. Krylov subspace methods approximate the matrix exponential, while quantile-based pruning controls state-space growth by removing low-probability states. Theoretical error bounds ensure that the truncation error remains bounded by the pruned mass at each step, which is user-controlled, and does not propagate forward in time. Numerical experiments on biochemical systems, including the Lotka-Volterra and Michaelis-Menten and bi-stable toggle switch models.

cs.CE↗

SoK: Market Microstructure for Decentralized Prediction Markets (DePMs)

Decentralized prediction markets (DePMs) allow open participation in event-based wagering without fully relying on centralized intermediaries. We review the history of DePMs which date back to 2011 and includes hundreds of proposals. Perhaps surprising, modern DePMs like Polymarket deviate materially from earlier designs like Truthcoin and Augur v1. We use our review to present a modular workflow comprising eight stages: underlying infrastructure, market topic, share structure and pricing, market initialization, trading, market resolution, settlement, and archiving. For each module, we enumerate the design variants, analyzing trade-offs around decentralization, expressiveness, and manipulation resistance. We also identify open problems for researchers interested in this ecosystem.

cs.CE↗

A Multigrid Finite State Projection Algorithm For The Solution Of The Reaction-Diffusion Master Equation

We develop a multigrid method for the finite state projection of the reaction-diffusion master equation (RDME). The RDME evolves the joint probabilities of molecular count configurations across well-mixed voxels coupled by local reactions and diffusive jumps. When fast diffusion or large reaction rates make this evolution stiff over long time horizons, implicit time stepping requires solving a large shifted linear system at every step. Grouping neighboring voxels and summing their molecular counts produces a hierarchy of coarser state spaces terminating at a one-voxel chemical master equation. Restriction sums residual entries with the same coarse counts, while multinomial prolongation preserves the RDME generator form on every level with explicit coarse reaction and diffusion rates. For reversible diffusion, the error omitted by coarsening is bounded by the graph Dirichlet energy of jumps inside the aggregates, with a constant independent of population. Numerical tests with standard multigrid cycles and point or block Gauss-Seidel smoothing reach 7.16 million states and resolve rare probabilities of order $10^{-7}$.

cs.CE↗