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: "a straightforward approach to morphological analysis and synthesis"
  Abstract: ABSTRACT In this paper we present a lexicon-based approach to the problem of morphological processing. Full-form words, lemmas and grammatical tags are in-terconnected in a DAWG. Thus, the process of analysis/synthesis is reduced to a search in the graph, which is very fast and can be performed even if several pieces of information are missing from the input. The contents of the DAWG are up-dated using an on-line incremental process. The proposed approach is language independent and it does not utilize any morphophonetic rules or any other special linguistic information. Keywords: Morphology, Directed Acyclic Word Graphs, Lexicon Structures 1. INTRODUCTION The morphological processing problem can be summarised in two separate tasks: (a) given a word form, determine its lemma and its grammatical de-scription (this is known as morphological analysis) and (b) given a lemma and a set of intended grammatical features, determine the corresponding inflected form (this is known as morphological synthesis). There is also a third option: given a word in any form and a set of intended grammati-cal features, change the word to the corresponding inflected form; but this can be reduced easily to a combination of the two aforementioned tasks. The problem is generally not deterministic and many approaches have been proposed to deal with it. Some of them are language specific using special knowledge of the language in question to obtain the results [5]. Other methods are generally language independent [1,3] but they require the development of some model of the language (e.g. morphophonetic and morphotactic rules). In this paper we describe a straightforward approach that is language independent, requires no model of the language or any other type of pre-programmed linguistic information and uses a sin-gle data structure for both analysis and synthesis. The structure is a specially structured lexicon that contains the lemmas, the inflected forms of the words and their grammatical features stored in a Directed Acyclic Word Graph (DAWG) [4]. Thus the problem of morphological processing is re-duced to a search in the graph. The structure has certain similarities to a lexical transducer [2]: it in-corporates surface and lexical forms as well as the appropriate morphological information. It differs in the way these forms and information are stored. And since it contains only finite strings, algorithms for incremental construction of DAWGs [5,8] can be applied to update it. These algorithms are fast enough to be used on-line. The proposed method has been applied to a Greek-language morphological analyser used in the project MITOS

Connected through hyperedge HE-1 (induced by source paper "incremental construction of compact acyclic nfas"):
  with members:
    - "incremental construction of minimal acyclic finite state automata"

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.CL(Computation and Language)