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: "joint detection and location of english puns"
  Abstract: A pun is a form of wordplay for an intended humorous or rhetorical effect, where a word suggests two or more meanings by exploiting polysemy (homographic pun) or phonological similarity to another word (heterographic pun). This paper presents an approach that addresses pun detection and pun location jointly from a sequence labeling perspective. We employ a new tagging scheme such that the model is capable of performing such a joint task, where useful structural information can be properly captured. We show that our proposed model is effective in handling both homographic and heterographic puns. Empirical results on the benchmark datasets demonstrate that our approach can achieve new state-of-the-art results.

Connected through hyperedge HE-1 (induced by source paper "mining commonsense facts from the physical world"):
  with members:
    - "leveraging knowledge bases in lstms for improving machine reading"
    - "aligning cross lingual entities with multi aspect information"
    - "graph convolution over pruned dependency trees improves relation extraction"
    - "n ary relation extraction using graph state lstm"
    - "learning cross lingual distributed logical representations for semantic parsing"
    - "swag a large scale adversarial dataset for grounded commonsense inference"
    - "automatic extraction of commonsense locatednear knowledge"
    - "fast and accurate entity recognition with iterated dilated convolutions"

Connected through hyperedge HE-2 (induced by source paper "text2math end to end parsing text into math expressions"):
  with members:
    - "translating a math word problem to an expression tree"
    - "semantic parsing with syntax and table aware sql generation"
    - "learning cross lingual distributed logical representations for semantic parsing"
    - "coarse to fine decoding for neural semantic parsing"
    - "a meaning based statistical english math word problem solver"
    - "mapping to declarative knowledge for word problem solving"
    - "program induction by rationale generation learning to solve and explain algebraic word problems"
    - "language to logical form with neural attention"

Connected through hyperedge HE-3 (induced by source paper "quantity tagger a latent variable sequence labeling approach to solving addition subtraction word problems"):
  with members:
    - "translating a math word problem to an expression tree"
    - "learning cross lingual distributed logical representations for semantic parsing"
    - "unit dependency graph and its application to arithmetic word problem solving"
    - "neural architectures for named entity recognition"
    - "solving general arithmetic word problems"

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)