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: "the generation of large networks from web of science data"
  Abstract: During the 1990s, one of us developed a series of freeware routines (this http URL) that enable the user to organize downloads from the Web-of-Science (Thomson Reuters) into a relational database, and then to export matrices for further analysis in various formats (for example, for co-author analysis). The basic format of the matrices displays each document as a case in a row that can be attributed different variables in the columns. One limitation to this approach was hitherto that relational databases typically have an upper limit for the number of variables, such as 256 or 1024. In this brief communication, we report on a way to circumvent this limitation by using txt2Pajek.exe, available as freeware from this http URL

Connected through hyperedge HE-1 (induced by source paper "quantifying the evolution of a scientific topic reaction of the academic community to the chornobyl disaster"):
  with members:
    - "text mining and visualization using vosviewer"

Connected through hyperedge HE-2 (induced by source paper "highly cited papers in library and information science lis authors institutions and network structures"):
  with members:
    - "which of the world s institutions employ the most highly cited researchers an analysis of the data from highlycited com"
    - "how are excellent highly cited papers defined in bibliometrics a quantitative analysis of the literature"
    - "are the authors of highly cited articles also the most productive ones"
    - "information metrics imetrics a research specialty with a socio cognitive identity"
    - "the use of percentiles and percentile rank classes in the analysis of bibliometric data opportunities and limits"

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.DL(Digital Libraries)