{"id":"https://openalex.org/W7162549021","doi":"https://doi.org/10.48550/arxiv.2605.26938","title":"Developing a Totally Unimodular Linear Program for Optimal Conformance Checking: When and Why It Complements A*","display_name":"Developing a Totally Unimodular Linear Program for Optimal Conformance Checking: When and Why It Complements A*","publication_year":2026,"publication_date":"2026-05-26","ids":{"openalex":"https://openalex.org/W7162549021","doi":"https://doi.org/10.48550/arxiv.2605.26938"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.26938","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26938","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.26938","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041097802","display_name":"Izack Cohen","orcid":"https://orcid.org/0000-0002-6775-3256"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cohen, Izack","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5041097802"],"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/T10703","display_name":"Business Process Modeling and Analysis","score":0.7562000155448914,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10703","display_name":"Business Process Modeling and Analysis","score":0.7562000155448914,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.045499999076128006,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.0333000011742115,"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/unimodular-matrix","display_name":"Unimodular matrix","score":0.6815999746322632},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5946999788284302},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4936000108718872},{"id":"https://openalex.org/keywords/conformance-checking","display_name":"Conformance checking","score":0.4860000014305115},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4742000102996826},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4659999907016754},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.45509999990463257},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.45399999618530273},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4162999987602234}],"concepts":[{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.6815999746322632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6413000226020813},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5946999788284302},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4936000108718872},{"id":"https://openalex.org/C2775948798","wikidata":"https://www.wikidata.org/wiki/Q5160261","display_name":"Conformance checking","level":5,"score":0.4860000014305115},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4742000102996826},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4659999907016754},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.45509999990463257},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.45399999618530273},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44209998846054077},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4162999987602234},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39899998903274536},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3880000114440918},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.34860000014305115},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C76844732","wikidata":"https://www.wikidata.org/wiki/Q4072285","display_name":"Conformance testing","level":3,"score":0.3384000062942505},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3319999873638153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30869999527931213},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29789999127388},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.25949999690055847}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.26938","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26938","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.26938","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26938","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Alignment-based":[0],"conformance":[1,47,109,154],"checking":[2,48,110,155],"is":[3,156],"the":[4,32,58,62,67,71,75,88,125,132,141],"state-of-the-art":[5],"approach":[6,127],"for":[7,147],"comparing":[8],"observed":[9],"process":[10,14],"executions":[11],"with":[12,92,150,178],"normative":[13],"models.":[15],"The":[16,119],"standard":[17],"exact":[18],"solution":[19,82],"relies":[20],"on":[21,57,104,136,160],"an":[22,78,100],"A*-based":[23],"heuristic":[24],"search,":[25],"which":[26],"can":[27],"exhibit":[28,128],"exponential":[29],"runtime":[30,174],"in":[31],"presence":[33],"of":[34,45,61,77,176],"long":[35],"traces":[36,149],"or":[37],"substantial":[38,145],"deviations.":[39],"This":[40],"paper":[41],"introduces":[42],"a":[43,50],"reformulation":[44],"alignment-based":[46],"as":[49],"totally":[51],"unimodular":[52],"linear":[53],"program":[54],"(LP)":[55],"defined":[56],"reachability":[59],"graph":[60],"synchronous":[63],"product.":[64],"By":[65],"exploiting":[66],"underlying":[68],"network-flow":[69],"structure,":[70],"proposed":[72],"formulation":[73,143],"guarantees":[74],"existence":[76],"integral":[79],"optimal":[80],"extreme-point":[81],"through":[83],"LP":[84,126,142],"relaxation,":[85],"thereby":[86],"avoiding":[87],"combinatorial":[89],"overhead":[90],"associated":[91],"integer":[93],"variables":[94],"and":[95,115,124],"branch-and-bound":[96],"search.":[97],"We":[98],"conduct":[99],"extensive":[101],"empirical":[102],"evaluation":[103],"more":[105],"than":[106],"2.1":[107],"million":[108],"instances":[111],"derived":[112],"from":[113],"real-world":[114],"synthetic":[116],"benchmark":[117],"datasets.":[118],"results":[120],"show":[121],"that":[122,168],"A*":[123],"complementary":[129],"performance":[130],"characteristics:":[131],"former":[133],"performs":[134],"best":[135],"short,":[137],"well-conforming":[138],"traces,":[139],"while":[140],"provides":[144],"speedups":[146],"longer":[148],"deviations,":[151],"precisely":[152],"where":[153],"most":[157],"informative.":[158],"Based":[159],"these":[161],"findings,":[162],"we":[163],"derive":[164],"simple":[165],"algorithm-selection":[166],"guidelines":[167],"combine":[169],"both":[170],"approaches,":[171],"achieving":[172],"average":[173],"savings":[175],"38.6%":[177],"96%":[179],"selection":[180],"accuracy":[181],"compared":[182],"to":[183],"always":[184],"using":[185],"A*.":[186]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-28T00:00:00"}