human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on the calm principle for bulk synchronous parallel computation"):
  Abstract: In the recent years a lot of emphasis has been placed on two apparently disjoined fields: data-parallel and eventually consistent distributed systems. In this paper we propose a theoretical study over an eventually consistent data-parallel computational model. The keystone is provided by the recent finding that a class of programs exists which can be computed in an eventually consistent, coordination-free way: monotonic programs. This principle is called CALM and has been proven for distributed asynchronous settings. We make the case that, using the techniques developed by Ameloot et al., CALM does not hold in general for data-parallel systems, wherein computation usually proceeds synchronously in rounds and where communication is reliable. We then show that using novel techniques subsuming the one of Ameloot et al., the satisfiability of the CALM principle is directly related with the assumptions imposed on the behavior of the system.

Includes members:
  Member "blazes coordination analysis for distributed programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "keeping calm when distributed consistency is easy")
  Member "win move is coordination free sometimes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "putting logic based distributed systems on stable grounds")
  Member "shark sql and rich analytics at scale":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "knowledge graphs")
  Member "bsp vs mapreduce":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "connecting mapreduce computations to realistic machine models")
  Member "relational transducers for declarative networking":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "keeping calm when distributed consistency is easy")

Question: Please tell me which class the source paper 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)