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: "the effect of block wise feedback on the throughput delay trade off in streaming"
  Abstract: Unlike traditional file transfer where only total delay matters, streaming applications impose delay constraints on each packet and require them to be in order. To achieve fast in-order packet decoding, we have to compromise on the throughput. We study this trade-off between throughput and in-order decoding delay, and in particular how it is affected by the frequency of block-wise feedback to the source. When there is immediate feedback, we can achieve the optimal throughput and delay simultaneously. But as the feedback delay increases, we have to compromise on at least one of these metrics. We present a spectrum of coding schemes that span different points on the throughput-delay trade-off. Depending upon the delay-sensitivity and bandwidth limitations of the application, one can choose an appropriate operating point on this trade-off.

Connected through hyperedge HE-1 (induced by source paper "adaptive causal network coding with feedback"):
  with members:
    - "resource allocation and harq optimization for urllc traffic in 5g wireless networks"
    - "tiny codes for guaranteeable delay"
    - "complete mdp convolutional codes"
    - "throughput maximization for delay sensitive random access communication"
    - "analysis of feedback error in automatic repeat request"
    - "low delay random linear coding over a stream"
    - "an elias bound on the bhattacharyya distance of codes for channels with a zero error capacity"
    - "on the delay advantage of coding in packet erasure networks"

Connected through hyperedge HE-2 (induced by source paper "low latency network adaptive error control for interactive streaming"):
  with members:
    - "adaptive causal network coding with feedback"
    - "optimal streaming codes for channels with burst and arbitrary erasures"
    - "tiny codes for guaranteeable delay"
    - "rate optimal streaming codes for channels with burst and isolated erasures"
    - "congestion control using fec for conversational multimedia communication"

Connected through hyperedge HE-3 (induced by source paper "constant delay and constant feedback moving window network coding for wireless multicast design and asymptotic analysis"):
  with members:
    - "scheduling of multicast and unicast services under limited feedback by using rateless codes"
    - "network control without csi using rateless codes for downlink cellular systems"
    - "throughput of rateless codes over broadcast erasure channels"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "three schemes for wireless coded broadcast to heterogeneous users"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "network coding meets tcp"
    - "effective delay control in online network coding"

Connected through hyperedge HE-4 (induced by source paper "in order delivery delay of transport layer coding"):
  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"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "throughput smoothness trade offs in multicasting of an ordered packet stream"):
  with members:
    - "effective delay control in online network coding"
    - "online network coding for optimal throughput and delay the three receiver case"

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)