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: "an achievable rate region for the three user interference channel based on coset codes"
  Abstract: We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes—partitioned coset codes (PCCs)—that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks.

Connected through hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding"):
  with members:
    - "homologous codes for multiple access channels"
    - "gaussian multiple access via compute and forward"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "equivalence of additive combinatorial linear inequalities for shannon entropy and differential entropy"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "secure compute and forward in a bidirectional relay"
    - "distributed decode forward for relay networks"
    - "secure degrees of freedom of one hop wireless networks"

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"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "a joint typicality approach to algebraic network information theory"
    - "optimal achievable rates for interference networks with random codes"
    - "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 "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"):
  with members:
    - "a joint typicality approach to algebraic network information theory"
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiple access via compute and forward"
    - "lattices over eisenstein integers for compute and forward"
    - "uplink downlink duality for integer forcing"
    - "successive integer forcing and its sum rate optimality"

Connected through hyperedge HE-4 (induced by source paper "a joint typicality approach to algebraic network information theory"):
  with members:
    - "secure compute and forward in a bidirectional relay"
    - "asymmetric compute and forward with csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "renyi divergence and kullback leibler divergence"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward strategies for cooperative distributed antenna systems"

Connected through hyperedge HE-5 (induced by source paper "new sufficient conditions for multiple access channel with correlated sources"):
  with members:
    - "computing sum of sources over an arbitrary multiple access channel"
    - "a graph based framework for transmission of correlated sources over broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "coset codes for communicating over non additive channels"):
  with members:
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"

Connected through hyperedge HE-7 (induced by source paper "achievable rate region for three user discrete broadcast 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"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "on the capacity of abelian group codes over discrete memoryless channels"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on broadcast channels with binary inputs and symmetric outputs"
    - "interference alignment and a noisy interference regime for many to one interference channels"

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)