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: "computation using noise based logic efficient string verification over a slow communication channel"
  Abstract: Utilizing the hyperspace of noise-based logic, we show two string verification methods with low communication complexity. One of them is based on continuum noise-based logic. The other one utilizes noise-based logic with random telegraph signals where a mathematical analysis of the error probability is also given. The last operation can also be interpreted as computing universal hash functions with noise-based logic and using them for string comparison. To find out with 10 -25 error probability that two strings with arbitrary length are different (this value is similar to the error probability of an idealistic gate in today's computer) Alice and Bob need to compare only 83 bits of the noise-based hyperspace. Copyright EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg 2011

Connected through hyperedge HE-1 (induced by source paper "entanglement and unsorted database search in noise based logic"):
  with members:
    - "a quantum inspired classical algorithm for recommendation systems"
    - "noise based logic gates by operations on the reference system"
    - "quantum inspired classical algorithms for principal component analysis and supervised clustering"
    - "drawing from hats by noise based logic"
    - "brain biological noise based logic"
    - "bird s eye view on noise based logic"
    - "noise based logic why noise a comparative study of the necessity of randomness out of orthogonality"
    - "new noise based logic representations to avoid some problems with time complexity"

Connected through hyperedge HE-2 (induced by source paper "noise based logic gates by operations on the reference system"):
  with members:
    - "drawing from hats by noise based logic"
    - "bird s eye view on noise based logic"
    - "noise based logic why noise a comparative study of the necessity of randomness out of orthogonality"
    - "instantaneous non squeezed noise based logic"
    - "new noise based logic representations to avoid some problems with time complexity"
    - "instantaneous noise based logic"

Connected through hyperedge HE-3 (induced by source paper "drawing from hats by noise based logic"):
  with members:
    - "noise based logic why noise a comparative study of the necessity of randomness out of orthogonality"
    - "instantaneous non squeezed noise based logic"
    - "new noise based logic representations to avoid some problems with time complexity"
    - "instantaneous noise based logic"

Connected through hyperedge HE-4 (induced by source paper "physical uncloneable function hardware keys utilizing kirchhoff law johnson noise secure key exchange and noise based logic"):
  with members:
    - "enhanced secure key exchange systems based on the johnson noise scheme"
    - "noise based logic why noise a comparative study of the necessity of randomness out of orthogonality"
    - "instantaneous non squeezed noise based logic"
    - "new noise based logic representations to avoid some problems with time complexity"
    - "instantaneous noise based logic"

Connected through hyperedge HE-5 (induced by source paper "enhanced secure key exchange systems based on the johnson noise scheme"):
  with members:
    - "information theoretic security by the laws of classical physics"
    - "effective privacy amplification for secure classical communications"
    - "information networks secured by the laws of physics"
    - "instantaneous non squeezed noise based logic"
    - "new noise based logic representations to avoid some problems with time complexity"

Connected through hyperedge HE-6 (induced by source paper "times in noise based logic increased dimensions of logic hyperspace"):
  with members:
    - "noise based logic why noise a comparative study of the necessity of randomness out of orthogonality"
    - "instantaneous non squeezed noise based logic"
    - "new noise based logic representations to avoid some problems with time complexity"
    - "instantaneous noise based logic"

Connected through hyperedge HE-7 (induced by source paper "information theoretic security by the laws of classical physics"):
  with members:
    - "effective privacy amplification for secure classical communications"
    - "information networks secured by the laws of physics"
    - "instantaneous non squeezed noise based logic"
    - "new noise based logic representations to avoid some problems with time complexity"

Connected through hyperedge HE-8 (induced by source paper "noise based logic why noise a comparative study of the necessity of randomness out of orthogonality"):
  with members:
    - "instantaneous non squeezed noise based logic"
    - "new noise based logic representations to avoid some problems with time complexity"
    - "instantaneous noise based logic"

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)