A Pluggable and Auditable Search Kernel for Real-World Structural Analysis: Design, Interfaces, and Case Studies

Many real-world decision problems are NP-hard : power-grid hardening, financial conta gion control, network repair, and frequency assignment. In practice, decision makers do not need provable optimality; they need a usable answer within a predictable time and cost budget, together with an auditable record of how it was obtained. We present a three-layer search kernel that separates a fixed engine from domain-specific problem definitions. A domain implements six methods—build, clone, evaluate a scalar deviation ∆, enumerate actions, apply an action, and validate a state—and the kernel provides budgeting, search, result schemas, and a SHA-256 audit trail. A private engine can be injected behind the same interface, so that intellectual prop erty is not exposed to domain developers. We report five synthetic case studies on commodity hardware: a 12-bus power grid (72.4% deviation reduction, 0.46 s), an 8-bank interbank cascade (100%, 0.05 s), a 12-node brain network (94.7%, 2 ms), a 509-vertex unit-distance graph (a 5-coloring in 69.5 s; non-4-colorability independently verified by SAT and DRAT), and ternary covering codes (n = 4: optimum 9 in 0.09 s; n = 5: 27 in 14 s). We deliberately make no optimality claims for the search layer. Our contribution is a reproducible, low-integration-cost pipeline whose outputs can be checked by a third party, and whose limits are stated explicitly

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24332747
Primary Topic
Constraint Satisfaction and Optimization
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Pluggable and Auditable Search Kernel for Real-World Structural Analysis: Design, Interfaces, and Case Studies

Chun Qi, Rui Lv, Baoyuan Zhang
Zenodo (CERN European Organization for Nuclear Research)
Constraint Satisfaction and Optimization
preprint

A Pluggable and Auditable Search Kernel for Real-World Structural Analysis: Design, Interfaces, and Case Studies

Chun Qi, Rui Lv, Baoyuan Zhang
preprint en

Abstract

Many real-world decision problems are NP-hard : power-grid hardening, financial conta gion control, network repair, and frequency assignment. In practice, decision makers do not need provable optimality; they need a usable answer within a predictable time and cost budget, together with an auditable record of how it was obtained. We present a three-layer search kernel that separates a fixed engine from domain-specific problem definitions. A domain implements six methods—build, clone, evaluate a scalar deviation ∆, enumerate actions, apply an action, and validate a state—and the kernel provides budgeting, search, result schemas, and a SHA-256 audit trail. A private engine can be injected behind the same interface, so that intellectual prop erty is not exposed to domain developers. We report five synthetic case studies on commodity hardware: a 12-bus power grid (72.4% deviation reduction, 0.46 s), an 8-bank interbank cascade (100%, 0.05 s), a 12-node brain network (94.7%, 2 ms), a 509-vertex unit-distance graph (a 5-coloring in 69.5 s; non-4-colorability independently verified by SAT and DRAT), and ternary covering codes (n = 4: optimum 9 in 0.09 s; n = 5: 27 in 14 s). We deliberately make no optimality claims for the search layer. Our contribution is a reproducible, low-integration-cost pipeline whose outputs can be checked by a third party, and whose limits are stated explicitly

Zenodo (CERN European Organization for Nuclear Research)
Communication University of China (CN), Xi'an Jiaotong University (CN)
Constraint Satisfaction and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon