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: "inactivation decoding analysis for lt codes"
  Abstract: We provide two analytical tools to model the inactivation decoding process of LT codes. First, a model is presented which derives the expected number of inactivations occurring in the decoding process of an LT code. This analysis is then extended allowing the derivation of the distribution of the number of inactivations. The accuracy of the method is verified by Monte Carlo simulations. The proposed analysis opens the door to the design of LT codes optimized for inactivation decoding.

Connected through hyperedge HE-1 (induced by source paper "bounds on the error probability of raptor codes under maximum likelihood decoding"):
  with members:
    - "fountain codes under maximum likelihood decoding"
    - "bounds on the error probability of raptor codes"
    - "distance spectrum of fixed rate raptor codes with linear random precoders"
    - "on the weight distribution of fixed rate raptor codes"
    - "lt code design for inactivation decoding"

Connected through hyperedge HE-2 (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"
    - "lt code design for inactivation decoding"
    - "distributed raptor coding for erasure channels partially and fully coded cooperation"
    - "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-3 (induced by source paper "frameless aloha with reliability latency guarantees"):
  with members:
    - "finite length analysis of frameless aloha"
    - "finite length analysis of frameless aloha with multi user detection"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded random access applying codes on graphs to design random access protocols"
    - "aloha random access that operates as a rateless code"
    - "frameless aloha protocol for wireless networks"

Connected through hyperedge HE-4 (induced by source paper "finite length analysis of frameless aloha"):
  with members:
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "coded random access how coding theory helps to build random access protocols"
    - "aloha random access that operates as a rateless code"
    - "frameless aloha protocol for wireless networks"

Connected through hyperedge HE-5 (induced by source paper "finite length analysis of frameless aloha with multi user detection"):
  with members:
    - "finite length analysis of frameless aloha"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded random access applying codes on graphs to design random access protocols"
    - "sign compute resolve for random access"
    - "aloha random access that operates as a rateless code"
    - "frameless aloha protocol for wireless networks"
    - "analysis of the second moment of the lt decoder"

Connected through hyperedge HE-6 (induced by source paper "bounds on the error probability of raptor codes"):
  with members:
    - "distance spectrum of fixed rate raptor codes with linear random precoders"
    - "on the weight distribution of fixed rate raptor codes"
    - "lt code design for inactivation decoding"

Connected through hyperedge HE-7 (induced by source paper "finite length analysis of bats codes"):
  with members:
    - "lt code design for inactivation decoding"
    - "batched sparse codes"
    - "on coding for reliable communication over packet networks"
    - "new model for rigorous analysis of lt codes"

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)