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: "secure clustered distributed storage against eavesdroppers"
  Abstract: This paper considers the security issue of practical distributed storage systems (DSSs) which consist of multiple clusters of storage nodes. Noticing that actual storage nodes constituting a DSS are distributed in multiple clusters, two novel eavesdropper models - the node-restricted model and the cluster-restricted model - are suggested which reflect the clustered nature of DSSs. In the node-restricted model, an eavesdropper cannot access the individual nodes, but can eavesdrop incoming/outgoing data for $L_c$ compromised clusters. In the cluster-restricted model, an eavesdropper can access a total of $l$ individual nodes but the number of accessible clusters is limited to $L_c$. We provide an upper bound on the securely storable data for each model, while a specific network coding scheme which achieves the upper bound is obtained for the node-restricted model, given some mild condition on the node storage size.

Connected through hyperedge HE-1 (induced by source paper "explicit construction of mbr codes for clustered distributed storage"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "locality and availability of array codes constructed from subspaces"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-2 (induced by source paper "explicit constructions of mbr and msr codes for clustered distributed storage"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "locality and availability of array codes constructed from subspaces"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-3 (induced by source paper "capacity of clustered distributed storage"):
  with members:
    - "explicit construction of mbr codes for clustered distributed storage"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "architecture aware coding for distributed storage repairable block failure resilient codes"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a realistic distributed storage system that minimizes data storage and repair bandwidth"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"

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)