{"id":"https://openalex.org/W7134242767","doi":"https://doi.org/10.48550/arxiv.2603.05818","title":"RouteGoT: Node-Adaptive Routing for Cost-Efficient Graph of Thoughts Reasoning","display_name":"RouteGoT: Node-Adaptive Routing for Cost-Efficient Graph of Thoughts Reasoning","publication_year":2026,"publication_date":"2026-03-06","ids":{"openalex":"https://openalex.org/W7134242767","doi":"https://doi.org/10.48550/arxiv.2603.05818"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.05818","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128481560","display_name":"Yuhang Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Liu, Yuhang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128432124","display_name":"Ruijie Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Ruijie","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128552487","display_name":"Yunlong Chu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chu, Yunlong","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128555192","display_name":"Bing Hao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hao, Bing","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128560455","display_name":"Yumeng Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Yumeng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128455141","display_name":"Shengzhong Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Shengzhong","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128548729","display_name":"Minglai Shao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shao, Minglai","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5128481560"],"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.7214999794960022,"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.7214999794960022,"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/T10028","display_name":"Topic Modeling","score":0.051899999380111694,"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/T14347","display_name":"Big Data and Digital Economy","score":0.034699998795986176,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/security-token","display_name":"Security token","score":0.7009999752044678},{"id":"https://openalex.org/keywords/inefficiency","display_name":"Inefficiency","score":0.6796000003814697},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.6238999962806702},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5534999966621399},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.534500002861023},{"id":"https://openalex.org/keywords/subnetwork","display_name":"Subnetwork","score":0.4131999909877777},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3716999888420105},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.34470000863075256}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7458999752998352},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.7009999752044678},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.6796000003814697},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6238999962806702},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5534999966621399},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.534500002861023},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4154999852180481},{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.4131999909877777},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4050999879837036},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3716999888420105},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3393000066280365},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.32249999046325684},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.3172999918460846},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.3160000145435333},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2840000092983246},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C2777480716","wikidata":"https://www.wikidata.org/wiki/Q23582796","display_name":"Resource consumption","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.25189998745918274},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2506999969482422},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.05818","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.05818","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.05818","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.05818","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large":[0],"Language":[1],"Models":[2],"(LLMs)":[3],"excel":[4],"at":[5],"multi-step":[6],"reasoning,":[7,185],"yet":[8],"increasing":[9],"the":[10],"structural":[11],"complexity":[12],"of":[13,25,29,35],"inference":[14,168],"does":[15],"not":[16],"consistently":[17],"improve":[18],"system-level":[19],"returns.":[20],"Methods":[21],"such":[22],"as":[23],"Tree":[24],"Thoughts":[26,30,36],"(ToT),":[27],"Graph":[28,34],"(GoT),":[31],"and":[32,52,54,78,87,93,105,142,149,187,213,240],"Adaptive":[33],"(AGoT)":[37],"can":[38,57,106],"boost":[39],"accuracy":[40,197,211],"on":[41,156],"some":[42],"benchmarks,":[43],"but":[44],"often":[45],"introduce":[46],"substantial":[47],"overhead":[48],"in":[49],"token":[50,177,201,216],"consumption":[51],"latency,":[53],"their":[55],"gains":[56],"be":[58,107],"unstable":[59],"across":[60,184],"task":[61],"distributions-sometimes":[62],"underperforming":[63],"simpler":[64],"Chain-of-Thought":[65],"(CoT)":[66],"or":[67,195],"direct":[68],"input-output":[69],"prompting":[70],"(IO).":[71],"We":[72],"attribute":[73],"this":[74],"inefficiency":[75],"to":[76,152,170,219],"stage-wise":[77],"node-wise":[79],"heterogeneity":[80],"inside":[81],"GoT-style":[82],"reasoning":[83],"pipelines:":[84],"high-quality":[85],"planning":[86,141],"final":[88],"synthesis":[89],"are":[90,103],"globally":[91],"coupled":[92],"typically":[94],"benefit":[95],"from":[96],"strong":[97,138],"models,":[98],"whereas":[99],"many":[100],"intermediate":[101],"subtasks":[102,154],"localized":[104],"solved":[108],"accurately":[109],"by":[110,118,136,227],"lighter":[111],"models":[112,139,148],"with":[113],"far":[114],"fewer":[115],"tokens.":[116],"Motivated":[117],"these":[119],"observations,":[120],"we":[121],"propose":[122],"RouteGoT,":[123],"a":[124,166,175,229],"budget-controllable,":[125],"node-adaptive":[126],"routing":[127,135,225],"framework":[128],"for":[129,140],"graph-structured":[130],"reasoning.":[131],"RouteGoT":[132,193,222],"performs":[133],"in-graph":[134],"prioritizing":[137],"synthesis,":[143],"while":[144,198],"dynamically":[145],"allocating":[146],"lightweight":[147],"cost-effective":[150],"strategies":[151],"leaf":[153],"based":[155],"predicted":[157],"difficulty.":[158],"It":[159],"further":[160],"integrates":[161],"explicit":[162],"budget":[163,238],"constraints":[164],"into":[165],"global":[167],"scheduler":[169],"control":[171],"graph":[172],"expansion":[173],"under":[174,236],"user-specified":[176],"budget,":[178],"enabling":[179],"predictable":[180],"performance-cost":[181],"trade-offs.":[182],"Experiments":[183],"retrieval,":[186],"multi-hop":[188],"QA":[189],"benchmarks":[190],"show":[191],"that":[192],"matching":[194],"improving":[196],"substantially":[199],"reducing":[200],"usage;":[202],"specifically,":[203],"it":[204],"achieves":[205],"an":[206],"average":[207],"8.1":[208],"percentage":[209],"points":[210],"improvement":[212],"79.1\\%":[214],"output":[215],"reduction":[217],"compared":[218],"AGoT.":[220],"Furthermore,":[221],"outperforms":[223],"existing":[224],"baselines":[226],"maintaining":[228],"superior":[230],"cost-accuracy":[231],"trade-off,":[232],"demonstrating":[233],"improved":[234],"robustness":[235],"varying":[237],"targets":[239],"tasks.":[241]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-03-10T00:00:00"}