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 "joint optimization of throughput and packet drop rate for delay sensitive applications in tdd satellite network coded systems"):
  Abstract: In this paper, we consider the issue of throughput and packet drop rate (PDR) optimization as two performance metrics for delay sensitive applications in network coded time division duplex (TDD) satellite systems with large round trip times (RTTs). We adopt random linear network coding (RLNC) and our purpose is to obtain the optimum RLNC-based transmission strategy. We start with a single-user case and propose a systematic framework to investigate the advantage of using feedback by comparing feedback-free and feedback schemes. Showing analytically that the feedback-free scheme gives better performance for our system of interest, we extend it to multi-user broadcast case. To this end, we consider a number of different broadcast scenarios and optimize the system parameters such that the best overall performance is achieved. Furthermore, the complicated interplay of the mean throughputs and PDRs of different users with different packet erasure conditions is discussed. Finally, it is shown that the optimized feedback-free RLNC broadcast scheme works close enough to an idealistic RLNC scheme, where the complete and immediate knowledge about the reception status of all users is assumed to be available at the sender.

Includes members:
  Member "instantly decodable versus random linear network coding a comparative framework for throughput and decoding delay performance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on improving the balance between the completion time and decoding delay in instantly decodable network coded systems")
  Member "joint coding and scheduling optimization in wireless systems with varying delay sensitivities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adaptive causal network coding with feedback")
  Member "throughput delay analysis of random linear network coding for wireless broadcasting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "delay complexity trade off of random linear network coding in wireless broadcast")
  Member "broadcasting in time division duplexing a random linear network coding approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks")
  Member "arq for network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tiny codes for guaranteeable delay")
  Member "random linear network coding for time division duplexing when to stop talking and start listening":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks")
  Member "intermediate performance of rateless codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "low density majority codes and the problem of graceful degradation")
  Member "on coding for reliable communication over packet networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adaptive causal network coding with feedback")

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)