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 wiretap channels with arbitrarily varying eavesdropper channel states"
  Abstract: In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wiretap channel in the sense of strong secrecy is derived, and shown to match with the converse in secure degrees of freedom. It is proved that there exists a universal coding scheme that secures the confidential message against any sequence of channel states experienced by the eavesdropper. This yields the conclusion that secure communication is possible regardless of the location or channel states of (potentially infinite number of) eavesdroppers. Additionally, it is observed that, the present setting renders the secrecy capacity problems for multi-terminal wiretap-type channels more tractable as compared the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access wiretap channel (MIMO MAC-WT) and the Gaussian MIMO broadcast wiretap channel (MIMO BC-WT) where the transmitter(s) and the intended receiver(s) have the same number of antennas.

Connected through hyperedge HE-1 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "semantic security capacity for wiretap channels of type ii"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "secrecy results for compound wiretap channels"
    - "polar coding for secret key generation"

Connected through hyperedge HE-2 (induced by source paper "secure degrees of freedom of wireless x networks using artificial noise alignment"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "on x channels with feedback and delayed csi"
    - "secure communication over parallel relay channel"
    - "on achievable degrees of freedom for mimo x channels"
    - "interference alignment for secrecy"

Connected through hyperedge HE-3 (induced by source paper "the secrecy capacity of compound gaussian mimo wiretap channels"):
  with members:
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "secrecy results for compound wiretap channels"
    - "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "on the compound mimo broadcast channels with confidential messages"
    - "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "secure degrees of freedom of one hop wireless networks"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "interference alignment for secrecy"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "real interference alignment with real numbers"
    - "degraded compound multi receiver wiretap channels"

Connected through hyperedge HE-5 (induced by source paper "blind mimome wiretap channel with delayed csit"):
  with members:
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "feasibility of interference alignment for the mimo interference channel"
    - "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 the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "artificial noise alignment for secure multicast using multiple antennas"
    - "on the secrecy degrees of freedom of multi antenna wiretap channels with delayed csit"

Connected through hyperedge HE-6 (induced by source paper "information spectrum approach to strong converse theorems for degraded wiretap channels"):
  with members:
    - "converses for secret key agreement and secure computing"
    - "strong converse and second order asymptotics of channel resolvability"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "fixed error asymptotics for erasure and list decoding"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "how many queries will resolve common randomness"

Connected through hyperedge HE-7 (induced by source paper "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"):
  with members:
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "universal secure network coding via rank metric codes"
    - "degrees of freedom region of the gaussian mimo broadcast channel with common and private messages"
    - "secrecy degrees of freedom of mimo broadcast channels with delayed csit"
    - "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"
    - "on the degrees of freedom of finite state compound wireless networks settling a conjecture by weingarten et al"

Connected through hyperedge HE-8 (induced by source paper "secure degrees of freedom of the gaussian mimo wiretap and mimo broadcast channels with unknown eavesdroppers"):
  with members:
    - "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "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"

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)