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: "throughput delay analysis of random linear network coding for wireless broadcasting"
  Abstract: In an unreliable single-hop broadcast network setting, we investigate the throughput and decoding-delay performance of random linear network coding as a function of the coding window size and the network size. Our model consists of a source transmitting packets of a single flow to a set of $n$ users over independent erasure channels. The source performs random linear network coding (RLNC) over $k$ (coding window size) packets and broadcasts them to the users. We note that the broadcast throughput of RLNC must vanish with increasing $n$, for any fixed $k.$ Hence, in contrast to other works in the literature, we investigate how the coding window size $k$ must scale for increasing $n$. Our analysis reveals that the coding window size of $\Theta(\ln(n))$ represents a phase transition rate, below which the throughput converges to zero, and above which it converges to the broadcast capacity. Further, we characterize the asymptotic distribution of decoding delay and provide approximate expressions for the mean and variance of decoding delay for the scaling regime of $k=\omega(\ln(n)).$ These asymptotic expressions reveal the impact of channel correlations on the throughput and delay performance of RLNC. We also show how our analysis can be extended to other rateless block coding schemes such as the LT codes. Finally, we comment on the extension of our results to the cases of dependent channels across users and asymmetric channel model.

Connected through hyperedge HE-1 (induced by source paper "delay complexity trade off of random linear network coding in wireless broadcast"):
  with members:
    - "circular shift linear network coding"
    - "circular shift linear network codes with arbitrary odd block lengths"
    - "approximating throughput and packet decoding delay in linear network coded wireless broadcast"
    - "decoding delay performance of random linear network coding for broadcast"
    - "optimal control for network coding broadcast"
    - "on vector linear solvability of multicast networks"
    - "decoding and file transfer delay balancing in network coding broadcast"
    - "completion delay minimization for instantly decodable network codes"

Connected through hyperedge HE-2 (induced by source paper "delay aware wireless network coding in adversarial traffic"):
  with members:
    - "online energy efficient scheduling for timely information downloads in mobile networks"
    - "network utility maximization in adversarial environments"
    - "adversarial network coding"
    - "online ski rental for on off scheduling of energy harvesting base stations"
    - "optimal reverse carpooling over wireless networks a distributed optimization approach"
    - "network coding aware queue management for tcp flows over coded wireless networks"

Connected through hyperedge HE-3 (induced by source paper "multirate packet delivery in heterogeneous broadcast networks"):
  with members:
    - "network coded multiple access"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "completion delay minimization for instantly decodable network codes"
    - "effective delay control in online network coding"
    - "arq for network coding"
    - "online network coding for optimal throughput and delay the three receiver case"
    - "intermediate performance of rateless codes"

Connected through hyperedge HE-4 (induced by source paper "delay optimal scheduling for chunked random linear network coding broadcast"):
  with members:
    - "optimal control for network coding broadcast"
    - "throughput of rateless codes over broadcast erasure channels"
    - "sparse network coding with overlapping classes"

Connected through hyperedge HE-5 (induced by source paper "delay on broadcast erasure channels under random linear combinations"):
  with members:
    - "on the delay advantage of coding in packet erasure networks"
    - "throughput of rateless codes over broadcast erasure channels"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "decoding and file transfer delay balancing in network coding broadcast"):
  with members:
    - "on minimizing the average packet decoding delay in wireless network coded broadcast"
    - "on throughput and decoding delay performance of instantly decodable network coding"
    - "arq for network coding"

Connected through hyperedge HE-7 (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"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "effective delay control in online network coding"
    - "informed network coding for minimum decoding delay"
    - "arq for network coding"

Connected through hyperedge HE-8 (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"
    - "the effect of block wise feedback on the throughput delay trade off in streaming"
    - "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"
    - "network coding meets tcp"
    - "effective delay control in online 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)