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 "widening and squeezing towards accurate and efficient qnns"):
  Abstract: Quantization neural networks (QNNs) are very attractive to the industry because their extremely cheap calculation and storage overhead, but their performance is still worse than that of networks with full-precision parameters. Most of existing methods aim to enhance performance of QNNs especially binary neural networks by exploiting more effective training techniques. However, we find the representation capability of quantization features is far weaker than full-precision features by experiments. We address this problem by projecting features in original full-precision networks to high-dimensional quantization features. Simultaneously, redundant quantization features will be eliminated in order to avoid unrestricted growth of dimensions for some datasets. Then, a compact quantization neural network but with sufficient representation ability will be established. Experimental results on benchmark datasets demonstrate that the proposed method is able to establish QNNs with much less parameters and calculations but almost the same performance as that of full-precision baseline models, e.g. $29.9\%$ top-1 error of binary ResNet-18 on the ImageNet ILSVRC 2012 dataset.

Includes members:
  Member "learning instance wise sparsity for accelerating deep models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ghostnet more features from cheap operations")
  Member "searching for accurate binary neural architectures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning architectures for binary networks")
  Member "binary ensemble neural network more bits per network or more networks per bit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning architectures for binary networks")
  Member "filter pruning via geometric median for deep convolutional neural networks acceleration":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "bi real net enhancing the performance of 1 bit cnns with improved representational capability and advanced training algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning architectures for binary networks")
  Member "lq nets learned quantization for highly accurate and compact deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sparse weight activation training")
  Member "soft filter pruning for accelerating deep convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "bnn improved binary network training":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "forward and backward information retention for accurate binary neural 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)