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 "the unbounded benefit of encoder cooperation for the k user mac"):
  Abstract: Cooperation strategies that allow communication devices to work together can improve network capacity. This paper generalizes the “cooperation facilitator” (CF) model from the 2-user to the k-user multiple access channel (MAC), extending capacity bounds, characterizing all k-user MACs for which the sum-capacity gain of encoder cooperation exceeds the capacity cost that enables it, and demonstrating an infinite benefit-cost ratio in the limit of small cost.

Includes members:
  Member "on the impact of a single edge on the network coding capacity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a local perspective on the edge removal problem")
  Member "the unbounded benefit of encoder cooperation for the k user mac extended version":
    also connected through other hyperedges:
      (none)
  Member "on achievability for downlink cloud radio access networks with base station cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hybrid precoder design for cache enabled millimeter wave radio access networks")
  Member "can negligible cooperation increase network reliability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity advantage of a single bit")
  Member "the multivariate covering lemma and its converse":
    also connected through other hyperedges:
      (none)

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)