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 "minimizing the age of information in a csma environment"):
  Abstract: In this paper, we investigate a network of N interfering links contending for the channel to send their data by employing the well-known Carrier Sense Multiple Access (CSMA) scheme. By leveraging the notion of stochastic hybrid systems, we find a closed form of the total average age of the network in this setting. Armed with this expression, we formulate the optimization problem of minimizing the total average age of the network by calibrating the back-off time of each link. By analyzing its structure, the optimization problem is then converted to an equivalent convex problem that can be solved efficiently to find the optimal back-off time of each link. Insights on the interaction between the links is provided and numerical implementations of our optimized CSMA scheme in an IEEE 802.11 environment is presented to highlight its performance. We also show that, although optimized, the standard CSMA scheme still lacks behind other distributed schemes in terms of average age in some special cases. These results suggest the necessity to find new distributed schemes to further minimize the average age of any general network.

Includes members:
  Member "age of information in a network of preemptive servers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis on computation intensive status update in mobile edge computing")
  Member "timely status update in massive iot systems decentralized scheduling for wireless uplinks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "distributed scheduling algorithms for optimizing information freshness in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age minimal online policies for energy harvesting sensors with random battery recharges":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who should google scholar update more often")
  Member "the age of updates in a simple relay network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "multicast with prioritized delivery how fresh is your data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "partial updates losing information for freshness")
  Member "content based status updates":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "age optimal information updates in multihop networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")

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)