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: "throughput optimized multi source cooperative networks with compute and forward"
  Abstract: In this work, we investigate a multi-source multi-cast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal common multicast throughput of all source nodes if resource allocations are available. A transmission protocol employing the relaying strategy, namely, compute-and-forward (CPF), is proposed. {We also adjust the methods in the literature to obtain the integer network-constructed coefficient matrix (a naive method, a local optimal method as well as a global optimal method) to fit for the general topology with an arbitrary number of relays. Two transmission scenarios are addressed. The first scenario is delay-stringent transmission where each message must be delivered within one slot. The second scenario is delay-tolerant transmission where no delay constraint is imposed. The associated optimization problems to maximize the short-term and long-term common multicast throughput are formulated and solved, and the optimal allocation of power and time slots are presented. Performance comparisons show that the CPF strategy outperforms conventional decode-and-forward (DF) strategy. It is also shown that with more relays, the CPF strategy performs even better due to the increased diversity. Finally, by simulation, it is observed that for a large network in relatively high SNR regime, CPF with the local optimal method for the network-constructed matrix can perform close to that with the global optimal method.

Connected through hyperedge HE-1 (induced by source paper "compute and forward on a multi user multi relay channel"):
  with members:
    - "compute and forward on a multiaccess relay channel coding and symmetric rate optimization"
    - "compute and forward harnessing interference through structured codes"
    - "performance bounds for bi directional coded cooperation protocols"

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)