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 "optimizing information freshness using low power status updates via sleep wake scheduling"):
  Abstract: In this paper, we consider the problem of optimizing the freshness of status updates that are sent from a large number of low-power source nodes to a common access point. The source nodes utilize carrier sensing to reduce collisions and adopt an asychronized sleep-wake strategy to achieve an extended battery lifetime (e.g., 10-25 years). We use age of information (AoI) to measure the freshness of status updates, and design the sleep-wake parameters for minimizing the weighted-sum peak AoI of the sources, subject to per-source battery lifetime constraints. When the sensing time is zero, this sleep-wake design problem can be solved by resorting to nested convex optimization; however, for positive sensing times, the problem is non-convex. We devise a low-complexity solution to solve this problem and prove that, for practical sensing times, the solution is within a small gap from the optimum AoI performance. Our numerical and NS-3 simulation results show that our solution can indeed elongate the batteries lifetime of information sources, while providing a competitive AoI performance.

Includes members:
  Member "fundamental limits of many user mac with finite payloads and fading":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "broadcast age of information in csma ca based wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "age of information for multicast transmission with fixed and random deadlines in iot systems")
  Member "energy efficient coded random access for the wireless uplink":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "massive access for future wireless communication systems")
  Member "minimizing the age of information in a csma environment":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "age optimal updates of multiple information flows":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who should google scholar update more often")
  Member "timely status update in massive iot systems decentralized scheduling for wireless uplinks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the optimality of the whittle s index policy for minimizing the age of information")
  Member "sampling for data freshness optimization non linear age functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")

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)