human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "age of information for multicast transmission with fixed and random deadlines in iot systems"
  Abstract: In this paper, we consider the multicast transmission of a real-time Internet of Things (IoT) system, where an access point (AP) transmits time-stamped status updates to multiple IoT devices. Different from the existing studies that only considered multicast transmission without deadlines, we enforce a deadline for the service time of each multicast status update, taking into account both the fixed and randomly distributed deadlines. In particular, a status update is dropped when either its deadline expires or it is successfully received by a certain number of IoT devices. Considering deadlines is important for many emerging IoT applications, where the outdated status updates are of no use to IoT devices. We evaluate the timeliness of the status update delivery by applying a recently proposed metric, named the age of information (AoI), which is defined as the time elapsed since the generation of the most recently received status update. After deriving the distributions of the service time for all possible reception outcomes at IoT devices, we manage to obtain the closed-form expressions of both the average AoI and the average peak AoI. Simulations validate the performance analysis, which reveals that the multicast transmission with deadlines achieves a lower average AoI than that without deadlines and there exists an optimal value of the deadline that can minimize the average (peak) AoI. Results also show that the fixed and random deadlines have respective advantages in different deadline regimes.

Question: Please tell me which class the center node 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)