{"id":"https://openalex.org/W4210321015","doi":"https://doi.org/10.37236/10098","title":"Hat Guessing on Books and Windmills","display_name":"Hat Guessing on Books and Windmills","publication_year":2022,"publication_date":"2022-01-28","ids":{"openalex":"https://openalex.org/W4210321015","doi":"https://doi.org/10.37236/10098"},"language":"en","primary_location":{"id":"doi:10.37236/10098","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10098","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i1p12/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i1p12/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017456930","display_name":"Xiaoyu He","orcid":"https://orcid.org/0000-0003-2958-6845"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaoyu He","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034076444","display_name":"Yuzu Ido","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuzu Ido","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009136134","display_name":"Benjamin Przybocki","orcid":"https://orcid.org/0009-0007-5489-1733"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Przybocki","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.2874,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.54552899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"29","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9987000226974487,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.78484046459198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7797650098800659},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6745460033416748},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6551117300987244},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48631176352500916},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.47324854135513306},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.45340341329574585},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42058658599853516}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.78484046459198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7797650098800659},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6745460033416748},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6551117300987244},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48631176352500916},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.47324854135513306},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.45340341329574585},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42058658599853516},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/10098","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10098","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i1p12/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/10098","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10098","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i1p12/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2499887605","display_name":null,"funder_award_id":"DGE-1656518","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G320138474","display_name":null,"funder_award_id":"-1656518","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5267932457","display_name":"Graduate Research Fellowship Program (GRFP)","funder_award_id":"1656518","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/W4210321015.pdf","grobid_xml":"https://content.openalex.org/works/W4210321015.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1978089484","https://openalex.org/W2063292248","https://openalex.org/W2080463870","https://openalex.org/W2963009464","https://openalex.org/W2963182345","https://openalex.org/W2964066337","https://openalex.org/W2976550183","https://openalex.org/W3101380329","https://openalex.org/W3110419541","https://openalex.org/W3195953319","https://openalex.org/W3198971151","https://openalex.org/W4206617389","https://openalex.org/W4244239489","https://openalex.org/W4300669229","https://openalex.org/W6600586173","https://openalex.org/W6698697543"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2036057584","https://openalex.org/W4246000090","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W2910933086","https://openalex.org/W3143578817","https://openalex.org/W4288630335"],"abstract_inverted_index":{"The":[0],"hat-guessing":[1,17,48,65,86],"number":[2,18,49,66,87],"is":[3,52,67],"a":[4],"graph":[5,60],"invariant":[6],"defined":[7],"by":[8],"Butler,":[9],"Hajiaghayi,":[10],"Kleinberg,":[11],"and":[12,34,36,80],"Leighton.":[13],"We":[14,44],"determine":[15,84],"the":[16,47,56,64,73,85],"exactly":[19,37],"for":[20,62,91],"book":[21],"graphs":[22,90],"with":[23],"sufficiently":[24],"many":[25],"pages,":[26],"improving":[27],"previously":[28],"known":[29,68],"lower":[30],"bounds":[31],"of":[32,42,50,76,78,88,94],"He":[33],"Li":[35],"matching":[38],"an":[39],"upper":[40,74],"bound":[41,75],"Gadouleau.":[43],"prove":[45],"that":[46],"$K_{3,3}$":[51],"$3$,":[53],"making":[54],"this":[55],"first":[57],"complete":[58],"bipartite":[59],"$K_{n,n}$":[61],"which":[63],"to":[69],"be":[70],"smaller":[71],"than":[72],"$n+1$":[77],"Gadouleau":[79],"Georgiou.":[81],"Finally,":[82],"we":[83],"windmill":[89],"most":[92],"choices":[93],"parameters.":[95]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}