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 "dice loss for data imbalanced nlp tasks"):
  Abstract: Many NLP tasks such as tagging and machine reading comprehension are faced with the severe data imbalance issue: negative examples significantly outnumber positive examples, and the huge number of background examples (or easy-negative examples) overwhelms the training. The most commonly used cross entropy (CE) criteria is actually an accuracy-oriented objective, and thus creates a discrepancy between training and test: at training time, each training instance contributes equally to the objective function, while at test time F1 score concerns more about positive examples. In this paper, we propose to use dice loss in replacement of the standard cross-entropy objective for data-imbalanced NLP tasks. Dice loss is based on the Sorensen-Dice coefficient or Tversky index, which attaches similar importance to false positives and false negatives, and is more immune to the data-imbalance issue. To further alleviate the dominating influence from easy-negative examples in training, we propose to associate training examples with dynamically adjusted weights to deemphasize easy-negative examples.Theoretical analysis shows that this strategy narrows down the gap between the F1 score in evaluation and the dice loss in training. With the proposed training objective, we observe significant performance boost on a wide range of data imbalanced NLP tasks. Notably, we are able to achieve SOTA results on CTB5, CTB6 and UD1.4 for the part of speech tagging task; SOTA results on CoNLL03, OntoNotes5.0, MSRA and OntoNotes4.0 for the named entity recognition task; along with competitive results on the tasks of machine reading comprehension and paraphrase identification.

Includes members:
  Member "a unified mrc framework for named entity recognition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coreference resolution as query based span prediction")
  Member "quoref a reading comprehension dataset with questions requiring coreferential reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "natural language qa approaches using reasoning with external knowledge")
  Member "libra r cnn towards balanced learning for object detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "forward and backward information retention for accurate binary neural networks")
  Member "glyce glyph vectors for chinese character representations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fgn fusion glyph network for chinese named entity recognition")
  Member "towards accurate one stage object detection with ap loss":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bridging the gap between anchor based and anchor free detection via adaptive training sample selection")
  Member "dsreg using distant supervision as a regularizer":
    also connected through other hyperedges:
      (none)
  Member "xlnet generalized autoregressive pretraining for language understanding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on contextual embeddings")
  Member "chinese ner using lattice lstm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "self attention based bigru and capsule network for named entity recognition")

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)