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 "characterizing and avoiding negative transfer"):
  Abstract: When labeled data is scarce for a specific target task, transfer learning often offers an effective solution by utilizing data from a related source task. However, when transferring knowledge from a less related source, it may inversely hurt the target performance, a phenomenon known as negative transfer. Despite its pervasiveness, negative transfer is usually described in an informal manner, lacking rigorous definition, careful analysis, or systematic treatment. This paper proposes a formal definition of negative transfer and analyzes three important aspects thereof. Stemming from this analysis, a novel technique is proposed to circumvent negative transfer by filtering out unrelated source data. Based on adversarial networks, the technique is highly generic and can be applied to a wide range of transfer learning algorithms. The proposed approach is evaluated on six state-of-the-art deep transfer methods via experiments on four benchmark datasets with varying levels of difficulty. Empirically, the proposed method consistently improves the performance of all baseline methods and largely avoids negative transfer, even when the source data is degenerate.

Includes members:
  Member "taskonomy disentangling task transfer learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "partial adversarial domain adaptation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "unsupervised multi class domain adaptation theory algorithms and practice")
  Member "towards more reliable transfer learning":
    also connected through other hyperedges:
      (none)
  Member "multi adversarial domain adaptation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unsupervised multi class domain adaptation theory algorithms and practice")
  Member "why do deep convolutional networks generalize so poorly to small image transformations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "affinity and diversity quantifying mechanisms of data augmentation")
  Member "deep hashing network for unsupervised domain adaptation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "revisiting meta learning as supervised learning")
  Member "partial transfer learning with selective adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unsupervised multi class domain adaptation theory algorithms and practice")
  Member "youtube boundingboxes a large high precision human annotated data set for object detection in video":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "siamese attentional keypoint network for high performance visual tracking")

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.LG(Machine Learning)