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: "on optimal proactive and retention aware caching with user mobility"
  Abstract: Caching popular contents at edge devices is an effective solution to alleviate the burden of the backhaul networks. Earlier investigations commonly neglected the storage cost in caching. More recently, retention-aware caching, where both the downloading cost and storage cost are accounted for, is attracting attention. Motivated by this, we address proactive and retention-aware caching with user mobility, optimizing the sum of the two types of costs. This is a combinatorial optimization problem. However, we derive a stream of analytical results and they together lead to an algorithm that guarantees global optimum with polynomial-time complexity. Numerical results show significant improvements in comparison to popular caching and random caching.

Connected through hyperedge HE-1 (induced by source paper "optimal scheduling of content caching subject to deadline"):
  with members:
    - "caching at base stations with heterogeneous user demands and spatial locality"
    - "a rolling horizon dynamic programming approach for collaborative caching"
    - "accounting for information freshness in scheduling of content caching"
    - "using grouped linear prediction and accelerated reinforcement learning for online content caching"
    - "caching with time varying popularity profiles a learning theoretic perspective"
    - "optimal geographic caching in cellular networks with linear content coding"
    - "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches"
    - "a learning based approach to caching in heterogenous small cell networks"

Connected through hyperedge HE-2 (induced by source paper "accounting for information freshness in scheduling of content caching"):
  with members:
    - "dynamic content updates in heterogeneous wireless networks"
    - "age of information aware cache updating with file and age dependent update durations"
    - "using grouped linear prediction and accelerated reinforcement learning for online content caching"
    - "caching with time varying popularity profiles a learning theoretic perspective"
    - "optimal geographic caching in cellular networks with linear content coding"
    - "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches"
    - "update or wait how to keep your data fresh"
    - "capacity of cellular networks with femtocache"

Connected through hyperedge HE-3 (induced by source paper "bs assisted task offloading for d2d networks with presence of user mobility"):
  with members:
    - "multi user multi task offloading and resource allocation in mobile cloud systems"
    - "a survey on mobile edge networks convergence of computing caching and communications"
    - "a survey on mobile edge computing the communication perspective"
    - "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches"

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.DC(Distributed, Parallel, and Cluster Computing)