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 "design and analysis of online fountain codes for intermediate performance"):
  Abstract: For the benefit of improved intermediate performance, recently online fountain codes attract much research attention. However, there is a trade-off between the intermediate performance and the full recovery overhead for online fountain codes, which prevents them to be improved simultaneously. We analyze this trade-off, and propose to improve both of these two performance. We first propose a method called Online Fountain Codes without Build-up phase (OFCNB) where the degree-1 coded symbols are transmitted at first and the build-up phase is removed to improve the intermediate performance. Then we analyze the performance of OFCNB theoretically. Motivated by the analysis results, we propose Systematic Online Fountain Codes (SOFC) to further reduce the full recovery overhead. Theoretical analysis shows that SOFC has better intermediate performance, and it also requires lower full recovery overhead when the channel erasure rate is lower than a constant. Simulation results verify the analyses and demonstrate the superior performance of OFCNB and SOFC in comparison to other online fountain codes.

Includes members:
  Member "fountain codes with nonuniform selection distributions through feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhanced cellular coverage and throughput using rateless codes")
  Member "buffer based distributed lt codes":
    also connected through other hyperedges:
      (none)
  Member "design and analysis of lt codes with decreasing ripple size":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coded pilot access a random access solution for massive mimo systems")

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)