{"id":"https://openalex.org/W4210880265","doi":"https://doi.org/10.1145/3417979","title":"A Lower Bound on Cycle-Finding in Sparse Digraphs","display_name":"A Lower Bound on Cycle-Finding in Sparse Digraphs","publication_year":2022,"publication_date":"2022-02-08","ids":{"openalex":"https://openalex.org/W4210880265","doi":"https://doi.org/10.1145/3417979"},"language":"en","primary_location":{"id":"doi:10.1145/3417979","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3417979","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3417979","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3417979","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100329996","display_name":"Xi Chen","orcid":"https://orcid.org/0000-0002-8911-4172"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xi Chen","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113136235","display_name":"Tim Randolph","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tim Randolph","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014866889","display_name":"Rocco A. Servedio","orcid":"https://orcid.org/0000-0003-2407-543X"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rocco A. Servedio","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088157912","display_name":"Timothy Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Timothy Sun","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100329996"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02971557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"4","first_page":"1","last_page":"23"},"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.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9958999752998352,"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/combinatorics","display_name":"Combinatorics","score":0.7558908462524414},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.695393979549408},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6938908100128174},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.6169759631156921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5752678513526917},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.5720110535621643},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.519143283367157},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4764704704284668},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.44310805201530457},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4406312108039856},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.43808525800704956},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43690943717956543},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.4365312457084656},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4125156104564667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28384846448898315},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11340907216072083}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7558908462524414},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.695393979549408},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6938908100128174},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.6169759631156921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5752678513526917},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.5720110535621643},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.519143283367157},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4764704704284668},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.44310805201530457},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4406312108039856},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.43808525800704956},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43690943717956543},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.4365312457084656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4125156104564667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28384846448898315},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11340907216072083},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3417979","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3417979","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3417979","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3417979","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3417979","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3417979","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3645694610","display_name":"AF: Medium: New Frontiers in Equilibrium Computation","funder_award_id":"1703925","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3878299174","display_name":null,"funder_award_id":"IIS-1838154","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G643561847","display_name":"BIGDATA: F: Big Data Analysis via Non-Standard Property Testing","funder_award_id":"1838154","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6507447573","display_name":null,"funder_award_id":"several","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7640071255","display_name":null,"funder_award_id":"CCF-1563155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8559448196","display_name":"AF: Small: Collaborative Research: Boolean Function Analysis Meets Stochastic Design","funder_award_id":"1814873","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8728025545","display_name":"AF: Medium: Collaborative Research:  Circuit Lower Bounds via Projections","funder_award_id":"1563155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4210880265.pdf","grobid_xml":"https://content.openalex.org/works/W4210880265.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W67256834","https://openalex.org/W1539682630","https://openalex.org/W1648776928","https://openalex.org/W1963750764","https://openalex.org/W1980816908","https://openalex.org/W1988120018","https://openalex.org/W1994987445","https://openalex.org/W2001342485","https://openalex.org/W2005787849","https://openalex.org/W2020551595","https://openalex.org/W2081449822","https://openalex.org/W2082227928","https://openalex.org/W2083280764","https://openalex.org/W2405502058","https://openalex.org/W2418413199","https://openalex.org/W2586277680","https://openalex.org/W2761580201","https://openalex.org/W2769478807","https://openalex.org/W2852590651","https://openalex.org/W2912332148","https://openalex.org/W2942215842","https://openalex.org/W2953253371","https://openalex.org/W2963613355","https://openalex.org/W2963670536","https://openalex.org/W2998414467","https://openalex.org/W3021019285","https://openalex.org/W4294171725"],"related_works":["https://openalex.org/W1778531840","https://openalex.org/W4299411867","https://openalex.org/W2107228433","https://openalex.org/W4236436085","https://openalex.org/W4287028074","https://openalex.org/W2354764436","https://openalex.org/W3191289342","https://openalex.org/W4255598955","https://openalex.org/W4288723498","https://openalex.org/W2046013031"],"abstract_inverted_index":{"We":[0,46],"consider":[1],"the":[2,24,81,95,115,119,128],"problem":[3,65],"of":[4,33,77,83,98,130],"finding":[5],"a":[6,9,31,137],"cycle":[7],"in":[8,38,42,127],"sparse":[10,104],"directed":[11],"graph":[12],"G":[13,43,78],"that":[14,23,53],"is":[15,44,88,114],"promised":[16],"to":[17,72],"be":[18],"far":[19,110],"from":[20,111,136],"acyclic,":[21],"meaning":[22],"smallest":[25],"feedback":[26],"arc":[27],"set":[28],",":[29],"i.e.,":[30],"subset":[32],"edges":[34],"whose":[35],"deletion":[36],"results":[37],"an":[39,48,73,89],"acyclic":[40],"graph,":[41],"large.":[45],"prove":[47],"information-theoretic":[49],"lower":[50,92,124],"bound,":[51,125],"showing":[52],"for":[54,63,101],"N":[55,122],"-vertex":[56],"graphs":[57],"with":[58,106],"constant":[59,107],"outdegree,":[60],"any":[61],"algorithm":[62],"this":[64],"must":[66],"make":[67],"\u03a9\u0304(N":[68,90],"5/9":[69],")":[70,123],"queries":[71],"adjacency":[74],"list":[75],"representation":[76],".":[79],"In":[80],"language":[82],"property":[84],"testing,":[85],"our":[86],"result":[87],"5/9)":[91],"bound":[93],"on":[94,118],"query":[96],"complexity":[97],"one-sided":[99],"algorithms":[100],"testing":[102],"whether":[103],"digraphs":[105],"outdegree":[108],"are":[109],"acyclic.":[112],"This":[113],"first":[116],"improvement":[117],"\u03a9":[120],"(\u221a":[121],"implicit":[126],"work":[129],"Bender":[131],"and":[132],"Ron,":[133],"which":[134],"follows":[135],"simple":[138],"birthday":[139],"paradox":[140],"argument.":[141]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}