human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "inactivation decoding of lt and raptor codes analysis and code design"):
  Abstract: In this paper, we analyze Luby transform (LT) and Raptor codes under inactivation decoding. A first-order analysis is introduced, which provides the expected number of inactivations for an LT code, as a function of the output distribution, the number of input symbols, and the decoding overhead. The analysis is then extended to the calculation of the distribution of the number of inactivations. In both cases, random inactivation is assumed. The developed analytical tools are then exploited to design LT and Raptor codes, enabling a tight control on the decoding complexity versus failure probability tradeoff. The accuracy of the approach is confirmed by numerical simulations.

Includes members:
  Member "bounds on the error probability of raptor codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounds on the error probability of raptor codes under maximum likelihood decoding")
  Member "distance spectrum of fixed rate raptor codes with linear random precoders":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounds on the error probability of raptor codes under maximum likelihood decoding")
  Member "inactivation decoding analysis for lt codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounds on the error probability of raptor codes under maximum likelihood decoding")
  Member "lt code design for inactivation decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounds on the error probability of raptor codes under maximum likelihood decoding")
  Member "distributed raptor coding for erasure channels partially and fully coded cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "probabilistic rateless multiple access for machine to machine communication")
  Member "analysis of the second moment of the lt decoder":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reed muller codes theory and algorithms")
  Member "new model for rigorous analysis of lt codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite length analysis of bats codes")

Question: Please tell me which class the source paper 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)