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: "broadcasting in time division duplexing a random linear network coding approach"
  Abstract: We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receivers to acknowledge the number of degrees of freedom, if any, that are required to decode correctly the information. We study the mean time to complete the transmission of a block of packets to all receivers. We also present a bound on the number of stops to wait for acknowledgement in order to complete transmission with probability at least $1-\epsilon$, for any $\epsilon>0$. We present analysis and numerical results showing that our scheme outperforms optimal scheduling policies for broadcast, in terms of the mean completion time. We provide a simple heuristic to compute the number of coded packets to be sent before stopping that achieves close to optimal performance with the advantage of a considerable reduction in the search time.

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"
    - "informed network coding for minimum decoding delay"
    - "random linear network coding for time division duplexing when to stop talking and start listening"
    - "random linear network coding a free cipher"
    - "opportunistic network coding for video streaming over wireless"

Connected through hyperedge HE-2 (induced by source paper "on the packet decoding delay of linear network coded wireless broadcast"):
  with members:
    - "performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast"
    - "on deterministic linear network coded broadcast and its relation to matroid theory"
    - "completion delay minimization for instantly decodable network codes"
    - "on coding for cooperative data exchange"
    - "informed network coding for minimum decoding delay"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-3 (induced by source paper "reliability of multicast under random linear network coding"):
  with members:
    - "reliability of broadcast communications under sparse random linear network coding"
    - "decoding delay performance of random linear network coding for broadcast"
    - "novel performance analysis of network coded communications in single relay networks"
    - "resource allocation frameworks for network coded layered multimedia multicast services"
    - "binary systematic network coding for progressive packet decoding"
    - "optimized network coded scalable video multicasting over embms networks"
    - "performance analysis of random linear network coding in two source single relay networks"
    - "rethinking the intercept probability of random linear network coding"

Connected through hyperedge HE-4 (induced by source paper "performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast"):
  with members:
    - "content aware instantly decodable network coding over wireless networks"
    - "coding opportunity densification strategies for instantly decodable network coding"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"
    - "informed network coding for minimum decoding delay"
    - "arq for network coding"

Connected through hyperedge HE-5 (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"
    - "random linear network coding for time division duplexing when to stop talking and start listening"

Connected through hyperedge HE-6 (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"
    - "random linear network coding for time division duplexing when to stop talking and start listening"

Connected through hyperedge HE-7 (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"
    - "arq for network coding"
    - "random linear network coding for time division duplexing when to stop talking and start listening"
    - "intermediate performance of rateless codes"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-8 (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"
    - "on the delay of network coding over line networks"
    - "random linear network coding for time division duplexing when to stop talking and start listening"
    - "coding for errors and erasures in random network coding"

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)