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 communication over broadcast erasure channels with state feedback"
  Abstract: We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each transmission. We explore the achievable rate region when we require that the message to each receiver remains secret - in the information theoretical sense - from all the other receivers. We characterize the capacity of secure communication in all the cases where the capacity of the 1-to-$K$ communication scenario without the requirement of security is known. As a special case, we characterize the secret-message capacity of a single receiver point-to-point erasure channel with public state-feedback in the presence of a passive eavesdropper. #R##N#We find that in all cases where we have an exact characterization, we can achieve the capacity by using linear complexity two-phase schemes: in the first phase we create appropriate secret keys, and in the second phase we use them to encrypt each message. We find that the amount of key we need is smaller than the size of the message, and equal to the amount of encrypted message the potential eavesdroppers jointly collect. Moreover, we prove that a dishonest receiver that provides deceptive feedback cannot diminish the rate experienced by the honest receivers. #R##N#We also develop a converse proof which reflects the two-phase structure of our achievability scheme. As a side result, our technique leads to a new outer bound proof for the non-secure communication problem.

Connected through hyperedge HE-1 (induced by source paper "using mm waves for secret key establishment"):
  with members:
    - "secure communications in millimeter wave ad hoc networks"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "a distortion based approach for protecting inferences"):
  with members:
    - "uncertain wiretap channels and secure estimation"
    - "rate distortion theory for secrecy systems"

Connected through hyperedge HE-3 (induced by source paper "group secret key agreement over state dependent wireless broadcast channels"):
  with members:
    - "secret key agreement with channel state information at the transmitter"
    - "wireless network information flow a deterministic approach"
    - "exchanging secrets without using cryptography"
    - "mapel achieving global optimality for a non convex wireless power control problem"

Connected through hyperedge HE-4 (induced by source paper "the wiretap channel with generalized feedback secure communication and key generation"):
  with members:
    - "secret key generation using correlated sources and channels"
    - "on the achievable rate region of a new wiretap channel with side information"
    - "secrecy via sources and channels"
    - "secrecy degrees of freedom of mimo broadcast channels with delayed csit"
    - "the role of feedback in two way secure communications"
    - "the wiretap channel with feedback encryption over the channel"
    - "secret communication with feedback"
    - "multiple access channels with generalized feedback and confidential messages"

Connected through hyperedge HE-5 (induced by source paper "delay optimal secrecy in two relay network"):
  with members:
    - "on secure network coding with nonuniform or restricted wiretap sets"

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)