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: "coding schemes for line networks"
  Abstract: We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks

Connected through hyperedge HE-1 (induced by source paper "random linear network coding for 5g mobile video delivery"):
  with members:
    - "reliability of broadcast communications under sparse random linear network coding"
    - "reliable video streaming over mmwave with multi connectivity and network coding"
    - "decoding delay performance of random linear network coding for broadcast"
    - "optimized interface diversity for ultra reliable low latency communication urllc"
    - "analysis and optimization of sparse random linear network coding for reliable multicast services"
    - "collaborative mobile edge computing in 5g networks new paradigms scenarios and challenges"
    - "resource allocation frameworks for network coded layered multimedia multicast services"
    - "optimized network coded scalable video multicasting over embms networks"

Connected through hyperedge HE-2 (induced by source paper "arq with cumulative feedback to compensate for burst errors"):
  with members:
    - "what will 5g be"
    - "arq for network coding"

Connected through hyperedge HE-3 (induced by source paper "optimal finite length coding rate of random linear network coding schemes"):
  with members:
    - "round robin streaming with generations"

Connected through hyperedge HE-4 (induced by source paper "minimal header overhead for random linear network coding"):
  with members:
    - "lower bounds for sparse recovery"
    - "improved compression of network coding vectors using erasure decoding and list decoding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-5 (induced by source paper "batched sparse codes"):
  with members:
    - "overhead optimized gamma network codes"
    - "effects of the generation size and overlap on throughput and complexity in randomized linear network coding"
    - "on the capacity of non coherent network coding"
    - "coding for linear operator channels over finite fields"
    - "communication over finite field matrix channels"
    - "overlapped chunked network coding"
    - "sparse network coding with overlapping classes"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-6 (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"
    - "throughput and latency in finite buffer line networks"
    - "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"

Connected through hyperedge HE-7 (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"
    - "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"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-8 (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"
    - "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)