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: "toward optimal coupon allocation in social networks an approximate submodular optimization approach"
  Abstract: CMO Council reports that 71\% of internet users in the U.S. were influenced by coupons and discounts when making their purchase decisions. It has also been shown that offering coupons to a small fraction of users (called seed users) may affect the purchase decisions of many other users in a social network. This motivates us to study the optimal coupon allocation problem, and our objective is to allocate coupons to a set of users so as to maximize the expected cascade. Different from existing studies on influence maximizaton (IM), our framework allows a general utility function and a more complex set of constraints. In particular, we formulate our problem as an approximate submodular maximization problem subject to matroid and knapsack constraints. Existing techniques relying on the submodularity of the utility function, such as greedy algorithm, can not work directly on a non-submodular function. We use $\epsilon$ to measure the difference between our function and its closest submodular function and propose a novel approximate algorithm with approximation ratio $\beta(\epsilon)$ with $\lim_{\epsilon\rightarrow 0}\beta(\epsilon)=1-1/e$. This is the best approximation guarantee for approximate submodular maximization subject to a partition matroid and knapsack constraints, our results apply to a broad range of optimization problems that can be formulated as an approximate submodular maximization problem.

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.SI(Social and Information Networks)