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 "rate aware instantly decodable network codes"):
  Abstract: This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications and abstract the model as equally slotted time for all users, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The consideration of asymmetric rates for receivers reflects more practical application scenarios and introduces a new trade-off between the choice of coding combinations for various receivers and the broadcasting rate for achieving shorter completion time. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. The highest weight clique in the created graph being potentially not unique, the paper further suggests a multi-layer version of the proposed solution to improve the obtained results from the employed completion time approximation. Simulation results indicate that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme.

Includes members:
  Member "on minimizing the maximum broadcast decoding delay for instantly decodable network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a tutorial on clique problems in communications and signal processing")
  Member "decoding delay controlled reduction of completion time in instantly decodable network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "delay reduction in multi hop device to device communication using network coding")
  Member "a game theoretic framework for decentralized cooperative data exchange using network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")
  Member "delay reduction in multi hop device to device communication using network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")
  Member "coding based data broadcasting for time critical applications with rate adaptation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on resource allocation in vehicular networks")
  Member "completion time reduction in instantly decodable network coding through decoding delay control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")
  Member "a game theoretic approach to minimize the completion time of network coded cooperative data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")
  Member "a lossy graph model for delay reduction in generalized instantly decodable network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a tutorial on clique problems in communications and signal processing")

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)