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: "node weighted scheduling"
  Abstract: This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. Our policies are throughput optimal for a large class of arrival processes which satisfy strong-law of large numbers. Given an initial configuration and no further arrivals, our policies drain all packets in the system in the minimal amount of time (providing an online alternative to the batch approach based on Birkhoff-VonNeumann decompositions). We show that it is possible for policies in our class to be throughput optimal even if they are not constrained to be maximal in every time slot. #R##N#Most algorithms for switch scheduling take an edge based approach; in contrast, we focus on scheduling (a large enough set of) the most congested ports. This alternate approach allows for lower-complexity algorithms, and also requires a non-standard technique to prove throughput-optimality. One algorithm in our class, Maximum Vertex-weighted Matching (MVM) has worst-case complexity similar to Max-size Matching, and in simulations shows slightly better delay performance than Max-(edge)weighted-Matching (MWM).

Connected through hyperedge HE-1 (induced by source paper "serenade a parallel randomized algorithm suite for crossbar scheduling in input queued switches"):
  with members:
    - "parallel scheduling algorithm based on complex coloring for input queued switches"
    - "delay based back pressure scheduling in multihop wireless networks"
    - "max product for maximum weight matching convergence correctness and lp duality"
    - "simple distributed weighted matchings"

Connected through hyperedge HE-2 (induced by source paper "user association and interference management in massive mimo hetnets"):
  with members:
    - "performance analysis of massive mimo for cell boundary users"
    - "harmonized cellular and distributed massive mimo load balancing and scheduling"
    - "algorithms for enhanced inter cell interference coordination eicic in lte hetnets"
    - "an overview of load balancing in hetnets old myths and open problems"
    - "optimal user cell association for massive mimo wireless networks"
    - "massive mimo for next generation wireless systems"
    - "what will 5g be"
    - "evolution toward 5g multi tier cellular wireless networks an interference management perspective"

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)