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: "prometheus lt codes meet cooperative transmission in cellular networks"
  Abstract: Following fast growth of cellular networks, more users have drawn attention to the contradiction between dynamic user data traffic and static data plans. To address this important but largely unexplored issue, in this paper, we design a new data plan sharing system named Prometheus, which is based on the scenario that some smartphone users have surplus data traffic and are willing to help others download data. To realize this system, we first propose a mechanism that incorporates LT codes into UDP. It is robust to transmission errors and encourages more concurrent transmissions and forwardings. It also can be implemented easily with low implementation complexity. Then we design an incentive mechanism using a Stackelberg game to choose assistant users ($AUs$), all participants will gain credits in return, which can be used to ask for future help when they need to download something. Finally real environment experiments are conducted and the results show that users in our Prometheus not only can manage their surplus data plan more efficiently, but also achieve a higher speed download rate.

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.NI(Networking and Internet Architecture)