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 "auditable register emulations"):
  Abstract: The widespread prevalence of data breaches amplifies the importance of auditing storage systems. Here we initiate the study of auditable storage emulations, which provides the capability for an auditor to discover the previously executed reads in a register. We precisely define the notion of auditable register and its properties, and establish tight bounds and impossibility results for auditable storage emulations in a Byzantine setting. Our formulation considers read-write registers that securely store data using information dispersal and support fast reads. In such scenario, given a maximum number $f$ of faulty storage objects and a minimum number $\tau$ of data blocks required to recover a written value, we prove that (1) auditability is impossible if $\tau \leq 2f$; (2) $\tau \geq 3f+1$ is required for implementing a weak form of auditability; and (3) a stronger form of auditability is impossible. We also show that totally ordering operations or using non-fast reads enables such strong auditability, albeit requiring more replicas.

Includes members:
  Member "integrated bounds for disintegrated storage":
    also connected through other hyperedges:
      (none)
  Member "information theoretic lower bounds on the storage cost of shared memory emulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coded state machine scaling state machine execution under byzantine faults")
  Member "space bounds for reliable storage fundamental limits of coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "storage efficient shared memory emulation")

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.DC(Distributed, Parallel, and Cluster Computing)