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 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.

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"
    - "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"
    - "coded random access applying codes on graphs to design random access protocols"

Connected through hyperedge HE-2 (induced by source paper "caching at the edge with lt codes"):
  with members:
    - "caching at the edge with fountain codes"
    - "mobility and popularity aware coded small cell caching"
    - "mds coded distributed storage for low delay wireless content delivery"
    - "optimizing mds codes for caching at the edge"

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)