human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "new bounds and constructions for constant weighted x codes"):
  Abstract: As a crucial technique for integrated circuits (IC) test response compaction, $X$-compact employs a special kind of codes called $X$-codes for reliable compressions of the test response in the presence of unknown logic values ($X$s). From a combinatorial view point, Fujiwara and Colbourn \cite{FC2010} introduced an equivalent definition of $X$-codes and studied $X$-codes of small weights that have good detectability and $X$-tolerance. #R##N#In this paper, bounds and constructions for constant weighted $X$-codes are investigated. First, we prove a general lower bound on the maximum number of codewords $n$ for an $(m,n,d,x)$ $X$-code of weight $w$, and we further improve this lower bound for the case with $x=2$ and $w=3$ through the probabilistic method. Then, using tools from additive combinatorics and finite fields, we present some explicit constructions for constant weighted $X$-codes with $d=3,7$ and $x=2$, which are nearly optimal for cases when $d=3$ and $w=3,4$. We also consider a special class of $X$-codes introduced in \cite{FC2010} and improve the best known lower bound on the maximum number of codewords for this kind of $X$-codes.

Includes members:
  Member "bounds on separating redundancy of linear codes and rates of x codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the maximum number of codewords of x codes of constant weight three")
  Member "a combinatorial approach to x tolerant compaction circuits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the maximum number of codewords of x codes of constant weight three")

Question: Please tell me which class the source paper 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)