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: "the homeostasis protocol avoiding transaction coordination through program analysis"
  Abstract: Datastores today rely on distribution and replication to achieve improved performance and fault-tolerance. But correctness of many applications depends on strong consistency properties - something that can impose substantial overheads, since it requires coordinating the behavior of multiple nodes. This paper describes a new approach to achieving strong consistency in distributed systems while minimizing communication between nodes. The key insight is to allow the state of the system to be inconsistent during execution, as long as this inconsistency is bounded and does not affect transaction correctness. In contrast to previous work, our approach uses program analysis to extract semantic information about permissible levels of inconsistency and is fully automated. We then employ a novel homeostasis protocol to allow sites to operate independently, without communicating, as long as any inconsistency is governed by appropriate treaties between the nodes. We discuss mechanisms for optimizing treaties based on workload characteristics to minimize communication, as well as a prototype implementation and experiments that demonstrate the benefits of our approach on common transactional benchmarks.

Connected through hyperedge HE-1 (induced by source paper "a comprehensive evaluation of rdma enabled concurrency control protocols"):
  with members:
    - "warp lightweight multi key transactions for key value stores"

Connected through hyperedge HE-2 (induced by source paper "antidote sql relaxed when possible strict when necessary"):
  with members:
    - "building on quicksand"

Connected through hyperedge HE-3 (induced by source paper "conflict free replicated data types an overview"):
  with members:
    - "delta state replicated data types"
    - "eventually consistent register revisited"
    - "scalable eventually consistent counters over unreliable networks"
    - "designing a commutative replicated data type"

Connected through hyperedge HE-4 (induced by source paper "scaling out acid applications with operation partitioning"):
  with members:
    - "rethinking serializable multiversion concurrency control"
    - "elastras an elastic transactional data store in the cloud"

Connected through hyperedge HE-5 (induced by source paper "ipa invariant preserving applications for weakly consistent replicated databases"):
  with members:
    - "blazes coordination analysis for distributed programs"
    - "building on quicksand"

Connected through hyperedge HE-6 (induced by source paper "actor database systems a manifesto"):
  with members:
    - "reactors a case for predictable virtualized actor database systems"
    - "occupy the cloud distributed computing for the 99"
    - "behavioral simulations in mapreduce"

Connected through hyperedge HE-7 (induced by source paper "building efficient query engines in a high level language"):
  with members:
    - "hpat high performance analytics with scripting ease of use"
    - "tupleware redefining modern analytics"
    - "automatic partitioning of database applications"
    - "dbtoaster higher order delta processing for dynamic frequently fresh views"

Connected through hyperedge HE-8 (induced by source paper "design principles for scaling multi core oltp under high contention"):
  with members:
    - "rethinking serializable multiversion concurrency control"
    - "automatic partitioning of database applications"
    - "oltp on hardware islands"
    - "high performance concurrency control mechanisms for main memory databases"
    - "flat combining and the synchronization parallelism tradeoff"

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)