{"id":"https://openalex.org/W7125485908","doi":"https://doi.org/10.4230/lipics.itcs.2026.12","title":"Semi-Random Graphs, Robust Asymmetry, and Reconstruction","display_name":"Semi-Random Graphs, Robust Asymmetry, and Reconstruction","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7125485908","doi":"https://doi.org/10.4230/lipics.itcs.2026.12"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25299","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.12","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.12","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123641931","display_name":"Julian Asilis","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Asilis, Julian","raw_affiliation_strings":["University of Southern California, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123664705","display_name":"Xi Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chen, Xi","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5099096952","display_name":"Dutch Hansen","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hansen, Dutch","raw_affiliation_strings":["University of Washington, Seattle, WA, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102005063","display_name":"Shang\u2010Hua Teng","orcid":"https://orcid.org/0000-0001-5011-4514"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Teng, Shang-Hua","raw_affiliation_strings":["University of Southern California, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5123641931"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23764259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.45820000767707825,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.45820000767707825,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.2563999891281128,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07760000228881836,"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/conjecture","display_name":"Conjecture","score":0.6248000264167786},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5530999898910522},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.5313000082969666},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5133000016212463},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5048999786376953},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.501800000667572},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.38109999895095825},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.3790999948978424},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.357699990272522}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.647599995136261},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6248000264167786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5771999955177307},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5530999898910522},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.5313000082969666},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5196999907493591},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5133000016212463},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5048999786376953},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.501800000667572},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.38109999895095825},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.3790999948978424},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.357699990272522},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.350600004196167},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.34360000491142273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.322299987077713},{"id":"https://openalex.org/C38976095","wikidata":"https://www.wikidata.org/wiki/Q752641","display_name":"Asymmetry","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.30309998989105225},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2833000123500824},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.26339998841285706},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25299","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.12","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.itcs.2026.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2026.12","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25299","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.12","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.8301990032196045,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Graph":[1],"Reconstruction":[2],"Conjecture":[3],"famously":[4],"posits":[5],"that":[6,147,168,184,213],"any":[7],"undirected":[8],"graph":[9,94,151],"on":[10,106,111,188,264],"at":[11],"least":[12],"three":[13],"vertices":[14,192],"is":[15,216,225],"determined":[16],"up":[17],"to":[18,227],"isomorphism":[19],"by":[20,59],"its":[21],"family":[22],"of":[23,34,40,44,56,73,115,124,137,142,247,268],"(unlabeled)":[24],"induced":[25,186],"subgraphs.":[26,143],"At":[27],"present,":[28],"the":[29,66,70,74,83,88,102,112,122,128,182,265],"conjecture":[30],"admits":[31],"partial":[32],"resolutions":[33],"two":[35,129],"types:":[36],"1)":[37],"casework-based":[38],"demonstrations":[39],"reconstructibility":[41,55],"for":[42,198],"families":[43],"graphs":[45,58,173,251,270],"satisfying":[46],"certain":[47],"structural":[48],"properties,":[49],"and":[50,117,140,195,256],"2)":[51],"probabilistic":[52],"arguments":[53,104],"establishing":[54],"random":[57,172,250],"leveraging":[60],"average-case":[61],"phenomena.":[62],"While":[63],"results":[64],"in":[65,81,87,133,232,249,271],"first":[67],"category":[68,90],"capture":[69],"worst-case":[71],"nature":[72],"conjecture,":[75],"they":[76],"play":[77],"a":[78],"limited":[79],"role":[80],"understanding":[82],"general":[84],"case.":[85],"Results":[86],"second":[89],"address":[91],"much":[92,157],"larger":[93],"families,":[95],"but":[96],"it":[97],"remains":[98],"unclear":[99],"how":[100],"heavily":[101],"necessary":[103],"rely":[105],"optimistic":[107],"distributional":[108],"properties.":[109],"Drawing":[110],"algorithmic":[113],"notions":[114],"smoothed":[116],"semi-random":[118,150],"analysis,":[119],"we":[120,145,211,243],"study":[121],"robustness":[123],"what":[125],"are":[126,193],"arguably":[127],"most":[130],"fundamental":[131],"properties":[132,155],"this":[134,214,241],"latter":[135],"line":[136],"work:":[138],"asymmetry":[139,248],"uniqueness":[141],"Notably,":[144],"find":[146],"various":[148],"natural":[149],"distributions":[152],"exhibit":[153],"these":[154],"asymptotically,":[156],"like":[158],"their":[159,185],"Erd\u0151s-R\u00e9nyi":[160,171],"counterparts.":[161],"In":[162],"particular,":[163],"Bollob\u00e1s":[164],"[Bollob{\u00e1}s,":[165],"1990]":[166],"demonstrated":[167],"almost":[169],"all":[170],"G":[174],"=":[175,203],"(V,":[176],"E)":[177],"\u223c":[178],"G(n,":[179,272],"p)":[180],"enjoy":[181],"property":[183,215],"subgraphs":[187],"n":[189],"-":[190,200,220],"\u0398(1)":[191],"asymmetric":[194],"mutually":[196],"non-isomorphic,":[197],"1":[199],"p,":[201],"p":[202],"\u03a9(log(n)":[204],"/":[205],"n).":[206],"As":[207],"our":[208],"primary":[209],"result,":[210,242],"demonstrate":[212],"robust":[217],"against":[218],"perturbation":[219],"even":[221],"when":[222],"an":[223],"adversary":[224],"permitted":[226],"add/remove":[228],"each":[229],"vertex":[230],"pair":[231],"V^{(2)}":[233],"with":[234,252,261],"(independent)":[235],"arbitrarily":[236],"large":[237,253],"constant":[238],"probability.":[239],"Exploiting":[240],"derive":[244],"asymptotic":[245],"characterizations":[246],"planted":[254],"structure":[255],"bounded":[257],"adversarial":[258],"corruptions,":[259],"along":[260],"improved":[262],"bounds":[263],"probability":[266],"mass":[267],"nonreconstructible":[269],"p).":[273]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2026-01-24T00:00:00"}