{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NDQHSKA3CO4IOMQEIWRYWLZL3Z","short_pith_number":"pith:NDQHSKA3","schema_version":"1.0","canonical_sha256":"68e079281b13b887320445a38b2f2bde5706bb3a9c64617c10c860dd0f18d68a","source":{"kind":"arxiv","id":"2403.03962","version":1},"attestation_state":"computed","paper":{"title":"Identify Critical Nodes in Complex Network with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.SI","authors_text":"Chen Gao, Dongyun Zou, Jinzhu Mao, Li Sheng, Siyi Liu, Yong Li, Yue Wang","submitted_at":"2024-03-01T14:23:26Z","abstract_excerpt":"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 creat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.03962","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2024-03-01T14:23:26Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"f4194246a43670a42a5ecfbdc2b5ffd39fcfc33ae6c547bd0850f07ab9892f54","abstract_canon_sha256":"fd396c03d25599a84dbb411fc95d09a1a507e7ca9348c03136d27a38b3a83f2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:16.326784Z","signature_b64":"47R7Kkoes7zRFN26qoXm8LlncRniICUl/Ju5DArnM6jUi+G6i+7PqvZNlFJ4pniduh38Y7OLub75bjdbiHtuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e079281b13b887320445a38b2f2bde5706bb3a9c64617c10c860dd0f18d68a","last_reissued_at":"2026-07-05T07:53:16.326306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:16.326306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identify Critical Nodes in Complex Network with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.SI","authors_text":"Chen Gao, Dongyun Zou, Jinzhu Mao, Li Sheng, Siyi Liu, Yong Li, Yue Wang","submitted_at":"2024-03-01T14:23:26Z","abstract_excerpt":"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 creat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03962","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.03962/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.03962","created_at":"2026-07-05T07:53:16.326376+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03962v1","created_at":"2026-07-05T07:53:16.326376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03962","created_at":"2026-07-05T07:53:16.326376+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDQHSKA3CO4I","created_at":"2026-07-05T07:53:16.326376+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDQHSKA3CO4IOMQE","created_at":"2026-07-05T07:53:16.326376+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDQHSKA3","created_at":"2026-07-05T07:53:16.326376+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20849","citing_title":"Large Language Models for Operations Research: A Comprehensive Survey","ref_index":79,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z","json":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z.json","graph_json":"https://pith.science/api/pith-number/NDQHSKA3CO4IOMQEIWRYWLZL3Z/graph.json","events_json":"https://pith.science/api/pith-number/NDQHSKA3CO4IOMQEIWRYWLZL3Z/events.json","paper":"https://pith.science/paper/NDQHSKA3"},"agent_actions":{"view_html":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z","download_json":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z.json","view_paper":"https://pith.science/paper/NDQHSKA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03962&json=true","fetch_graph":"https://pith.science/api/pith-number/NDQHSKA3CO4IOMQEIWRYWLZL3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/NDQHSKA3CO4IOMQEIWRYWLZL3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z/action/storage_attestation","attest_author":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z/action/author_attestation","sign_citation":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z/action/citation_signature","submit_replication":"https://pith.science/pith/NDQHSKA3CO4IOMQEIWRYWLZL3Z/action/replication_record"}},"created_at":"2026-07-05T07:53:16.326376+00:00","updated_at":"2026-07-05T07:53:16.326376+00:00"}