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 "deep independently recurrent neural network indrnn"):
  Abstract: Recurrent neural networks (RNNs) are known to be difficult to train due to the gradient vanishing and exploding problems and thus difficult to learn long-term patterns. Long short-term memory (LSTM) was developed to address these problems, but the use of hyperbolic tangent and the sigmoid activation functions results in gradient decay over layers. Consequently, construction of an efficiently trainable deep RNN is challenging. Moreover, training of LSTM is very compute-intensive as the recurrent connection using matrix product is conducted at every time step. To address these problems, this paper proposes a new type of RNNs with the recurrent connection formulated as Hadamard product, referred to as independently recurrent neural network (IndRNN), where neurons in the same layer are independent of each other and connected across layers. The gradient vanishing and exploding problems are solved in IndRNN by simply regulating the recurrent weights, and thus long-term dependencies can be learned. Moreover, an IndRNN can work with non-saturated activation functions such as ReLU and be still trained robustly. Different deeper IndRNN architectures, including the basic stacked IndRNN, residual IndRNN and densely connected IndRNN, have been investigated, all of which can be much deeper than the existing RNNs. Furthermore, IndRNN reduces the computation at each time step and can be over 10 times faster than the LSTM. The code is made publicly available at this https URL. Experimental results have shown that the proposed IndRNN is able to process very long sequences (over 5000 time steps), can be used to construct very deep networks (the 21 layers residual IndRNN and deep densely connected IndRNN used in the experiment for example). Better performances have been achieved on various tasks with IndRNNs compared with the traditional RNN and LSTM.

Includes members:
  Member "temporal transformer networks joint learning of invariant and discriminative time warping":
    also connected through other hyperedges:
      (none)
  Member "independently recurrent neural network indrnn building a longer and deeper rnn":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on 3d skeleton based action recognition using learning method")
  Member "part based graph convolutional network for action recognition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "predictively encoded graph convolutional network for noise robust skeleton based action recognition")
  Member "learning long term dependencies via fourier recurrent units":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multiresolution transformer networks recurrence is not essential for modeling hierarchical structure")
  Member "co occurrence feature learning from skeleton data for action recognition and detection with hierarchical aggregation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on 3d skeleton based action recognition using learning method")
  Member "view adaptive neural networks for high performance skeleton based human action recognition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on 3d skeleton based action recognition using learning method")
  Member "simple recurrent units for highly parallelizable recurrence":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "refined gate a simple and effective gating mechanism for recurrent units")
  Member "lstm a search space odyssey":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "refined gate a simple and effective gating mechanism for recurrent units")

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)