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: "rate maximization for half duplex multiple access with cooperating transmitters"
  Abstract: We derive the optimal resource allocation of a practical half-duplex scheme for the Gaussian multiple access channel with transmitter cooperation (MAC-TC). Based on rate splitting and superposition coding, two users transmit information to a destination over 3 phases, such that the users partially exchange their information during the first 2 phases and cooperatively transmit to the destination during the last one. This scheme is near capacity-achieving when the inter-user links are stronger than each user-destination link; it also includes partial decode-forward relaying as a special case. We propose efficient algorithms to find the optimal resource allocation for maximizing either the individual or the sum rate and identify the corresponding optimal scheme for each channel configuration. For fixed phase durations, the power allocation problem is convex and can be solved analytically based on the KKT conditions. The optimal phase durations can then be obtained numerically using simple search methods. Results show that as the interuser link qualities increase, the optimal scheme moves from no cooperation to partial then to full cooperation, in which the users fully exchange their information and cooperatively send it to the destination. Therefore, in practical systems with strong inter-user links, simple decode-forward relaying at both users is rate-optimal.

Connected through hyperedge HE-1 (induced by source paper "the capacity of the gaussian cooperative two user multiple access channel to within a constant gap"):
  with members:
    - "achievable rates and outer bound for the half duplex mac with generalized feedback"
    - "a half duplex cooperative scheme with partial decode forward relaying"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-2 (induced by source paper "spectral efficiency and outage performance for hybrid d2d infrastructure uplink cooperation"):
  with members:
    - "femtocaching and device to device collaboration a new architecture for wireless video distribution"
    - "a half duplex cooperative scheme with partial decode forward relaying"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"

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)