{"id":"https://openalex.org/W7150765046","doi":"https://doi.org/10.48550/arxiv.2604.02395","title":"Eliminating Illusion in Directed Networks","display_name":"Eliminating Illusion in Directed Networks","publication_year":2026,"publication_date":"2026-04-02","ids":{"openalex":"https://openalex.org/W7150765046","doi":"https://doi.org/10.48550/arxiv.2604.02395"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.02395","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.02395","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.02395","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133009470","display_name":"Sougata Jana","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jana, Sougata","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133000792","display_name":"Sanjukta Roy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roy, Sanjukta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7458999752998352,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7458999752998352,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.08060000091791153,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.065700002014637,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6496000289916992},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6406999826431274},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6060000061988831},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5774000287055969},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5228000283241272},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.45730000734329224},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.37770000100135803},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37459999322891235}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6496000289916992},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6438999772071838},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6406999826431274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6105999946594238},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6060000061988831},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5774000287055969},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5228000283241272},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.45730000734329224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38089999556541443},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.37770000100135803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37459999322891235},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3734999895095825},{"id":"https://openalex.org/C184047640","wikidata":"https://www.wikidata.org/wiki/Q182593","display_name":"Illusion","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3294000029563904},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.29809999465942383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2980000078678131},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2705000042915344},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2574000060558319}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.02395","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.02395","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.02395","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.02395","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5541564226150513}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,166],"study":[1],"illusion":[2,73],"elimination":[3,74],"problems":[4],"on":[5,127,139],"directed":[6,72,156],"social":[7],"networks":[8,180],"where":[9],"each":[10,122],"vertex":[11,19,67,85],"is":[12,20,68,86,95,104,110],"colored":[13],"either":[14],"red":[15,28,40],"or":[16],"blue.":[17],"A":[18],"under":[21,87,209],"\\textit{majority":[22],"illusion}":[23],"if":[24],"it":[25],"has":[26],"more":[27,36,47],"out-neighbors":[29,32,58],"than":[30,39],"blue":[31,37],"when":[33,101,114],"there":[34],"are":[35],"vertices":[38,81,208],"ones":[41],"in":[42,174,177],"the":[43,57,71,93,102,108,117,169,199,205],"network.":[44],"In":[45,70],"a":[46,66,105,135,147],"general":[48],"phenomenon":[49],"of":[50,56,65,80,119,198,207],"$p$-illusion,":[51,88],"at":[52],"least":[53],"$p$":[54],"fraction":[55],"(as":[59],"opposed":[60],"to":[61],"$1/2$":[62],"for":[63,89,97,121],"majority)":[64],"red.":[69],"problem,":[75],"we":[76,131,144,191],"recolor":[77],"minimum":[78],"number":[79,118,206],"so":[82],"that":[83,159,168],"no":[84],"$p\\in":[90],"(0,1)$.":[91],"Unfortunately,":[92],"problem":[94,109,170],"NP-hard":[96,111],"$p":[98,123],"=1/2$":[99],"even":[100,126,150],"network":[103],"grid.":[106],"Moreover,":[107],"and":[112,155,188,203],"W[2]-hard":[113],"parameterized":[115,195],"by":[116,151,196,204],"recolorings":[120],"\\in":[124],"(0,1)$":[125],"bipartite":[128],"DAGs.":[129],"Thus,":[130],"can":[132,145,171],"neither":[133],"get":[134,146],"polynomial":[136,175],"time":[137,176],"algorithm":[138,149],"DAGs,":[140],"unless":[141,164],"P=NP,":[142],"nor":[143],"FPT":[148],"combining":[152],"solution":[153],"size":[154],"graph":[157],"parameters":[158],"measure":[160],"distance":[161],"from":[162],"acyclicity,":[163],"FPT=W[2].":[165],"show":[167,192],"be":[172],"solved":[173],"structured,":[178],"sparse":[179],"such":[181],"as":[182],"outerplanar":[183],"networks,":[184],"outward":[185],"grids,":[186],"trees,":[187],"cycles.":[189],"Finally,":[190],"tractable":[193],"algorithms":[194],"treewidth":[197],"underlying":[200],"undirected":[201],"graph,":[202],"illusion.":[210]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-07T00:00:00"}