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: "a novel mobile data contract design with time flexibility"
  Abstract: In conventional mobile data plans, the data is associated with a fixed period (e.g., one month) and the unused data will be cleared at the end of each period. To take advantage of consumers' heterogeneous demands across different periods and meanwhile to provide more time flexibility, some mobile data service providers (SP) have offered data plans with different lengths of period. In this paper, we consider the data plan design problem for a single SP, who provides data plans with different lengths of period for consumers with different characteristics of data demands. We propose a contract-theoretic approach, wherein the SP offers a period-price data plan contract which consists of a set of period and price combinations, indicating the prices for data with different periods. We study the optimal data plan contract designs under two different models: discrete and continuous consumer-type models, depending on whether the consumer type is discrete or continuous. In the former model, each type of consumers are assigned with a specific period-price combination. In the latter model, the consumers are first categorized into a finite number of groups, and each group of consumers (possibly with different types) are assigned with a specific period-price combination. We systematically analyze the incentive compatibility (IC) constraint and individual rationality (IR) constraint, which ensure each consumer to choose the data plan with the period-price combination intended for his type. We further derive the optimal contract that maximizes the SP's expected profit, meanwhile satisfying the IC and IR constraints of consumers. Our numerical results show that the proposed optimal contract can increase the SP's profit by 35%, comparing with the conventional fixed monthly-period data plan.

Connected through hyperedge HE-1 (induced by source paper "multi cap optimization for wireless data plans with time flexibility"):
  with members:
    - "duopoly competition for mobile data plans with time flexibility"
    - "economic viability of data trading with rollover"
    - "exploring time flexibility in wireless data plans"
    - "on optimal two sided pricing of congested networks"
    - "economic analysis of crowdsourced wireless community networks"
    - "an integrated spectrum and information market for green cognitive communications"
    - "the role of data cap in optimal two part network pricing"
    - "a survey of smart data pricing past proposals current plans and future trends"

Connected through hyperedge HE-2 (induced by source paper "duopoly competition for mobile data plans with time flexibility"):
  with members:
    - "economic viability of data trading with rollover"
    - "exploring time flexibility in wireless data plans"
    - "an integrated spectrum and information market for green cognitive communications"
    - "the role of data cap in optimal two part network pricing"
    - "time and location aware mobile data pricing"
    - "mine gold to deliver green cognitive communications"
    - "economic viability of paris metro pricing for digital services"
    - "a survey of smart data pricing past proposals current plans and future trends"

Connected through hyperedge HE-3 (induced by source paper "economic viability of data trading with rollover"):
  with members:
    - "exploring time flexibility in wireless data plans"
    - "mobile data trading behavioral economics analysis and algorithm design"
    - "time and location aware mobile data pricing"
    - "a survey of smart data pricing past proposals current plans and future trends"

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)