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 "the capacity achieving distribution for the amplitude constrained additive gaussian channel an upper bound on the number of mass points"):
  Abstract: This paper studies an $n$-dimensional additive Gaussian noise channel with a peak-power-constrained input. #R##N#It is well known that, in this case, the capacity-achieving input distribution is supported on finitely many concentric shells. However, due to the previous proof technique, neither the exact number of shells of the optimal input distribution nor a bound on it was available. #R##N#This paper provides an alternative proof of the finiteness of the number shells of the capacity-achieving input distribution and produces the first firm upper bound on the number of shells, paving an alternative way for approaching many such problems. In particular, for every dimension $n$, it is shown that the number of shells is given by $O(\mathsf{A}^2)$ where $\mathsf{A}$ is the constraint on the input amplitude. Moreover, this paper also provides bounds on the number of points for the case of $n=1$ with an additional power constraint.

Includes members:
  Member "upper and lower bounds on the capacity of amplitude constrained mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of mimo optical wireless channels")
  Member "an upper bound for the capacity of amplitude constrained scalar awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computable upper bounds on the capacity of finite state channels")
  Member "capacity bounds for discrete time amplitude constrained additive white gaussian noise channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computable upper bounds on the capacity of finite state channels")
  Member "on the capacity of vector gaussian channels with bounded inputs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)