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 "scheduling of multicast and unicast services under limited feedback by using rateless codes"):
  Abstract: Many opportunistic scheduling techniques are impractical because they require accurate channel state information (CSI) at the transmitter. In this paper, we investigate the scheduling of unicast and multicast services in a downlink network with a very limited amount of feedback information. Specifically, unicast users send imperfect (or no) CSI and infrequent acknowledgements (ACKs) to a base station, and multicast users only report infrequent ACKs to avoid feedback implosion. We consider the use of physical-layer rateless codes, which not only combats channel uncertainty, but also reduces the overhead of ACK feedback. A joint scheduling and power allocation scheme is developed to realize multiuser diversity gain for unicast service and multicast gain for multicast service. We prove that our scheme achieves a near-optimal throughput region. Our simulation results show that our scheme significantly improves the network throughput over schemes employing fixed-rate codes or using only unicast communications.

Includes members:
  Member "network control without csi using rateless codes for downlink cellular systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constant delay and constant feedback moving window network coding for wireless multicast design and asymptotic analysis")
  Member "multiuser scheduling in a markov modeled downlink using randomly delayed arq feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sequential decision making with limited observation capability application to wireless networks")
  Member "de randomizing shannon the design and analysis of a capacity achieving rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "expansion coding for channel and source coding")
  Member "throughput of rateless codes over broadcast erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "high throughput low delay wireless multicast via multi channel moving window codes")
  Member "asymptotically optimal downlink scheduling over markovian fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constrained restless bandits for dynamic scheduling in cyber physical systems")
  Member "throughput delay analysis of random linear network coding for wireless broadcasting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "delay complexity trade off of random linear network coding in wireless broadcast")
  Member "zero rate feedback can achieve the empirical capacity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning an adversary s actions for secret communication")

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)