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 "bounds and constructions for overline 3 strongly separable codes with length 3"):
  Abstract: As separable code (SC, IEEE Trans Inf Theory 57:4843-4851, 2011) and frameproof code (FPC, IEEE Trans Inf Theory 44:1897-1905, 1998) do in multimedia fingerprinting, strongly separable code (SSC, Des. Codes and Cryptogr.79:303-318, 2016) can be also used to construct anti-collusion codes. Furthermore, SSC is better than FPC and SC in the applications for multimedia fingerprinting since SSC has lower tracing complexity than that of SC (the same complexity as FPC) and weaker structure than that of FPC. In this paper, we first derive several upper bounds on the number of codewords of $\overline{t}$-SSC. Then we focus on $\overline{3}$-SSC with codeword length $3$, and obtain the following two main results: (1) An equivalence between an SSC and an SC. %Consequently a more tighter upper bound $(3q^2/4)$ and lower bound $(q^{3/2})$ on the number of codewords are obtained; (2) An improved lower bound $\Omega (q^{5/3}+q^{4/3}-q)$ on the size of a $q$-ary SSC when $q=q_1^6$ for any prime power $q_1\equiv\ 1 \pmod 6$, better than the before known bound $\lfloor\sqrt{q}\rfloor^{3}$, which is obtained by means of difference matrix and the known result on the subset of $\mathbb{F}^{n}_q$ containing no three points on a line.

Includes members:
  Member "separating hash families a johnson type bound and new constructions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounds on traceability schemes")
  Member "probabilistic existence results for separable codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "signature codes for weighted binary adder channel and multimedia fingerprinting")
  Member "strongly separable codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "signature codes for weighted binary adder channel and multimedia fingerprinting")

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.DM(Discrete Mathematics)