{"id":"https://openalex.org/W4388505125","doi":"https://doi.org/10.1109/access.2023.3331220","title":"MCWDST: A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media","display_name":"MCWDST: A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4388505125","doi":"https://doi.org/10.1109/access.2023.3331220"},"language":"en","primary_location":{"id":"doi:10.1109/access.2023.3331220","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2023.3331220","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/10311605.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/10311605.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007725540","display_name":"Ciprian\u2010Octavian Truic\u0103","orcid":"https://orcid.org/0000-0001-7292-4462"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Ciprian-Octavian Truic\u0103","raw_affiliation_strings":["Computer Science and Engineering Department, Faculty of Automatic Control and Computers, National University of Science and Technology Politehnica Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, Faculty of Automatic Control and Computers, National University of Science and Technology Politehnica Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026015539","display_name":"Elena\u2010Simona Apostol","orcid":"https://orcid.org/0000-0001-6397-4951"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Elena-Simona Apostol","raw_affiliation_strings":["Computer Science and Engineering Department, Faculty of Automatic Control and Computers, National University of Science and Technology Politehnica Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, Faculty of Automatic Control and Computers, National University of Science and Technology Politehnica Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088824599","display_name":"Radu-C\u0103t\u0103lin Nicolescu","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Radu-C\u0103t\u0103lin Nicolescu","raw_affiliation_strings":["Computer Science and Engineering Department, Faculty of Automatic Control and Computers, National University of Science and Technology Politehnica Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, Faculty of Automatic Control and Computers, National University of Science and Technology Politehnica Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103092057","display_name":"Panagiotis Karras","orcid":"https://orcid.org/0000-0003-0509-9129"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Panagiotis Karras","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5007725540"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":26.9335,"has_fulltext":true,"cited_by_count":46,"citation_normalized_percentile":{"value":0.99654646,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"11","issue":null,"first_page":"125861","last_page":"125873"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11147","display_name":"Misinformation and Its Impacts","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11147","display_name":"Misinformation and Its Impacts","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11644","display_name":"Spam and Phishing Detection","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9815000295639038,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/computer-science","display_name":"Computer science","score":0.695135772228241},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6097928881645203},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5995668768882751},{"id":"https://openalex.org/keywords/social-media","display_name":"Social media","score":0.5920215845108032},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4895413815975189},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4616374671459198},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.41307157278060913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4021291136741638},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1567286252975464},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.10825115442276001},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09871560335159302}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.695135772228241},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6097928881645203},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5995668768882751},{"id":"https://openalex.org/C518677369","wikidata":"https://www.wikidata.org/wiki/Q202833","display_name":"Social media","level":2,"score":0.5920215845108032},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4895413815975189},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4616374671459198},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.41307157278060913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4021291136741638},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1567286252975464},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.10825115442276001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09871560335159302}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/access.2023.3331220","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2023.3331220","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/10311605.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:f1bc72c045764d208b96791897c68deb","is_oa":true,"landing_page_url":"https://doaj.org/article/f1bc72c045764d208b96791897c68deb","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 11, Pp 125861-125873 (2023)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/29f85941-e1d7-461b-ad83-9c7c4bc0f12b","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/29f85941-e1d7-461b-ad83-9c7c4bc0f12b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Truica , C O , Apostol , E S , Nicolescu , R C & Karras , P 2023 , ' MCWDST : A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media ' , IEEE Access , vol. 11 , pp. 125861-125873 . https://doi.org/10.1109/ACCESS.2023.3331220","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2023.3331220","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2023.3331220","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/10311605.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Access","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4399999976158142,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320327756","display_name":"National University of Science and Technology","ror":"https://ror.org/019vsm959"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388505125.pdf","grobid_xml":"https://content.openalex.org/works/W4388505125.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W168564468","https://openalex.org/W2051405935","https://openalex.org/W2085419924","https://openalex.org/W2185894252","https://openalex.org/W2194775991","https://openalex.org/W2250539671","https://openalex.org/W2342249984","https://openalex.org/W2769470793","https://openalex.org/W2790829410","https://openalex.org/W2896457183","https://openalex.org/W2963918774","https://openalex.org/W2965373594","https://openalex.org/W2969207975","https://openalex.org/W2981194182","https://openalex.org/W2982597884","https://openalex.org/W2984545517","https://openalex.org/W2997591727","https://openalex.org/W3031781733","https://openalex.org/W3034999214","https://openalex.org/W3035082952","https://openalex.org/W3041311242","https://openalex.org/W3047706880","https://openalex.org/W3085707319","https://openalex.org/W3093798014","https://openalex.org/W3099906969","https://openalex.org/W3126072720","https://openalex.org/W3138953784","https://openalex.org/W3150002274","https://openalex.org/W3159881645","https://openalex.org/W3186163009","https://openalex.org/W4206512241","https://openalex.org/W4210299703","https://openalex.org/W4213370678","https://openalex.org/W4214680498","https://openalex.org/W4238387639","https://openalex.org/W4317505581","https://openalex.org/W4319323673","https://openalex.org/W4393256667","https://openalex.org/W4399672772","https://openalex.org/W6636510571","https://openalex.org/W6637373629","https://openalex.org/W6743295981","https://openalex.org/W6762718338","https://openalex.org/W6778848071","https://openalex.org/W6785427929","https://openalex.org/W6799600525","https://openalex.org/W6849179084","https://openalex.org/W6850350526","https://openalex.org/W7019290799"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"The":[0],"widespread":[1],"availability":[2],"of":[3,61,121,163],"internet":[4],"access":[5],"and":[6,30,50,89,113,143],"handheld":[7],"devices":[8],"confers":[9],"to":[10,16,21,66],"social":[11,28],"media":[12,29],"a":[13,57,126,133,140,155],"power":[14],"similar":[15],"the":[17,51,119,161],"one":[18],"newspapers":[19],"used":[20],"have.":[22],"People":[23],"seek":[24],"affordable":[25],"information":[26],"on":[27,166],"can":[31,53],"reach":[32],"it":[33],"within":[34],"seconds.":[35],"Yet":[36],"this":[37,77],"convenience":[38],"comes":[39],"with":[40],"dangers;":[41],"any":[42],"user":[43],"may":[44],"freely":[45],"post":[46],"whatever":[47],"they":[48],"please":[49],"content":[52],"stay":[54],"online":[55],"for":[56,139],"long":[58],"period,":[59],"regardless":[60],"its":[62],"truthfulness.":[63],"A":[64],"need":[65],"detect":[67,99],"untruthful":[68],"information,":[69],"also":[70],"known":[71],"as":[72],"fake":[73,87,100,122],"news,":[74,101,123],"arises.":[75],"In":[76],"paper,":[78],"we":[79,102,124],"present":[80],"an":[81],"end-to-end":[82],"solution":[83,165],"that":[84,93,110,130,148],"accurately":[85],"detects":[86],"news":[88],"immunizes":[90,145],"network":[91],"nodes":[92,146],"spread":[94,120],"them":[95],"in":[96,147],"real-time.":[97],"To":[98,117],"propose":[103,125],"two":[104],"new":[105],"stack":[106],"deep":[107],"learning":[108],"architectures":[109],"utilize":[111],"convolutional":[112],"bidirectional":[114],"LSTM":[115],"layers.":[116],"mitigate":[118],"real-time":[127],"network-aware":[128],"strategy":[129],"(1)":[131],"constructs":[132],"minimum-cost":[134],"weighted":[135],"directed":[136],"spanning":[137],"tree":[138,149],"detected":[141],"node,":[142],"(2)":[144],"by":[150],"scoring":[151],"their":[152],"harmfulness":[153],"using":[154],"novel":[156],"ranking":[157],"function.":[158],"We":[159],"demonstrate":[160],"effectiveness":[162],"our":[164],"five":[167],"real-world":[168],"datasets.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":25},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":3}],"updated_date":"2026-03-22T08:09:32.410652","created_date":"2023-11-09T00:00:00"}