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: "distributed storage codes through hadamard designs"
  Abstract: In distributed storage systems that employ erasure coding, the issue of minimizing the total {\it repair bandwidth} required to exactly regenerate a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Minimizing it requires that undesired data during a repair align in the smallest possible spaces, using the concept of interference alignment (IA). Here, a points-on-a-lattice representation of the symbol extension IA of Cadambe {\it et al.} provides cues to perfect IA instances which we combine with fundamental properties of Hadamard matrices to construct a new storage code with favorable repair properties. Specifically, we build an explicit $(k+2,k)$ storage code over $\mathbb{GF}(3)$, whose single systematic node failures can be repaired with bandwidth that matches exactly the theoretical minimum. Moreover, the repair of single parity node failures generates at most the same repair bandwidth as any systematic node failure. Our code can tolerate any single node failure and any pair of failures that involves at most one systematic failure.

Connected through hyperedge HE-1 (induced by source paper "explicit mds codes for optimal repair bandwidth"):
  with members:
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "access vs bandwidth in codes for storage"
    - "mds array codes with optimal rebuilding"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-2 (induced by source paper "quasi cyclic flexible regenerating codes"):
  with members:
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems"
    - "locally repairable codes"
    - "mds array codes with optimal rebuilding"
    - "simple regenerating codes network coding for cloud storage"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-3 (induced by source paper "a repair framework for scalar mds codes"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "structured lattice codes for 2 times 2 times 2 mimo interference channel"
    - "a piggybacking design framework for read and download efficient distributed storage codes"
    - "codes with local regeneration"
    - "locally repairable codes"
    - "mds array codes with optimal rebuilding"

Connected through hyperedge HE-4 (induced by source paper "cooperative regenerating codes"):
  with members:
    - "optimal locally repairable codes via rank metric codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "codes with local regeneration"
    - "exact scalar minimum storage coordinated regenerating codes"
    - "optimal linear codes with a local error correction property"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"
    - "cross mbcr exact minimum bandwith coordinated regenerating codes"
    - "minimum cost multicast with decentralized sources"

Connected through hyperedge HE-5 (induced by source paper "error resilience in distributed storage via rank metric codes"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "regenerating codes for errors and erasures in distributed storage"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "information theoretically secure regenerating codes for distributed storage"
    - "homomorphic self repairing codes for agile maintenance of distributed storage systems"

Connected through hyperedge HE-6 (induced by source paper "access vs bandwidth in codes for storage"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "mds array codes with optimal rebuilding"
    - "repair optimal erasure codes through hadamard designs"
    - "on codes for optimal rebuilding access"
    - "enabling node repair in any erasure code for distributed storage"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

Connected through hyperedge HE-7 (induced by source paper "repair optimal erasure codes through hadamard designs"):
  with members:
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "locally repairable codes"
    - "mds array codes with optimal rebuilding"
    - "simple regenerating codes network coding for cloud storage"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "exact minimum repair bandwidth cooperative regenerating codes for distributed storage systems"
    - "a construction of systematic mds codes with minimum repair bandwidth"

Connected through hyperedge HE-8 (induced by source paper "optimal repair of mds codes in distributed storage via subspace interference alignment"):
  with members:
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "mds array codes with optimal rebuilding"
    - "double circulant minimum storage regenerating codes"
    - "on the existence of optimal exact repair mds codes for distributed storage"
    - "fractional repetition codes for repair in distributed storage systems"
    - "exact regeneration codes for distributed storage repair using interference alignment"
    - "searching for minimum storage regenerating codes"
    - "explicit codes minimizing repair bandwidth for 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)