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 "cram er rao lower bounds for positioning with large intelligent surfaces"):
  Abstract: We consider the potential for positioning with a system where antenna arrays are deployed as a large intelligent surface (LIS). We derive Fisher-informations and Cramer-Rao lower bounds (CRLB) in closed-form for terminals along the central perpendicular line (CPL) of the LIS for all three Cartesian dimensions. For terminals at positions other than the CPL, closed-form expressions for the Fisher-informations and CRLBs seem out of reach, and we alternatively provide approximations (in closed-form) which are shown to be very accurate. We also show that under mild conditions, the CRLBs in general decrease quadratically in the surface-area for both the $x$ and $y$ dimensions. For the $z$-dimension (distance from the LIS), the CRLB decreases linearly in the surface-area when terminals are along the CPL. However, when terminals move away from the CPL, the CRLB is dramatically increased and then also decreases quadratically in the surface-area. We also extensively discuss the impact of different deployments (centralized and distributed) of the LIS.

Includes members:
  Member "the potential of using large antenna arrays on intelligent surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "large intelligent surface lis based communications new features and system layouts")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")

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)