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: "approximating max min linear programs with local algorithms"
  Abstract: A local algorithm is a distributed algorithm where each node must operate solely based on the information that was available at system startup within a constant-size neighbourhood of the node. We study the applicability of local algorithms to max-min LPs where the objective is to maximise mink Sigmav CkvXv subject to Sigmav alphaivXv les 1 far each i and Xv ges 0 far each v. Here ckv ges 0, and the support sets Vi = {v : alphaiv> 0}, Vk = {v : ckv > 0}, Iv = {i: alphaiv > 0} and Kv = {k : Ckv > 0} have bounded size. In the distributed setting, each agent v is responsible for choosing the value of Xv, and the communication network is a hypergraph H where the sets Vk and Vi constitute the hyperedges. We present inapproximability results for a wide range of structural assumptions; for example, even if |Vi| and |Vk| are bounded by some constants larger than 2, there is no local approximation scheme. To contrast the negative results, we present a local approximation algorithm which achieves good approximation ratios if we can bound the relative growth of the vertex neighbourhoods in H.

Connected through hyperedge HE-1 (induced by source paper "fast distributed algorithms for lp type problems of bounded dimension"):
  with members:
    - "optimal gossip algorithms for exact and approximate quantile computations"
    - "analyzing network coding gossip made easy"
    - "local computation lower and upper bounds"
    - "violator spaces structure and algorithms"

Connected through hyperedge HE-2 (induced by source paper "weak models of distributed computing with connections to modal logic"):
  with members:
    - "lower bounds for local approximation"
    - "beeping a maximal independent set"
    - "stone age distributed computing"
    - "almost stable matchings by truncating the gale shapley algorithm"
    - "local algorithms in weakly coloured graphs"
    - "deploying wireless networks with beeps"
    - "an optimal local approximation algorithm for max min linear programs"
    - "a simple local 3 approximation algorithm for vertex cover"

Connected through hyperedge HE-3 (induced by source paper "an optimal local approximation algorithm for max min linear programs"):
  with members:
    - "local approximation algorithms for a class of 0 1 max min linear programs"
    - "tight local approximation results for max min linear programs"
    - "sequential and parallel algorithms for mixed packing and covering"

Connected through hyperedge HE-4 (induced by source paper "a simple local 3 approximation algorithm for vertex cover"):
  with members:
    - "tight local approximation results for max min linear programs"

Connected through hyperedge HE-5 (induced by source paper "tight local approximation results for max min linear programs"):
  with members:
    - "an optimal local approximation algorithm for max min linear programs"
    - "local approximation algorithms for a class of 0 1 max min linear programs"

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.DC(Distributed, Parallel, and Cluster Computing)