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: "bounds on the rate of disjunctive codes"
  Abstract: A binary code is said to be a disjunctive (s, l) cover-free code if it is an incidence matrix of a family of sets where the intersection of any l sets is not covered by the union of any other s sets of this family. A binary code is said to be a list-decoding disjunctive of strength s with list size L if it is an incidence matrix of a family of sets where the union of any s sets can cover no more that L ? 1 other sets of this family. For L = l = 1, both definitions coincide, and the corresponding binary code is called a disjunctive s-code. This paper is aimed at improving previously known and obtaining new bounds on the rate of these codes. The most interesting of the new results is a lower bound on the rate of disjunctive (s, l) cover-free codes obtained by random coding over the ensemble of binary constant-weight codes; its ratio to the best known upper bound converges as s ? ?, with an arbitrary fixed l ? 1, to the limit 2e?2 = 0.271 ... In the classical case of l = 1, this means that the upper bound on the rate of disjunctive s-codes constructed in 1982 by D'yachkov and Rykov is asymptotically attained up to a constant factor a, 2e?2 ≤ a ≤ 1.

Connected through hyperedge HE-1 (induced by source paper "optimal multistage group testing algorithm for 3 defectives"):
  with members:
    - "a new algorithm for two stage group testing"
    - "performance of group testing algorithms with near constant tests per item"
    - "on a hypergraph approach to multistage group testing problems"
    - "lectures on designing screening experiments"
    - "group testing with random pools optimal two stage algorithms"

Connected through hyperedge HE-2 (induced by source paper "a new algorithm for two stage group testing"):
  with members:
    - "performance of group testing algorithms with near constant tests per item"
    - "on a hypergraph approach to multistage group testing problems"
    - "lectures on designing screening experiments"
    - "group testing with random pools optimal two stage algorithms"

Connected through hyperedge HE-3 (induced by source paper "nearly optimal sparse group testing"):
  with members:
    - "performance of group testing algorithms with near constant tests per item"
    - "novel impossibility results for group testing"
    - "near optimal noisy group testing via separate decoding of items"
    - "individual testing is optimal for nonadaptive group testing in the linear regime"
    - "improved group testing rates with constant column weight designs"
    - "nonadaptive group testing with random set of defectives"
    - "limits on support recovery with probabilistic models an information theoretic framework"
    - "group testing schemes from codes and designs"

Connected through hyperedge HE-4 (induced by source paper "exact learning from an honest teacher that answers membership queries"):
  with members:
    - "exact learning of juntas from membership queries"
    - "almost optimal cover free families"
    - "progress on polynomial identity testing ii"
    - "linear time constructions of some d restriction problems"
    - "on exact learning monotone dnf from membership queries"
    - "learning boolean halfspaces with small weights from membership queries"
    - "efficient computation of representative sets with applications in parameterized and exact algorithms"
    - "analytical approach to parallel repetition"

Connected through hyperedge HE-5 (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"
    - "new bounds for frameproof codes"

Connected through hyperedge HE-6 (induced by source paper "on a hypergraph approach to multistage group testing problems"):
  with members:
    - "bounds on the rate of disjunctive codes in russian"
    - "lectures on designing screening experiments"
    - "group testing with random pools optimal two stage algorithms"

Connected through hyperedge HE-7 (induced by source paper "almost disjunct matrices from codes and designs"):
  with members:
    - "nonadaptive group testing with random set of defectives via constant weight codes"
    - "semiquantitative group testing"
    - "on almost disjunct matrices for group testing"
    - "non adaptive group testing explicit bounds and novel algorithms"
    - "semi quantitative group testing"
    - "explicit non adaptive combinatorial group testing schemes"

Connected through hyperedge HE-8 (induced by source paper "group testing schemes from codes and designs"):
  with members:
    - "nonadaptive group testing with random set of defectives"
    - "nonadaptive group testing with random set of defectives via constant weight codes"
    - "almost cover free codes and designs"
    - "semiquantitative group testing"
    - "on almost disjunct matrices for group testing"

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)