{"id":"https://openalex.org/W7171841468","doi":"https://doi.org/10.48550/arxiv.2607.26630","title":"Cut Query Reachability for DAGs with Subquadratic Queries","display_name":"Cut Query Reachability for DAGs with Subquadratic Queries","publication_year":2026,"publication_date":"2026-07-29","ids":{"openalex":"https://openalex.org/W7171841468","doi":"https://doi.org/10.48550/arxiv.2607.26630"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.26630","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.26630","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2607.26630","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5144057712","display_name":"Ben Bals","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bals, Ben","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143997780","display_name":"Matei Tinca","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tinca, Matei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5012259594","display_name":"Yasamin Nazari","orcid":"https://orcid.org/0000-0003-1315-9355"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nazari, Yasamin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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.28110000491142273,"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.28110000491142273,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.226500004529953,"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.1145000010728836,"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/reachability","display_name":"Reachability","score":0.7146000266075134},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6290000081062317},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5695000290870667},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.5504000186920166},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.4941999912261963},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4359000027179718},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42340001463890076},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.40610000491142273},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.3828999996185303},{"id":"https://openalex.org/keywords/boolean-conjunctive-query","display_name":"Boolean conjunctive query","score":0.36160001158714294}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7146000266075134},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6290000081062317},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5695000290870667},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.5504000186920166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5296000242233276},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4941999912261963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48089998960494995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4706999957561493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4690999984741211},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4361000061035156},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4359000027179718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42340001463890076},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.3828999996185303},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.36160001158714294},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3555999994277954},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3544999957084656},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33899998664855957},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.3353999853134155},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.3215999901294708},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.3199999928474426},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3179999887943268},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.3172000050544739},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.31619998812675476},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.28610000014305115},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.28060001134872437},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.27309998869895935},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.2727999985218048},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.2538999915122986}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.26630","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.26630","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2607.26630","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.26630","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":{"In":[0],"the":[1,18,21,29,33,70,76,82,90],"cut-query":[2],"model,":[3],"we":[4,15],"have":[5],"access":[6],"to":[7,41,88,114,146],"a":[8,25,46,94,121,137],"(directed)":[9,22],"graph":[10,92],"via":[11],"an":[12],"oracle":[13],"and":[14,52,98,107,119,141],"can":[16,142],"query":[17,72],"size":[19],"of":[20,24,28,32,79],"cut":[23,71],"given":[26],"subset":[27],"vertices.":[30],"One":[31],"most":[34],"elementary":[35],"tasks":[36],"in":[37,64,69,151],"this":[38],"model":[39],"is":[40,45,87,134],"decide":[42],"if":[43],"there":[44],"path":[47],"two":[48],"fixed":[49],"vertices":[50],"$s$":[51],"$t$.":[53],"While":[54],"many":[55],"results":[56],"are":[57],"known":[58,84],"for":[59,66,75],"undirected":[60],"graphs,":[61],"much":[62],"less":[63],"understood":[65],"directed":[67,115],"graphs":[68,117],"model.":[73],"Even":[74],"basic":[77],"task":[78],"$s$-$t$":[80],"reachability,":[81],"best":[83],"randomized":[85],"algorithm,":[86,140],"reconstruct":[89],"entire":[91],"with":[93],"technique":[95],"by":[96],"Grebinski":[97],"Kucherov":[99],"using":[100,126],"$O(n^2":[101],"/":[102],"\\log":[103,129],"n)$":[104],"queries":[105],"[Grebinski":[106],"Kucherov,":[108],"2000].":[109],"We":[110],"restrict":[111],"our":[112],"attention":[113],"acyclic":[116],"(DAGs)":[118],"obtain":[120],"deterministic":[122],"single-source":[123,148],"reachability":[124],"algorithm":[125],"$O(n":[127],"\\sqrt{n":[128],"n})$":[130],"queries.":[131],"The":[132],"result":[133],"based":[135],"on":[136],"topological":[138],"sort":[139],"also":[143],"be":[144],"adapted":[145],"compute":[147],"shortest":[149],"paths":[150],"DAGs.":[152]},"counts_by_year":[],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2026-07-31T00:00:00"}