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 "graph adaptive pruning for efficient inference of convolutional neural networks"):
  Abstract: In this work, we propose a graph-adaptive pruning (GAP) method for efficient inference of convolutional neural networks (CNNs). In this method, the network is viewed as a computational graph, in which the vertices denote the computation nodes and edges represent the information flow. Through topology analysis, GAP is capable of adapting to different network structures, especially the widely used cross connections and multi-path data flow in recent novel convolutional models. The models can be adaptively pruned at vertex-level as well as edge-level without any post-processing, thus GAP can directly get practical model compression and inference speed-up. Moreover, it does not need any customized computation library or hardware support. Finetuning is conducted after pruning to restore the model performance. In the finetuning step, we adopt a self-taught knowledge distillation (KD) strategy by utilizing information from the original model, through which, the performance of the optimized model can be sufficiently improved, without introduction of any other teacher model. Experimental results show the proposed GAP can achieve promising result to make inference more efficient, e.g., for ResNeXt-29 on CIFAR10, it can get 13X model compression and 4.3X practical speed-up with marginal loss of accuracy.

Includes members:
  Member "mobilenets efficient convolutional neural networks for mobile vision applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "thinet a filter level pruning method for deep neural network compression":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "exploring the regularity of sparse structure in convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "patdnn achieving real time dnn execution on mobile devices with pattern based weight pruning")
  Member "squeezenet alexnet level accuracy with 50x fewer parameters and 0 5mb model size":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lossless compression of deep neural networks")
  Member "channel pruning for accelerating very deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "learning structured sparsity in deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "densely connected convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lossless compression of deep neural networks")
  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.CV(Computer Vision and Pattern Recognition)