{"id":"https://openalex.org/W7129731296","doi":"https://doi.org/10.48550/arxiv.2602.14550","title":"Faster Pseudo-Deterministic Minimum Cut","display_name":"Faster Pseudo-Deterministic Minimum Cut","publication_year":2026,"publication_date":"2026-02-16","ids":{"openalex":"https://openalex.org/W7129731296","doi":"https://doi.org/10.48550/arxiv.2602.14550"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.14550","is_oa":true,"landing_page_url":null,"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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119918554","display_name":"Yotam Kenneth-Mordoch","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kenneth-Mordoch, Yotam","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5119918554"],"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.9452999830245972,"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.9452999830245972,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.014000000432133675,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.006200000178068876,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/minimum-cut","display_name":"Minimum cut","score":0.5231999754905701},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5221999883651733},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5047000050544739},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.49939998984336853},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4893999993801117},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4302000105381012},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.32659998536109924}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6765000224113464},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5231999754905701},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5221999883651733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5192999839782715},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.49939998984336853},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4893999993801117},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4302000105381012},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31929999589920044},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.3075999915599823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3021000027656555},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C204707403","wikidata":"https://www.wikidata.org/wiki/Q1152398","display_name":"Canonical form","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.275299996137619},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2596000134944916},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.14550","is_oa":true,"landing_page_url":null,"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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.14550","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.14550","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":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.14550","is_oa":true,"landing_page_url":null,"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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"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":{"Pseudo-deterministic":[0],"algorithms":[1,4,19,123],"are":[2],"randomized":[3,94,139],"that,":[5],"with":[6,112],"high":[7],"constant":[8],"probability,":[9],"output":[10],"a":[11,36,49,57,103,108],"fixed":[12],"canonical":[13,58,104],"solution.":[14],"The":[15,97],"study":[16],"of":[17,88,134],"pseudo-deterministic":[18,68,99,122],"for":[20,72,101,124],"the":[21,81,128,137],"global":[22],"minimum":[23,59,69,105],"cut":[24,70,106],"problem":[25],"was":[26],"recently":[27],"initiated":[28],"by":[29],"Agarwala":[30],"and":[31,91,116,131],"Varma":[32],"[ITCS'26],":[33],"who":[34],"gave":[35],"black-box":[37],"reduction":[38],"incurring":[39],"an":[40],"$O(\\log":[41,82],"n":[42,83],"\\log":[43,44,84,85],"n)$":[45,78,86],"overhead.":[46],"We":[47],"introduce":[48],"natural":[50],"graph-theoretic":[51],"tie-breaking":[52],"mechanism":[53],"that":[54],"uniquely":[55],"selects":[56],"cut.":[60],"Using":[61],"this":[62],"mechanism,":[63],"we":[64],"obtain:":[65],"(i)":[66],"A":[67],"algorithm":[71,100],"weighted":[73],"graphs":[74,126],"running":[75],"in":[76,107,127],"$O(m\\log^2":[77],"time,":[79],"eliminating":[80],"overhead":[87],"prior":[89],"work":[90],"matching":[92,136],"existing":[93],"algorithms.":[95,140],"(ii)":[96],"first":[98],"maintaining":[102],"fully-dynamic":[109],"unweighted":[110,125],"graph,":[111],"$\\mathrm{polylog}(n)$":[113],"update":[114],"time":[115],"$\\tilde{O}(n)$":[117],"query":[118],"time.":[119],"(iii)":[120],"Improved":[121],"dynamic":[129],"streaming":[130],"cut-query":[132],"models":[133],"computation,":[135],"best":[138]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-18T00:00:00"}