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: "characterization of secrecy capacity for general msr codes under passive eavesdropping model"
  Abstract: In this paper, we revisit the problem of characterizing the secrecy capacity of MSR codes under the passive {l1, l2}-eavesdropper model, where the eavesdropper has access to data stored on l1 nodes as well as the repair traffic for an additional l2 nodes. We analyze the secrecy capacity of MSR codes from an information theory perspective. Specifically, we investigate the basic reconstruction and regeneration properties of MSR codes and find some information theoretic features on the contents of storage nodes as well as repair traffic. Leveraging these properties with a definition of the secrecy capacity, we derive new upper bounds on the secrecy capacity for MSR codes. These explicit upper bounds on the secrecy capacity bring out an interesting fact that the secrecy capacity of MSR codes is not only related to {l1, l2}, but also closely depends on ?, the amount of data downloaded from each helper node during the repair process. Similar bounds on the secrecy capacity in the literature are either restricted to the situation that l2\leq2, or based on the assumption of linear coding. To the best of our knowledge, this is a novel characterization of the secrecy capacity of general MSR codes without the above constraints.

Connected through hyperedge HE-1 (induced by source paper "centralized repair of multiple node failures with applications to communication efficient secret sharing"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "minimum storage regenerating codes for all parameters"
    - "broadcast repair for wireless distributed storage systems"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "security concerns in minimum storage cooperative regenerating codes"
    - "optimal rebuilding of multiple erasures in mds codes"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"

Connected through hyperedge HE-2 (induced by source paper "a note on secure minimum storage regenerating codes"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "toward optimal secure distributed storage systems with exact repair"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "security concerns in minimum storage cooperative regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "security in locally repairable 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)