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: "lifetime based memory management for distributed data processing systems"
  Abstract: In-memory caching of intermediate data and eager combining of data in shuffle buffers have been shown to be very effective in minimizing the re-computation and I/O cost in distributed data processing systems like Spark and Flink. However, it has also been widely reported that these techniques would create a large amount of long-living data objects in the heap, which may quickly saturate the garbage collector, especially when handling a large dataset, and hence would limit the scalability of the system. To eliminate this problem, we propose a lifetime-based memory management framework, which, by automatically analyzing the user-defined functions and data types, obtains the expected lifetime of the data objects, and then allocates and releases memory space accordingly to minimize the garbage collection overhead. In particular, we present Deca, a concrete implementation of our proposal on top of Spark, which transparently decomposes and groups objects with similar lifetimes into byte arrays and releases their space altogether when their lifetimes come to an end. An extensive experimental study using both synthetic and real datasets shows that, in comparing to Spark, Deca is able to 1) reduce the garbage collection time by up to 99.9%, 2) to achieve up to 22.7x speed up in terms of execution time in cases without data spilling and 41.6x speedup in cases with data spilling, and 3) to consume up to 46.6% less memory.

Connected through hyperedge HE-1 (induced by source paper "efficient memory management for gpu based deep learning systems"):
  with members:
    - "training wide residual networks for deployment using a single bit for each weight"
    - "superneurons dynamic gpu memory management for training deep neural networks"
    - "ease ml towards multi tenant resource sharing for machine learning workloads"
    - "memory efficient implementation of densenets"
    - "comparative study of deep learning software frameworks"
    - "database meets deep learning challenges and opportunities"
    - "eie efficient inference engine on compressed deep neural network"
    - "training deep nets with sublinear memory cost"

Connected through hyperedge HE-2 (induced by source paper "pangea monolithic distributed storage for data analytics"):
  with members:
    - "plinycompute a platform for high performance distributed data intensive tool development"
    - "tensorflow large scale machine learning on heterogeneous distributed systems"
    - "efficient analysis of caching strategies under dynamic content popularity"
    - "xoring elephants novel erasure codes for big data"
    - "interactive analytical processing in big data systems a cross industry study of mapreduce workloads"
    - "the k server dual and loose competitiveness for paging"

Connected through hyperedge HE-3 (induced by source paper "plinycompute a platform for high performance distributed data intensive tool development"):
  with members:
    - "generating custom code for efficient query execution on heterogeneous processors"
    - "flare native compilation for heterogeneous workloads in apache spark"
    - "building efficient query engines in a high level language"
    - "tensorflow large scale machine learning on heterogeneous distributed systems"
    - "mllib machine learning in apache spark"

Connected through hyperedge HE-4 (induced by source paper "ng2c pretenuring n generational gc for hotspot big data applications"):
  with members:
    - "m3r increased performance for in memory hadoop jobs"

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)