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: "approximate capacity of gaussian relay networks"
  Abstract: We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant depends on the topology of the network, but not the values of the channel gains. Therefore, we uniformly characterize the capacity of Gaussian relay networks within a constant number of bits, for all channel parameters.

Connected through hyperedge HE-1 (induced by source paper "multihop backhaul compression for the uplink of cloud radio access networks"):
  with members:
    - "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks"
    - "millimeter wave beamforming for wireless backhaul and access in small cell networks"
    - "uplink multicell processing with limited backhaul via per base station successive interference cancellation"
    - "reduced dimension linear transform coding of correlated signals in networks"
    - "robust and efficient distributed compression for cloud radio access networks"
    - "cascade multiterminal source coding"
    - "interference mitigation through limited receiver cooperation"
    - "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem"

Connected through hyperedge HE-2 (induced by source paper "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "noisy network coding"
    - "capacity region of the deterministic multi pair bi directional relay network"
    - "approximate capacity of the two way relay channel a deterministic approach"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "transmission techniques for relay interference networks"

Connected through hyperedge HE-3 (induced by source paper "near optimal quantization and linear network coding for relay networks"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "expansion coding achieving the capacity of an aen channel"
    - "multicommodity flows and cuts in polymatroidal networks"
    - "capacity of multiple unicast in wireless networks a polymatroidal approach"
    - "wireless network information flow a deterministic approach"
    - "low complexity near optimal codes for gaussian relay networks"
    - "binary error correcting network codes"
    - "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"

Connected through hyperedge HE-4 (induced by source paper "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "a digital interface for gaussian relay networks lifting codes from the discrete superposition model to gaussian relay networks"
    - "noisy network coding"
    - "fading broadcast channels with state information at the receivers"
    - "on approximating gaussian relay networks by deterministic networks"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "approximate capacity of the two way relay channel a deterministic approach"

Connected through hyperedge HE-5 (induced by source paper "wireless network information flow a deterministic approach"):
  with members:
    - "the approximate capacity of the gaussian n relay diamond network"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "broadcast capacity region of two phase bidirectional relaying"
    - "approximate capacity of the two way relay channel a deterministic approach"
    - "lossy source transmission over the relay channel"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "nested lattice codes for gaussian relay networks with interference"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "lattice strategies for the dirty multiple access channel"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "the case for structured random codes in network capacity theorems"
    - "wireless network information flow"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-7 (induced by source paper "efficient capacity computation and power optimization for relay networks"):
  with members:
    - "near optimal nonmyopic value of information in graphical models"
    - "wireless network information flow a deterministic approach"
    - "improved combinatorial algorithms for wireless information flow"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "combinatiorial algorithms for wireless information flow"
    - "a combinatorial study of linear deterministic relay networks"
    - "a deterministic approach to wireless relay networks"

Connected through hyperedge HE-8 (induced by source paper "slepian wolf coding over cooperative relay networks"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "deterministic relay networks with state information"
    - "wyner ziv coding over broadcast channels digital schemes"
    - "protocols for half duplex multiple relay networks"
    - "analysis of a mixed strategy for multiple relay networks"

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)