human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "relation mention extraction from noisy data with hierarchical reinforcement learning"):
  Abstract: In this paper we address a task of relation mention extraction from noisy data: extracting representative phrases for a particular relation from noisy sentences that are collected via distant supervision. Despite its significance and value in many downstream applications, this task is less studied on noisy data. The major challenges exists in 1) the lack of annotation on mention phrases, and more severely, 2) handling noisy sentences which do not express a relation at all. To address the two challenges, we formulate the task as a semi-Markov decision process and propose a novel hierarchical reinforcement learning model. Our model consists of a top-level sentence selector to remove noisy sentences, a low-level mention extractor to extract relation mentions, and a reward estimator to provide signals to guide data denoising and mention extraction without explicit annotations. Experimental results show that our model is effective to extract relation mentions from noisy data.

Includes members:
  Member "semeval 2010 task 8 multi way classification of semantic relations between pairs of nominals":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning from explanations with neural execution tree")
  Member "joint extraction of entities and relations based on a novel tagging scheme":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hybrid neural tagging model for open relation extraction")
  Member "cotype joint extraction of typed entities and relations with knowledge bases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "knowledge graphs")
  Member "end to end relation extraction using lstms on sequences and tree structures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deeper task specificity improves joint entity and relation extraction")
  Member "classifying relations by ranking with convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "named entity recognition with bidirectional lstm cnns":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "monotonic cardinality estimation of similarity selection a deep learning approach")
  Member "hierarchical reinforcement learning with the maxq value function decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning functionally decomposed hierarchies for continuous control tasks")

Question: Please tell me which class the source paper 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)