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: "integrated interleaved codes as locally recoverable codes properties and performance"
  Abstract: Considerable interest has been paid in recent literature to codes combining local and global properties for erasure correction. Applications are in cloud type of implementations, in which fast recovery of a failed storage device is important, but additional protection is required in order to avoid data loss, and in RAID type of architectures, in which total device failures coexist with silent failures at the page or sector level in each device. Existing solutions to these problems require in general relatively large finite fields. The techniques of Integrated Interleaved Codes (which are closely related to Generalized Concatenated Codes) are proposed to reduce significantly the size of the finite field, and it is shown that when the parameters of these codes are judiciously chosen, their performance may be competitive with the one of codes optimizing the minimum distance.

Connected through hyperedge HE-1 (induced by source paper "spatially coupled ldpc codes with sub block locality"):
  with members:
    - "ldpc codes with local and global decoding"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "multi block interleaved codes for local and global read access"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a family of optimal locally recoverable codes"
    - "multi dimensional spatially coupled codes"
    - "new codes on graphs constructed by connecting spatially coupled chains"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-2 (induced by source paper "computing sharp recovery structures for locally recoverable codes"):
  with members:
    - "construction of optimal locally repairable codes via automorphism groups of rational function fields"
    - "cyclic lrc codes and their subfield subcodes"
    - "locally recoverable codes on algebraic curves"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "on the ideal associated to a linear code"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "extended integrated interleaved codes over any field with applications to locally recoverable codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "ldpc codes with local and global decoding"):
  with members:
    - "multi block interleaved codes for local and global read access"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "bilayer low density parity check codes for decode and forward in relay channels"

Connected through hyperedge HE-5 (induced by source paper "extended product and integrated interleaved codes"):
  with members:
    - "multi block interleaved codes for local and global read access"
    - "maximally recoverable codes for grid like topologies"
    - "bounds and constructions of codes with multiple localities"
    - "new constructions of sd and mr codes over small finite fields"
    - "generalized and extended product codes"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-6 (induced by source paper "multi erasure locally recoverable codes over small fields"):
  with members:
    - "binary linear locally repairable codes"
    - "locally recoverable codes on algebraic curves"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "an upper bound on the size of locally recoverable codes"
    - "partial mds codes and their application to raid type of architectures"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"

Connected through hyperedge HE-7 (induced by source paper "multi block interleaved codes for local and global read access"):
  with members:
    - "a family of optimal locally recoverable codes"
    - "on the locality of codeword symbols"

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)