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: "interference decoding for deterministic channels"
  Abstract: An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver. It is shown that this interference-decoding inner bound is tight under certain strong interference conditions. The inner bound is also shown to strictly contain the inner bound obtained by treating interference as noise, which includes interference alignment for deterministic channels. The gain comes from judicious analysis of the number of combined interference sequences in different regimes of input distributions and message rates. Finally, the inner bound is generalized to the case where each channel output is observed through a noisy channel.

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"
    - "optimal achievable rates for interference networks with random codes"
    - "system architecture and key technologies for 5g heterogeneous cloud radio access networks"

Connected through hyperedge HE-2 (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"
    - "achievable rates for k user gaussian interference channels"

Connected through hyperedge HE-3 (induced by source paper "optimal achievable rates for interference networks with random codes"):
  with members:
    - "a comparison of superposition coding schemes"
    - "wireless network information flow a deterministic approach"
    - "to decode the interference or to consider it as noise"

Connected through hyperedge HE-4 (induced by source paper "a unified approach for network information theory"):
  with members:
    - "noisy network coding with partial df"
    - "short message noisy network coding with a decode forward option"
    - "hybrid coding an interface for joint source channel coding and network communication"
    - "simultaneous nonunique decoding is rate optimal"
    - "achievability proof via output statistics of random binning"
    - "wireless network information flow a deterministic approach"
    - "on the capacity of the noncausal relay channel"
    - "slepian wolf coding over cooperative relay networks"

Connected through hyperedge HE-5 (induced by source paper "is non unique decoding necessary"):
  with members:
    - "hybrid coding an interface for joint source channel coding and network communication"
    - "simultaneous nonunique decoding is rate optimal"
    - "capacity region of multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"
    - "on the optimal compressions in the compress and forward relay schemes"

Connected through hyperedge HE-6 (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"

Connected through hyperedge HE-7 (induced by source paper "an achievable rate region for three pair interference channels with noise"):
  with members:
    - "communication with disturbance constraints"
    - "wireless network information flow a deterministic approach"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-8 (induced by source paper "simultaneous nonunique decoding is rate optimal"):
  with members:
    - "interference networks with point to point codes"

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)