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 "on the trade off between computational load and reliability for network function virtualization"):
  Abstract: Network Function Virtualization (NFV) enables the "softwarization" of network functions, which are implemented on virtual machines hosted on Commercial off-the-shelf (COTS) servers. Both the composition of the virtual network functions (VNFs) into a forwarding graph (FG) at the logical layer and the embedding of the FG on the servers need to take into account the less-than-carrier-grade reliability of COTS components. This work investigates the trade-off between end-to-end reliability and computational load per server via the joint design of VNF chain composition (CC) and FG embedding (FGE) under the assumption of a bipartite FG that consists of controller and regular VNFs. Evaluating the reliability criterion within a probabilistic model, analytical insights are first provided for a simplified disconnected FG. Then, a block coordinate descent method based on mixed-integer linear programming is proposed to tackle the joint optimization of CC and FGE. Via simulation results, it is observed that a joint design of CC and FGE leads to substantial performance gains compared to separate optimization approaches.

Includes members:
  Member "securing virtual network function placement with high availability guarantees":
    also connected through other hyperedges:
      (none)
  Member "network function virtualization state of the art and research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")

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)