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 "rotate your networks better weight consolidation and less catastrophic forgetting"):
  Abstract: In this paper we propose an approach to avoiding catastrophic forgetting in sequential task learning scenarios. Our technique is based on a network reparameterization that approximately diagonalizes the Fisher Information Matrix of the network parameters. This reparameterization takes the form of a factorized rotation of parameter space which, when used in conjunction with Elastic Weight Consolidation (which assumes a diagonal Fisher Information Matrix), leads to significantly better performance on lifelong learning of sequential tasks. Experimental results on the MNIST, CIFAR-100, CUB-200 and Stanford-40 datasets demonstrate that we significantly improve the results of standard elastic weight consolidation, and that we obtain competitive results when compared to other state-of-the-art in lifelong learning without forgetting.

Includes members:
  Member "riemannian walk for incremental learning understanding forgetting and intransigence":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "overcoming catastrophic forgetting with hard attention to the task":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "domain adaptive deep network compression":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptative inference cost with convolutional neural mixture models")
  Member "continual learning with deep generative replay":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "encoder based lifelong learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "disassembling the dataset a camera alignment mechanism for multiple tasks in person re identification")
  Member "continual learning through synaptic intelligence":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "incremental object detection via meta learning")
  Member "overcoming catastrophic forgetting by incremental moment matching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ternary feature masks continual learning without any forgetting")
  Member "diagonal rescaling for neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scaling laws for the principled design initialization and preconditioning of relu networks")

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)