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 and latency in finite buffer line networks"
  Abstract: This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that models the system exactly. Using simple strategies, bounds on the throughput capacity are derived. The work then presents two iterative schemes to approximate the steady-state distribution of node occupancies by decoupling the chain to smaller queueing blocks. These approximate solutions are used to understand the effect of buffer sizes on throughput capacity and the distribution of packet delay. Using the exact modeling for line networks, it is shown that the throughput capacity is unaltered in the absence of hop-by-hop feedback provided packet-level network coding is allowed. Finally, using simulations, it is confirmed that the proposed framework yields accurate estimates of the throughput capacity and delay distribution and captures the vital trends and tradeoffs in these networks.

Connected through hyperedge HE-1 (induced by source paper "upper bound scalability on achievable rates of batched codes for line networks"):
  with members:
    - "batched sparse codes"
    - "sparse network coding with overlapping classes"

Connected through hyperedge HE-2 (induced by source paper "reliability modeling and analysis of communication networks"):
  with members:
    - "analysis of network coding in a slotted aloha based two way relay network"
    - "formal dependability modeling and analysis a survey"
    - "applying formal methods to networking theory techniques and applications"
    - "towards formal fault tree analysis using theorem proving"
    - "towards the formal reliability analysis of oil and gas pipelines"
    - "formal analysis of soft errors using theorem proving"

Connected through hyperedge HE-3 (induced by source paper "stochastic throughput optimization for two hop systems with finite relay buffers"):
  with members:
    - "buffer aided relaying with adaptive link selection"
    - "buffer aided relaying with adaptive link selection fixed and mixed rate transmission"
    - "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning"
    - "dynamic packet scheduler optimization in wireless relay networks"
    - "queue aware distributive resource control for delay sensitive two hop mimo cooperative systems"

Connected through hyperedge HE-4 (induced by source paper "expander chunked codes"):
  with members:
    - "batched sparse codes"
    - "overhead optimized gamma network codes"
    - "linear complexity overhead optimized random linear network codes"
    - "effects of the generation size and overlap on throughput and complexity in randomized linear network coding"
    - "overlapped chunked network coding"
    - "sparse network coding with overlapping classes"
    - "packing and covering properties of subspace codes for error control in random linear network coding"
    - "coding schemes for line networks"

Connected through hyperedge HE-5 (induced by source paper "streaming codes for channels with burst and isolated erasures"):
  with members:
    - "erasure coding for real time streaming"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"
    - "rateless codes for single server streaming to diverse users"
    - "doped fountain coding for minimum delay data collection in circular networks"

Connected through hyperedge HE-6 (induced by source paper "exact modeling of the performance of random linear network coding in finite buffer networks"):
  with members:
    - "study of throughput and latency in finite buffer coded networks"
    - "throughput and latency of acyclic erasure networks with feedback in a finite buffer regime"
    - "coding schemes for line networks"

Connected through hyperedge HE-7 (induced by source paper "study of throughput and latency in finite buffer coded networks"):
  with members:
    - "throughput and latency of acyclic erasure networks with feedback in a finite buffer regime"
    - "arq for network coding"
    - "coding schemes for line networks"

Connected through hyperedge HE-8 (induced by source paper "throughput and latency of acyclic erasure networks with feedback in a finite buffer regime"):
  with members:
    - "coding schemes for line networks"

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)