{"id":"https://openalex.org/W7127623021","doi":"https://doi.org/10.48550/arxiv.2602.03701","title":"A Formal Analysis of Capacity Scaling Algorithms for Minimum-Cost Flows","display_name":"A Formal Analysis of Capacity Scaling Algorithms for Minimum-Cost Flows","publication_year":2026,"publication_date":"2026-02-03","ids":{"openalex":"https://openalex.org/W7127623021","doi":"https://doi.org/10.48550/arxiv.2602.03701"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.03701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03701","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.2602.03701","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125012758","display_name":"Mohammad Abdulaziz","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Abdulaziz, Mohammad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124983367","display_name":"Thomas Ammer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ammer, Thomas","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5125012758"],"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/T10126","display_name":"Logic, programming, and type systems","score":0.2930999994277954,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.2930999994277954,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.23909999430179596,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.15109999477863312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/executable","display_name":"Executable","score":0.8069999814033508},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7882000207901001},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.663100004196167},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.4496000111103058},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.4207000136375427},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3955000042915344},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.38909998536109924},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.3855000138282776},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.3765000104904175}],"concepts":[{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.8069999814033508},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7882000207901001},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.663100004196167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6388000249862671},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.628000020980835},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.4496000111103058},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.4207000136375427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40709999203681946},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.38909998536109924},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.3617999851703644},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.35359999537467957},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.3522999882698059},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3179999887943268},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.3098999857902527},{"id":"https://openalex.org/C2985583900","wikidata":"https://www.wikidata.org/wiki/Q722617","display_name":"Formal description","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.2648000121116638},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.2563999891281128},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.03701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03701","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.2602.03701","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03701","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,45,110],"present":[1],"formalisations":[2],"of":[3,6,17,25,42,50,62,71,121,138],"the":[4,18,23,33,40,51,69,89,105,114,119],"correctness":[5],"executable":[7,76,102],"algorithms":[8,19],"to":[9,116,135,143,151],"solve":[10],"minimum-cost":[11,43,107,122],"flow":[12,108],"problems":[13,90],"in":[14],"Isabelle/HOL.":[15],"Two":[16],"are":[20,96,113],"based":[21],"on":[22,85],"technique":[24,70],"scaling,":[26],"most":[27],"notably":[28],"Orlin's":[29,57,93],"algorithm,":[30,64],"which":[31,65,92],"has":[32,132],"fastest":[34],"known":[35],"running":[36,53],"time":[37,54],"for":[38,56,91],"solving":[39],"problem":[41,120],"flow.":[44],"also":[46,99,133],"include":[47],"a":[48,81,136],"formalisation":[49],"worst-case":[52],"argument":[55],"algorithm.":[58],"Our":[59,130],"verified":[60,100],"implementation":[61],"this":[63],"is":[66,74],"derived":[67],"by":[68],"stepwise":[72],"refinement,":[73],"fully":[75],"and":[77,141],"was":[78],"integrated":[79],"into":[80],"reusable":[82],"formal":[83],"library":[84],"graph":[86],"algorithms.":[87,129],"Because":[88],"algorithm":[94],"works":[95],"restricted,":[97],"we":[98,112],"an":[101],"reduction":[103],"from":[104],"general":[106],"problem.":[109],"believe":[111],"first":[115],"formally":[117],"consider":[118],"flows":[123],"and,":[124],"more":[125],"generally,":[126],"any":[127],"scaling":[128],"work":[131],"led":[134],"number":[137],"mathematical":[139],"insights":[140],"improvements":[142],"proofs":[144],"as":[145,147],"well":[146],"theorem":[148],"statements,":[149],"compared":[150],"all":[152],"existing":[153],"expositions.":[154]},"counts_by_year":[],"updated_date":"2026-02-06T02:05:47.483045","created_date":"2026-02-06T00:00:00"}