human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the uplink achievable rate for massive mimo with 1 bit adc and superimposed pilots"
  Abstract: In this paper, a superimposed pilot scheme for massive multiple-input multiple-output uplink transmission with 1-bit analog-to-digital converters (ADCs) at the base station (BS) is considered. Due to the intractable complexity of obtaining true bounds on the data rate, we thus derive an approximate lower bound on the achievable data rate while assuming the BS employs the linear minimum mean square error channel estimator and maximum ratio combining receiver. The derived bound is shown to be nearly tight when the number of users is large or operating in the low signal-to-noise ratio (SNR) regime. We also obtain the closed-form expression of the optimal pilot-data power allocation maximizing the data rate. Although there is a performance gap between the quantized and unquantized (i.e., with infinite-resolution ADCs) systems, it is shown that this gap diminishes when the number of BS antennas is asymptotically large. We show that when the received pilot symbols are removed from the received signal (utilizing the estimated channel) for the data detection process, the increase in data rate is not significant when compared with the no-pilot-removal case, especially in the regimes of low SNR and a large number of users. We present some numerical results to corroborate our theoretical findings, and the insights are provided for further exploration of the quantized systems with superimposed pilots.

Connected through hyperedge HE-1 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping"):
  with members:
    - "robust designs of beamforming and power splitting for distributed antenna systems with wireless energy harvesting"
    - "secure massive mimo communication with low resolution dacs"
    - "data aided secure massive mimo transmission with active eavesdropping"
    - "secure massive mimo systems with limited rf chains"
    - "secure transmission with large numbers of antennas and finite alphabet inputs"
    - "jamming resistant receivers for the massive mimo uplink"
    - "beamforming and power splitting designs for an aided secure multi user mimo swipt systems"
    - "interference alignment and soft space reuse based cooperative transmission for multi cell massive mimo networks"

Connected through hyperedge HE-2 (induced by source paper "learning based rate adaptation for uplink massive mimo networks with cooperative data assisted detection"):
  with members:
    - "superimposed pilots are superior for mitigating pilot contamination in massive mimo"
    - "analyzing uplink sinr and rate in massive mimo systems using stochastic geometry"

Question: Please tell me which class the center node 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)