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 recursive approach toward code domain noma for massive communications"
  Abstract: Nonorthogonal multiple access (NOMA) is a promising technology to meet the demands of the next generation wireless networks on massive connectivity, high throughput and reliability, improved fairness, and low latency. In this context, code-domain NOMA which attempts to serve $K$ users in $M\leq K$ orthogonal resource blocks, using a pattern matrix, is of utmost interest. However, extending the pattern matrix dimensions severely increases the detection complexity and hampers on the significant advantages that can be achieved using large pattern matrices. In this paper, we propose a novel approach toward code-domain NOMA which factorizes the pattern matrix as the Kronecker product of some other factor matrices each with a smaller dimension. Therefore, both the pattern matrix design at the transmitter side and the mixed symbols' detection at the receiver side can be performed over much smaller dimensions and with a remarkably reduced complexity and latency. As a consequence, the system can significantly be overloaded to effectively support the requirements of the next generation wireless networks without any considerable increase on the system complexity.

Connected through hyperedge HE-1 (induced by source paper "coded distributed computing performance limits and code designs"):
  with members:
    - "polar coded distributed matrix multiplication"
    - "speeding up distributed machine learning using codes"
    - "rateless codes for near perfect load balancing in distributed matrix vector multiplication"
    - "almost optimal scaling of reed muller codes on bec and bsc channels"
    - "coded sparse matrix multiplication"
    - "coded computation over heterogeneous clusters"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "coding for distributed fog computing"

Connected through hyperedge HE-2 (induced by source paper "uplink non orthogonal multiple access over mixed rf fso systems"):
  with members:
    - "multi beam noma for hybrid mmwave systems"
    - "exploiting full half duplex user relaying in noma systems"
    - "performance analysis of noma for ultra reliable and low latency communications"
    - "optimal user scheduling and power allocation for millimeter wave noma systems"
    - "modeling and analyzing millimeter wave cellular systems"
    - "power domain non orthogonal multiple access noma in 5g systems potentials and challenges"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "5g wireless backhaul networks challenges and research advances"

Connected through hyperedge HE-3 (induced by source paper "outage probability analysis of uplink noma over ultra high speed fso backhauled systems"):
  with members:
    - "modeling and analyzing millimeter wave cellular systems"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "5g wireless backhaul networks challenges and research advances"

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)