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: "between linearizability and quiescent consistency quantitative quiescent consistency"
  Abstract: Linearizability is the de facto correctness criterion for concurrent data structures. Unfortunately, linearizability imposes a performance penalty which scales linearly in the number of contending threads. Quiescent consistency is an alternative criterion which guarantees that a concurrent data structure behaves correctly when accessed sequentially. Yet quiescent consistency says very little about executions that have any contention. #R##N#We define quantitative quiescent consistency (QQC), a relaxation of linearizability where the degree of relaxation is proportional to the degree of contention. When quiescent, no relaxation is allowed, and therefore QQC refines quiescent consistency, unlike other proposed relaxations of linearizability. We show that high performance counters and stacks designed to satisfy quiescent consistency continue to satisfy QQC. The precise assumptions under which QQC holds provides fresh insight on these structures. To demonstrate the robustness of QQC, we provide three natural characterizations and prove compositionality.

Connected through hyperedge HE-1 (induced by source paper "specifying concurrent programs in separation logic morphisms and simulations"):
  with members:
    - "proving linearizability using forward simulations"
    - "concurrent data structures linked in time"
    - "hoare style specifications as correctness conditions for non linearizable concurrent objects"
    - "specifying and verifying concurrent algorithms with histories and subjectivity"
    - "linearizability with ownership transfer"
    - "flat combining and the synchronization parallelism tradeoff"

Connected through hyperedge HE-2 (induced by source paper "decidability and complexity for quiescent consistency and its variations"):
  with members:
    - "on verifying causal consistency"
    - "tightening the complexity of equivalence problems for commutative grammars"
    - "sequential consistency and concurrent data structures"
    - "on reducing linearizability to state reachability"
    - "on the complexity of linearizability"

Connected through hyperedge HE-3 (induced by source paper "hoare style specifications as correctness conditions for non linearizable concurrent objects"):
  with members:
    - "specifying and verifying concurrent algorithms with histories and subjectivity"
    - "linearizability with ownership transfer"

Connected through hyperedge HE-4 (induced by source paper "verifying linearizability a comparative survey"):
  with members:
    - "efficient lock free binary search trees"
    - "simplifying proofs of linearisability using layers of abstraction"
    - "linearizability with ownership transfer"
    - "proving linearisability via coarse grained abstraction"
    - "lock free dynamic hash tables with open addressing"

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.PL(Programming Languages)