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 "covert communication over a k user multiple access channel"):
  Abstract: We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless multiple-access channel (MAC) while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless MAC. We assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver. We show that each of the $K$ transmitters can transmit on the order of $\sqrt{n}$ reliable and covert bits per $n$ channel uses, exceeding which, the warden will be able to detect the communication. We identify the optimal pre-constants of the scaling, which leads to a complete characterization of the covert capacity region of the $K$-user binary-input MAC. We show that, asymptotically, all sum-rate constraints are inactive unlike the traditional MAC capacity region. We also characterize the channel conditions that have to be satisfied for the transmitters to operate without a secret key.

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 "embedding covert information in broadcast communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "cooperative resolvability and secrecy in the cribbing multiple access channel":
    also connected through other hyperedges:
      (none)
  Member "multilevel coded pulse position modulation for covert communications over binary input discrete memoryless channels":
    also connected through other hyperedges:
      (none)
  Member "covert communication achieved by a greedy relay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covert transmission with a self sustained relay")
  Member "time division transmission is optimal for covert communication over broadcast channels":
    also connected through other hyperedges:
      (none)
  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 "mac resolvability first and second order results":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resolvability on continuous alphabets")

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)