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: "improving memory hierarchy utilisation for stencil computations on multicore machines"
  Abstract: AbstractAlthough modern supercomputers are composed of multicore machines, onecan ﬁnd scientists that still execute their legacy applications which were developedto monocore cluster where memory hierarchy is dedicated to a sole core. The mainobjective of this paper is to propose and evaluate an algorithm that identify an efﬁ-cient blocksize to be applied on MPI stencil computations on multicore machines.Under the light of an extensive experimental analysis, this work shows the beneﬁtsof identifying blocksizes that will dividing data on the various cores and suggest amethodology that explore the memory hierarchy available in modern machines. 1 Introduction Despite the increase in processing power and storage capacity of computers in recentdecades [10], there is a growing demand by scientists, engineers, economists amongothers researchers, which are looking for high performance computing. This demandis due to a variety of complex problems being studied and also the increasing amountof data to be analysed.In modern system platforms, a growing number of multiprocessors [7] has becomeavailable and researchers have been spending signiﬁcant efforts to extract high perfor-mance from such systems [9]. In recent studies, the memory access pattern is a crucial

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.DC(Distributed, Parallel, and Cluster Computing)