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 "strong secrecy for multiple access channels"):
  Abstract: We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders have entropy-limited access to common randomness. If no common randomness is available, then the achievable region derived here does not allow for the secret transmission of a common message. The second coding problem assumes that the encoders do not have a common message nor access to common randomness. However, they may have a conferencing link over which they may iteratively exchange rate-limited information. This can be used to form a common message and common randomness to reduce the second coding problem to the first one. We give the example of a channel where the achievable region equals zero without conferencing or common randomness and where conferencing establishes the possibility of secret message transmission. Both coding problems describe practically relevant networks which need to be secured against eavesdropping attacks.

Includes members:
  Member "secrecy results for compound wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure polar coding with delayed wiretapping information")
  Member "the arbitrarily varying multiple access channel with conferencing encoders":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "strongly secure communications over the two way wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "mimo wiretap channels with arbitrarily varying eavesdropper channel states":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "the compound multiple access channel with partially cooperating encoders":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the capacity region of the arbitrarily varying mac with and without constraints")
  Member "fading cognitive multiple access channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for wireless ergodic fading broadcast channels with partial csit")
  Member "multiple access channels with generalized feedback and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multiple access wiretap channel with noiseless feedback")
  Member "the discrete memoryless multiple access channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multiple access channel with common message and secrecy constraint")

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)