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 bounds for frameproof codes"
  Abstract: Frameproof codes are used to fingerprint digital data. It can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for $w$-frameproof codes of length $N$ over an alphabet of size $q$. The upper bound is based on a combinatorial approach and the lower bound is based on a probabilistic construction. Both bounds can improve previous results when $q$ is small compared to $w$, say $cq\leq w$ for some constant $c\leq q$. Furthermore, we pay special attention to binary frameproof codes. We show a binary $w$-frameproof code of length $N$ can not have more than $N$ codewords if $N<\binom{w+1}{2}$.

Connected through hyperedge HE-1 (induced by source paper "on capacities of the two user union channel with complete feedback"):
  with members:
    - "probabilistic existence results for separable codes"

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

Connected through hyperedge HE-3 (induced by source paper "bounds for signature codes"):
  with members:
    - "probabilistic existence results for separable codes"
    - "lectures on designing screening experiments"

Connected through hyperedge HE-4 (induced by source paper "bounds on traceability schemes"):
  with members:
    - "separating hash families a johnson type bound and new constructions"
    - "new results for traitor tracing schemes"
    - "new bounds on the number of tests for disjunct matrices"

Connected through hyperedge HE-5 (induced by source paper "some bounds of separating hash families"):
  with members:
    - "separating hash families a johnson type bound and new constructions"
    - "a tight bound on the size of certain separating hash families"
    - "on tight bounds for binary frameproof codes"

Connected through hyperedge HE-6 (induced by source paper "new results for traitor tracing schemes"):
  with members:
    - "new bounds on the number of tests for disjunct matrices"
    - "on tight bounds for binary frameproof 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)