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: "on secrecy above secrecy capacity"
  Abstract: We consider secrecy obtained when one transmits on a Gaussian Wiretap channel above the secrecy capacity. Instead of equivocation, we consider probability of error as the criterion of secrecy. The usual channel codes are considered for transmission. The rates obtained can reach the channel capacity. We show that the "confusion" caused to the Eve when the rate of transmission is above capacity of the Eve's channel is similar to the confusion caused by using the wiretap channel codes used below the secrecy capacity.

Connected through hyperedge HE-1 (induced by source paper "physical layer security for ultra reliable and low latency communications"):
  with members:
    - "short packet downlink transmission with non orthogonal multiple access"
    - "ultra reliable and low latency communications in 5g downlink physical layer aspects"
    - "ultra reliable low latency cellular networks use cases challenges and approaches"
    - "location based beamforming for enhancing secrecy in rician wiretap channels"
    - "analysis of short blocklength codes for secrecy"
    - "ber based physical layer security with finite codelength combining strong converse and error amplification"
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"

Connected through hyperedge HE-2 (induced by source paper "ber based physical layer security with finite codelength combining strong converse and error amplification"):
  with members:
    - "performance assessment and design of finite length ldpc codes for the gaussian wiretap channel"
    - "performance analysis and design of two edge type ldpc codes for the bec wiretap channel"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "secrecy gain a wiretap lattice code design"
    - "invertible extractors and wiretap protocols"

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)