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: "multi block interleaved codes for local and global read access"
  Abstract: We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the correction capability of the sub-block code through its gap $t$ from optimal minimum distance, and look to have full-block minimum distance that grows with the parameter $t$. We construct two families of such codes when the number of sub-blocks is $3$. The codes match the distance properties of known integrated-interleaving codes, but with the added feature of mapping the same number of information symbols to each sub-block. As such, they are the first codes that provide read access in multiple size granularities and correction capabilities.

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"
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "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 "hierarchical coding to enable scalability and flexibility in heterogeneous cloud storage"):
  with members:
    - "codes with hierarchical locality from covering maps of curves"
    - "extended product and integrated interleaved codes"

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:
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "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:
    - "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"
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "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"

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)