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: "spectral efficient communications employing 1 bit quantization and oversampling at the receiver"
  Abstract: To relax power consumption requirements in multigigabit/s communications systems low resolution quantization can be used. Information-theoretic results have shown that systems employing 1-bit quantization and oversampling are a viable option for this. This work investigates such a structure under the influence of additive Gaussian noise and two matched pulse shaping filters. It is described how a BCJR algorithm, based on a finite-state channel assumption, can be used to reconstruct symbols of higher order modulation schemes that allow the transmission of more than one bit per symbol. Furthermore, it is shown how symbol sources that are fitted to the 1-bit constraint can significantly improve the error rate performance of the system.

Connected through hyperedge HE-1 (induced by source paper "bandlimited communication with one bit quantization and oversampling transceiver design and performance evaluation"):
  with members:
    - "spatio temporal waveform design for multiuser massive mimo downlink with 1 bit receivers"
    - "near maximum likelihood detector and channel estimator for uplink multiuser massive mimo systems with one bit adcs"
    - "a general framework for transmission with transceiver distortion and some applications"
    - "at low snr asymmetric quantizers are better"
    - "increased capacity per unit cost by oversampling"

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)