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: "probabilistic existence results for separable codes"
  Abstract: Separable codes were defined by Cheng and Miao in 2011, motivated by applications to the identification of pirates in a multimedia setting. Combinatorially,    $\overline {t}$   -separable codes lie somewhere between    $t$   -frameproof and    $(t-1)$   -frameproof codes: all    $t$   -frameproof codes are    $\overline {t}$   -separable, and all    $\overline {t}$   -separable codes are    $(t-1)$   -frameproof. Results for frameproof codes show that (when    $q$    is large) there are    $q$   -ary    $\overline {t}$   -separable codes of length    $n$    with approximately    $q^{\lceil n/t\rceil }$    codewords, and that no    $q$   -ary    $\overline {t}$   -separable codes of length    $n$    can have more than approximately    $q^{\lceil n/(t-1)\rceil }$    codewords. This paper provides improved probabilistic existence results for    $\overline {t}$   -separable codes when    $t\geq 3$   . More precisely, for all    $t\geq 3$    and all    $n\geq 3$   , there exists a constant    $\kappa $    (depending only on    $t$    and    $n$   ), such that there exists a    $q$   -ary    $\overline {t}$   -separable code of length    $n$    with at least    $\kappa q^{n/(t-1)}$    codewords for all sufficiently large integers    $q$   . This shows, in particular, that the upper bound [derived from the bound on    $(t-1)$   -frameproof codes] on the number of codewords in a    $\overline {t}$   -separable code is realistic. The results above are more surprising after examining the situation when    $t=2$   . Results due to Gao and Ge show that a    $q$   -ary    $\overline {2}$   -separable code of length    $n$    can contain at most    $\frac {3}{2}q^{2\lceil n/3\rceil }-\frac {1}{2}q^{\lceil n/3\rceil }$    codewords, and that codes with at least    $\kappa q^{2n/3}$    codewords exist. Thus, optimal    $\overline {2}$   -separable codes behave neither like two-frameproof nor one-frameproof codes. This paper also observes that the bound of Gao and Ge can be strengthened to show that the number of codewords of a    $q$   -ary    $\overline {2}$   -separable code of length    $n$    is at most    $q^{\lceil 2n/3\rceil }+\tfrac {1}{2}q^{\lfloor n/3\rfloor }(q^{\lfloor n/3\rfloor }-1)$   .

Connected through hyperedge HE-1 (induced by source paper "signature codes for weighted binary adder channel and multimedia fingerprinting"):
  with members:
    - "codes with the identifiable parent property for multimedia fingerprinting"
    - "lectures on designing screening experiments"
    - "strongly separable codes"
    - "two level fingerprinting codes"

Connected through hyperedge HE-2 (induced by source paper "probabilistic existence results for parent identifying schemes"):
  with members:
    - "codes with the identifiable parent property for multimedia fingerprinting"
    - "bounds on traceability schemes"

Connected through hyperedge HE-3 (induced by source paper "on capacities of the two user union channel with complete feedback"):
  with members:
    - "new bounds for frameproof codes"

Connected through hyperedge HE-4 (induced by source paper "separable codes for the symmetric multiple access channel"):
  with members:
    - "superimposed codes and threshold group testing"
    - "bounds on the rate of disjunctive codes"
    - "new bounds for frameproof codes"

Connected through hyperedge HE-5 (induced by source paper "bounds for signature codes"):
  with members:
    - "lectures on designing screening experiments"
    - "new bounds for frameproof codes"

Connected through hyperedge HE-6 (induced by source paper "bounds and constructions for overline 3 strongly separable codes with length 3"):
  with members:
    - "separating hash families a johnson type bound and new constructions"
    - "strongly separable codes"

Connected through hyperedge HE-7 (induced by source paper "multimedia ipp codes with efficient tracing"):
  with members:
    - "probabilistic existence results for parent identifying schemes"
    - "codes with the identifiable parent property for multimedia fingerprinting"
    - "strongly separable codes"

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)