{"id":"https://openalex.org/W7164373110","doi":"https://doi.org/10.48550/arxiv.2606.11348","title":"SwiftCTS: Fast Cross-Design Prediction and Pareto Optimization of Clock Tree Metrics via Few-Shot Calibration","display_name":"SwiftCTS: Fast Cross-Design Prediction and Pareto Optimization of Clock Tree Metrics via Few-Shot Calibration","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164373110","doi":"https://doi.org/10.48550/arxiv.2606.11348"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.11348","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11348","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":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.11348","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126692194","display_name":"Barsat Khadka","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khadka, Barsat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138426928","display_name":"Kawsher Roxy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roxy, Kawsher","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126691810","display_name":"Md Rubel Ahmed","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ahmed, Md Rubel","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/T10363","display_name":"Low-power high-performance VLSI design","score":0.7009999752044678,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.7009999752044678,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.09740000218153,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11206","display_name":"Model Reduction and Neural Networks","score":0.011699999682605267,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/skew","display_name":"Skew","score":0.5501000285148621},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4747999906539917},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.453000009059906},{"id":"https://openalex.org/keywords/calibration","display_name":"Calibration","score":0.4503999948501587},{"id":"https://openalex.org/keywords/resampling","display_name":"Resampling","score":0.44029998779296875},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4390000104904175},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.43470001220703125},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.43209999799728394},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4275999963283539},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.397599995136261}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7468000054359436},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.5501000285148621},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4747999906539917},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.453000009059906},{"id":"https://openalex.org/C165838908","wikidata":"https://www.wikidata.org/wiki/Q736777","display_name":"Calibration","level":2,"score":0.4503999948501587},{"id":"https://openalex.org/C150921843","wikidata":"https://www.wikidata.org/wiki/Q1170431","display_name":"Resampling","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4390000104904175},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4275999963283539},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.40149998664855957},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.397599995136261},{"id":"https://openalex.org/C190839683","wikidata":"https://www.wikidata.org/wiki/Q2448197","display_name":"Train","level":2,"score":0.35659998655319214},{"id":"https://openalex.org/C22019652","wikidata":"https://www.wikidata.org/wiki/Q331309","display_name":"Overfitting","level":3,"score":0.3515999913215637},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3472999930381775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3384000062942505},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.3310000002384186},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2955000102519989},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.2619999945163727},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.11348","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11348","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.11348","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11348","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":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":{"Clock":[0],"Tree":[1],"Synthesis":[2],"(CTS)":[3],"is":[4],"a":[5,21,66,91,111],"computationally":[6,37],"expensive":[7,38],"stage":[8],"in":[9,86,158],"the":[10,54,170],"physical":[11,124],"design":[12],"flow,":[13],"requiring":[14],"iterative":[15],"EDA":[16],"tool":[17,198],"invocations":[18],"to":[19,43,45,53,119,133,140],"navigate":[20],"vast":[22],"configuration":[23],"space":[24],"for":[25,180],"optimal":[26],"power,":[27],"wirelength,":[28,183],"and":[29,49,93,135,182,184],"timing":[30,185],"skew.":[31],"Existing":[32],"machine":[33],"learning":[34],"approaches":[35],"require":[36],"retraining":[39,106],"or":[40,107,122],"fine-tuning":[41],"cycles":[42],"adapt":[44],"unseen":[46,144],"macro":[47],"architectures":[48],"are":[50,166],"architecturally":[51],"mismatched":[52],"millions":[55],"of":[56],"evaluations":[57],"demanded":[58],"by":[59],"exhaustive":[60],"combinatorial":[61],"search.":[62],"We":[63],"present":[64],"SwiftCTS,":[65],"physics-informed":[67],"surrogate":[68],"framework":[69],"that":[70,116,165],"addresses":[71],"both":[72],"limitations":[73],"simultaneously.":[74],"By":[75],"coupling":[76],"lightweight,":[77],"physics-grounded":[78],"statistical":[79],"features":[80],"with":[81,149],"gradient-boosted":[82],"ensembles,":[83],"SwiftCTS":[84,153],"trains":[85],"under":[87,141,159],"five":[88,189],"seconds":[89],"on":[90,143,191],"CPU":[92],"delivers":[94],"sub-millisecond":[95],"inference":[96],"without":[97,105],"GPU":[98],"support.":[99],"To":[100],"handle":[101],"out-of-distribution":[102],"(OOD)":[103],"designs":[104],"fine-tuning,":[108],"we":[109],"introduce":[110],"K-shot":[112],"multiplicative":[113],"calibration":[114],"mechanism":[115],"anchors":[117],"predictions":[118,187],"just":[120],"one":[121],"two":[123],"reference":[125],"runs,":[126],"reducing":[127],"power":[128,181],"prediction":[129,176],"error":[130,137],"from":[131,138],"24.5\\%":[132],"3.3\\%":[134],"wirelength":[136],"56.6\\%":[139],"1\\%":[142],"macros.":[145],"Integrating":[146],"this":[147],"engine":[148],"an":[150,192],"evolutionary":[151],"optimizer,":[152],"evaluates":[154],"100,000":[155],"CTS":[156],"configurations":[157],"ten":[160],"seconds,":[161],"yielding":[162],"Pareto-optimal":[163],"frontiers":[164],"physically":[167],"validated":[168],"within":[169,188],"OpenROAD":[171],"flow.":[172],"Closed-loop":[173],"validation":[174],"confirms":[175],"errors":[177],"below":[178],"0.5\\%":[179],"skew":[186],"picoseconds":[190],"OOD":[193],"benchmark,":[194],"consistently":[195],"outperforming":[196],"default":[197],"heuristics":[199],"across":[200],"all":[201],"target":[202],"metrics.":[203],"Code":[204],"publicly":[205],"available":[206],"at:":[207],"\\href{https://anonymous.4open.science/r/SwiftCTS-7E6E}{https://github.com/BarsatKhadka/SwiftCTS}":[208]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-12T00:00:00"}