human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "random linear network coding for time division duplexing when to stop talking and start listening"
  Abstract: A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. We provide an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. We show that its performance is very close to that of a full duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also, we study the throughput performance of our scheme and compare it to existing half-duplex Go-back-N and Selective Repeat ARQ schemes. Numerical results, obtained for different latencies, show that our scheme has similar performance to the Selective Repeat in most cases and considerable performance gain when latency and packet error probability is high.

Connected through hyperedge HE-1 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks"):
  with members:
    - "on coding for cooperative data exchange"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "informed network coding for minimum decoding delay"
    - "random linear network coding a free cipher"
    - "opportunistic network coding for video streaming over wireless"

Connected through hyperedge HE-2 (induced by source paper "network coded handover in ieee 802 11"):
  with members:
    - "adaptive network coding schemes for satellite communications"

Connected through hyperedge HE-3 (induced by source paper "network coding over satcom lessons learned"):
  with members:
    - "low delay random linear coding over a stream"
    - "fulcrum network codes a code for fluid allocation of complexity"
    - "network coding as a wimax link reliability mechanism"
    - "speeding multicast by acknowledgment reduction technique smart"

Connected through hyperedge HE-4 (induced by source paper "fec for lower in order delivery delay in packet networks"):
  with members:
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "broadcasting in time division duplexing a random linear network coding approach"

Connected through hyperedge HE-5 (induced by source paper "low delay random linear coding over a stream"):
  with members:
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "broadcasting in time division duplexing a random linear network coding approach"

Connected through hyperedge HE-6 (induced by source paper "joint optimization of throughput and packet drop rate for delay sensitive applications in tdd satellite network coded systems"):
  with members:
    - "instantly decodable versus random linear network coding a comparative framework for throughput and decoding delay performance"
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "arq for network coding"
    - "intermediate performance of rateless codes"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-7 (induced by source paper "in order delivery delay of transport layer coding"):
  with members:
    - "the effect of block wise feedback on the throughput delay trade off in streaming"
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "on the delay of network coding over line networks"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-8 (induced by source paper "beyond the min cut bound deterministic network coding for asynchronous multirate broadcast"):
  with members:
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"
    - "arq for network coding"
    - "intermediate performance of rateless codes"
    - "on coding for reliable communication over packet networks"

Question: Please tell me which class the center node 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)