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: "analysis of the second moment of the lt decoder"
  Abstract: We analyze the second moment of the ripple size during the LT decoding process and prove that the standard deviation of the ripple size for an LT-code with length $k$ is of the order of $\sqrt k.$ Together with a result by Karp et. al stating that the expectation of the ripple size is of the order of $k$ [3], this gives bounds on the error probability of the LT decoder. We also give an analytic expression for the variance of the ripple size up to terms of constant order, and refine the expression in [3] for the expectation of the ripple size up to terms of the order of $1/k$, thus providing a first step towards an analytic finite-length analysis of LT decoding.

Connected through hyperedge HE-1 (induced by source paper "reliability latency performance of frameless aloha with and without feedback"):
  with members:
    - "finite length analysis of irregular repetition slotted aloha in the waterfall region"
    - "on the modeling and performance assessment of random access with sic"
    - "optimized frameless aloha for cooperative base stations with overlapped coverage areas"
    - "frameless aloha with reliability latency guarantees"
    - "inactivation decoding of lt and raptor codes analysis and code design"
    - "finite length analysis of frameless aloha"
    - "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
    - "error floor analysis of coded slotted aloha over packet erasure channels"

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"
    - "inactivation decoding analysis for lt codes"
    - "lt code design for inactivation decoding"
    - "distributed raptor coding for erasure channels partially and fully coded cooperation"
    - "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 "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"
    - "inactivation decoding analysis for lt codes"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "inactivation decoding analysis for lt codes"):
  with members:
    - "lt code design for inactivation decoding"
    - "finite length analysis of bats codes"

Connected through hyperedge HE-5 (induced by source paper "three schemes for wireless coded broadcast to heterogeneous users"):
  with members:
    - "effects of the generation size and overlap on throughput and complexity in randomized linear network coding"
    - "rateless codes for single server streaming to diverse users"
    - "intermediate performance of rateless codes"

Connected through hyperedge HE-6 (induced by source paper "design and analysis of lt codes with decreasing ripple size"):
  with members:
    - "intermediate performance of rateless codes"
    - "new model for rigorous analysis of lt codes"

Connected through hyperedge HE-7 (induced by source paper "rateless codes for single server streaming to diverse users"):
  with members:
    - "intermediate performance of rateless 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)