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 "coding based data broadcasting for time critical applications with rate adaptation"):
  Abstract: In this paper, we dynamically select the transmission rate and design wireless network coding to improve the quality of services, such as delay for time-critical applications. In a network coded system, with a low transmission rate and, hence, a longer transmission range, more packets may be encoded, which increases the coding opportunity. However, a low transmission rate may incur extra transmission delay, which is intolerable for time-critical applications. We design a novel joint rate selection and wireless network coding (RSNC) scheme with a delay constraint to maximize the total benefit (where we can define the benefit based on the priority or importance of a packet for example) of the packets that are successfully received at the destinations without missing their deadlines. We prove that the proposed problem is NP-hard and propose a novel graph model to mathematically formulate the problem. For the general case, we propose a transmission metric and design an efficient algorithm to determine the transmission rate and coding strategy for each transmission. For a special case when all delay constraints are the same, we study pairwise coding and present a polynomial-time pairwise coding algorithm that achieves an approximation ratio of    $\hbox{1} -(\hbox{1}/e)$   to the optimal pairwise coding solution, where    $e$   is the base of the natural logarithm. Finally, simulation results demonstrate the superiority of the proposed RSNC scheme.

Includes members:
  Member "partial third party information exchange with network coding":
    also connected through other hyperedges:
      (none)
  Member "exchanging third party information with minimum transmission cost":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a game theoretic approach to minimize the completion time of network coded cooperative data exchange")
  Member "error correction for cooperative data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "erasure codes with symbol locality and group decodability for distributed storage")
  Member "joint rate selection and wireless network coding for time critical applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a game theoretic approach to minimize the completion time of network coded cooperative data exchange")
  Member "broadcasting with side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "privacy utility tradeoff in a guessing framework inspired by index coding")

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)