{"id":"https://openalex.org/W7165169515","doi":"https://doi.org/10.48550/arxiv.2606.18520","title":"Compact Geometric Representations of Hierarchies","display_name":"Compact Geometric Representations of Hierarchies","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W7165169515","doi":"https://doi.org/10.48550/arxiv.2606.18520"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.18520","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18520","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.18520","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066946498","display_name":"Prashant Gokhale","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gokhale, Prashant","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138939069","display_name":"Piotr Indyk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Indyk, Piotr","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138927612","display_name":"Yuhao Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Yuhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029495902","display_name":"Sandeep Silwal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Silwal, Sandeep","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073429864","display_name":"Tony Chang Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Tony Chang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138919441","display_name":"Haike Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Haike","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/T11273","display_name":"Advanced Graph Neural Networks","score":0.8774999976158142,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.8774999976158142,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.03779999911785126,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.018300000578165054,"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/embedding","display_name":"Embedding","score":0.646399974822998},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6141999959945679},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5527999997138977},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5016999840736389},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4602999985218048},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45320001244544983},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.428600013256073},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41620001196861267}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.646399974822998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6265000104904175},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6141999959945679},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5527999997138977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5034999847412109},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5016999840736389},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4602999985218048},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45320001244544983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4456000030040741},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.428600013256073},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41620001196861267},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.367900013923645},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.3605000078678131},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3582000136375427},{"id":"https://openalex.org/C75564084","wikidata":"https://www.wikidata.org/wiki/Q5597085","display_name":"Graph embedding","level":3,"score":0.334199994802475},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.30239999294281006},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.2957000136375427},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.28279998898506165},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.27149999141693115},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.18520","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18520","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.18520","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18520","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Computing":[0],"geometric":[1],"representations":[2],"of":[3,8,30,69,88,136,154,164,192,206],"data":[4],"is":[5,45,71,161,181,188],"a":[6,24,52,128],"cornerstone":[7],"modern":[9],"machine":[10],"learning,":[11],"typically":[12],"achieved":[13],"by":[14,47,149,203],"training":[15],"dual":[16],"encoders":[17],"which":[18],"map":[19],"queries":[20],"and":[21,103,186,199,224],"documents":[22],"into":[23],"shared":[25],"embedding":[26,130],"space.":[27],"Recent":[28],"work":[29,59],"You":[31],"et":[32],"al.":[33],"[NeurIPS":[34],"'25]":[35],"has":[36,60],"extended":[37],"this":[38,91,144],"approach":[39],"to":[40,146,236],"hierarchical":[41],"retrieval,":[42],"where":[43,159],"relevance":[44],"determined":[46],"the":[48,67,85,137,162,204,209],"ancestor-descendant":[49],"relationships":[50],"in":[51,131,208,231],"Directed":[53],"Acyclic":[54],"Graph":[55],"(DAG).":[56],"While":[57],"previous":[58],"shown":[61],"that":[62,121,178,214,225],"valid":[63],"embeddings":[64,97,111,153,216,238],"exist":[65],"when":[66],"number":[68,87,163,205],"descendants":[70],"small,":[72],"these":[73,167],"bounds":[74,201],"degrade":[75],"significantly":[76],"for":[77,98,107,122,183,190],"deep":[78],"hierarchies,":[79],"requiring":[80],"dimensions":[81,230],"as":[82,84],"large":[83],"total":[86],"nodes.":[89,165],"In":[90],"paper,":[92],"we":[93,170],"investigate":[94],"compact":[95],"reachability":[96,129],"more":[99],"general":[100,184],"graph":[101,117],"classes":[102],"provide":[104,171],"theoretical":[105,240],"guarantees":[106],"representing":[108],"hierarchies":[109],"using":[110],"whose":[112],"dimension":[113,133,155,179],"depends":[114],"on":[115,220],"structural":[116],"parameters.":[118],"We":[119,142,195,211],"prove":[120],"any":[123],"directed":[124],"tree,":[125],"there":[126],"exists":[127],"constant":[132],"3,":[134],"independent":[135],"tree's":[138],"size":[139],"or":[140,173],"depth.":[141],"generalize":[143],"result":[145],"graphs":[147,191],"characterized":[148],"treewidth":[150,193],"$t$,":[151],"constructing":[152],"$O(t":[156],"\\log":[157],"n)$,":[158],"$n$":[160],"Complementing":[166],"upper":[168,198],"bounds,":[169,176],"matching":[172],"near-matching":[174],"lower":[175,200],"showing":[177],"$\u03a9(n)$":[180],"necessary":[182],"DAGs":[185],"$\u03a9(t/\\log(n/t))$":[187],"required":[189],"$t$.":[194],"also":[196],"obtain":[197],"parameterized":[202],"cross-edges":[207],"DAG.":[210],"additionally":[212],"show":[213],"our":[215],"can":[217],"be":[218],"constructed":[219],"real":[221],"world":[222],"datasets,":[223],"they":[226],"give":[227],"much":[228],"smaller":[229],"high":[232],"recall":[233],"regimes":[234],"compared":[235],"prior":[237],"with":[239],"guarantees.":[241]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-19T00:00:00"}