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: "optimal achievable rates for interference networks with random codes"
  Abstract: The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple  simultaneous nonunique decoding  rule, under which each receiver decodes for the intended message as well as the interfering messages, is shown to achieve this optimal rate region regardless of the relative strengths of signal, interference, and noise. This result implies that the Han-Kobayashi bound, the best known inner bound on the capacity region of the two-user pair interference channel, cannot be improved merely by using the optimal maximum likelihood decoder.

Connected through hyperedge HE-1 (induced by source paper "performance of multi cell massive mimo systems with interference decoding"):
  with members:
    - "large scale fading decoding in cellular massive mimo systems with spatially correlated channels"
    - "massive mimo has unlimited capacity"
    - "gaussian multiple access via compute and forward"
    - "uplink interference reduction in large scale antenna systems"
    - "joint power allocation and user association optimization for massive mimo systems"
    - "robust pilot decontamination based on joint angle and power domain discrimination"
    - "system architecture and key technologies for 5g heterogeneous cloud radio access networks"
    - "massive mimo for next generation wireless systems"

Connected through hyperedge HE-2 (induced by source paper "homologous codes for multiple access channels"):
  with members:
    - "on general lattice quantization noise"
    - "towards an algebraic network information theory simultaneous joint typicality decoding"
    - "communication versus computation duality for multiple access channels and source coding"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "a joint typicality approach to algebraic network information theory"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "achievable rate region based on coset codes for multiple access channel with states"

Connected through hyperedge HE-3 (induced by source paper "efficient global optimal resource allocation in non orthogonal interference networks"):
  with members:
    - "optimization of weighted individual energy efficiencies in interference networks"
    - "distributed optimization for coordinated beamforming in multicell multigroup multicast systems power minimization and sinr balancing"
    - "energy efficient beam coordination strategies with rate dependent processing power"
    - "energy efficient power control a look at 5g wireless technologies"
    - "resource allocation for energy efficient 3 way relay channels"
    - "instantaneous relaying for the 3 way relay channel with circular message exchanges"
    - "wireless information and power transfer energy efficiency optimization in ofdma systems"
    - "robust monotonic optimization framework for multicell miso systems"

Connected through hyperedge HE-4 (induced by source paper "sliding window superposition coding two user interference channels"):
  with members:
    - "polar coding for interference networks"
    - "is non unique decoding necessary"
    - "a comparison of superposition coding schemes"
    - "rate splitting in the presence of multiple receivers"
    - "universal codes for the gaussian mac via spatial coupling"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "to decode the interference or to consider it as noise"

Connected through hyperedge HE-5 (induced by source paper "polar coding strategies for the interference channel with partially joint decoding"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar coding for processes with memory"
    - "polar codes for broadcast channels"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "polar coding for interference networks"
    - "channel upgradation for non binary input alphabets and macs"
    - "polar coding for secret key generation"

Connected through hyperedge HE-6 (induced by source paper "random coding error exponents for the two user interference channel"):
  with members:
    - "mismatched multi letter successive decoding for the multiple access channel"
    - "list decoding random coding exponents and expurgated exponents"
    - "exact correct decoding exponent of the wiretap channel decoder"
    - "exact random coding error exponents of optimal bin index decoding"
    - "erasure list random coding error exponents are not universally achievable"
    - "multiuser random coding techniques for mismatched decoding"
    - "the generalized random energy model and its application to the statistical physics of ensembles of hierarchical codes"
    - "interference channel capacity region for randomized fixed composition codes"

Connected through hyperedge HE-7 (induced by source paper "the dispersion of nearest neighbor decoding for additive non gaussian channels"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "asymptotics and non asymptotics for universal fixed to variable source coding"
    - "a case where interference does not affect the channel dispersion"
    - "fixed length lossy compression in the finite blocklength regime"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-8 (induced by source paper "on the achievable region for interference networks with point to point codes"):
  with members:
    - "simple transmission strategies for interference channel"
    - "to decode the interference or to consider it as noise"
    - "gaussian interference channel capacity to within one bit"

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)