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: "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
  Abstract: The $(n,k,d)$ regenerating code is a class of $(n,k)$ erasure codes with the capability to recover a lost code fragment from other $d$ existing code fragments. This paper concentrates on the design of exact regenerating codes at Minimum Bandwidth Regenerating (MBR) points. For $d=n-1$, a class of $(n,k,d=n-1)$ Exact-MBR codes, termed as repair-by-transfer codes, have been developed in prior work to avoid arithmetic operations in node repairing process. The first result of this paper presents a new class of repair-by-transfer codes via congruent transformations. As compared with the prior works, the advantages of the proposed codes include: i) The minimum of the finite field size is significantly reduced from $n \choose 2$ to $n$. ii) The encoding complexity is decreased from $n^4$ to $n^3$. As shown in simulations, the proposed repair-by-transfer codes have lower computational overhead when $n$ is greater than a specific constant. The second result of this paper presents a new form of coding matrix for product-matrix Exact-MBR codes. The proposed coding matrix includes a number of advantages: i). The minimum of the finite field size is reduced from $n-k+d$ to $n$. ii). The fast Reed-Solomon erasure coding algorithms can be applied on the Exact-MBR codes to reduce the time complexities.

Connected through hyperedge HE-1 (induced by source paper "an overflow problem in network coding for secure cloud storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "security in locally repairable storage"
    - "batched sparse codes"
    - "data secrecy in distributed storage systems under exact repair"
    - "capacity and security of heterogeneous distributed storage systems"
    - "simple regenerating codes network coding for cloud storage"
    - "information theoretically secure regenerating codes for distributed storage"

Connected through hyperedge HE-2 (induced by source paper "asymptotically optimal regenerating codes over any field"):
  with members:
    - "minimum storage regenerating codes for all parameters"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "on mbr codes with replication"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "optimal systematic distributed storage codes with fast encoding"
    - "explicit mbr all symbol locality codes"
    - "regenerating codes a system perspective"

Connected through hyperedge HE-3 (induced by source paper "on mbr codes with replication"):
  with members:
    - "update efficient error correcting product matrix codes"
    - "on minimizing data read and download for storage node recovery"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "fractional repetition codes for repair in distributed storage systems"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

Connected through hyperedge HE-4 (induced by source paper "information theoretically secure erasure codes for distributed storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "generalization of rashmi shah kumar minimum storage regenerating codes"
    - "on minimizing data read and download for storage node recovery"

Connected through hyperedge HE-5 (induced by source paper "hfr code a flexible replication scheme for cloud storage systems"):
  with members:
    - "irregular fractional repetition code optimization for heterogeneous cloud storage"
    - "optimal fractional repetition codes based on graphs and designs"
    - "locally repairable codes with multiple repair alternatives"
    - "on weak dress codes for cloud storage"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "repairable replication based storage systems using resolvable designs"
    - "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems"
    - "scalable constructions of fractional repetition codes in distributed storage systems"

Connected through hyperedge HE-6 (induced by source paper "repairable threshold secret sharing schemes"):
  with members:
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

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)