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: "combinatorial alphabet dependent bounds for locally recoverable codes"
  Abstract: Locally recoverable (LRC) codes have recently been a focus point of research in coding theory due to their theoretical appeal and applications in distributed storage systems. In an LRC code, any erased symbol of a codeword can be recovered by accessing only a small number of other symbols. For LRC codes over a small alphabet (such as binary), the optimal rate-distance trade-off is unknown. We present several new combinatorial bounds on LRC codes including the locality-aware sphere packing and Plotkin bounds. We also develop an approach to linear programming (LP) bounds on LRC codes. The resulting LP bound gives better estimates in examples than the other upper bounds known in the literature. Further, we provide the tightest known upper bound on the rate of linear LRC codes with a given relative distance, an improvement over the previous best known bounds.

Connected through hyperedge HE-1 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage"):
  with members:
    - "an exponential lower bound on the sub packetization of msr codes"
    - "capacity of locally recoverable codes"
    - "a layered architecture for erasure coded consistent distributed storage"
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "the storage vs repair bandwidth trade off for multiple failures in clustered storage networks"
    - "locally recoverable codes from algebraic curves and surfaces"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"

Connected through hyperedge HE-2 (induced by source paper "locally recoverable j affine variety codes"):
  with members:
    - "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"
    - "cyclic lrc codes and their subfield subcodes"

Connected through hyperedge HE-3 (induced by source paper "the complete hierarchical locality of the punctured simplex code"):
  with members:
    - "codes with hierarchical locality from covering maps of curves"
    - "matroid theory and storage codes bounds and constructions"
    - "alphabet dependent bounds for linear locally repairable codes based on residual codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "codes with hierarchical locality"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "extended integrated interleaved codes over any field with applications to locally recoverable codes"):
  with members:
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "erasure coding for distributed storage an overview"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "bounds and constructions for linear locally repairable codes over binary fields"
    - "optimal binary linear locally repairable codes with disjoint repair groups"
    - "extended product and integrated interleaved codes"
    - "multi block interleaved codes for local and global read access"

Connected through hyperedge HE-5 (induced by source paper "alphabet dependent bounds for linear locally repairable codes based on residual codes"):
  with members:
    - "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"
    - "repairing reed solomon codes"

Connected through hyperedge HE-6 (induced by source paper "on optimal locally repairable codes with super linear length"):
  with members:
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "explicit optimal length locally repairable codes of distance 5"
    - "irregular recovery and unequal locality for locally recoverable codes with availability"
    - "locality and availability of array codes constructed from subspaces"
    - "optimal locally repairable systematic codes based on packings"

Connected through hyperedge HE-7 (induced by source paper "capacity of locally recoverable codes"):
  with members:
    - "locally recoverable codes from algebraic curves and surfaces"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"

Connected through hyperedge HE-8 (induced by source paper "linear programming bounds for distributed storage codes"):
  with members:
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "locality and availability in distributed storage"
    - "repair locality from a combinatorial perspective"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"

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)