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 "eyeriss v2 a flexible accelerator for emerging deep neural networks on mobile devices"):
  Abstract: A recent trend in DNN development is to extend the reach of deep learning applications to platforms that are more resource and energy constrained, e.g., mobile devices. These endeavors aim to reduce the DNN model size and improve the hardware processing efficiency, and have resulted in DNNs that are much more compact in their structures and/or have high data sparsity. These compact or sparse models are different from the traditional large ones in that there is much more variation in their layer shapes and sizes, and often require specialized hardware to exploit sparsity for performance improvement. Thus, many DNN accelerators designed for large DNNs do not perform well on these models. In this work, we present Eyeriss v2, a DNN accelerator architecture designed for running compact and sparse DNNs. To deal with the widely varying layer shapes and sizes, it introduces a highly flexible on-chip network, called hierarchical mesh, that can adapt to the different amounts of data reuse and bandwidth requirements of different data types, which improves the utilization of the computation resources. Furthermore, Eyeriss v2 can process sparse data directly in the compressed domain for both weights and activations, and therefore is able to improve both processing speed and energy efficiency with sparse models. Overall, with sparse MobileNet, Eyeriss v2 in a 65nm CMOS process achieves a throughput of 1470.6 inferences/sec and 2560.3 inferences/J at a batch size of 1, which is 12.6x faster and 2.5x more energy efficient than the original Eyeriss running MobileNet. We also present an analysis methodology called Eyexam that provides a systematic way of understanding the performance limits for DNN processors as a function of specific characteristics of the DNN model and accelerator design; it applies these characteristics as sequential steps to increasingly tighten the bound on the performance limits.

Includes members:
  Member "in datacenter performance analysis of a tensor processing unit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "train large then compress rethinking model size for efficient training and inference of transformers")
  Member "efficient processing of deep neural networks a tutorial and survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "searching for winograd aware quantized networks")
  Member "scnn an accelerator for compressed sparse convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sparse weight activation training")
  Member "mobilenets efficient convolutional neural networks for mobile vision applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "squeezenet alexnet level accuracy with 50x fewer parameters and 0 5mb model size":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lossless compression of deep neural networks")
  Member "ternary weight networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sparse weight activation training")
  Member "deeper depth prediction with fully convolutional residual networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "domain decluttering simplifying images to mitigate synthetic real domain shift and improve depth estimation")
  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.DC(Distributed, Parallel, and Cluster Computing)