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: "streaming codes for multicast over burst erasure channels"
  Abstract: We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast channel. The source packets must be sequentially reconstructed at each receiver with a possibly different reconstruction deadline. We study the associated capacity as a function of burst-lengths and delays at the two receivers. #R##N#We establish that the operation of the system can be divided into two main regimes: a low-delay regime and a large-delay regime. We fully characterize the capacity in the large delay regime. The key to this characterization is an inherent slackness in the delay of one of the receivers. At every point in this regime we can reduce the delay of at-least one of the users until a certain critical value and thus it suffices to obtain code constructions for certain critical delays. We partially characterize the capacity in the low-delay regime. Our capacity results involve code constructions and converse techniques that appear to be novel. We also provide a rigorous information theoretic converse theorem in the point-to-point setting which was studied by Martinian in an earlier work.

Connected through hyperedge HE-1 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures"):
  with members:
    - "low field size rate optimal streaming codes for channels with burst and random erasures"
    - "optimal multiplexed erasure codes for streaming messages with different decoding delays"
    - "an explicit rate optimal streaming code for channels with burst and arbitrary erasures"
    - "optimal streaming codes for channels with burst and arbitrary erasures"
    - "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"
    - "rate optimal streaming codes for channels with burst and isolated erasures"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"

Connected through hyperedge HE-2 (induced by source paper "layered constructions for low delay streaming codes"):
  with members:
    - "robust streaming erasure codes based on deterministic channel approximations"
    - "erasure coding for real time streaming"
    - "round robin streaming with generations"
    - "streaming codes for channels with burst and isolated erasures"
    - "linear error correcting codes with anytime reliability"
    - "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-3 (induced by source paper "convolutional codes with maximum column sum rank for network streaming"):
  with members:
    - "layered constructions for low delay streaming codes"
    - "on the impact of a single edge on the network coding capacity"
    - "convolutional codes in rank metric with application to random network coding"
    - "a new class of superregular matrices and mdp convolutional codes"
    - "decoding of convolutional codes over the erasure channel"
    - "multishot codes for network coding using rank metric codes"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random 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)