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: "online submodular welfare maximization greedy is optimal"
  Abstract: We prove that no online algorithm (even randomized, against an oblivious adversary) is better than 1/2-competitive for welfare maximization with coverage valuations, unless $NP = RP$. Since the Greedy algorithm is known to be 1/2-competitive for monotone submodular valuations, of which coverage is a special case, this proves that Greedy provides the optimal competitive ratio. On the other hand, we prove that Greedy in a stochastic setting with i.i.d.items and valuations satisfying diminishing returns is $(1-1/e)$-competitive, which is optimal even for coverage valuations, unless $NP=RP$. For online budget-additive allocation, we prove that no algorithm can be 0.612-competitive with respect to a natural LP which has been used previously for this problem.

Connected through hyperedge HE-1 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints"):
  with members:
    - "submodular streaming in all its glory tight approximation minimum memory and low adaptive complexity"
    - "do less get more streaming submodular maximization with subsampling"
    - "beyond 1 2 approximation for submodular maximization on massive data streams"
    - "streaming non monotone submodular maximization personalized video summarization on the fly"
    - "online submodular welfare maximization greedy beats 1 2 in random order"
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "constrained submodular maximization beyond 1 e"
    - "the power of randomization distributed submodular maximization on massive datasets"

Connected through hyperedge HE-2 (induced by source paper "making a sieve random improved semi streaming algorithm for submodular maximization under a cardinality constraint"):
  with members:
    - "deterministic 1 2 epsilon approximation for submodular maximization over a matroid"
    - "online submodular maximization beating 1 2 made simple"
    - "do less get more streaming submodular maximization with subsampling"
    - "streaming non monotone submodular maximization personalized video summarization on the fly"
    - "online submodular welfare maximization greedy beats 1 2 in random order"
    - "constrained submodular maximization beyond 1 e"
    - "streaming algorithms for submodular function maximization"
    - "online submodular maximization with preemption"

Connected through hyperedge HE-3 (induced by source paper "maximizing welfare in social networks under a utility driven influence diffusion model"):
  with members:
    - "beyond worst case in approximability of nonsubmodular influence maximization"
    - "an issue in the martingale analysis of the influence maximization algorithm imm"
    - "online submodular welfare maximization greedy beats 1 2 in random order"
    - "stop and stare optimal sampling algorithms for viral marketing in billion scale networks"
    - "inferring networks of substitutable and complementary products"
    - "combining traditional marketing and viral marketing with amphibious influence maximization"
    - "from competition to complementarity comparative influence diffusion and maximization"
    - "influence maximization near optimal time complexity meets practical efficiency"

Connected through hyperedge HE-4 (induced by source paper "near optimal online algorithms and fast approximation algorithms for resource allocation problems"):
  with members:
    - "fast algorithms for online stochastic convex programming"
    - "primal beats dual on online packing lps in the random order model"
    - "selective call out and real time bidding"
    - "online stochastic matching online actions based on offline statistics"
    - "online stochastic packing applied to display ad allocation"
    - "a dynamic near optimal algorithm for online linear programming"
    - "online stochastic matching beating 1 1 e"
    - "randomized rounding without solving the linear program"

Connected through hyperedge HE-5 (induced by source paper "online submodular maximization beating 1 2 made simple"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "deterministic 1 2 epsilon approximation for submodular maximization over a matroid"
    - "beyond 1 2 approximation for submodular maximization on massive data streams"
    - "online submodular welfare maximization greedy beats 1 2 in random order"
    - "online matroid intersection beating half for random arrival"
    - "lazier than lazy greedy"
    - "maximum matching in semi streaming with few passes"
    - "online vertex weighted bipartite matching and single bid budgeted allocations"

Connected through hyperedge HE-6 (induced by source paper "submodular secretary problem with shortlists"):
  with members:
    - "online submodular maximization beating 1 2 made simple"
    - "the submodular secretary problem under a cardinality constraint and with limited resources"
    - "online submodular welfare maximization greedy beats 1 2 in random order"
    - "submodular secretary problems cardinality matching and linear constraints"
    - "the submodular secretary problem goes linear"
    - "lazier than lazy greedy"
    - "submodular maximization meets streaming matchings matroids and more"
    - "online stochastic packing applied to display ad allocation"

Connected through hyperedge HE-7 (induced by source paper "maximizing monotone dr submodular continuous functions by derivative free optimization"):
  with members:
    - "optimal algorithms for continuous non monotone submodular and dr submodular maximization"
    - "gradient methods for submodular maximization"
    - "continuous dr submodular maximization structure and algorithms"
    - "robust budget allocation via continuous submodular functions"
    - "submodular optimization under noise"
    - "guaranteed non convex optimization submodular maximization over continuous domains"
    - "submodular functions from discrete to continous domains"
    - "maximizing monotone submodular functions over the integer lattice"

Connected through hyperedge HE-8 (induced by source paper "online submodular welfare maximization greedy beats 1 2 in random order"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "randomized composable core sets for distributed submodular maximization"
    - "bayesian sequential auctions"
    - "geometry of online packing linear programs"
    - "composable and efficient mechanisms"
    - "sequential auctions and externalities"
    - "online vertex weighted bipartite matching and single bid budgeted allocations"
    - "online stochastic matching online actions based on offline statistics"

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.DS(Data Structures and Algorithms)