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: "centralized repair of multiple node failures with applications to communication efficient secret sharing"
  Abstract: This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth-efficient repair of a single failed node. This work focuses on the trade-off between the amount of data stored and repair bandwidth in this CMR model. In particular, repair bandwidth bounds are derived for the minimum storage multi-node repair (MSMR) and the minimum bandwidth multi-node repair (MBMR) operating points. The tightness of these bounds are analyzed via code constructions. The MSMR point is characterized through codes achieving this point under functional repair for general set of CMR parameters, as well as with codes enabling exact repair for certain CMR parameters. The MBMR point, on the other hand, is characterized with exact repair codes for all CMR parameters for systems that satisfy a certain entropy accumulation property. Finally, the model proposed here is utilized for the secret sharing problem, where the codes for the multi-node repair problem is used to construct communication efficient secret sharing schemes with the property of bandwidth efficient share repair.

Connected through hyperedge HE-1 (induced by source paper "distributed secure storage rate privacy trade off and xor based coding scheme"):
  with members:
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "communication efficient secret sharing"
    - "staircase codes for secret sharing with optimal communication and read overheads"

Connected through hyperedge HE-2 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "rack aware regenerating codes for data centers"
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "a class of msr codes for clustered distributed storage"
    - "erasure coding for distributed storage an overview"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"

Connected through hyperedge HE-3 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "on the achievability region of regenerating codes for multiple erasures"
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing reed solomon codes with multiple erasures"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"

Connected through hyperedge HE-4 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes"):
  with members:
    - "functional repair codes a view from projective geometry"
    - "centralized multi node repair regenerating codes"
    - "broadcast repair for wireless distributed storage systems"
    - "characterizations and construction methods for linear functional repair storage codes"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"
    - "cooperative regenerating codes"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-5 (induced by source paper "staircase pir universally robust private information retrieval"):
  with members:
    - "analyzing the download time of availability codes"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "speeding up distributed machine learning using codes"
    - "lifting private information retrieval from two to any number of messages"
    - "polynomially coded regression optimal straggler mitigation via data encoding"
    - "minimizing latency for secure coded computing using secret sharing via staircase codes"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "the capacity of private information retrieval from byzantine and colluding databases"

Connected through hyperedge HE-6 (induced by source paper "the repair problem for reed solomon codes optimal repair of single and multiple erasures asymptotically optimal node size"):
  with members:
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "efficiently repairing algebraic geometry codes"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing multiple failures for scalar mds codes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-7 (induced by source paper "cooperative repair constructions of optimal mds codes for all admissible parameters"):
  with members:
    - "on the achievability region of regenerating codes for multiple erasures"
    - "the repair problem for reed solomon codes optimal repair of single and multiple erasures asymptotically optimal node size"
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing multiple failures for scalar mds codes"
    - "repairing reed solomon codes with multiple erasures"

Connected through hyperedge HE-8 (induced by source paper "optimal mds codes for cooperative repair"):
  with members:
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing multiple failures for scalar mds codes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"

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)