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: "the second price knapsack problem near optimal real time bidding in internet advertisement"
  Abstract: In the past decade, Real Time Bidding (RTB) has become one of the most common purchase mechanisms of the online advertisement market. Under RTB a unique second-price auction between bidders is managed for every individual advertisement slot. We consider the bidder's problem of maximizing the value of the bundle of ads they purchase, subject to budget constraints, and assuming the value of each ad is known. We generalize the problem as a \textbf{second-price knapsack problem} with uncertain resource consumption: the bidder wins an auction when they bid the highest amount, but they pay an amount equal to the second-highest bid, unknown a priori. Surprisingly, because of the second-price mechanism, we prove that a linear form of bidding yields a near-optimal selection of ads. We extend to an implementable online one-shot learning algorithm. We prove that key points of the random permutation assumption hold in this setting, and that we can apply algorithms for the online-knapsack problem to this setting. Through this we recover a competitive ratio of $1-6\epsilon$, where $\epsilon$ is the training ratio and is small in general, yielding a strong theoretical result on an important variation of the standard online knapsack problem. Numerical results from the iPinYou dataset verify our results, recovering a bundle of ads with 99.5% - 100.0% of the optimal value.

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)