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: "enabling sphere decoding for scma"
  Abstract: In this letter, we propose a reduced-complexity optimal modified sphere decoding (MSD) detection scheme for sparse code multiple access (SCMA). As SCMA systems are characterized by a number of resource elements that are less than the number of the supported users, the channel matrix is rank-deficient, and SD cannot be directly applied. Inspired by the Tikhonov regularization, we formulate a new full-rank detection problem that it is equivalent to the original rank-deficient detection problem for constellation points with constant modulus and an important subset of non-constant modulus constellations. By exploiting the SCMA structure, the computational complexity of MSD is reduced compared with the conventional SD. We also employ list MSD to facilitate channel coding. Simulation results demonstrate that in uncoded SCMA systems, the proposed MSD achieves the performance of the optimal maximum likelihood detection. Additionally, the proposed MSD benefits from a lower average complexity compared with message passing algorithm.

Connected through hyperedge HE-1 (induced by source paper "multidimensional constellations for uplink scma systems a comparative study"):
  with members:
    - "survey on multi access edge computing for internet of things realization"
    - "low complexity receiver for uplink scma system via expectation propagation"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "modulation and multiple access for 5g networks"
    - "an optimization perspective of the superiority of noma compared to conventional oma"
    - "polar codes for scma systems"
    - "a survey on low latency towards 5g ran core network and caching solutions"
    - "design of non orthogonal multiple access enhanced backscatter communication"

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)