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 "volume of metric balls in high dimensional complex grassmann manifolds"):
  Abstract: Volume of metric balls relates to rate-distortion theory and packing bounds on codes. In this paper, the volume of balls in complex Grassmann manifolds is evaluated for an arbitrary radius. The ball is defined as a set of hyperplanes of a fixed dimension with reference to a center of possibly different dimension, and a generalized chordal distance for unequal dimensional subspaces is used. First, the volume is reduced to one-dimensional integral representation. The overall problem boils down to evaluating a determinant of a matrix of the same size as the subspace dimensionality. Interpreting this determinant as a characteristic function of the Jacobi ensemble, an asymptotic analysis is carried out. The obtained asymptotic volume is moreover refined using moment-matching techniques to provide a tighter approximation in finite-size regimes. Lastly, the pertinence of the derived results is shown by rate-distortion analysis of source coding on Grassmann manifolds.

Includes members:
  Member "from random matrix theory to coding theory volume of a metric ball in unitary group":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "matrix infinitely divisible series tail inequalities and applications in optimization")
  Member "normalized volume of hyperball in complex grassmann manifold and its application in large scale mu mimo communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the matrix inversion approximation based on neumann series in massive mimo systems")
  Member "multiuser diversity for secrecy communications using opportunistic jammer selection secure dof and jammer scaling law":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective optimization criteria and relay selection algorithms for physical layer security in multiple antenna relay networks")
  Member "quantization bounds on grassmann manifolds and applications to mimo communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "high dimensional stochastic gradient quantization for communication efficient edge learning")
  Member "a feedback reduction technique for mimo broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tranceiver design using linear precoding in a multiuser mimo system with limited feedback")

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.IT(Information Theory)