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: "efficient single writer concurrency"
  Abstract: Most research in concurrency focuses on providing safety and liveness guarantees under the worst possible conditions. However, workloads of many important concurrent applications are much less adversarial, leaving room for optimizations for the common case. In this paper, we focus on single writer multiple reader concurrency, where any number of transactions can atomically access shared data structures, but only one thread can atomically commit new versions. The single-writer setup is particularly applicable to search indices, online graph analysis, and hybrid transactional/analytical processing (HTAP) databases, in which there can be a continuous stream of updates handled by one thread, but the bulk of the work is done by transactions that analyze the data. #R##N#Our approach is based on a variant of multiversion concurrency control. We define the \emph{version maintenance problem}, which gives a framework that allows for very low overhead in maintaining and collecting multiple versions of a database. We then present provably efficient, low-contention lock-free and wait-free algorithms that solve it, and show how these solutions can be used to develop a transactional memory. We believe that the version maintenance problem could be of independent interest. #R##N#Focusing on single writer workloads allows us to achieve strong properties, some of which are not achievable with multiple writers. In particular, we develop a transactional memory that in addition to guaranteeing strict serializability and safe and precise garbage collection, guarantees wait-free write transactions, and delay-free read transactions---i.e., the number of steps taken is independent of the number of threads, number of versions, and actions of other threads. Delay-freedom is significantly stronger than wait-freedom.

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)