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: "blazes coordination analysis for distributed programs"
  Abstract: Distributed consistency is perhaps the most discussed topic in distributed systems today. Coordination protocols can ensure consistency, but in practice they cause undesirable performance unless used judiciously. Scalable distributed architectures avoid coordination whenever possible, but under-coordinated systems can exhibit behavioral anomalies under fault, which are often extremely difficult to debug. This raises significant challenges for distributed system architects and developers. In this paper we present Blazes, a cross-platform program analysis framework that (a) identifies program locations that require coordination to ensure consistent executions, and (b) automatically synthesizes application-specific coordination code that can significantly outperform general-purpose techniques. We present two case studies, one using annotated programs in the Twitter Storm system, and another using the Bloom declarative language.

Connected through hyperedge HE-1 (induced by source paper "keeping calm when distributed consistency is easy"):
  with members:
    - "dissipation of stop and go waves via control of autonomous vehicles field experiments"
    - "communication steps for parallel query processing"
    - "relational transducers for declarative networking"
    - "building on quicksand"

Connected through hyperedge HE-2 (induced by source paper "ipa invariant preserving applications for weakly consistent replicated databases"):
  with members:
    - "the homeostasis protocol avoiding transaction coordination through program analysis"
    - "building on quicksand"

Connected through hyperedge HE-3 (induced by source paper "consistency in non transactional distributed storage systems"):
  with members:
    - "don t trust the cloud verify integrity and consistency for cloud object stores"
    - "probabilistically bounded staleness for practical partial quorums"
    - "toward a principled framework for benchmarking consistency"
    - "using paxos to build a scalable consistent and highly available datastore"
    - "fork sequential consistency is blocking"
    - "a unified theory of shared memory consistency"

Connected through hyperedge HE-4 (induced by source paper "coordination avoidance in database systems extended version"):
  with members:
    - "writes that fall in the forest and make no sound semantics based adaptive data consistency"
    - "the homeostasis protocol avoiding transaction coordination through program analysis"
    - "relational transducers for declarative networking"
    - "consensus on transaction commit"

Connected through hyperedge HE-5 (induced by source paper "a datalog based computational model for coordination free data parallel systems"):
  with members:
    - "parallel correctness and transferability for conjunctive queries"
    - "on the calm principle for bulk synchronous parallel computation"
    - "win move is coordination free sometimes"
    - "relational transducers for declarative networking"

Connected through hyperedge HE-6 (induced by source paper "on the calm principle for bulk synchronous parallel computation"):
  with members:
    - "win move is coordination free sometimes"
    - "shark sql and rich analytics at scale"
    - "bsp vs mapreduce"
    - "relational transducers for declarative networking"

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)