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: "an economic based analysis of ranking for online bipartite matching"
  Abstract: We give a simple proof showing that the RANKING algorithm introduced by Karp, Vazirani and Vazirani \cite{DBLP:conf/stoc/KarpVV90} is $1-\frac{1}{e}$ competitive for the online bipartite matching problem. Our proof resembles the proof given by Devanur, Jain and Kleinberg [2013], but does not make an explicit use of linear programming duality; instead, it is based on an economic interpretation of the matching problem. In our interpretation, one set of vertices represent items that are assigned prices, and the other set of vertices represent unit-demand buyers that arrive sequentially and choose their most-demanded items.

Connected through hyperedge HE-1 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models"):
  with members:
    - "beating greedy for stochastic bipartite matching"
    - "online stochastic matching with edge arrivals"
    - "optimal single choice prophet inequalities from samples"
    - "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint"
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "prophet inequality for bipartite matching merits of being simple and non adaptive"
    - "tight competitive ratios of classic matching algorithms in the fully online model"
    - "how to match when all vertices arrive online"

Connected through hyperedge HE-2 (induced by source paper "tight bounds for online edge coloring"):
  with members:
    - "online matching with general arrivals"
    - "tight competitive ratios of classic matching algorithms in the fully online model"
    - "how to match when all vertices arrive online"
    - "tighter bounds for online bipartite matching"
    - "deterministic distributed edge coloring with fewer colors"
    - "dynamic algorithms for graph coloring"
    - "deterministic distributed edge coloring via hypergraph maximal matching"
    - "online lower bounds via duality"

Connected through hyperedge HE-3 (induced by source paper "online matching with general arrivals"):
  with members:
    - "tight bounds for online edge coloring"
    - "tight competitive ratios of classic matching algorithms in the fully online model"
    - "how to match when all vertices arrive online"
    - "online vertex weighted bipartite matching beating 1 1 e with random arrivals"
    - "tighter bounds for online bipartite matching"
    - "online lower bounds via duality"
    - "maximum matching on trees in the online preemptive and the incremental dynamic graph models"
    - "online matroid intersection beating half for random arrival"

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.GT(Computer Science and Game Theory)