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: "intermediate performance of rateless codes"
  Abstract: Rateless/fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. In this paper we investigate the number of input symbols that can be recovered by the same decoder, but when the number of coded symbols available is less than the total number of input symbols. Of course recovery of all inputs is not possible, and the fraction that can be recovered will depend on the output degree distribution of the code. #R##N#In this paper we (a) outer bound the fraction of inputs that can be recovered for any output degree distribution of the code, and (b) design degree distributions which meet/perform close to this bound. Our results are of interest for real-time systems using rateless codes, and for Raptor-type two-stage designs.

Connected through hyperedge HE-1 (induced by source paper "low density majority codes and the problem of graceful degradation"):
  with members:
    - "a lower bound on the expected distortion of joint source channel coding"
    - "low complexity concatenated ldpc staircase codes"
    - "comparison of channels criteria for domination by a symmetric channel"
    - "deep joint source channel coding for wireless image transmission"
    - "strong data processing inequalities for channels and bayesian networks"
    - "a source channel separation theorem with application to the source broadcast problem"
    - "protograph based raptor like ldpc codes"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"

Connected through hyperedge HE-2 (induced by source paper "on low density majority codes"):
  with members:
    - "a lower bound on the expected distortion of joint source channel coding"
    - "low complexity concatenated ldpc staircase codes"
    - "deep joint source channel coding for wireless image transmission"
    - "a source channel separation theorem with application to the source broadcast problem"
    - "protograph based raptor like ldpc codes"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"

Connected through hyperedge HE-3 (induced by source paper "on the probability of partial decoding in sparse network coding"):
  with members:
    - "reliability of broadcast communications under sparse random linear network coding"
    - "analysis and optimization of sparse random linear network coding for reliable multicast services"
    - "probability of partially decoding network coded messages"
    - "binary systematic network coding for progressive packet decoding"
    - "feedback based online network coding"

Connected through hyperedge HE-4 (induced by source paper "multirate packet delivery in heterogeneous broadcast networks"):
  with members:
    - "network coded multiple access"
    - "dynamic rate adaptation for improved throughput and delay in wireless network coded broadcast"
    - "completion delay minimization for instantly decodable network codes"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"
    - "arq for network coding"
    - "online network coding for optimal throughput and delay the three receiver case"

Connected through hyperedge HE-5 (induced by source paper "fountain codes with nonuniform selection distributions through feedback"):
  with members:
    - "on the role of feedback in lt codes"

Connected through hyperedge HE-6 (induced by source paper "joint optimization of throughput and packet drop rate for delay sensitive applications in tdd satellite network coded systems"):
  with members:
    - "instantly decodable versus random linear network coding a comparative framework for throughput and decoding delay performance"
    - "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"
    - "arq for network coding"
    - "random linear network coding for time division duplexing when to stop talking and start listening"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-7 (induced by source paper "beyond the min cut bound deterministic network coding for asynchronous multirate broadcast"):
  with members:
    - "joint coding and scheduling optimization in wireless systems with varying delay sensitivities"
    - "throughput delay analysis of random linear network coding for wireless broadcasting"
    - "effective delay control in online network coding"
    - "arq for network coding"
    - "random linear network coding for time division duplexing when to stop talking and start listening"
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-8 (induced by source paper "low latency data sharing in erasure multi way relay channels"):
  with members:
    - "on modulo sum computation over an erasure multiple access channel"
    - "joint compute and forward for the two way relay channel with spatially coupled ldpc codes"
    - "an optimal coding strategy for the binary multi way relay channel"
    - "the multi way relay channel"
    - "capacity theorems for the awgn multi way relay channel"

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)