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 "taskonomy disentangling task transfer learning"):
  Abstract: Do visual tasks have a relationship, or are they unrelated? For instance, could having surface normals simplify estimating the depth of an image? Intuition answers these questions positively, implying existence of a structure among visual tasks. Knowing this structure has notable values; it is the concept underlying transfer learning and provides a principled way for identifying redundancies across tasks, e.g., to seamlessly reuse supervision among related tasks or solve many tasks in one system without piling up the complexity. #R##N#We proposes a fully computational approach for modeling the structure of space of visual tasks. This is done via finding (first and higher-order) transfer learning dependencies across a dictionary of twenty six 2D, 2.5D, 3D, and semantic tasks in a latent space. The product is a computational taxonomic map for task transfer learning. We study the consequences of this structure, e.g. nontrivial emerged relationships, and exploit them to reduce the demand for labeled data. For example, we show that the total number of labeled datapoints needed for solving a set of 10 tasks can be reduced by roughly 2/3 (compared to training independently) while keeping the performance nearly the same. We provide a set of tools for computing and probing this taxonomical structure including a solver that users can employ to devise efficient supervision policies for their use cases.

Includes members:
  Member "gibson env real world perception for embodied agents":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an exploration of embodied visual exploration")
  Member "transitive invariance for self supervised visual representation learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning video object segmentation from unlabeled videos")
  Member "identifying beneficial task relations for multi task learning in deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bam born again multi task networks for natural language understanding")
  Member "rl 2 fast reinforcement learning via slow reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "multi task self supervised visual learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a large scale study of representation learning with the visual task adaptation benchmark")
  Member "matterport3d learning from rgb d data in indoor environments":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an exploration of embodied visual exploration")
  Member "representation learning by learning to count":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning spatiotemporal features via video and text pair discrimination")
  Member "playing for benchmarks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "virtual kitti 2")

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)