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: "the gaussian many to one interference channel with confidential messages"
  Abstract: The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information theoretic secrecy to this model and consider the many-to-one interference channel with confidential messages, in which each receiver, in particular, the one subject to interference, is also one from which the interfering users' messages need to be kept secret from. We derive the achievable secrecy sum rate for this channel using nested lattice codes, as well as an upper bound on the secrecy sum rate for all possible channel gain configurations. We identify several nontrivial cases where the gap between the upper bound and the achieved secrecy sum rate is only a function of the number of the users K, and is uniform over all possible channel gain configurations in each case. In addition, we identify the secure degree of freedom for this channel and show it to be equivalent to its degree of freedom, i.e., the secrecy in high SNR comes for free.

Connected through hyperedge HE-1 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "semantic security capacity for wiretap channels of type ii"
    - "causal erasure channels"
    - "achievability proof via output statistics of random binning"
    - "information theoretically secure regenerating codes for distributed storage"
    - "the role of feedback in two way secure communications"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secure nested codes for type ii wiretap channels"

Connected through hyperedge HE-2 (induced by source paper "a new wiretap channel model and its strong secrecy capacity"):
  with members:
    - "semantic security capacity for wiretap channels of type ii"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "the role of feedback in two way secure communications"
    - "secure nested codes for type ii wiretap channels"
    - "the gaussian multiple access wire tap channel"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"):
  with members:
    - "secure degrees of freedom of wireless x networks using artificial noise alignment"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "on the degrees of freedom of the 3 user miso broadcast channel with hybrid csit"
    - "degrees of freedom region of the mimo interference channel with output feedback and delayed csit"
    - "dof analysis of the k user miso broadcast channel with alternating csit"
    - "on the dof region of the k user miso broadcast channel with hybrid csit"
    - "linear degrees of freedom of the mimo x channel with delayed csit"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"

Connected through hyperedge HE-4 (induced by source paper "joint power control in wiretap interference channels"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"
    - "outage constrained robust secure transmission for miso wiretap channels"
    - "spectrum leasing via cooperation for enhanced physical layer secrecy"
    - "interference assisted secret communication"
    - "cooperative secret communication with artificial noise in symmetric interference channel"
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"
    - "on the secrecy rate of interference networks using structured codes"

Connected through hyperedge HE-5 (induced by source paper "semantically secure lattice codes for the gaussian wiretap channel"):
  with members:
    - "secret key generation from gaussian sources using lattice hashing"
    - "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "strong secrecy from channel resolvability"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "strong secrecy for erasure wiretap channels"

Connected through hyperedge HE-6 (induced by source paper "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"):
  with members:
    - "a secure communication game with a relay helping the eavesdropper"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "explicit capacity achieving codes for worst case additive errors"
    - "the role of feedback in two way secure communications"
    - "providing secrecy with lattice codes"
    - "an algebraic watchdog for wireless network coding"
    - "two hop secure communication using an untrusted relay"

Connected through hyperedge HE-7 (induced by source paper "distributed storage codes meet multiple access wiretap channels"):
  with members:
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "interference alignment as a rank constrained rank minimization"
    - "interference alignment for the multi antenna compound wiretap channel"
    - "on the existence of optimal exact repair mds codes for distributed storage"
    - "on the secure degrees of freedom of the multiple access channel"
    - "on the secrecy degress of freedom of the multi antenna block fading wiretap channels"
    - "a survey on network codes for distributed storage"
    - "searching for minimum storage regenerating codes"

Connected through hyperedge HE-8 (induced by source paper "k user interference channels achievable secrecy rate and degrees of freedom"):
  with members:
    - "interference alignment for secrecy"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "providing secrecy with lattice codes"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "interference alignment on the deterministic channel and application to fully connected awgn interference networks"
    - "the capacity region of a class of discrete degraded interference channels"

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)