human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "an achievable rate region for the three user interference channel based on coset codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "on interference networks over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "structured mappings and conferencing common information for multiple access channels")
  Member "on the capacity of the finite field counterparts of wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an achievable rate region for the three user interference channel based on coset codes")
  Member "achievable rate region based on coset codes for multiple access channel with states":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "homologous codes for multiple access channels")
  Member "evaluation of marton s inner bound for the general broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the direction of discrimination an information theoretic analysis of disparate impact in machine learning")
  Member "on the capacity of abelian group codes over discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on modulo sum computation over an erasure multiple access channel")
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "on broadcast channels with binary inputs and symmetric outputs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "superposition coding is almost always optimal for the poisson broadcast channel")

Question: Please tell me which class the source paper 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)