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: "secret writing on dirty paper a deterministic view"
  Abstract: Recently there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as “secret writing on dirty paper”) to within (1/2) log 3 bits.

Connected through hyperedge HE-1 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "capacity of the state dependent wiretap channel secure writing on dirty paper"
    - "analogy between gambling and measurement based work extraction"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "on state dependent broadcast channels with cooperation"

Connected through hyperedge HE-2 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the deterministic sum capacity of the multiple access wiretap channel"
    - "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-3 (induced by source paper "finite state markov wiretap channel with delayed feedback"):
  with members:
    - "multiple access relay wiretap channel"
    - "relay broadcast channel with confidential messages"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "interference assisted secret communication"
    - "on the capacity of memoryless finite state multiple access channels with asymmetric state information at the encoders"
    - "capacity bounds for broadcast channels with confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"

Connected through hyperedge HE-4 (induced by source paper "individual secrecy for broadcast channels with receiver side information"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "strong secrecy for cooperative broadcast channels"
    - "individual secrecy for the broadcast channel"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "effective secrecy reliability confusion and stealth"
    - "new results on multiple input multiple output broadcast channels with confidential messages"

Connected through hyperedge HE-5 (induced by source paper "on the capacity of the 2 user interference channel with transmitter cooperation and secrecy constraints"):
  with members:
    - "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "interference mitigation through limited transmitter cooperation"
    - "interference mitigation through limited receiver cooperation"
    - "secrecy capacity of a class of orthogonal relay eavesdropper channels"
    - "secrecy in cooperative relay broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"):
  with members:
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "wireless network information flow a deterministic approach"
    - "interference alignment for secrecy"
    - "interference mitigation through limited transmitter cooperation"
    - "interference mitigation through limited receiver cooperation"
    - "cooperative encoding for secrecy in interference channels"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"

Connected through hyperedge HE-7 (induced by source paper "worst case expected capacity loss of slow fading channels"):
  with members:
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "gaussian interference channel capacity to within one bit"
    - "on the fading paper achievable region of the fading mimo broadcast channel"
    - "writing on fading paper and causal transmitter csi"

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)