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: "data secrecy in distributed storage systems under exact repair"
  Abstract: The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures.The maximum file size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree $d=n-1$, where $n$ is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the maximum secure file size for systems with $d<n-1$. The key ingredients for the contribution of this paper are new results on subspace intersection for the data downloaded during repair. The new bounds imply the interesting fact that the maximum data that can be stored securely decreases exponentially with the number of compromised nodes.

Connected through hyperedge HE-1 (induced by source paper "achieving secrecy capacity of minimum storage regenerating codes for all feasible n k d parameter values"):
  with members:
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "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"
    - "information theoretically secure regenerating codes for distributed storage"
    - "on secure distributed data storage under repair dynamics"

Connected through hyperedge HE-2 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "minimum storage regenerating codes for all parameters"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "hashtag erasure codes from theory to practice"
    - "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"
    - "layered exact repair regenerating codes via embedded error correction and block designs"

Connected through hyperedge HE-3 (induced by source paper "on secure exact repair regenerating codes with a single pareto optimal point"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "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"
    - "outer bounds for exact repair codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "exact repair regenerating codes via layered erasure correction and block designs"

Connected through hyperedge HE-4 (induced by source paper "new results on multilevel diversity coding with secure regeneration"):
  with members:
    - "multilevel diversity coding with secure regeneration separate coding achieves the mbr point"
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "toward optimal secure distributed storage systems with exact repair"
    - "multilevel diversity coding with regeneration"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "information theoretically secure regenerating codes for distributed storage"
    - "on secure distributed data storage under repair dynamics"

Connected through hyperedge HE-5 (induced by source paper "improving the secrecy of distributed storage systems using interference alignment"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "information theoretically secure regenerating codes for distributed storage"
    - "on secure distributed data storage under repair dynamics"
    - "exact regeneration codes for distributed storage repair using interference alignment"
    - "decentralized erasure codes for distributed networked storage"

Connected through hyperedge HE-6 (induced by source paper "on the tradeoff region of secure exact repair regenerating codes"):
  with members:
    - "a note on secure minimum storage regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "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"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "outer bounds for exact repair codes"

Connected through hyperedge HE-7 (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"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "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-8 (induced by source paper "security concerns in minimum storage cooperative regenerating codes"):
  with members:
    - "on secrecy capacity of minimum storage regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "codes between mbr and msr points with exact repair property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

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)