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: "approximately achieving gaussian relay network capacity with lattice codes"
  Abstract: Recently, it has been shown that a quantize-map-and-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary topologies. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we show that the same approximation result can be established by using lattices for transmission and quantization along with structured mappings at the relays.

Connected through hyperedge HE-1 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks"):
  with members:
    - "generalized degrees freedom of noncoherent mimo with asymmetric links"
    - "capacity approximations for gaussian relay networks"
    - "cooperative relaying at finite snr role of quantize map and forward"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "on noncoherent fading relay channels at high signal to noise ratio"
    - "wireless network simplification the gaussian n relay diamond network"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-2 (induced by source paper "on the generalized degrees of freedom of noncoherent interference channel"):
  with members:
    - "approximate capacity of fast fading interference channels with no instantaneous csit"
    - "on noncoherent fading relay channels at high signal to noise ratio"
    - "interference channels with rate limited feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "gaussian interference channel with intermittent feedback"):
  with members:
    - "achievable regions for interference channels with generalized and intermittent feedback"
    - "interference channel with intermittent feedback"
    - "two way interference channels"
    - "wireless network information flow a deterministic approach"
    - "interference channels with rate limited feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "on channel output feedback in deterministic interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "cooperative relaying at finite snr role of quantize map and forward"):
  with members:
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "experiment driven characterization of full duplex wireless systems"
    - "wireless network information flow a deterministic approach"
    - "compute and forward harnessing interference through structured codes"
    - "diversity multiplexing tradeoff of the half duplex relay channel"

Connected through hyperedge HE-5 (induced by source paper "compress and forward scheme for relay networks backword decoding and connection to bisubmodular flows"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"
    - "on the optimal compressions in the compress and forward relay schemes"
    - "combinatiorial algorithms for wireless information flow"

Connected through hyperedge HE-6 (induced by source paper "an algebraic approach to physical layer network coding"):
  with members:
    - "lattices over eisenstein integers for compute and forward"
    - "communication over finite chain ring matrix channels"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "wireless network information flow a deterministic approach"
    - "reliable physical layer network coding"
    - "the degrees of freedom of compute and forward"
    - "integer forcing linear receivers"

Connected through hyperedge HE-7 (induced by source paper "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"):
  with members:
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "on capacity and optimal scheduling for the half duplex multiple relay channel"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "study of gaussian relay channels with correlated noises"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"

Connected through hyperedge HE-8 (induced by source paper "multilevel coding schemes for compute and forward with flexible decoding"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "wireless network information flow a deterministic approach"
    - "reliable physical layer network coding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "universality for the noisy slepian wolf problem via spatial coupling"
    - "universal codes for the gaussian mac via spatial coupling"

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)