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 "adaptive csma under the sinr model efficient approximation algorithms for throughput and utility maximization"):
  Abstract: We consider a CSMA based scheduling algorithm for a single-hop wireless network under a realistic SINR model for the interference. We propose two local optimization based approximation algorithms to efficiently estimate certain attempt rate parameters of CSMA called fugacities. It is known that adaptive CSMA can achieve throughput optimality by sampling feasible schedules from a Gibbs distribution, with appropriate fugacities. Unfortunately, obtaining these optimal fugacities is an NP-hard problem. Further, the existing adaptive CSMA algorithms use a stochastic gradient descent based method, which usually entails an impractically slow (exponential in the size of the network) convergence to the optimal fugacities. To address this issue, we first propose an algorithm to estimate the fugacities, that can support a given set of desired service rates. The convergence rate and the complexity of this algorithm are independent of the network size, and depend only on the neighborhood size of a link. Further, we show that the proposed algorithm corresponds exactly to performing the well-known Bethe approximation to the underlying Gibbs distribution. Then, we propose another local algorithm to estimate the optimal fugacities under a utility maximization framework, and characterize its accuracy. Numerical results indicate that the proposed methods have a good degree of accuracy, and achieve extremely fast convergence to near-optimal fugacities, and often outperform the convergence rate of the stochastic gradient descent by a few orders of magnitude.

Includes members:
  Member "spatial csma a distributed scheduling algorithm for the sir model with time varying channels":
    also connected through other hyperedges:
      (none)
  Member "how well can graphs represent wireless interference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "introduction to local certification")
  Member "exploiting the past to reduce delay in csma scheduling a high order markov chain approach":
    also connected through other hyperedges:
      (none)
  Member "loopy belief propagation for approximate inference an empirical study":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "adaptive spatial aloha fairness and stochastic geometry":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximum sum rate of slotted aloha with capture")
  Member "applications of belief propagation in csma wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient csma using regional free energy approximations")
  Member "fast mixing of parallel glauber dynamics and low delay csma scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "distributed random access algorithm scheduling and congesion control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards a queueing based framework for in network function computation")

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)