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: "universal dependencies parsing for colloquial singaporean english"
  Abstract: Singlish can be interesting to the ACL community both linguistically as a major creole based on English, and computationally for information extraction and sentiment analysis of regional social media. We investigate dependency parsing of Singlish by constructing a dependency treebank under the Universal Dependencies scheme, and then training a neural network model by integrating English syntactic knowledge into a state-of-the-art parser trained on the Singlish treebank. Results show that English knowledge can lead to 25% relative error reduction, resulting in a parser of 84.47% accuracies. To the best of our knowledge, we are the first to use neural stacking to improve cross-lingual dependency parsing on low-resource languages. We make both our annotation and parser available for further research.

Connected through hyperedge HE-1 (induced by source paper "cross lingual dependency parsing using code mixed treebank"):
  with members:
    - "low resource syntactic transfer with unsupervised source reordering"
    - "parameter sharing between dependency parsers for related languages"
    - "design challenges and misconceptions in neural sequence labeling"
    - "cross lingual dependency parsing with late decoding for truly low resource languages"
    - "deep biaffine attention for neural dependency parsing"
    - "cross lingual syntactic transfer with limited resources"
    - "many languages one parser"

Connected through hyperedge HE-2 (induced by source paper "parsing tweets into universal dependencies"):
  with members:
    - "reporting score distributions makes a difference performance study of lstm networks for sequence tagging"
    - "training with exploration improves a greedy stack lstm parser"
    - "simple and accurate dependency parsing using bidirectional lstm feature representations"
    - "distilling an ensemble of greedy dependency parsers into one mst parser"
    - "many languages one parser"
    - "improved transition based parsing by modeling characters instead of words with lstms"
    - "bidirectional lstm crf models for sequence tagging"
    - "a framework for under specifying dependency syntax without overloading annotators"

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)