{"id":"https://openalex.org/W4289655430","doi":"https://doi.org/10.1109/isit50566.2022.9834714","title":"Improved Bounds on the Moments of Guessing Cost","display_name":"Improved Bounds on the Moments of Guessing Cost","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655430","doi":"https://doi.org/10.1109/isit50566.2022.9834714"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834714","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834714","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039387116","display_name":"\u015euayb S. Arslan","orcid":"https://orcid.org/0000-0003-3779-0731"},"institutions":[{"id":"https://openalex.org/I1301968116","display_name":"MEF University","ror":"https://ror.org/05jz51y94","country_code":"TR","type":"education","lineage":["https://openalex.org/I1301968116"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Suayb S. Arslan","raw_affiliation_strings":["MEF University,Sarıyer, Istanbul,Turkey,34396"],"affiliations":[{"raw_affiliation_string":"MEF University,Sarıyer, Istanbul,Turkey,34396","institution_ids":["https://openalex.org/I1301968116"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073219837","display_name":"Elif Haytao\u011flu","orcid":"https://orcid.org/0000-0002-6341-9701"},"institutions":[{"id":"https://openalex.org/I48843708","display_name":"Pamukkale University","ror":"https://ror.org/01etz1309","country_code":"TR","type":"education","lineage":["https://openalex.org/I48843708"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Elif Haytaoglu","raw_affiliation_strings":["Pamukkale University,Denizli,Turkey,20067"],"affiliations":[{"raw_affiliation_string":"Pamukkale University,Denizli,Turkey,20067","institution_ids":["https://openalex.org/I48843708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039387116"],"corresponding_institution_ids":["https://openalex.org/I1301968116"],"apc_list":null,"apc_paid":null,"fwci":0.261,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.37275693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"3351","last_page":"3356"},"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.9549999833106995,"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.9549999833106995,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9079999923706055,"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/computer-science","display_name":"Computer science","score":0.5565400719642639},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3431570529937744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3155052661895752}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5565400719642639},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3431570529937744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3155052661895752}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834714","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834714","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W768071978","https://openalex.org/W1755610232","https://openalex.org/W2106695582","https://openalex.org/W2123097583","https://openalex.org/W2165203736","https://openalex.org/W2954103209","https://openalex.org/W2963451384","https://openalex.org/W2965588185","https://openalex.org/W2975016959","https://openalex.org/W3036644399","https://openalex.org/W3045960439","https://openalex.org/W3080822496","https://openalex.org/W3098377107","https://openalex.org/W3203072205","https://openalex.org/W6622275137","https://openalex.org/W6637809210","https://openalex.org/W6780154714","https://openalex.org/W6802291951"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Guessing":[0],"a":[1,16],"random":[2],"variable":[3],"with":[4,71],"finite":[5],"or":[6],"countably":[7],"infinite":[8],"support":[9],"in":[10,50,87],"which":[11],"each":[12],"selection":[13],"leads":[14],"to":[15,34],"positive":[17],"cost":[18,47],"value":[19],"has":[20],"recently":[21],"been":[22],"studied":[23],"within":[24],"the":[25,42,53,64,82,98,113,116,127],"context":[26],"of":[27,45,52,97,126],"\"guessing":[28],"cost\".":[29],"In":[30,58],"those":[31],"studies,":[32],"similar":[33],"standard":[35],"guesswork,":[36],"upper":[37,114],"and":[38,106,135],"lower":[39,84,100,122],"bounds":[40,66,130],"for":[41,102,112,131],"\u03c1-th":[43],"moment":[44],"guessing":[46],"are":[48],"described":[49],"terms":[51],"known":[54,65,99],"measure":[55],"R\u00e9nyi\u2019s":[56],"entropy.":[57],"this":[59,88],"study,":[60],"we":[61],"non-trivially":[62],"improve":[63],"using":[67],"previous":[68],"techniques":[69],"along":[70],"new":[72],"notions":[73],"such":[74],"as":[75],"balancing":[76],"cost.":[77],"We":[78],"have":[79],"demonstrated":[80],"that":[81,96,125],"novel":[83,117],"bound":[85,101],"proposed":[86],"work,":[89],"achieves":[90],"5.84%,":[91],"18.47%":[92],"higher":[93],"values":[94,123],"than":[95,124],"\u03c1":[103,107,132,136],"=":[104,108,133,137],"1":[105,134],"5,":[109,138],"respectively.":[110,139],"As":[111],"bound,":[115],"expression":[118],"provides":[119],"10.93%,":[120],"5.54%":[121],"previously":[128],"presented":[129]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}