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: "multi resource fairness objectives algorithms and performance"
  Abstract: Designing efficient and fair algorithms for sharing multiple resources between heterogeneous demands is becoming increasingly important. Applications include compute clusters shared by multi-task jobs and routers equipped with middleboxes shared by flows of different types. We show that the currently preferred objective of Dominant Resource Fairness has a significantly less favorable efficiency-fairness tradeoff than alternatives like Proportional Fairness and our proposal, Bottleneck Max Fairness. In addition to other desirable properties, these objectives are equally strategyproof in any realistic scenario with dynamic demand.

Connected through hyperedge HE-1 (induced by source paper "elastic multi resource network slicing can protection lead to improved performance"):
  with members:
    - "an axiomatic theory of fairness in network resource allocation"

Connected through hyperedge HE-2 (induced by source paper "width independence beyond linear objectives distributed fair packing and covering algorithms"):
  with members:
    - "solving packing and covering lps in tilde o frac 1 epsilon 2 distributed iterations with a single algorithm and simpler analysis"
    - "fairness in machine learning lessons from political philosophy"
    - "a fast distributed stateless algorithm for alpha fair packing problems"
    - "using optimization to break the epsilon barrier a faster and simpler width independent algorithm for solving positive linear programs in parallel"
    - "approximating the exponential the lanczos method and an tilde o m time spectral algorithm for balanced separator"
    - "an axiomatic theory of fairness in network resource allocation"
    - "sequential and parallel algorithms for mixed packing and covering"

Connected through hyperedge HE-3 (induced by source paper "a fast distributed stateless algorithm for alpha fair packing problems"):
  with members:
    - "max min fair rate allocation and routing in energy harvesting networks algorithmic analysis"
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "using optimization to break the epsilon barrier a faster and simpler width independent algorithm for solving positive linear programs in parallel"
    - "on line end to end congestion control"
    - "sequential and parallel algorithms for mixed packing and covering"
    - "congestion control with explicit rate indication"

Connected through hyperedge HE-4 (induced by source paper "multi resource fair allocation with bounded number of tasks in cloud computing systems"):
  with members:
    - "enhanced cluster computing performance through proportional fairness"
    - "dominant resource fairness in cloud computing systems with heterogeneous servers"
    - "fair allocation without trade"
    - "no justified complaints on fair sharing of multiple resources"

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)