{"id":"https://openalex.org/W7162533900","doi":"https://doi.org/10.4230/lipics.socg.2026.87","title":"Robustness of Persistent Topological Features and Minimum Homological Cuts","display_name":"Robustness of Persistent Topological Features and Minimum Homological Cuts","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162533900","doi":"https://doi.org/10.4230/lipics.socg.2026.87"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25863","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.87","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.87/LIPIcs.SoCG.2026.87.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.87/LIPIcs.SoCG.2026.87.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137168260","display_name":"Pepijn Roos Hoefgeest","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Roos Hoefgeest, Pepijn","raw_affiliation_strings":["KTH Royal Institute of Technology Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085055528","display_name":"Lucas Slot","orcid":"https://orcid.org/0000-0003-3790-492X"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Slot, Lucas","raw_affiliation_strings":["University of Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3790-492X","affiliations":[{"raw_affiliation_string":"University of Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63238438,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9980000257492065,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9980000257492065,"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/T10896","display_name":"Homotopy and Cohomology in Algebraic Topology","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.00019999999494757503,"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/robustness","display_name":"Robustness (evolution)","score":0.6410999894142151},{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"Simplicial complex","score":0.5771999955177307},{"id":"https://openalex.org/keywords/persistent-homology","display_name":"Persistent homology","score":0.559499979019165},{"id":"https://openalex.org/keywords/simplicial-homology","display_name":"Simplicial homology","score":0.4950999915599823},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4343999922275543},{"id":"https://openalex.org/keywords/homology","display_name":"Homology (biology)","score":0.3855000138282776},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3720000088214874},{"id":"https://openalex.org/keywords/hausdorff-space","display_name":"Hausdorff space","score":0.35269999504089355}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.683899998664856},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6410999894142151},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.5771999955177307},{"id":"https://openalex.org/C2874115","wikidata":"https://www.wikidata.org/wiki/Q17099562","display_name":"Persistent homology","level":2,"score":0.559499979019165},{"id":"https://openalex.org/C3469331","wikidata":"https://www.wikidata.org/wiki/Q7520902","display_name":"Simplicial homology","level":3,"score":0.4950999915599823},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4343999922275543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3896999955177307},{"id":"https://openalex.org/C165525559","wikidata":"https://www.wikidata.org/wiki/Q224180","display_name":"Homology (biology)","level":3,"score":0.3855000138282776},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37209999561309814},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C191399826","wikidata":"https://www.wikidata.org/wiki/Q326908","display_name":"Hausdorff space","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C181576044","wikidata":"https://www.wikidata.org/wiki/Q4129926","display_name":"Computational topology","level":3,"score":0.3239000141620636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31709998846054077},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31529998779296875},{"id":"https://openalex.org/C64245159","wikidata":"https://www.wikidata.org/wiki/Q3983972","display_name":"Simplicial approximation theorem","level":5,"score":0.29339998960494995},{"id":"https://openalex.org/C129621563","wikidata":"https://www.wikidata.org/wiki/Q429593","display_name":"Betti number","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C2776477805","wikidata":"https://www.wikidata.org/wiki/Q4460773","display_name":"Topological data analysis","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C146867743","wikidata":"https://www.wikidata.org/wiki/Q4669959","display_name":"Abstract simplicial complex","level":3,"score":0.26510000228881836},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.258899986743927},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25863","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.87","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.87/LIPIcs.SoCG.2026.87.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.socg.2026.87","is_oa":true,"landing_page_url":"http://bookstore.ams.org/surv-209/","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.socg.2026.87","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.87","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25863","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.87","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.87/LIPIcs.SoCG.2026.87.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162533900.pdf","grobid_xml":"https://content.openalex.org/works/W7162533900.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Persistent":[0],"homology":[1],"is":[2,70,116,124,224],"a":[3,51,80,105,112,128,198,210,240],"popular":[4],"method":[5],"for":[6,159,171,179],"computing":[7],"topological":[8],"features":[9],"of":[10,27,37,79,83,95,102,111,131,144,163,201,234,252],"(metric)":[11],"data.":[12],"Standard":[13],"approaches":[14],"based":[15,243],"on":[16,244],"the":[17,28,44,56,73,77,93,100,109,132,154,172,202,221,231,235,245],"\u010cech":[18],"or":[19],"Rips":[20,236],"filtration":[21],"are":[22],"stable":[23],"under":[24],"small":[25],"perturbations":[26],"data,":[29],"but":[30],"highly":[31],"sensitive":[32],"to":[33,72,127,142,260],"outliers.":[34,86],"This":[35,256],"lack":[36],"robustness":[38,251,259],"has":[39],"been":[40],"frequently":[41],"addressed":[42],"in":[43,76,108,136,167,181,185,205,216,227,230,264],"literature.":[45],"In":[46],"this":[47,89,122,160],"paper,":[48],"we":[49,61,140,152,238],"take":[50],"novel":[52],"perspective":[53],"by":[54,91],"asking":[55],"following":[57],"question:":[58],"When":[59],"can":[60],"guarantee":[62],"that":[63,121,209,220,248],"an":[64,164,176],"observed":[65],"persistent":[66,265],"feature":[67],"(a":[68],"bar)":[69],"inherent":[71],"underlying":[74],"data":[75],"presence":[78],"limited":[81],"number":[82],"unknown,":[84],"arbitrary":[85],"We":[87,119,187,207],"formalize":[88],"question":[90],"introducing":[92],"notion":[94],"adversarial":[96,250,258],"robustness,":[97],"and":[98,175],"study":[99],"problem":[101,123,135,204],"deciding":[103],"whether":[104],"given":[106],"bar":[107],"barcode":[110],"filtered":[113],"simplicial":[114,137],"complex":[115],"adversarially":[117],"robust.":[118],"show":[120,208],"essentially":[125],"equivalent":[126],"homological":[129,199],"variant":[130],"minimum":[133],"cut":[134],"complexes,":[138],"which":[139],"believe":[141],"be":[143],"independent":[145],"interest.":[146],"As":[147],"our":[148,217],"main":[149],"technical":[150],"contribution,":[151],"provide":[153,239],"first":[155],"computational":[156],"complexity":[157],"results":[158],"problem,":[161,174],"consisting":[162],"efficient":[165,177],"algorithm":[166,178],"0-dimensional":[168],"homology,":[169],"NP-hardness":[170],"general":[173],"codimension-1":[180],"n-dimensional":[182],"complexes":[183],"embedded":[184],"\u211d\u207f.":[186],"also":[188],"analyze":[189],"its":[190],"natural":[191],"linear":[192],"programming":[193],"relaxation,":[194],"whose":[195],"dual":[196],"defines":[197],"analog":[200],"max-flow":[203],"graphs.":[206],"max-flow/min-cut":[211],"theorem":[212],"does":[213],"not":[214,225],"hold":[215],"setting,":[218],"implying":[219],"LP":[222],"relaxation":[223],"tight":[226],"general.":[228],"Finally,":[229],"special":[232],"case":[233],"filtration,":[237],"global":[241],"heuristic":[242],"Hausdorff":[246],"distance":[247],"guarantees":[249],"sufficiently":[253],"long":[254],"bars.":[255],"connects":[257],"standard":[261],"stability":[262],"theorems":[263],"homology.":[266]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}