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: "distributed raptor coding for erasure channels partially and fully coded cooperation"
  Abstract: In this paper, we propose a new rateless coded cooperation scheme for a general multi-user cooperative wireless system. We develop cooperation methods based on Raptor codes with the assumption that the channels face erasure with specific erasure probabilities and transmitters have no channel state information. A fully coded cooperation (FCC) and a partially coded cooperation (PCC) strategy are developed to maximize the average system throughput. Both PCC and FCC schemes have been analyzed through AND-OR tree analysis and a linear programming optimization problem is then formulated to find the optimum degree distribution for each scheme. Simulation results show that optimized degree distributions can bring considerable throughput gains compared to existing degree distributions which are designed for point-to-point binary erasure channels. It is also shown that the PCC scheme outperforms the FCC scheme in terms of average system throughput.

Connected through hyperedge HE-1 (induced by source paper "inactivation decoding of lt and raptor codes analysis and code design"):
  with members:
    - "bounds on the error probability of raptor codes"
    - "distance spectrum of fixed rate raptor codes with linear random precoders"
    - "inactivation decoding analysis for lt codes"
    - "lt code design for inactivation decoding"
    - "analysis of the second moment of the lt decoder"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "new model for rigorous analysis of lt codes"

Connected through hyperedge HE-2 (induced by source paper "probabilistic rateless multiple access for machine to machine communication"):
  with members:
    - "near capacity adaptive analog fountain codes for wireless channels"
    - "fundamentals of throughput maximization with random arrivals for m2m communications"
    - "power efficient system design for cellular based machine to machine communications"
    - "on modulo sum computation over an erasure multiple access channel"
    - "spatially coupled random access on graphs"

Connected through hyperedge HE-3 (induced by source paper "distributed soft coding with a soft input soft output siso relay encoder in parallel relay channels"):
  with members:
    - "performance analysis of hybrid relay selection in cooperative wireless systems"
    - "bilayer low density parity check codes for decode and forward in relay channels"
    - "optimal relay functionality for snr maximization in memoryless relay 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)