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: "secrecy capacity of the wiretap channel with noisy feedback"
  Abstract: In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a discrete memoryless modulo-additive channel with a full-duplex destination node is considered first, and it is shown that a judicious use of feedback increases the perfect secrecy capacity to the capacity of the source-destination channel in the absence of the wiretapper. In the achievability scheme, the feedback signal corresponds to a private key, known only to the destination. Then a half-duplex system is considered, for which a novel feedback technique that always achieves a positive perfect secrecy rate (even when the source-wiretapper channel is less noisy than the source-destination channel) is proposed. These results hinge on the modulo-additive property of the channel, which is exploited by the destination to perform encryption over the channel without revealing its key to the source.

Connected through hyperedge HE-1 (induced by source paper "on the commitment capacity of unfair noisy channels"):
  with members:
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"
    - "secrecy capacity region of fading broadcast channels"
    - "the secrecy capacity of the mimo wiretap channel"
    - "commitment capacity of discrete memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "secrecy capacity of colored gaussian noise channels with feedback"):
  with members:
    - "multiple access wiretap channel with noiseless feedback"
    - "an improved feedback coding scheme for the wire tap channel"
    - "control approach to computing the feedback capacity for stationary finite dimensional gaussian channels"
    - "secrecy degrees of freedom of mimo broadcast channels with delayed csit"
    - "the wiretap channel with feedback encryption over the channel"
    - "secret communication with feedback"
    - "feedback capacity of stationary gaussian channels"

Connected through hyperedge HE-3 (induced by source paper "the secrecy rate region of the broadcast channel"):
  with members:
    - "interference assisted secret communication"
    - "capacity bounds for broadcast channels with confidential messages"
    - "on the secure degrees of freedom in the k user gaussian interference channel"
    - "success exponent of wiretapper a tradeoff between secrecy and reliability"
    - "secure communication over fading channels"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "on the secrecy capacity of fading channels"
    - "relay channels with confidential messages"

Connected through hyperedge HE-4 (induced by source paper "information theoretic security in wireless networks"):
  with members:
    - "authentication over noisy channels"
    - "secure communication over fading channels"
    - "secrecy capacity region of fading broadcast channels"
    - "secure nested codes for type ii wiretap channels"
    - "multiple antenna secure broadcast over wireless networks"
    - "cognitive interference channels with confidential messages"
    - "multiple access channels with generalized feedback and confidential messages"
    - "secrecy capacity region of binary and gaussian multiple access 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)