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 "eliminet a model for eliminating options for reading comprehension with multiple choice questions"):
  Abstract: The task of Reading Comprehension with Multiple Choice Questions, requires a human (or machine) to read a given passage, question pair and select one of the n given options. The current state of the art model for this task first computes a question-aware representation for the passage and then selects the option which has the maximum similarity with this representation. However, when humans perform this task they do not just focus on option selection but use a combination of elimination and selection. Specifically, a human would first try to eliminate the most irrelevant option and then read the passage again in the light of this new information (and perhaps ignore portions corresponding to the eliminated option). This process could be repeated multiple times till the reader is finally ready to select the correct option. We propose ElimiNet, a neural network-based model which tries to mimic this process. Specifically, it has gates which decide whether an option can be eliminated given the passage, question pair and if so it tries to make the passage representation orthogonal to this eliminated option (akin to ignoring portions of the passage corresponding to the eliminated option). The model makes multiple rounds of partial elimination to refine the passage representation and finally uses a selection module to pick the best option. We evaluate our model on the recently released large scale RACE dataset and show that it outperforms the current state of the art model on 7 out of the $13$ question types in this dataset. Further, we show that taking an ensemble of our elimination-selection based method with a selection based method gives us an improvement of 3.1% over the best-reported performance on this dataset.

Includes members:
  Member "race large scale reading comprehension dataset from examinations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reclor a reading comprehension dataset requiring logical reasoning")
  Member "triviaqa a large scale distantly supervised challenge dataset for reading comprehension":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "the narrativeqa reading comprehension challenge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "newsqa a machine comprehension dataset":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "question answering via integer programming over semi structured knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reasoning driven question answering for natural language understanding")
  Member "a thorough examination of the cnn daily mail reading comprehension task":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "text understanding with the attention sum reader network":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "retrospective reader for machine reading comprehension")
  Member "squad 100 000 questions for machine comprehension of text":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bert can see out of the box on the cross modal transferability of text representations")

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)