{"id":"https://openalex.org/W7161015954","doi":"https://doi.org/10.1109/tdsc.2026.3692750","title":"Optimizing the Weight Stable Set Attack With Budget Constraint","display_name":"Optimizing the Weight Stable Set Attack With Budget Constraint","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161015954","doi":"https://doi.org/10.1109/tdsc.2026.3692750"},"language":null,"primary_location":{"id":"doi:10.1109/tdsc.2026.3692750","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2026.3692750","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5121807880","display_name":"Ruiqing Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruiqing Sun","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming, China"],"raw_orcid":"https://orcid.org/0000-0002-0306-8268","affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086302899","display_name":"Weidong Li","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weidong Li","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming, China"],"raw_orcid":"https://orcid.org/0000-0003-3094-4347","affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming, China","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.58170015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"4","first_page":"9426","last_page":"9439"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.13940000534057617,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.13940000534057617,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.1006999984383583,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.09629999846220016,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5613999962806702},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.546999990940094},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.3716000020503998},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.3343000113964081},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.325300008058548},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.31470000743865967},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3057999908924103}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.713699996471405},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5613999962806702},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.546999990940094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5031999945640564},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3716000020503998},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C3020028006","wikidata":"https://www.wikidata.org/wiki/Q9158","display_name":"Electronic mail","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2734000086784363},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tdsc.2026.3692750","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2026.3692750","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","display_name":"Climate action","score":0.4432775676250458}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Identifying":[0],"the":[1,15,57,86,100,106,124,135,139,142,177,182,198,202,210,222],"most":[2,16],"influential":[3],"communicators":[4],"as":[5,23],"an":[6],"issue":[7],"of":[8,14,37,53,85,141,204],"maximizing":[9],"influence":[10],"has":[11,25,72],"become":[12],"one":[13,51],"notable":[17],"topics":[18],"in":[19,28,105,225],"social":[20,68],"network":[21],"analysis,":[22],"it":[24],"achieved":[26],"success":[27],"viral":[29],"marketing.":[30],"Only":[31],"by":[32],"understanding":[33],"our":[34,186],"opponent's":[35],"way":[36],"thinking":[38],"can":[39,149],"we":[40,165,196],"effectively":[41],"defend":[42],"against":[43],"or":[44],"attack":[45,61],"them.":[46],"We":[47,111,155],"particularly":[48],"focus":[49],"on":[50,123,169],"type":[52],"such":[54,98],"attacks":[55],"called":[56],"weight":[58,74,102],"stable":[59,103],"set":[60,104],"problem":[62,79,122],"with":[63,209],"budget":[64],"constraint.":[65],"Given":[66],"a":[67,73,83,95,114,158],"network,":[69],"each":[70],"node":[71],"and":[75,173],"removal":[76,90],"cost.":[77],"This":[78],"is":[80,109,134,189,219],"to":[81,152],"remove":[82],"subset":[84],"nodes":[87],"whose":[88],"total":[89],"cost":[91],"does":[92],"not":[93],"exceed":[94],"given":[96],"threshold,":[97],"that":[99,185,200,216],"maximum":[101],"resulting":[107],"graph":[108,125,178],"minimized.":[110],"first":[112],"propose":[113],"2<inline-formula":[115],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[116,131],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[117,132],"notation=\"LaTeX\">$\\alpha$</tex-math></inline-formula>-approximation":[118],"algorithm":[119,140,148,160,199,218,224],"for":[120,138,161],"this":[121,147,217],"without":[126,179,206],"odd":[127,180,207],"cycles,":[128,181],"where":[129],"<inline-formula":[130],"notation=\"LaTeX\">$\\alpha$</tex-math></inline-formula>":[133],"approximation":[136],"ratio":[137,188],"minimum":[143],"knapsack":[144],"problem.":[145],"Interestingly,":[146],"be":[150],"extended":[151],"general":[153,162,194],"graphs.":[154,163],"also":[156],"design":[157],"genetic":[159,211,223],"Finally,":[164],"conducted":[166],"many":[167],"experiments":[168],"both":[170],"artificial":[171],"networks":[172],"real-world":[174],"networks.":[175],"For":[176,193],"results":[183,214],"show":[184,215],"performance":[187],"less":[190],"than":[191,221],"1.21.":[192],"graphs,":[195],"compare":[197],"extends":[201],"idea":[203],"graphs":[205],"cycles":[208],"algorithm.":[212],"The":[213],"better":[220],"some":[226],"settings.":[227]},"counts_by_year":[],"updated_date":"2026-07-11T05:44:25.926202","created_date":"2026-05-14T00:00:00"}