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 meet multiple access wiretap channels"
  Abstract: We consider {\it i)} the overhead minimization of maximum-distance separable (MDS) storage codes for the repair of a single failed node and {\it ii)} the total secure degrees-of-freedom (S-DoF) maximization in a multiple-access compound wiretap channel. We show that the two problems are connected. Specifically, the overhead minimization for a single node failure of an {\it optimal} MDS code, i.e. one that can achieve the information theoretic overhead minimum, is equivalent to maximizing the S-DoF in a multiple-access compound wiretap channel. Additionally, we show that maximizing the S-DoF in a multiple-access compound wiretap channel is equivalent to minimizing the overhead of an MDS code for the repair of a departed node. An optimal MDS code maps to a full S-DoF channel and a full S-DoF channel maps to an MDS code with minimum repair overhead for one failed node. We also state a general framework for code-to-channel and channel-to-code mappings and performance bounds between the two settings. The underlying theme for all connections presented is interference alignment (IA). The connections between the two problems become apparent when we restate IA as an optimization problem. Specifically, we formulate the overhead minimization and the S-DoF maximization as rank constrained, sum-rank and max-rank minimization problems respectively. The derived connections allow us to map repair strategies of recently discovered repair codes to beamforming matrices and characterize the maximum S-DoF for the single antenna multiple-access compound wiretap channel.

Connected through hyperedge HE-1 (induced by source paper "rank minimization over finite fields fundamental limits and coding theoretic interpretations"):
  with members:
    - "information theoretic bounds for tensor rank minimization over finite fields"
    - "capacity achieving linear codes with random binary sparse generating matrices"
    - "capacity achieving random sparse linear codes"
    - "information theoretic bounds for low rank matrix completion"
    - "communication over finite field matrix channels"
    - "the power of convex relaxation near optimal matrix completion"
    - "lp decoding meets lp decoding a connection between channel coding and compressed sensing"
    - "guaranteed rank minimization via singular value projection"

Connected through hyperedge HE-2 (induced by source paper "mimo multiple access channel with an arbitrarily varying eavesdropper"):
  with members:
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "interference alignment for the multi antenna compound wiretap channel"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "on the secure degrees of freedom of the multiple access channel"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "on the compound mimo broadcast channels with confidential messages"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"

Connected through hyperedge HE-3 (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-4 (induced by source paper "information theoretically secure regenerating codes for distributed storage"):
  with members:
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "on secure distributed data storage under repair dynamics"
    - "exact regeneration codes for distributed storage repair using interference alignment"
    - "explicit codes minimizing repair bandwidth for distributed storage"
    - "explicit construction of optimal exact regenerating codes for distributed storage"
    - "network coding for distributed storage systems"

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)