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: "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
  Abstract: We study a multi-antenna broadcast channel with two legitimate receivers and an external eavesdropper. We assume that the channel matrix of the eavesdropper is unknown to the legitimate terminals but satisfies a maximum rank constraint. As our main result we characterize the associated secrecy degrees of freedom for the broadcast channel with common and private messages. We show that a direct extension of the single-user wiretap codebook does not achieve the secrecy degrees of freedom. Our proposed optimal scheme involves decomposing the signal space into a common subspace, which can be observed by both receivers, and private subspaces which can be observed by only one of the receivers, and carefully transmitting a subset of messages in each subspace. We also consider the case when each user's private message must additionally remain confidential from the other legitimate receiver and characterize the s.d.o.f. region in this case.

Connected through hyperedge HE-1 (induced by source paper "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "wireless network information flow a deterministic approach"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "ergodic secret alignment"

Connected through hyperedge HE-2 (induced by source paper "secrecy in mimo networks with no eavesdropper csit"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "secure degrees of freedom for the mimo wire tap channel with a multi antenna cooperative jammer"
    - "secure degrees of freedom of one hop wireless networks"
    - "feasibility of interference alignment for the mimo interference channel"
    - "blind mimome wiretap channel with delayed csit"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "multiaccess channel with partially cooperating encoders and security constraints"

Connected through hyperedge HE-3 (induced by source paper "secure degrees of freedom of the gaussian mimo wiretap and mimo broadcast channels with unknown eavesdroppers"):
  with members:
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "on the secure degrees of freedom of the multiple access channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "secrecy in cooperative relay broadcast channels"
    - "the secrecy capacity of the mimo wiretap channel"
    - "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy"

Connected through hyperedge HE-4 (induced by source paper "wiretap channel with causal state information and secure rate limited feedback"):
  with members:
    - "physical layer security in downlink multi antenna cellular networks"
    - "on secure communication with constrained randomization"
    - "cognitive interference channels with confidential messages under randomness constraint"
    - "broadcast channels with confidential messages by randomness constrained stochastic encoder"
    - "secret key agreement with channel state information at the transmitter"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "wiretap channel with causal state information"

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)