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: "efficient one way secret key agreement and private channel coding via polarization"
  Abstract: We introduce explicit schemes based on the polarization phenomenon for the task of secret-key agreement from common information and one-way public communication as well as for the task of private channel coding. Our protocols are distinct from previously known schemes in that they combine two practically relevant properties: they achieve the ultimate rate--defined with respect to a strong secrecy condition--and their complexity is essentially linear in the blocklength. However, we are not able to give an efficient algorithm for code construction.

Connected through hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "empirical and strong coordination via soft covering with polar codes"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "an information theoretic approach to secret sharing"

Connected through hyperedge HE-2 (induced by source paper "polar coding for common message only wiretap broadcast channel"):
  with members:
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "universal polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-3 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"):
  with members:
    - "secure massive mimo systems with limited rf chains"
    - "secure transmission with large numbers of antennas and finite alphabet inputs"
    - "probabilistically robust swipt for secrecy misome systems"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "full duplex bidirectional secure communications under perfect and distributionally ambiguous eavesdropper s csi"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "physical layer security aware routing and performance tradeoffs in ad hoc networks"
    - "hybrid procoder and combiner design for secure transmission in mmwave mimo systems"

Connected through hyperedge HE-4 (induced by source paper "strong secrecy on a class of degraded broadcast channels using polar codes"):
  with members:
    - "a comparative study of polar code constructions for the awgn channel"
    - "polar codes for broadcast channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for interference networks"
    - "an information theoretic approach to secret sharing"
    - "polar coding for secret key generation"
    - "entropy bounds for discrete random variables via maximal coupling"

Connected through hyperedge HE-5 (induced by source paper "alignment of polarized sets"):
  with members:
    - "polar codes for broadcast channels"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "universal polar codes"
    - "on the construction of polar codes"
    - "wiretap channels implications of the more capable condition and cyclic shift symmetry"

Connected through hyperedge HE-6 (induced by source paper "universal hashing for information theoretic security"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "polar coding for the general wiretap channel"):
  with members:
    - "polar codes for broadcast channels"
    - "polar codes for distributed hierarchical source coding"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "polar coding for interference networks"
    - "polar codes for the two user multiple access channel"

Connected through hyperedge HE-8 (induced by source paper "polar coding for the broadcast channel with confidential messages a random binning analogy"):
  with members:
    - "polar codes for broadcast channels"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar coding for secret key generation"
    - "on secure communication with constrained randomization"
    - "achievability proof via output statistics of random binning"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

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)