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 detection algorithm for the primary synchronization signal in lte"
  Abstract: One of the challenging tasks in Long-Term Evolution (LTE) baseband receiver design is synchronization, which determines the symbol boundary and transmitted frame start time and performs cell identification. Conventional algorithms are based on correlation methods that involve a large number of multiplications and, thus, lead to high receiver hardware complexity and power consumption. In this paper, a hardware-efficient synchronization algorithm for frame timing based on    $K$  - means clustering schemes is proposed. The algorithm reduces the complexity of the primary synchronization signal for LTE from 24 complex multiplications, which are currently best known in the literature, to just eight. Simulation results demonstrate that the proposed algorithm has negligible performance degradation with reduced complexity relative to conventional techniques.

Connected through hyperedge HE-1 (induced by source paper "directional frame timing synchronization in wideband millimeter wave systems with low resolution adcs"):
  with members:
    - "a tutorial on beam management for 3gpp nr at mmwave frequencies"
    - "mimo beampattern and waveform design with low resolution dacs"
    - "fast and reliable initial access with random beamforming for mmwave networks"
    - "how much spectrum is too much in millimeter wave wireless access"
    - "two dimensional aod and aoa acquisition for wideband millimeter wave systems with dual polarized mimo"
    - "uplink performance of wideband massive mimo with one bit adcs"
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "hybrid architectures with few bit adc receivers achievable rates and energy rate tradeoffs"

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)