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: "a general upper bound on the size of constant weight conflict avoiding codes"
  Abstract: Conflict-avoiding codes are used in the multiple-access collision channel without feedback. The number of codewords in a conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, a new upper bound on the size of constant-weight conflict-avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and all Hamming weights. Several existing constructions for conflict-avoiding codes, which are known to be optimal for Hamming weights equal to four and five, are shown to be optimal for all Hamming weights in general.

Connected through hyperedge HE-1 (induced by source paper "on the existence of perfect splitter sets"):
  with members:
    - "on the non existence of lattice tilings by quasi crosses"
    - "tilings with n dimensional chairs and their applications to asymmetric codes"
    - "quasi cross lattice tilings with applications to flash memory"

Connected through hyperedge HE-2 (induced by source paper "partially user irrepressible sequence sets and conflict avoiding codes"):
  with members:
    - "transmission sequence design and allocation for wide area ad hoc networks"
    - "constructions for difference triangle sets"

Connected through hyperedge HE-3 (induced by source paper "optimal strongly conflict avoiding codes of even length and weight three"):
  with members:
    - "construction and applications of crt sequences"

Connected through hyperedge HE-4 (induced by source paper "transmission sequence design and allocation for wide area ad hoc networks"):
  with members:
    - "construction and applications of crt sequences"
    - "construction of short protocol sequences with worst case throughput guarantee"

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)