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: "on the delay of network coding over line networks"
  Abstract: We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore the asymptotic rate is determined by the worst link of the line network. In this paper we investigate the delay for transmitting a batch of packets, which is a function of all the erasure probabilities and the number of packets in the batch. We show a monotonicity result on the delay function and derive simple expressions which characterize the expected delay behavior of line networks. Further, we use a martingale bounded differences argument to show that the actual delay is tightly concentrated around its expectation.

Connected through hyperedge HE-1 (induced by source paper "when queueing meets coding optimal latency data retrieving scheme in storage clouds"):
  with members:
    - "on throughput delay optimal access to storage clouds via load adaptive coding and chunking"
    - "when do redundant requests reduce latency"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "toward sustainable networking storage area networks with network coding"
    - "the mds queue analysing the latency performance of erasure codes"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-2 (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"
    - "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-3 (induced by source paper "on throughput delay optimal access to storage clouds via load adaptive coding and chunking"):
  with members:
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "coding for fast content download"
    - "the mds queue analysing the latency performance of erasure codes"
    - "fault tolerant real time streaming with fec thanks to capillary multi path routing"

Connected through hyperedge HE-4 (induced by source paper "tofec achieving optimal throughput delay trade off of cloud storage using erasure codes"):
  with members:
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "the mds queue analysing the latency performance of erasure codes"
    - "fault tolerant real time streaming with fec thanks to capillary multi path routing"

Connected through hyperedge HE-5 (induced by source paper "fast cloud pushing the envelope on delay performance of cloud storage with coding"):
  with members:
    - "toward sustainable networking storage area networks with network coding"
    - "the mds queue analysing the latency performance of erasure codes"
    - "fault tolerant real time streaming with fec thanks to capillary multi path routing"

Connected through hyperedge HE-6 (induced by source paper "on the delay advantage of coding in packet erasure networks"):
  with members:
    - "coding delay analysis of chunked codes over line networks"
    - "how fast can dense codes achieve the min cut capacity of line networks"
    - "wireless erasure networks with feedback"
    - "network coding capacity of random wireless networks under a sinr model"
    - "bounds on the network coding capacity for wireless random networks"
    - "coding schemes for line networks"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-7 (induced by source paper "coding delay analysis of chunked codes over line networks"):
  with members:
    - "how fast can dense codes achieve the min cut capacity of line networks"
    - "network codes with overlapping chunks over line networks a case for linear time codes"
    - "sparse network coding with overlapping classes"
    - "coding schemes for line networks"

Connected through hyperedge HE-8 (induced by source paper "coding delay analysis of dense and chunked network codes over line networks"):
  with members:
    - "how fast can dense codes achieve the min cut capacity of line networks"
    - "analysis of overlapped chunked codes with small chunks over line networks"
    - "overlapped chunked network coding"
    - "sparse network coding with overlapping classes"

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)