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 rate region for three user discrete broadcast channel based on coset codes"
  Abstract: We present an achievable rate region for the general three user discrete broadcast channel (DBC), based on coset codes. We identify an example of a three user DBC for which the proposed achievable rate region strictly enlarges that obtained by a natural extension of Marton's [1] rate region. As a step towards deriving the achievable rate region for the general three user DBC, we characterize and derive an achievable rate region for a new class - 3-to-1 DBC- of broadcast channels of which the aforementioned is an example.

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"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "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"

Connected through hyperedge HE-2 (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"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"

Connected through hyperedge HE-3 (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"
    - "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"
    - "polar codes for the two user multiple access channel"

Connected through hyperedge HE-4 (induced by source paper "trade off between communication and cooperation in the interference channel"):
  with members:
    - "an achievable rate distortion region for multiple descriptions source coding based on coset codes"
    - "sub optimality of the han kobayashi achievable region for interference channels"
    - "an achievable rate distortion region for the multiple descriptions problem"
    - "on interference networks over finite fields"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"

Connected through hyperedge HE-5 (induced by source paper "quasi linear codes application to point to point and multi terminal source coding"):
  with members:
    - "an achievable rate distortion region for multiple descriptions source coding based on coset codes"
    - "combinatorial message sharing and a new achievable region for multiple descriptions"
    - "linear coding schemes for the distributed computation of subspaces"

Connected through hyperedge HE-6 (induced by source paper "an achievable rate distortion region for multiple descriptions source coding based on coset codes"):
  with members:
    - "combinatorial message sharing and a new achievable region for multiple descriptions"
    - "an achievable rate distortion region for the multiple descriptions problem"

Connected through hyperedge HE-7 (induced by source paper "coset codes for communicating over non additive channels"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "the approximate capacity of the many to one and one to many gaussian 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)