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 "outer bounds on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"):
  Abstract: This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic setting. The derivation of the outer bounds on the secrecy capacity region involves careful selection of the side information to be provided to the receivers and using the secrecy constraints at the receivers in a judicious manner. To this end, a novel partitioning of the encoded messages and outputs is proposed for the deterministic model based on the strength of interference and signal. The obtained outer bounds are shown to be tight using the achievable scheme derived by the authors in a previous work. Using the insight obtained from the deterministic model, outer bounds on the secrecy capacity region of the 2-user Gaussian Z-IC are obtained. The equivalence between the outer bounds for both the models is also established. It is also shown that secrecy constraint at the receiver does not hurt the capacity region of the 2-user Z-IC for the deterministic model in the weak/moderate interference regime. On the other hand, the outer bounds developed for the Gaussian case shows that secrecy constraint at the receiver can reduce the capacity region for the weak/moderate interference regime. The study of the relative performance of these bounds reveals insight into the fundamental limits of the 2-user Z-IC with limited rate transmitter cooperation.

Includes members:
  Member "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation":
    also connected through other hyperedges:
      (none)
  Member "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds")
  Member "multiaccess channel with partially cooperating encoders and security constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure lossy source coding for some classes of helper and gray wyner models")
  Member "interference alignment for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "interference assisted secret communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "jammer assisted resource allocation in secure ofdma with untrusted users")
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")
  Member "the approximate capacity region of the gaussian z interference channel with conferencing encoders":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation")

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)