human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints"):
  Abstract: This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By re-visiting [18], we first present new and more general achievability bounds for random coding schemes under maximal or average probability of error requirements. Such general bounds are then applied to covert communication in AWGN channels where codewords are generated from Gaussian distribution while meeting the maximal power constraint. Further comparison is made between the new achievability bounds and existing one with deterministic codebooks.

Includes members:
  Member "first and second order asymptotics in covert communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information")
  Member "fundamental limits of covert communication over mimo awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi antenna jamming in covert communication")
  Member "covert communication in fading channels under channel uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")
  Member "covert wireless communication with artificial noise generation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")
  Member "covert communication with finite blocklength in awgn channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "covert transmission with a self sustained relay")
  Member "on covert communication with noise uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")
  Member "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "keyless covert communication via channel state information")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "keyless covert communication via channel state information")

Question: Please tell me which class the source paper 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)