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: "shale an efficient algorithm for allocation of guaranteed display advertising"
  Abstract: Motivated by the problem of optimizing allocation in guaranteed display advertising, we develop an efficient, lightweight method of generating a compact {\em allocation plan} that can be used to guide ad server decisions. The plan itself uses just O(1) state per guaranteed contract, is robust to noise, and allows us to serve (provably) nearly optimally. The optimization method we develop is scalable, with a small in-memory footprint, and working in linear time per iteration. It is also "stop-anytime", meaning that time-critical applications can stop early and still get a good serving solution. Thus, it is particularly useful for optimizing the large problems arising in the context of display advertising. We demonstrate the effectiveness of our algorithm using actual Yahoo! data.

Connected through hyperedge HE-1 (induced by source paper "pricing average price advertising options when underlying spot market prices are discontinuous"):
  with members:
    - "risk aware dynamic reserve prices of programmatic guarantee in display advertising"
    - "a dynamic pricing model for unifying programmatic guarantee and real time bidding in display advertising"
    - "a lattice framework for pricing display advertisement options with the stochastic volatility underlying model"
    - "real time bidding for online advertising measurement and analysis"
    - "multi keyword multi click advertisement option contracts for sponsored search"
    - "sequential selection of correlated ads by pomdps"

Connected through hyperedge HE-2 (induced by source paper "combining guaranteed and spot markets in display advertising selling guaranteed page views with stochastic demand"):
  with members:
    - "pricing average price advertising options when underlying spot market prices are discontinuous"
    - "risk aware dynamic reserve prices of programmatic guarantee in display advertising"
    - "ad exchange envy free auctions with mediators"
    - "efficient delivery policy to minimize user traffic consumption in guaranteed advertising"
    - "combining spot and futures markets a hybrid market approach to dynamic spectrum access"
    - "a dynamic pricing model for unifying programmatic guarantee and real time bidding in display advertising"
    - "a lattice framework for pricing display advertisement options with the stochastic volatility underlying model"
    - "multi keyword multi click advertisement option contracts for sponsored search"

Connected through hyperedge HE-3 (induced by source paper "risk aware dynamic reserve prices of programmatic guarantee in display advertising"):
  with members:
    - "a dynamic pricing model for unifying programmatic guarantee and real time bidding in display advertising"
    - "a lattice framework for pricing display advertisement options with the stochastic volatility underlying model"
    - "multi keyword multi click advertisement option contracts for sponsored search"
    - "bidding for representative allocations for display advertising"

Connected through hyperedge HE-4 (induced by source paper "efficient delivery policy to minimize user traffic consumption in guaranteed advertising"):
  with members:
    - "a dynamic pricing model for unifying programmatic guarantee and real time bidding in display advertising"
    - "ad serving using a compact allocation plan"
    - "bidding for representative allocations for display advertising"
    - "online stochastic matching beating 1 1 e"

Connected through hyperedge HE-5 (induced by source paper "online budgeted allocation with general budgets"):
  with members:
    - "fast algorithms for online stochastic convex programming"
    - "online vertex weighted bipartite matching and single bid budgeted allocations"
    - "bidding for representative allocations for display advertising"

Connected through hyperedge HE-6 (induced by source paper "a dynamic pricing model for unifying programmatic guarantee and real time bidding in display advertising"):
  with members:
    - "real time bidding for online advertising measurement and analysis"
    - "multi keyword multi click advertisement option contracts for sponsored search"
    - "sequential selection of correlated ads by pomdps"
    - "bidding for representative allocations for display advertising"

Connected through hyperedge HE-7 (induced by source paper "value of targeting"):
  with members:
    - "optimal mechanisms for selling information"
    - "bidding for representative allocations for display advertising"

Connected through hyperedge HE-8 (induced by source paper "multi keyword multi click advertisement option contracts for sponsored search"):
  with members:
    - "a dynamic pricing model for unifying programmatic guarantee and real time bidding in display advertising"
    - "a lattice framework for pricing display advertisement options with the stochastic volatility underlying model"
    - "sequential selection of correlated ads by pomdps"
    - "bidding for representative allocations for display advertising"

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)