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: "how fast can dense codes achieve the min cut capacity of line networks"
  Abstract: In this paper, we study the coding delay and the average coding delay of random linear network codes (dense codes) over line networks with deterministic regular and Poisson transmission schedules. We consider both lossless networks and networks with Bernoulli losses. The upper bounds derived in this paper, which are in some cases more general, and in some other cases tighter, than the existing bounds, provide a more clear picture of the speed of convergence of dense codes to the min-cut capacity of line networks.

Connected through hyperedge HE-1 (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"
    - "on the delay of network coding over 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-2 (induced by source paper "coding delay analysis of chunked codes over line networks"):
  with members:
    - "network codes with overlapping chunks over line networks a case for linear time codes"
    - "on the delay of network coding over line networks"
    - "sparse network coding with overlapping classes"
    - "coding schemes for line networks"

Connected through hyperedge HE-3 (induced by source paper "coding delay analysis of dense and chunked network codes over line networks"):
  with members:
    - "analysis of overlapped chunked codes with small chunks over line networks"
    - "overlapped chunked network coding"
    - "on the delay of network coding over line networks"
    - "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)