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 "nero a neural rule grounding framework for label efficient relation extraction"):
  Abstract: Deep neural models for relation extraction tend to be less reliable when perfectly labeled data is limited, despite their success in label-sufficient scenarios. Instead of seeking more instance-level labels from human annotators, here we propose to annotate frequent surface patterns to form labeling rules. These rules can be automatically mined from large text corpora and generalized via a soft rule matching mechanism. Prior works use labeling rules in an exact matching fashion, which inherently limits the coverage of sentence matching and results in the low-recall issue. In this paper, we present a neural approach to ground rules for RE, named NERO, which jointly learns a relation extraction module and a soft matching module. One can employ any neural relation extraction models as the instantiation for the RE module. The soft matching module learns to match rules with semantically similar sentences such that raw corpora can be automatically labeled and leveraged by the RE module (in a much better coverage) as augmented supervision, in addition to the exactly matched sentences. Extensive experiments and analysis on two public and widely-used datasets demonstrate the effectiveness of the proposed NERO framework, comparing with both rule-based and semi-supervised methods. Through user studies, we find that the time efficiency for a human to annotate rules and sentences are similar (0.30 vs. 0.35 min per label). In particular, NERO's performance using 270 rules is comparable to the models trained using 3,000 labeled sentences, yielding a 9.5x speedup. Moreover, NERO can predict for unseen relations at test time and provide interpretable predictions. We release our code to the community for future research.

Includes members:
  Member "learning dual retrieval module for semi supervised relation extraction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "neural snowball for few shot relation learning")
  Member "semeval 2010 task 8 multi way classification of semantic relations between pairs of nominals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning from explanations with neural execution tree")
  Member "attention guided graph convolutional networks for relation extraction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "event detection with relation aware graph convolutional neural networks")
  Member "graph convolution over pruned dependency trees improves relation extraction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "k adapter infusing knowledge into pre trained models with adapters")
  Member "joint bootstrapping machines for high confidence relation extraction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "neural rule grounding for low resource relation extraction")
  Member "bert pre training of deep bidirectional transformers for language understanding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "metapad meta pattern discovery from massive text corpora":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "taxoexpan self supervised taxonomy expansion with position enhanced graph neural network")
  Member "mean teachers are better role models weight averaged consistency targets improve semi supervised deep learning results":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mutual mean teaching pseudo label refinery for unsupervised domain adaptation on person re identification")

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)