Pith. sign in

REVIEW 2 cited by

Identify Critical Nodes in Complex Network with Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.03962 v1 pith:NDQHSKA3 submitted 2024-03-01 cs.SI cs.AIcs.NE

classification cs.SIcs.AIcs.NE
keywords functionsnodesmodelscriticalexcellentgenerateidentifylanguage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Identifying critical nodes in networks is a classical decision-making task, and many methods struggle to strike a balance between adaptability and utility. Therefore, we propose an approach that empowers Evolutionary Algorithm (EA) with Large Language Models (LLMs), to generate a function called "score\_nodes" which can further be used to identify crucial nodes based on their assigned scores. Our model consists of three main components: Manual Initialization, Population Management, and LLMs-based Evolution. It evolves from initial populations with a set of designed node scoring functions created manually. LLMs leverage their strong contextual understanding and rich programming skills to perform crossover and mutation operations on the individuals, generating excellent new functions. These functions are then categorized, ranked, and eliminated to ensure the stable development of the populations while preserving diversity. Extensive experiments demonstrate the excellent performance of our method, showcasing its strong generalization ability compared to other state-of-the-art algorithms. It can consistently and orderly generate diverse and efficient node scoring functions. All source codes and models that can reproduce all results in this work are publicly available at this link: \url{https://anonymous.4open.science/r/LLM4CN-6520}

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AutoSND: From Execution Evidence to Structural Policies for Automated Network Dismantling Heuristic Discovery

    cs.AI 2026-08 conditional novelty 7.0 of 10

    A three-stage LLM search framework converts execution evidence into structural policies and discovers network dismantling programs with strong quality and low runtime.

  2. EvoVLMA: Evolutionary Vision-Language Model Adaptation

    cs.CV 2025-08 conditional novelty 6.0 of 10

    An LLM-based evolutionary algorithm automatically designs training-free VLM adaptation code, improving few-shot classification accuracy over manually-designed baselines by up to 1.91 points.

Pith tools