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: "fundamental limits on communication for oblivious updates in storage networks"
  Abstract: In distributed storage systems, storage nodes intermittently go offline for numerous reasons. On coming back online, nodes need to update their contents to reflect any modifications to the data in the interim. In this paper, we consider a setting where no information regarding modified data needs to be logged in the system. In such a setting, a ‘stale’ node needs to update its contents by downloading data from already updated nodes, while neither the stale node nor the updated nodes have any knowledge as to which data symbols are modified and what their value is. We investigate the fundamental limits on the amount of communication necessary for such an oblivious update process. We first present a generic lower bound on the amount of communication that is necessary under any storage code with a linear encoding (while allowing non-linear update protocols). This lower bound is derived under a set of extremely weak conditions, giving all updated nodes access to the entire modified data and the stale node access to the entire stale data as side information. We then present codes and update algorithms that are optimal in that they meet this lower bound. Next, we present a lower bound for an important subclass of codes, that of linear Maximum-Distance-Separable (MDS) codes. We then present an MDS code construction and an associated update algorithm that meets this lower bound. These results thus establish the capacity of oblivious updates in terms of the communication requirements under these settings.

Connected through hyperedge HE-1 (induced by source paper "codes for updating linear functions over small fields"):
  with members:
    - "updating content in cache aided coded multicast"
    - "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"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "index coding with coded side information"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (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"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "multi version coding an information theoretic perspective of consistent distributed storage"

Connected through hyperedge HE-3 (induced by source paper "multi version coding for consistent distributed storage of correlated data updates"):
  with members:
    - "correlation aware distributed caching and coded delivery"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "file updates under random arbitrary insertions and deletions"
    - "a family of optimal locally recoverable codes"
    - "is non unique decoding necessary"
    - "simultaneous nonunique decoding is rate optimal"
    - "a compression algorithm using mis aligned side information"

Connected through hyperedge HE-4 (induced by source paper "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"):
  with members:
    - "weight enumerators and higher support weights of maximally recoverable codes"
    - "on partial maximally recoverable and maximally recoverable codes"
    - "file updates under random arbitrary insertions and deletions"
    - "synchronizing edits in distributed storage networks"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"
    - "explicit maximally recoverable codes with locality"
    - "explicit mbr all symbol locality codes"

Connected through hyperedge HE-5 (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"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "content type coding"
    - "compressed differential erasure codes for efficient archival of versioned data"
    - "synchronizing edits in distributed 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.IT(Information Theory)