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 "asymptotically optimal scheduling for compute and forward"):
  Abstract: Consider a Compute and Forward (CF) relay network with $L$ users and a single relay. The relay tries to decode a linear function of the transmitted signals. For such a network, letting all $L$ users transmit simultaneously, especially when $L$, is large causes a significant degradation in the rate the relay is able to decode. In fact, it goes to zero very fast with $L$. Therefore, in each transmission phase only a fixed number of users should transmit, i.e., \emph{users should be scheduled.} #R##N#In this work, we provide an asymptotically optimal, polynomial time scheduling algorithm for CF. We show that scheduling under CF not only guarantees non-zero rate, it provides a gain in the system sum-rate, up to the optimal scaling law of $O(\log{\log{L}})$. We do this by first fixing a good, yet sub-optimal, coefficients vector, and devising a polynomial time algorithm to find a sub-set of the users whose channel gains matches the vector. We then prove that this choice is asymptotically optimal.

Includes members:
  Member "the necessity of scheduling in compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private information retrieval over gaussian mac")
  Member "compute and forward finding the best equation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low complexity coefficient selection algorithms for compute and forward")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private information retrieval over gaussian mac")
  Member "compute and forward strategies for cooperative distributed antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private information retrieval over gaussian mac")
  Member "integer forcing linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval over gaussian mac")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private information retrieval over gaussian mac")

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)