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: "design and analysis of lt codes with decreasing ripple size"
  Abstract: In this paper we propose a new design of LT codes, which decreases the amount of necessary overhead in comparison to existing designs. The design focuses on a parameter of the LT decoding process called the ripple size. This parameter was also a key element in the design proposed in the original work by Luby. Specifically, Luby argued that an LT code should provide a constant ripple size during decoding. In this work we show that the ripple size should decrease during decoding, in order to reduce the necessary overhead. Initially we motivate this claim by analytical results related to the redundancy within an LT code. We then propose a new design procedure, which can provide any desired achievable decreasing ripple size. The new design procedure is evaluated and compared to the current state of the art through simulations. This reveals a significant increase in performance with respect to both average overhead and error probability at any fixed overhead.

Connected through hyperedge HE-1 (induced by source paper "design and analysis of online fountain codes for intermediate performance"):
  with members:
    - "fountain codes with nonuniform selection distributions through feedback"
    - "buffer based distributed lt codes"

Connected through hyperedge HE-2 (induced by source paper "coded pilot access a random access solution for massive mimo systems"):
  with members:
    - "random access for massive mimo systems with intra cell pilot contamination"
    - "random access protocol for massive mimo strongest user collision resolution sucr"
    - "massive mimo for crowd scenarios a solution based on random access"
    - "coded random access how coding theory helps to build random access protocols"
    - "exploiting capture effect in frameless aloha for massive wireless random access"
    - "five disruptive technology directions for 5g"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"

Connected through hyperedge HE-3 (induced by source paper "massive mimo for crowd scenarios a solution based on random access"):
  with members:
    - "five disruptive technology directions for 5g"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"
    - "frameless aloha protocol for wireless networks"
    - "pilot contamination and precoding in multi cell tdd systems"

Connected through hyperedge HE-4 (induced by source paper "coded splitting tree protocols"):
  with members:
    - "frameless aloha protocol for wireless 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)