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: "new families of optimal frequency hopping sequence sets"
  Abstract: Frequency hopping sequences (FHSs) are employed to mitigate the interferences caused by the hits of frequencies in frequency hopping spread spectrum systems. In this paper, we present some new algebraic and combinatorial constructions for FHS sets, including an algebraic construction via the linear mapping, two direct constructions by using cyclotomic classes and recursive constructions based on cyclic difference matrices. By these constructions, a number of series of new FHS sets are then produced. These FHS sets are optimal with respect to the Peng-Fan bounds.

Connected through hyperedge HE-1 (induced by source paper "new families of strictly optimal frequency hopping sequence sets"):
  with members:
    - "frequency hopping sequences with optimal partial hamming correlation"

Connected through hyperedge HE-2 (induced by source paper "disjoint difference families and their applications"):
  with members:
    - "non overlapping codes"
    - "a combinatorial model of interference in frequency hopping schemes"
    - "high rate self synchronizing codes"
    - "information theoretic authentication and secrecy codes in the splitting model"
    - "combinatorial bounds and characterizations of splitting authentication codes"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "optimal rate code constructions for computationally simple channels"
    - "authentication and secrecy codes for equiprobable source probability distributions"

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)