{"id":"https://openalex.org/W3130873638","doi":"https://doi.org/10.46298/lmcs-20(1:1)2024","title":"Depth lower bounds in Stabbing Planes for combinatorial principles","display_name":"Depth lower bounds in Stabbing Planes for combinatorial principles","publication_year":2024,"publication_date":"2024-01-11","ids":{"openalex":"https://openalex.org/W3130873638","doi":"https://doi.org/10.46298/lmcs-20(1:1)2024","mag":"3130873638"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-20(1:1)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(1:1)2024","pdf_url":"https://lmcs.episciences.org/12858/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/12858/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038346780","display_name":"Stefan Dantchev","orcid":"https://orcid.org/0000-0003-4534-2242"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan Dantchev","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084573067","display_name":"Nicola Galesi","orcid":"https://orcid.org/0000-0002-8522-362X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicola Galesi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060317464","display_name":"Abdul Ghani","orcid":"https://orcid.org/0000-0002-1719-7335"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abdul Ghani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barnaby Martin","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":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00043877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"Volume 20, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.9804588556289673},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6713594794273376},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6522799134254456},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6432284116744995},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.599911630153656},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5355038642883301},{"id":"https://openalex.org/keywords/combinatorial-principles","display_name":"Combinatorial principles","score":0.5046514272689819},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4540671706199646},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.45322877168655396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4527776539325714},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41717711091041565},{"id":"https://openalex.org/keywords/combinatorial-explosion","display_name":"Combinatorial explosion","score":0.14100617170333862},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09709441661834717}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.9804588556289673},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6713594794273376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6522799134254456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6432284116744995},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.599911630153656},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5355038642883301},{"id":"https://openalex.org/C1769372","wikidata":"https://www.wikidata.org/wiki/Q3850844","display_name":"Combinatorial principles","level":3,"score":0.5046514272689819},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4540671706199646},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.45322877168655396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4527776539325714},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41717711091041565},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.14100617170333862},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09709441661834717},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.46298/lmcs-20(1:1)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(1:1)2024","pdf_url":"https://lmcs.episciences.org/12858/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2102.07622","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2102.07622","pdf_url":"https://arxiv.org/pdf/2102.07622","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:3130873638","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2102.07622.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:doaj.org/article:68c4f2bcad5e4d099e8d6f8096124122","is_oa":true,"landing_page_url":"https://doaj.org/article/68c4f2bcad5e4d099e8d6f8096124122","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)","raw_type":"article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:15834","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.24","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2102.07622","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2102.07622","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-journal"},{"id":"doi:10.4230/lipics.stacs.2022.24","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2022.24","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.46298/lmcs-20(1:1)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(1:1)2024","pdf_url":"https://lmcs.episciences.org/12858/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3130873638.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W30950413","https://openalex.org/W153015188","https://openalex.org/W1492641605","https://openalex.org/W1504627710","https://openalex.org/W1599335667","https://openalex.org/W1603813317","https://openalex.org/W1976465342","https://openalex.org/W2038193643","https://openalex.org/W2057361103","https://openalex.org/W2061307063","https://openalex.org/W2062897452","https://openalex.org/W2065389690","https://openalex.org/W2078608416","https://openalex.org/W2098022011","https://openalex.org/W2100738443","https://openalex.org/W2117749206","https://openalex.org/W2133392939","https://openalex.org/W2142326240","https://openalex.org/W2188711438","https://openalex.org/W2474757319","https://openalex.org/W3003895133","https://openalex.org/W3045335116","https://openalex.org/W3119890049","https://openalex.org/W3128839604","https://openalex.org/W3134484519","https://openalex.org/W3165747590","https://openalex.org/W4307781383","https://openalex.org/W6929359421"],"related_works":["https://openalex.org/W3148729657","https://openalex.org/W3134484519","https://openalex.org/W3037553937","https://openalex.org/W2133392939","https://openalex.org/W296741740","https://openalex.org/W1996043196","https://openalex.org/W2296221246","https://openalex.org/W2041989601","https://openalex.org/W2580163882","https://openalex.org/W2729364042","https://openalex.org/W1965650902","https://openalex.org/W2765862497","https://openalex.org/W2963756047","https://openalex.org/W2073039422","https://openalex.org/W3885171","https://openalex.org/W2045497185","https://openalex.org/W2963012133","https://openalex.org/W3098872886","https://openalex.org/W2920960746","https://openalex.org/W2011805810"],"abstract_inverted_index":{"Stabbing":[0,45,121,240],"Planes":[1,46,55,96,122,241],"(also":[2],"known":[3,34],"as":[4,171],"Branch":[5],"and":[6,40,78,135,178,194,204,216,233],"Cut)":[7],"is":[8],"a":[9,228,234,247],"proof":[10,56,242],"system":[11],"introduced":[12],"very":[13],"recently":[14],"which,":[15],"informally":[16],"speaking,":[17],"extends":[18],"the":[19,53,128,137,147,172,175,179,184,201,209,213,218,223],"DPLL":[20],"method":[21,139,186,225],"by":[22,65,100,150],"branching":[23],"on":[24,132,143,157,165],"integer":[25],"linear":[26,151,190],"inequalities":[27],"instead":[28],"of":[29,49,88,146,167,243],"single":[30],"variables.":[31],"The":[32],"techniques":[33],"so":[35],"far":[36],"to":[37,115],"prove":[38,116,188],"size":[39,59,191,230],"depth":[41,71,197,236],"lower":[42,60,92,118,192,198,206,231,237],"bounds":[43,61,83,93,119,193,199,207],"for":[44,52,70,85,94,124,200,208,217,239],"are":[47,63,73,97],"generalizations":[48],"those":[50],"used":[51],"Cutting":[54,95],"system.":[57],"For":[58],"these":[62,72,82],"established":[64],"monotone":[66],"circuit":[67],"arguments,":[68],"while":[69],"found":[74],"via":[75],"communication":[76],"complexity":[77],"protection.":[79],"As":[80],"such":[81,170],"apply":[84],"lifted":[86],"versions":[87],"combinatorial":[89,159,168],"statements.":[90],"Rank":[91],"also":[98],"obtained":[99],"geometric":[101,113],"arguments":[102],"called":[103],"protection":[104],"lemmas.":[105],"In":[106],"this":[107],"work":[108],"we":[109,187,226],"introduce":[110],"two":[111],"new":[112],"approaches":[114],"size/depth":[117],"in":[120,154],"working":[123],"any":[125],"formula:":[126],"(1)":[127],"antichain":[129],"method,":[130],"relying":[131],"Sperner's":[133],"Theorem":[134],"(2)":[136],"covering":[138,224],"which":[140,153],"uses":[141],"results":[142],"essential":[144],"coverings":[145],"boolean":[148],"cube":[149],"polynomials,":[152],"turn":[155],"relies":[156],"Alon's":[158],"Nullenstellensatz.":[160],"We":[161],"demonstrate":[162],"their":[163],"use":[164],"classes":[166],"principles":[169],"Pigeonhole":[173,202],"principle,":[174],"Tseitin":[176,210,244],"contradictions":[177,211,245],"Linear":[180,219],"Ordering":[181,220],"Principle.":[182,221],"By":[183,222],"first":[185],"almost":[189],"optimal":[195],"logarithmic":[196,235],"principle":[203],"analogous":[205],"over":[212,246],"complete":[214],"graph":[215],"obtain":[227],"superlinear":[229],"bound":[232,238],"grid":[248],"graph.":[249]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}