human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "regional clock tree generation by abutment in synchoros vlsi design"
  Abstract: Synchoros VLSI design style has been proposed as an alternative to standard cell based design. It enables end-to-end automation of large designs with ASIC-like efficiency. A key problem in this automation process is generation of regional clock tree. Synchoros design style requires that the clock tree should emerge by abutting its identical fragments, that are absorbed in synchoros large grain VLSI design objects as a one-time engineering effort. The clock tree should not be ad-hoc but a structured parametrically predictable design whose cost metrics are known. We present a new clock tree design that is compatible with the Synchoros design. The proposed design has been verified with static timing analysis and compared against functionally equivalent clock tree synthesized by commercial EDA tools. The scheme is also scalable and we show that the composition by abutment scheme is able to generate valid VLSI designs from 0.5 to ~2 million gates without the need for clock tree synthesis. More critically, the synthesized design is correct by construction and requires no further verification. In contrast, the hierarchical synthesis flow requires to synthesize the regional clock tree in addition to follow up verification step because it lacks predictability. The results also demonstrate that the capacitance, slew and the ability to balance skew of the clock tree synthesized by abutment is comparable to the one generated by commercial EDA tools.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.AR(Hardware Architecture)