Metraipolis › archive › dc_04d3578cc8aa

AutoSND: From Execution Evidence to Structural Policies for Automated Network Dismantling Heuristic Discovery — arXiv:2608.03653

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.03653
License (as archived)
CC0-1.0
Archived
2026-10-31T12:16:32.339Z
SHA-256 of the archived text
2026e3518cee32dcba750a1217e19fdda9a5cd65d9321a803a5070b8ef250ca1
Stable URL of this page
https://metraipolis.com/documento/dc_04d3578cc8aa

How to cite

AutoSND: From Execution Evidence to Structural Policies for Automated Network Dismantling Heuristic Discovery — arXiv:2608.03653 — arXiv (en), https://arxiv.org/abs/2608.03653 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_04d3578cc8aa (Metraipolis archive dc_04d3578cc8aa, sha256 2026e3518cee32dcba750a1217e19fdda9a5cd65d9321a803a5070b8ef250ca1)
BibTeX
@misc{dc04d3578cc8aa,
  title = {AutoSND: From Execution Evidence to Structural Policies for Automated Network Dismantling Heuristic Discovery — arXiv:2608.03653},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.03653},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_04d3578cc8aa; sha256 2026e3518cee32dcba750a1217e19fdda9a5cd65d9321a803a5070b8ef250ca1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03653. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Network dismantling is fundamental to analyzing the robustness and vulnerability of complex systems, yet practical heuristics must balance effectiveness and computational efficiency, and are usually designed manually by researchers. Existing large language model based automatic heuristic design methods can generate and screen candidates, yet they have difficulty further transforming candidate quality or failure states during execution into structural-level guid- ance for subsequent generation. We propose AutoSND, a three stage tree search framework for complete network dismantling pro- grams. Stage I broadly explores from simple heuristics and archives execution evidence. Stage II compiles candidate records into struc- tural policies concerning local signals, neighborhood access, and state update ranges. Stage III continues tree search conditioned on these policies and obtains the final quality prioritized and speed prioritized candidates, AutoSND-Q/S. Experiments on 12 real world networks and 3 large real world networks show that AutoSND achieves better search performance and stability and discovers more competitive and structurally interpretable network disman- tling programs. The final candidates form an interpretable structure that uses residual degree as the backbone, adjusts node order with bounded local signals, and restricts the state update range. Code is available at this https URL .

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-05 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2608.03653 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T12:05:52.830Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).