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: "codes with locality for two erasures"
  Abstract: In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated to small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan \textit{et al}, in which recovery from a single erasure is considered. By studying the Generalized Hamming Weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Tur\'an graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from $2$ erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

Connected through hyperedge HE-1 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies"):
  with members:
    - "on maximally recoverable codes for product topologies"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "maximally recoverable codes for grid like topologies"
    - "binary codes with locality for multiple erasures having short block length"
    - "optimal binary locally repairable codes via anticodes"
    - "binary linear locally repairable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"

Connected through hyperedge HE-2 (induced by source paper "locally recoverable j affine variety codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "how long can optimal locally repairable codes be"
    - "new binary and ternary lcd codes"
    - "classical and quantum evaluation codes at the trace roots"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "cooperative local repair in distributed storage"

Connected through hyperedge HE-3 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions"):
  with members:
    - "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3"
    - "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "on optimal ternary locally repairable codes"
    - "liquid cloud storage"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with all symbol locality and availability"

Connected through hyperedge HE-4 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"):
  with members:
    - "on minimum distance of locally repairable codes"
    - "binary codes with locality for multiple erasures having short block length"
    - "binary codes with locality for four erasures"
    - "codes with hierarchical locality"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "an upper bound on the minimum distance of ldpc codes over gf q"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-5 (induced by source paper "batch and pir codes and their connections to locally repairable codes"):
  with members:
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "cooperative local repair in distributed storage"
    - "pir with low storage overhead coding instead of replication"
    - "private information retrieval for coded storage"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"

Connected through hyperedge HE-6 (induced by source paper "alphabet dependent bounds for linear locally repairable codes based on residual codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "matroid theory and storage codes bounds and constructions"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "bounds on binary locally repairable codes tolerating multiple erasures"
    - "constructions and properties of linear locally repairable codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"

Connected through hyperedge HE-7 (induced by source paper "combinatorial alphabet dependent bounds for locally recoverable codes"):
  with members:
    - "bounds on the rate of linear locally repairable codes over small alphabets"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"
    - "bounds on the parameters of locally recoverable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-8 (induced by source paper "on taking advantage of multiple requests in error correcting codes"):
  with members:
    - "local list recovery of high rate tensor codes and applications"
    - "locality via partially lifted codes"
    - "on multi point local decoding of reed muller codes"
    - "cooperative local repair in distributed storage"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable 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)