{"id":"https://openalex.org/W7165040182","doi":"https://doi.org/10.48550/arxiv.2606.18236","title":"Sign-Rank, Index, and List Replicability: Connections and Separations","display_name":"Sign-Rank, Index, and List Replicability: Connections and Separations","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W7165040182","doi":"https://doi.org/10.48550/arxiv.2606.18236"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.18236","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18236","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.2606.18236","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138827128","display_name":"Ari Blondal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Blondal, Ari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084547602","display_name":"Hamed Hatami","orcid":"https://orcid.org/0000-0002-4732-434X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hatami, Hamed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007198874","display_name":"Pooya Hatami","orcid":"https://orcid.org/0000-0001-7928-8008"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hatami, Pooya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120367166","display_name":"Chavdar Lalov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lalov, Chavdar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138786234","display_name":"Sivan Tretiak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tretiak, Sivan","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/T12072","display_name":"Machine Learning and Algorithms","score":0.9569000005722046,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9569000005722046,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.009200000204145908,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.0071000000461936,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sign","display_name":"Sign (mathematics)","score":0.7038999795913696},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6434999704360962},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.607699990272522},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5781000256538391},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.478300005197525},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4668000042438507},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44510000944137573}],"concepts":[{"id":"https://openalex.org/C139676723","wikidata":"https://www.wikidata.org/wiki/Q1193832","display_name":"Sign (mathematics)","level":2,"score":0.7038999795913696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6651999950408936},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6434999704360962},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.607699990272522},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5921000242233276},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5781000256538391},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.478300005197525},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4668000042438507},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4408999979496002},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41920000314712524},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.3691999912261963},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.35929998755455017},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2985999882221222},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2727000117301941},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.18236","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18236","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.2606.18236","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18236","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":[{"score":0.5317421555519104,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"learning":[1],"theory,":[2],"the":[3,11,41,55,58,68,77,111,114,123,145,157,160,165],"sign-rank":[4,30,47,91],"of":[5,76,98,108,113,147,159,164],"a":[6,73,82,87,96,105,139],"binary":[7],"concept":[8,149],"class":[9],"captures":[10],"smallest":[12],"dimension":[13],"in":[14],"which":[15],"it":[16],"can":[17],"be":[18],"represented":[19],"by":[20,48,72,127,156],"points":[21],"and":[22,57,92,101,132],"halfspaces.":[23],"Despite":[24],"tremendous":[25],"interest,":[26],"lower":[27,44],"bounds":[28,45,121],"on":[29,46,122],"are":[31,51],"notoriously":[32],"difficult":[33],"to":[34,40,53],"come":[35],"by.":[36],"Two":[37],"recent":[38],"approaches":[39],"problem":[42],"establish":[43,119],"measures":[49],"that":[50,67,144],"easier":[52],"analyze:":[54],"$\\mathbb{Z}_2$-index":[56,69],"list":[59,78,109,124,152,161],"replicability":[60,79,125,153,162],"number.":[61,80,135],"We":[62,118,136],"order":[63],"these":[64],"measures,":[65],"showing":[66,143],"is":[70],"upper-bounded":[71],"linear":[74],"function":[75],"As":[81],"main":[83],"consequence,":[84],"we":[85],"obtain":[86],"strong":[88],"separation":[89],"between":[90],"$\\mathbb{Z}_2$-index,":[93],"thereby":[94],"resolving":[95],"question":[97],"Frick,":[99],"Hosseini,":[100],"Vasileuski.":[102],"This":[103],"motivates":[104],"thorough":[106],"study":[107],"replicability,":[110],"stronger":[112],"two":[115,128,148,166],"lower-bounding":[116],"measures.":[117],"upper":[120],"number":[126,154],"combinatorial":[129],"measures:":[130],"height":[131],"minimum":[133],"star":[134],"also":[137],"prove":[138],"fundamental":[140],"composition":[141],"result,":[142],"product":[146],"classes":[150],"has":[151],"bounded":[155],"sum":[158],"numbers":[163],"classes.":[167]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-18T00:00:00"}