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: "information theoretic lower bounds on the storage cost of shared memory emulation"
  Abstract: The focus of this paper is to understand storage costs of emulating an atomic shared memory over an asynchronous, distributed message passing system. Previous literature has developed several shared memory emulation algorithms based on replication and erasure coding techniques. In this paper, we present information-theoretic lower bounds on the storage costs incurred by shared memory emulation algorithms. Our storage cost lower bounds are universally applicable, that is, we make no assumption on the structure of the algorithm or the method of encoding the data. #R##N#We consider an arbitrary algorithm $A$ that implements an atomic multi-writer single-reader (MWSR) shared memory variable whose values come from a finite set $\mathcal{V}$ over a system of $N$ servers connected by point-to-point asynchronous links. We require that in every fair execution of algorithm $A$ where the number of server failures is smaller than a parameter $f$, every operation invoked at a non-failing client terminates. We define the storage cost of a server in algorithm $A$ as the logarithm (to base 2) of number of states it can take on; the total-storage cost of algorithm $A$ is the sum of the storage cost of all servers. #R##N#Our results are as follows. (i) We show that if algorithm $A$ does not use server gossip, then the total storage cost is lower bounded by $2 \frac{N}{N-f+1}\log_2|\mathcal{V}|-o(\log_2|\mathcal{V}|)$. (ii) The total storage cost is at least $2 \frac{N}{N-f+2} \log_{2}|\mathcal{V}|-o(\log_{2}|\mathcal{V}|)$ even if the algorithm uses server gossip. (iii) We consider algorithms where the write protocol sends information about the value in at most one phase. We show that the total storage cost is at least $\nu^* \frac{N}{N-f+\nu^*-1} \log_2( |\mathcal{V}|)- o(\log_2(|\mathcal{V}|),$ where $\nu^*$ is the minimum of $f+1$ and the number of active write operations of an execution.

Connected through hyperedge HE-1 (induced by source paper "coded state machine scaling state machine execution under byzantine faults"):
  with members:
    - "interpol information theoretically verifiable polynomial evaluation"
    - "speeding up distributed machine learning using codes"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "a unified coding framework for distributed computing with straggling servers"
    - "multi version coding an information theoretic perspective of consistent distributed storage"

Connected through hyperedge HE-2 (induced by source paper "auditable register emulations"):
  with members:
    - "integrated bounds for disintegrated storage"
    - "space bounds for reliable storage fundamental limits of coding"

Connected through hyperedge HE-3 (induced by source paper "harnessing correlations in distributed erasure coded key value stores"):
  with members:
    - "on coding for cache aided delivery of dynamic correlated content"
    - "storage efficient shared memory emulation"
    - "a layered architecture for erasure coded consistent distributed storage"
    - "multi version coding for consistent distributed storage of correlated data updates"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "correlation aware distributed caching and coded delivery"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "compressed differential erasure codes for efficient archival of versioned data"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of erasure coded key value stores with side information"):
  with members:
    - "multi version coding with side information"
    - "harnessing correlations in distributed erasure coded key value stores"
    - "storage efficient shared memory emulation"
    - "radon repairable atomic data object in networks"
    - "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "erasure coded byzantine storage with separate metadata"
    - "a coded shared atomic memory algorithm for message passing architectures"

Connected through hyperedge HE-5 (induced by source paper "storage efficient shared memory emulation"):
  with members:
    - "a layered architecture for erasure coded consistent distributed storage"
    - "radon repairable atomic data object in networks"
    - "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "space bounds for reliable storage fundamental limits of coding"

Connected through hyperedge HE-6 (induced by source paper "integrated bounds for disintegrated storage"):
  with members:
    - "space complexity of implementing large shared registers"
    - "erasure coded byzantine storage with separate metadata"

Connected through hyperedge HE-7 (induced by source paper "a layered architecture for erasure coded consistent distributed storage"):
  with members:
    - "radon repairable atomic data object in networks"
    - "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"
    - "space bounds for reliable storage fundamental limits of coding"
    - "evaluation of codes with inherent double replication for hadoop"
    - "a coded shared atomic memory algorithm for message passing architectures"
    - "xoring elephants novel erasure codes for big data"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-8 (induced by source paper "multi version coding an information theoretic perspective of consistent distributed storage"):
  with members:
    - "a layered architecture for erasure coded consistent distributed storage"
    - "radon repairable atomic data object in networks"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "content type coding"
    - "compressed differential erasure codes for efficient archival of versioned data"
    - "synchronizing edits in distributed storage networks"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"

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)