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: "adcell ad allocation in cellular networks"
  Abstract: With more than four billion usage of cellular phones worldwide, mobile advertising has become an attractive alternative to online advertisements. In this paper, we propose a new targeted advertising policy for Wireless Service Providers (WSPs) via SMS or MMS- namely {\em AdCell}. In our model, a WSP charges the advertisers for showing their ads. Each advertiser has a valuation for specific types of customers in various times and locations and has a limit on the maximum available budget. Each query is in the form of time and location and is associated with one individual customer. In order to achieve a non-intrusive delivery, only a limited number of ads can be sent to each customer. Recently, new services have been introduced that offer location-based advertising over cellular network that fit in our model (e.g., ShopAlerts by AT&T) . #R##N#We consider both online and offline version of the AdCell problem and develop approximation algorithms with constant competitive ratio. For the online version, we assume that the appearances of the queries follow a stochastic distribution and thus consider a Bayesian setting. Furthermore, queries may come from different distributions on different times. This model generalizes several previous advertising models such as online secretary problem \cite{HKP04}, online bipartite matching \cite{KVV90,FMMM09} and AdWords \cite{saberi05}. ...

Connected through hyperedge HE-1 (induced by source paper "beating 1 frac 1 e for ordered prophets"):
  with members:
    - "descending price optimally coordinates search"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "combinatorial auctions via posted prices"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "matroid prophet inequalities"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "mechanism design via correlation gap"
    - "online stochastic matching beating 1 1 e"

Connected through hyperedge HE-2 (induced by source paper "stochastic k server how should uber work"):
  with members:
    - "beating 1 frac 1 e for ordered prophets"
    - "a polylogarithmic competitive algorithm for the k server problem"
    - "better algorithms for unfair metrical task systems and applications"
    - "truly online paging with locality of reference"
    - "competitive paging algorithms"

Connected through hyperedge HE-3 (induced by source paper "online degree bounded steiner network design"):
  with members:
    - "online stochastic matching beating 1 1 e"
    - "bicriteria network design problems"

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)