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: "update efficiency and local repairability limits for capacity approaching codes"
  Abstract: Motivated by distributed storage applications, we investigate the degree to which capacity achieving encodings can be efficiently updated when a single information bit changes, and the degree to which such encodings can be efficiently (i.e., locally) repaired when single encoded bit is lost. #R##N#Specifically, we first develop conditions under which optimum error-correction and update-efficiency are possible, and establish that the number of encoded bits that must change in response to a change in a single information bit must scale logarithmically in the block-length of the code if we are to achieve any nontrivial rate with vanishing probability of error over the binary erasure or binary symmetric channels. Moreover, we show there exist capacity-achieving codes with this scaling. #R##N#With respect to local repairability, we develop tight upper and lower bounds on the number of remaining encoded bits that are needed to recover a single lost bit of the encoding. In particular, we show that if the code-rate is $\epsilon$ less than the capacity, then for optimal codes, the maximum number of codeword symbols required to recover one lost symbol must scale as $\log1/\epsilon$. #R##N#Several variations on---and extensions of---these results are also developed.

Connected through hyperedge HE-1 (induced by source paper "achieving multi port memory performance on single port memory with coding techniques"):
  with members:
    - "locality and availability in distributed storage"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols"
    - "hitting the memory wall implications of the obvious"

Connected through hyperedge HE-2 (induced by source paper "local decode and update for big data compression"):
  with members:
    - "how to store a random walk"
    - "set membership with non adaptive bit probes"
    - "compressed data structures for dynamic sequences"
    - "set membership with a few bit probes"
    - "bounds on the parameters of locally recoverable codes"
    - "a family of optimal locally recoverable codes"
    - "on locally decodable source coding"
    - "a simple online competitive adaptation of lempel ziv compression with efficient random access support"

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"
    - "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-4 (induced by source paper "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead"):
  with members:
    - "balanced locally repairable codes"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "locally repairable codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-5 (induced by source paper "energy efficient distributed coding for data collection in a noisy sparse network"):
  with members:
    - "graph codes for distributed instant message collection in an arbitrary noisy broadcast network"
    - "optimal function computation in directed and undirected graphs"
    - "decentralized erasure codes for distributed networked storage"

Connected through hyperedge HE-6 (induced by source paper "graph codes for distributed instant message collection in an arbitrary noisy broadcast network"):
  with members:
    - "sum networks from undirected graphs construction and capacity analysis"
    - "energy efficient distributed coding for data collection in a noisy sparse network"
    - "computing linear transformations with unreliable components"
    - "computation over gaussian networks with orthogonal components"
    - "computing linear functions by linear coding over networks"
    - "network coding for computing cut set bounds"
    - "towards a queueing based framework for in network function computation"
    - "optimal function computation in directed and undirected graphs"

Connected through hyperedge HE-7 (induced by source paper "locally encodable and decodable codes for distributed storage systems"):
  with members:
    - "storage capacity of repairable networks"
    - "coding with constraints minimum distance bounds and systematic constructions"
    - "erasure codes with symbol locality and group decodability for distributed storage"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"
    - "on the locality of codeword symbols"
    - "self repairing homomorphic codes for distributed storage systems"

Connected through hyperedge HE-8 (induced by source paper "a family of optimal locally recoverable codes"):
  with members:
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "explicit maximally recoverable codes with locality"
    - "on the locality of codeword symbols in non linear codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "optimal locally repairable codes via rank metric codes"
    - "locally repairable codes with multiple repair alternatives"
    - "an upper bound on the size of locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"

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)