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: "on the capacity of abelian group codes over discrete memoryless channels"
  Abstract: For most discrete memoryless channels, there does not exist a linear code for the channel which uses all of the channel's input symbols. Therefore, linearity of the code for such channels is a very restrictive condition and there should be a loosening of the algebraic structure of the code to a degree that the code can admit any channel input alphabet. For any channel input alphabet size, there always exists an Abelian group structure defined on the alphabet. We investigate the capacity of Abelian group codes over discrete memoryless channels and provide lower and upper bounds on the capacity.

Connected through hyperedge HE-1 (induced by source paper "achievable rate region for three user discrete broadcast channel based on coset codes"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "on modulo sum computation over an erasure multiple access channel"):
  with members:
    - "anti structure problems"
    - "multilevel coding schemes for compute and forward"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "lattice strategies for the dirty multiple access channel"
    - "on the secrecy rate of interference networks using structured codes"
    - "compute and forward harnessing interference through structured codes"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"

Connected through hyperedge HE-3 (induced by source paper "asymptotically good codes over non abelian groups"):
  with members:
    - "lattice strategies for the dirty multiple access channel"
    - "distributed source coding using abelian group codes"

Connected through hyperedge HE-4 (induced by source paper "multilevel polarization of polar codes over arbitrary discrete memoryless channels"):
  with members:
    - "polar codes for q ary channels q 2 r"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

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)