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 "capacity of 1 to k broadcast packet erasure channels with channel output feedback"):
  Abstract: This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We consider the setting in which the source node has instant feedback of the channel outputs of the K receivers after each transmission. Such a setting directly models network coded packet transmission in the downlink direction with integrated feedback mechanisms (such as Automatic Repeat reQuest (ARQ)). The main results of this paper are: (i) The capacity region for general 1-to-3 broadcast PECs, and (ii) The capacity region for two classes of 1-to-K broadcast PECs: the symmetric PECs, and the spatially independent PECs with one-sided fairness constraints. This paper also develops (iii) A pair of outer and inner bounds of the capacity region for arbitrary 1-to-K broadcast PECs, which can be evaluated by any linear programming solver. For most practical scenarios, the outer and inner bounds meet and thus jointly characterize the capacity.

Includes members:
  Member "multiuser broadcast erasure channel with feedback capacity and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "benefits of coding on age of information in broadcast networks")
  Member "completely stale transmitter channel state information is still very useful":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "achievable dof regions of three user mimo broadcast channel with delayed csit")
  Member "network coding for multiple unicasts an interference alignment approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "alignment based network coding for two unicast z networks")
  Member "wireless erasure networks with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the delay advantage of coding in packet erasure networks")
  Member "arq for network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tiny codes for guaranteeable delay")
  Member "a deterministic approach to wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the deterministic sum capacity of the multiple access wiretap 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)