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: "exchanging secrets without using cryptography"
  Abstract: We consider the problem where a group of n nodes, connected to the same broadcast channel (e.g., a wireless network), want to generate a common secret bitstream, in the presence of an adversary Eve, who tries to obtain information on the bitstream. We assume that the nodes initially share a (small) piece of information, but do not have access to any out-of-band channel. We ask the question: can this problem be solved without relying on Eve's computational limitations, i.e., without using any form of public-key cryptography? #R##N#We propose a secret-agreement protocol, where the n nodes of the group keep exchanging bits until they have all agreed on a bit sequence that Eve cannot reconstruct with very high probability. In this task, the nodes are assisted by a small number of interferers, whose role is to create channel noise in a way that bounds the amount of information Eve can overhear. Our protocol has polynomial-time complexity and requires no changes to the physical or MAC layer of network devices. #R##N#First, we formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure, achieves optimal secret-generation rate for n = 2 nodes, and scales well to an arbitrary number of nodes. Second, we adapt our protocol to a small wireless 14-square-meter testbed; we experimentally show that, if Eve uses a standard wireless physical layer and is not too close to any of the nodes, 8 nodes can achieve a secret-generation rate of 38 Kbps. To the best of our knowledge, ours is the first experimental demonstration of information-theoretic secret exchange on a wireless network at a rate beyond a few tens of bits per second.

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

Connected through hyperedge HE-2 (induced by source paper "secret communication over broadcast erasure channels with state feedback"):
  with members:
    - "group secret key agreement over state dependent wireless broadcast channels"
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "keys through arq theory and practice"
    - "completely stale transmitter channel state information is still very useful"
    - "the wiretap channel with feedback encryption over the channel"

Connected through hyperedge HE-3 (induced by source paper "secure capacity region for erasure broadcast channels with feedback"):
  with members:
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "wireless network information flow a deterministic approach"
    - "keys through arq theory and practice"
    - "completely stale transmitter channel state information is still very useful"
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "the wiretap channel with feedback encryption over the channel"
    - "opportunistic network coding for video streaming over wireless"

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.CR(Cryptography and Security)