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: "staircase codes for secret sharing with optimal communication and read overheads"
  Abstract: We study the communication efficient secret sharing (CESS) problem introduced by Huang, Langberg, Kliewer and Bruck. A classical threshold secret sharing scheme randomly encodes a secret into $n$ shares given to $n$ parties, such that any set of at least $t$, $t  n$. We describe two explicit constructions of Staircase codes that achieve minimum communication and read overheads respectively for a fixed $d$, and universally for all possible values of $d, t\leq d\leq n$.

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"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "communication efficient secret sharing"

Connected through hyperedge HE-2 (induced by source paper "communication efficient secret sharing in the presence of malicious adversary"):
  with members:
    - "securing data against limited knowledge adversaries in distributed storage systems"
    - "network codes resilient to jamming and eavesdropping"

Connected through hyperedge HE-3 (induced by source paper "private and rateless adaptive coded matrix vector multiplication"):
  with members:
    - "codedprivateml a fast and privacy preserving framework for distributed machine learning"
    - "analyzing the download time of availability codes"
    - "secure coded cooperative computation at the heterogeneous edge against byzantine attacks"
    - "an application of storage optimal matdot codes for coded matrix multiplication fast k nearest neighbors estimation"
    - "speeding up distributed machine learning using codes"
    - "anytime stochastic gradient descent a time to hear from all the workers"
    - "gasp codes for secure distributed matrix multiplication"
    - "speeding up distributed gradient descent by utilizing non persistent stragglers"

Connected through hyperedge HE-4 (induced by source paper "coded elastic computing"):
  with members:
    - "an application of storage optimal matdot codes for coded matrix multiplication fast k nearest neighbors estimation"
    - "hierarchical coded computation"
    - "learning a code machine learning for approximate non linear coded computation"
    - "speeding up distributed machine learning using codes"
    - "straggler resilient and communication efficient distributed iterative linear solver"
    - "speeding up distributed gradient descent by utilizing non persistent stragglers"
    - "coded computing for distributed graph analytics"
    - "hierarchical coding for distributed computing"

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 "distributed multi user secret sharing"):
  with members:
    - "communication efficient secret sharing"
    - "distributed secret dissemination across a network"

Connected through hyperedge HE-7 (induced by source paper "universal secure rank metric coding schemes with optimal communication overheads"):
  with members:
    - "rank metric codes with local recoverability"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "communication efficient secret sharing"
    - "repairing reed solomon codes"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "a family of optimal locally recoverable codes"
    - "on the locality of codeword symbols"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-8 (induced by source paper "minimizing latency for secure distributed computing"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "federated optimization distributed machine learning for on device intelligence"
    - "tofec achieving optimal throughput delay trade off of cloud storage using erasure codes"
    - "coding for fast content download"

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)