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 "mapping to declarative knowledge for word problem solving"):
  Abstract: Math word problems form a natural abstraction to a range of quantitative reasoning problems, such as understanding financial news, sports results, and casualties of war. Solving such problems requires the understanding of several mathematical concepts such as dimensional analysis, subset relationships, etc. In this paper, we develop declarative rules which govern the translation of natural language description of these concepts to math expressions. We then present a framework for incorporating such declarative knowledge into word problem solving. Our method learns to map arithmetic word problem text to math expressions, by learning to select the relevant declarative knowledge for each operation of the solution expression. This provides a way to handle multiple concepts in the same problem while, at the same time, support interpretability of the answer expression. Our method models the mapping to declarative knowledge as a latent variable, thus removing the need for expensive annotations. Experimental evaluation suggests that our domain knowledge based solver outperforms all other systems, and that it generalizes better in the realistic case where the training data it is exposed to is biased in a different way than the test data.

Includes members:
  Member "adversarial examples for evaluating reading comprehension systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "program induction by rationale generation learning to solve and explain algebraic word problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "drop a reading comprehension benchmark requiring discrete reasoning over paragraphs")
  Member "question answering via integer programming over semi structured knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reasoning driven question answering for natural language understanding")
  Member "unit dependency graph and its application to arithmetic word problem solving":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "text2math end to end parsing text into math expressions")
  Member "equation parsing mapping sentences to grounded equations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "text2math end to end parsing text into math expressions")
  Member "solving general arithmetic word problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equate a benchmark evaluation framework for quantitative reasoning in natural language inference")
  Member "learning dependency based compositional semantics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "break it down a question understanding benchmark")

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)