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 "wireless scheduling with dominant interferers and applications to femtocellular interference cancellation"):
  Abstract: We consider a general class of wireless scheduling and resource allocation problems where the received rate in each link is determined by the actions of the transmitter in that link along with a single dominant interferer. Such scenarios arise in a range of scenarios, particularly in emerging femto- and picocellular networks with strong, localized interference. For these networks, a utility maximizing scheduler based on loopy belief propagation is presented that enables computationally-efficient local processing and low communication overhead. Our main theoretical result shows that the fixed points of the method are provably globally optimal for arbitrary (potentially non-convex) rate and utility functions. The methodology thus provides globally optimal solutions to a large class of inter-cellular interference coordination problems including subband scheduling, dynamic orthogonalization and beamforming whenever the dominant interferer assumption is valid. The paper focuses on applications for systems with interference cancellation (IC) and suggests a new scheme on optimal rate control, as opposed to traditional power control. Simulations are presented in industry standard femtocellular network models demonstrate significant improvements in rates over simple reuse 1 without IC, and near optimal performance of loopy belief propagation for rate selection in only one or two iterations.

Includes members:
  Member "belief propagation methods for intercell interference coordination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hybrid approximate message passing")
  Member "femto macro cellular interference control with subband scheduling and interference cancelation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transmit power minimization in small cell networks under time average qos constraints")
  Member "max product for maximum weight matching convergence correctness and lp duality":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "my fair bandit distributed learning of max min fairness with multi player bandits")
  Member "femtocell networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust resource allocation for pd noma based miso heterogeneous networks with comp technology")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)