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: "opportunistic communications in an orthogonal multiaccess relay channel"
  Abstract: The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the presence of a relay. A half-duplex relay is considered that transmits on a channel orthogonal to that used by the sources. The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at both the transmitter and receiver. Under an average power constraint at each source and the relay, the sum-rate for the achievable strategy of decode-and-forward (DF) is maximized over all power allocations (policies) at the sources and relay. It is shown that the sum-rate maximizing policy exploits the multiuser fading diversity to reveal the optimality of opportunistic channel use by each user. A geometric interpretation of the optimal power policy is also presented.

Connected through hyperedge HE-1 (induced by source paper "on the design of a novel joint network channel coding scheme for the multiple access relay channel"):
  with members:
    - "network coding over a noisy relay a belief propagation approach"

Connected through hyperedge HE-2 (induced by source paper "compute and forward on a multiaccess relay channel coding and symmetric rate optimization"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "wireless network information flow a deterministic approach"
    - "lattice codes for the gaussian relay channel decode and forward and compress and forward"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"
    - "performance bounds for bi directional coded cooperation protocols"

Connected through hyperedge HE-3 (induced by source paper "ergodic fading interference channels sum capacity and separability"):
  with members:
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "noisy interference sum rate capacity of parallel gaussian interference channels"
    - "ergodic interference alignment"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "on the separability of parallel gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "multiple access outerbounds and the inseparability of parallel interference channels"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-4 (induced by source paper "sum capacity of ergodic fading interference and compound multiaccess channels"):
  with members:
    - "capacity bounds for the gaussian interference channel"

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)