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: "low delay random linear coding over a stream"
  Abstract: We consider use of FEC to reduce in-order delivery delay over packet erasure channels. We propose a class of streaming codes that is capacity achieving and provides a superior throughput-delay trade-off compared to block codes by introducing flexibility in where and when redundancy is placed. This flexibility results in significantly lower in-order delay for a given throughput for a wide range of network scenarios. Furthermore, a major contribution of this paper is the combination of queuing and coding theory to analyze the code's performance. Finally, we present simulation and experimental results illustrating the code's benefits.

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"
    - "the effect of block wise feedback on the throughput delay trade off in streaming"
    - "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 "adaptive causal network coding with feedback for multipath multi hop communications"):
  with members:
    - "adaptive causal network coding with feedback"
    - "tiny codes for guaranteeable delay"
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-3 (induced by source paper "tiny codes for guaranteeable delay"):
  with members:
    - "resource allocation and harq optimization for urllc traffic in 5g wireless networks"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "the sky is not the limit lte for unmanned aerial vehicles"
    - "arq with cumulative feedback to compensate for burst errors"
    - "complete mdp convolutional codes"
    - "throughput maximization for delay sensitive random access communication"
    - "analysis of feedback error in automatic repeat request"
    - "wide area wireless communication challenges for the internet of things"

Connected through hyperedge HE-4 (induced by source paper "multipath communication with finite sliding window network coding for ultra reliability and low latency"):
  with members:
    - "decoding delay performance of random linear network coding for broadcast"
    - "wireless access for ultra reliable low latency communication urllc principles and building blocks"
    - "multi path low delay network codes"
    - "low delay random linear coding and scheduling over multiple interfaces"

Connected through hyperedge HE-5 (induced by source paper "analysis of coded selective repeat arq via matrix signal flow graphs"):
  with members:
    - "complete mdp convolutional codes"
    - "analysis of feedback error in automatic repeat request"

Connected through hyperedge HE-6 (induced by source paper "network coding over satcom lessons learned"):
  with members:
    - "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"
    - "random linear network coding for time division duplexing when to stop talking and start listening"

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)