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: "inferring uncertain trajectories from partial observations"
  Abstract: The explosion in the availability of GPS-enabled devices has resulted in an abundance of trajectory data. In reality, however, majority of these trajectories are collected at a low sampling rate and only provide partial observations on their actually traversed routes. Consequently, they are mired with uncertainty. In this paper, we develop a technique called Infer Tra to infer uncertain trajectories from network-constrained partial observations. Rather than predicting the most likely route, the inferred uncertain trajectory takes the form of an edge-weighted graph and summarizes all probable routes in a holistic manner. For trajectory inference, Infer Tra employs Gibbs sampling by learning a Network Mobility Model (NMM) from a database of historical trajectories. Extensive experiments on real trajectory databases show that the graph-based approach of Infer Tra is up to 50% more accurate, 20 times faster, and immensely more versatile than state-of-the-art techniques.

Connected through hyperedge HE-1 (induced by source paper "joint modeling of dense and incomplete trajectories for citywide traffic volume inference"):
  with members:
    - "revisiting spatial temporal similarity a deep learning framework for traffic prediction"
    - "how local is the local diversity reinforcing sequential determinantal point processes with dynamic ground sets for supervised video summarization"
    - "deep multi view spatial temporal network for taxi demand prediction"
    - "an attention based collaboration framework for multi view network representation learning"
    - "xgboost a scalable tree boosting system"
    - "adam a method for stochastic optimization"
    - "efficient estimation of word representations in vector space"
    - "distributed representations of words and phrases and their compositionality"

Connected through hyperedge HE-2 (induced by source paper "netclus a scalable framework for locating top k sites for placement of trajectory aware services"):
  with members:
    - "trajectory aware macro cell planning for mobile users"
    - "discovery of convoys in trajectory databases"

Connected through hyperedge HE-3 (induced by source paper "prediction based online trajectory compression"):
  with members:
    - "press a novel framework of trajectory compression in road networks"
    - "on prediction using variable order markov models"

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.DB(Databases)