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: "secrecy capacity region of fading broadcast channels"
  Abstract: The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy capacity region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are then applied to give the ergodic secrecy capacity region for the fading BCC.

Connected through hyperedge HE-1 (induced by source paper "semantically secure lattice codes for compound mimo channels"):
  with members:
    - "random ensembles of lattices from generalized reductions"
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "universal lattice codes for mimo channels"
    - "a general formula for compound channel capacity"
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "the mimo wiretap channel decomposed"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"

Connected through hyperedge HE-2 (induced by source paper "on the commitment capacity of unfair noisy channels"):
  with members:
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"
    - "secrecy capacity of the wiretap channel with noisy feedback"
    - "the secrecy capacity of the mimo wiretap channel"
    - "commitment capacity of discrete memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "secrecy capacity analysis over kappa mu fading channels theory and applications"):
  with members:
    - "on the equivalence between interference and eavesdropping in wireless communications"
    - "analytic expressions and bounds for special functions and applications in communication theory"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages"):
  with members:
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "a physical layer secured key distribution technique for ieee 802 11g wireless networks"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "broadcast channels with confidential messages by randomness constrained stochastic encoder"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "increasing physical layer security through scrambled codes and arq"
    - "secure broadcasting over fading channels with statistical qos constraints"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"

Connected through hyperedge HE-5 (induced by source paper "strongly secure communications over the two way wiretap channel"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the wiretap channel with feedback encryption over the channel"
    - "secret communication with feedback"
    - "the mimome channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-6 (induced by source paper "on the relationship between the multi antenna secrecy communications and cognitive radio communications"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "multi antenna gaussian broadcast channels with confidential messages"
    - "weighted sum rate optimization for cognitive radio mimo broadcast channels"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "cognitive interference channels with confidential messages"

Connected through hyperedge HE-7 (induced by source paper "information theoretic security in wireless networks"):
  with members:
    - "authentication over noisy channels"
    - "secure communication over fading channels"
    - "secrecy capacity of the wiretap channel with noisy feedback"
    - "secure nested codes for type ii wiretap channels"
    - "multiple antenna secure broadcast over wireless networks"
    - "cognitive interference channels with confidential messages"
    - "multiple access channels with generalized feedback and confidential messages"
    - "secrecy capacity region of binary and gaussian multiple access channels"

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)