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: "a low complexity channel shortening receiver with diversity support for evolved 2g device"
  Abstract: The second generation (2G) cellular networks are the current workhorse for machine-to-machine (M2M) communications. Diversity in 2G devices can be present both in form of multiple receive branches and blind repetitions. In presence of diversity, intersymbol interference (ISI) equalization and co-channel interference (CCI) suppression are usually very complex. In this paper, we consider the improvements for 2G devices with receive diversity. We derive a low-complexity receiver based on a channel shortening filter, which allows to sum up all diversity branches to a single stream after filtering while keeping the full diversity gain. The summed up stream is subsequently processed by a single stream Max-log-MAP (MLM) equalizer. The channel shortening filter is designed to maximize the mutual information lower bound (MILB) with the Ungerboeck detection model. Its filter coefficients can be obtained mainly by means of discrete-Fourier transforms (DFTs). Compared with the state-of-art homomorphic (HOM) filtering based channel shortener which cooperates with a delayed-decision feedback MLM (DDF-MLM) equalizer, the proposed MILB channel shortener has superior performance. Moreover, the equalization complexity, in terms of real-valued multiplications, is decreased by a factor that equals the number of diversity branches.

Connected through hyperedge HE-1 (induced by source paper "achieving large sum rate and good fairness in miso broadcast communication"):
  with members:
    - "a generalized zero forcing precoder with successive dirty paper coding in miso broadcast channels"
    - "improving the performance of the zero forcing multiuser miso downlink precoder through user grouping"
    - "an alternative proof for the capacity region of the degraded gaussian mimo broadcast channel"
    - "an axiomatic theory of fairness in network resource allocation"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-2 (induced by source paper "beyond massive mimo the potential of data transmission with large intelligent surfaces"):
  with members:
    - "the potential of using large antenna arrays on intelligent surfaces"
    - "a generalized zero forcing precoder with successive dirty paper coding in miso broadcast channels"
    - "limited feedback hybrid precoding for multi user millimeter wave systems"
    - "massive mimo performance evaluation based on measured propagation data"
    - "massive mimo for next generation wireless systems"
    - "what will 5g be"
    - "millimeter wave cellular wireless networks potentials and challenges"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-3 (induced by source paper "a generalized zero forcing precoder with successive dirty paper coding in miso broadcast channels"):
  with members:
    - "improving the performance of the zero forcing multiuser miso downlink precoder through user grouping"
    - "bounds on eigenvalues of a spatial correlation matrix"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-4 (induced by source paper "optimal channel shortener design for reduced state soft output viterbi equalizer in single carrier systems"):
  with members:
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

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)