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: "selective term proximity scoring via bp ann"
  Abstract: When two terms occur together in a document, the probability of a close relationship between them and the document itself is greater if they are in nearby positions. However, ranking functions including term proximity (TP) require larger indexes than traditional document-level indexing, which slows down query processing. Previous studies also show that this technique is not effective for all types of queries. Here we propose a document ranking model which decides for which queries it would be beneficial to use a proximity-based ranking, based on a collection of features of the query. We use a machine learning approach in determining whether utilizing TP will be beneficial. Experiments show that the proposed model returns improved rankings while also reducing the overhead incurred as a result of using TP statistics.

Connected through hyperedge HE-1 (induced by source paper "neural information retrieval a literature review"):
  with members:
    - "lstm a search space odyssey"
    - "tweet2vec character based distributed representations for social media"
    - "using word embeddings for automatic query expansion"
    - "representing documents and queries as sets of word embedded vectors for information retrieval"
    - "using word embeddings in twitter election classification"
    - "a deep relevance matching model for ad hoc retrieval"
    - "a study of matchpyramid models on ad hoc retrieval"
    - "toward a deep neural approach for knowledge based ir"

Connected through hyperedge HE-2 (induced by source paper "getting started with neural models for semantic matching in web search"):
  with members:
    - "a deep relevance matching model for ad hoc retrieval"
    - "query expansion with locally trained word embeddings"
    - "unsupervised efficient and semantic expertise retrieval"
    - "learning latent vector spaces for product search"
    - "learning distributed representations of sentences from unlabelled data"
    - "learning dynamic classes of events using stacked multilayer perceptron networks"
    - "deep learning relevance creating relevant information as opposed to retrieving it"
    - "deep sentence embedding using long short term memory networks analysis and application to information retrieval"

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.IR(Information Retrieval)