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: "achievable rates for k user gaussian interference channels"
  Abstract: The aim of this paper is to study the achievable rates for a $K$ user Gaussian interference channels for any SNR using a combination of lattice and algebraic codes. Lattice codes are first used to transform the Gaussian interference channel (G-IFC) into a discrete input-output noiseless channel, and subsequently algebraic codes are developed to achieve good rates over this new alphabet. In this context, a quantity called efficiency is introduced which reflects the effectiveness of the algebraic coding strategy. The paper first addresses the problem of finding high efficiency algebraic codes. A combination of these codes with Construction-A lattices is then used to achieve non trivial rates for the original Gaussian interference channel.

Connected through hyperedge HE-1 (induced by source paper "structured mappings and conferencing common information for multiple access channels"):
  with members:
    - "a new achievable rate region for multiple access channel with states"
    - "quasi linear codes application to point to point and multi terminal source coding"
    - "distributed simulation of continuous random variables"
    - "exact common information"
    - "on interference networks over finite fields"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-2 (induced by source paper "how to compute modulo prime power sums"):
  with members:
    - "on the necessity of structured codes for communications over mac with feedback"
    - "a new achievable rate region for multiple access channel with states"
    - "trade off between communication and cooperation in the interference channel"
    - "a joint typicality approach to algebraic network information theory"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-3 (induced by source paper "an achievable rate region for the three user interference channel based on coset codes"):
  with members:
    - "on interference networks over finite fields"
    - "on the capacity of the finite field counterparts of wireless interference networks"
    - "is non unique decoding necessary"
    - "abelian group codes for source coding and channel coding"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "interference decoding for deterministic channels"

Connected through hyperedge HE-4 (induced by source paper "itlinq a new approach for spectrum sharing in device to device communication systems"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "spectrum sharing for device to device communication in cellular networks"
    - "topological interference management through index coding"
    - "on the optimality of treating interference as noise"
    - "interference networks with no csit impact of topology"
    - "power control for d2d underlaid cellular networks modeling algorithms and analysis"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-5 (induced by source paper "the approximate sum capacity of the symmetric gaussian k user interference channel"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "successive integer forcing and its sum rate optimality"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "wireless network information flow a deterministic approach"

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)