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: "on the optimality of keyless authentication in a noisy model"
  Abstract: We further study the keyless authentication problem in a noisy model in our previous work, where no secret setup is available for sender Alice and receiver Bob while there is DMC $W_1$ from Alice to Bob and a two-way noiseless but insecure channel between them. We propose a construction such that the message length over DMC $W_1$ does not depend on the size of the source space. If the source space is ${\cal S}$ and the number of channel $W_1$ uses is $n$, then our protocol only has a round complexity of $\log^*|{\cal S}|-\log^*n+4.$ In addition, we show that the round complexity of any secure protocol in our model is lower bounded by $\log^*|{\cal S}|-\log^* n-5$. We also obtain a lower bound on the success probability when the message size on DMC $W_1$ is given. Finally, we derive the capacity for a non-interactive authentication protocol under general DMCs, which extends the result under BSCs in our previous work.

Connected through hyperedge HE-1 (induced by source paper "secret key authentication capacity region part i average authentication rate"):
  with members:
    - "inner bound for the capacity region of noisy channels with an authentication requirement"
    - "keyless authentication in the presence of a simultaneously transmitting adversary"
    - "using the physical layer for wireless authentication in time variant channels"

Connected through hyperedge HE-2 (induced by source paper "secret key authentication capacity region part ii typical authentication rate"):
  with members:
    - "keyless authentication in the presence of a simultaneously transmitting adversary"
    - "using the physical layer for wireless authentication in time variant channels"

Connected through hyperedge HE-3 (induced by source paper "multi message authentication over noisy channel with secure channel codes"):
  with members:
    - "on the error region for channel estimation based physical layer authentication over rayleigh fading"
    - "message authentication code over a wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "cooperative secret key generation from phase estimation in narrowband fading channels"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "strong secrecy for erasure wiretap channels"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "analysis of channel based user authentication by key less and key based approaches"):
  with members:
    - "artificial noise aided message authentication codes with information theoretic security"
    - "on the error region for channel estimation based physical layer authentication over rayleigh fading"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "a theoretical analysis of authentication privacy and reusability across secure biometric systems"
    - "using the physical layer for wireless authentication in time variant 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)