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 "one sided unsupervised domain mapping"):
  Abstract: In unsupervised domain mapping, the learner is given two unmatched datasets $A$ and $B$. The goal is to learn a mapping $G_{AB}$ that translates a sample in $A$ to the analog sample in $B$. Recent approaches have shown that when learning simultaneously both $G_{AB}$ and the inverse mapping $G_{BA}$, convincing mappings are obtained. In this work, we present a method of learning $G_{AB}$ without learning $G_{BA}$. This is done by learning a mapping that maintains the distance between a pair of samples. Moreover, good mappings are obtained, even by maintaining the distance between different parts of the same sample before and after mapping. We present experimental results that the new method not only allows for one sided mapping learning, but also leads to preferable numerical results over the existing circularity-based constraint. Our entire code is made publicly available at this https URL .

Includes members:
  Member "learning to discover cross domain relations with generative adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "unpaired image to image translation using cycle consistent adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generative adversarial networks in computer vision a survey and taxonomy")
  Member "dualgan unsupervised dual learning for image to image translation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "perceptual losses for real time style transfer and super resolution":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "unsupervised cross domain image generation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "texture networks feed forward synthesis of textures and stylized images":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to adapt class specific features across domains for semantic segmentation")
  Member "unsupervised pixel level domain adaptation with generative adversarial networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "learning from simulated and unsupervised images through adversarial training":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gan compression efficient architectures for interactive conditional gans")

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.CV(Computer Vision and Pattern Recognition)