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 "lstm sharp an adaptable energy efficient hardware accelerator for long short term memory"):
  Abstract: The effectiveness of LSTM neural networks for popular tasks such as Automatic Speech Recognition has fostered an increasing interest in LSTM inference acceleration. Due to the recurrent nature and data dependencies of LSTM computations, designing a customized architecture specifically tailored to its computation pattern is crucial for efficiency. Since LSTMs are used for a variety of tasks, generalizing this efficiency to diverse configurations, i.e., adaptiveness, is another key feature of these accelerators. In this work, we first show the problem of low resource-utilization and adaptiveness for the state-of-the-art LSTM implementations on GPU, FPGA and ASIC architectures. To solve these issues, we propose an intelligent tiled-based dispatching mechanism that efficiently handles the data dependencies and increases the adaptiveness of LSTM computation. To do so, we propose LSTM-Sharp as a hardware accelerator, which pipelines LSTM computation using an effective scheduling scheme to hide most of the dependent serialization. Furthermore, LSTM-Sharp employs dynamic reconfigurable architecture to adapt to the model's characteristics. LSTM-Sharp achieves 1.5x, 2.86x, and 82x speedups on average over the state-of-the-art ASIC, FPGA, and GPU implementations respectively, for different LSTM models and resource budgets. Furthermore, we provide significant energy-reduction with respect to the previous solutions, due to the low power dissipation of LSTM-Sharp (383 GFLOPs/Watt).

Includes members:
  Member "learning to ask unanswerable questions for machine reading comprehension":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "undersensitivity in neural reading comprehension")
  Member "towards non saturating recurrent units for modelling long term dependencies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "refined gate a simple and effective gating mechanism for recurrent units")
  Member "the emergence of number and syntax units in lstm language models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linguistic generalization and compositionality in modern artificial neural networks")
  Member "recent advances in recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamentals of recurrent neural network rnn and long short term memory lstm network")
  Member "in datacenter performance analysis of a tensor processing unit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "train large then compress rethinking model size for efficient training and inference of transformers")
  Member "bidirectional attention flow for machine comprehension":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "description based text classification with reinforcement learning")
  Member "optimizing performance of recurrent neural networks on gpus":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "all smiles variational autoencoder")
  Member "eie efficient inference engine on compressed deep neural network":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cluster pruning an efficient filter pruning method for edge ai vision applications")

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)