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: "superimposed codes and threshold group testing"
  Abstract: We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper bound on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained for non-adaptive threshold group testing which develop the theory of superimposed codes

Connected through hyperedge HE-1 (induced by source paper "improved non adaptive algorithms for threshold group testing with a gap"):
  with members:
    - "group testing an information theory perspective"
    - "a framework for generalized group testing with inhibitors and its potential application in neuroscience"
    - "separable codes for the symmetric multiple access channel"
    - "efficiently decodable non adaptive threshold group testing"
    - "grotesque noisy group testing quick and efficient"
    - "improved constructions for non adaptive threshold group testing"
    - "noise resilient group testing limitations and constructions"

Connected through hyperedge HE-2 (induced by source paper "improved encoding and decoding for non adaptive threshold group testing"):
  with members:
    - "a framework for generalized group testing with inhibitors and its potential application in neuroscience"
    - "efficient nonrandom construction and decoding of non adaptive group testing"
    - "separable codes for the symmetric multiple access channel"
    - "grotesque noisy group testing quick and efficient"
    - "improved constructions for non adaptive threshold group testing"
    - "noise resilient group testing limitations and constructions"
    - "explicit non adaptive combinatorial group testing schemes"

Connected through hyperedge HE-3 (induced by source paper "efficiently decodable non adaptive threshold group testing"):
  with members:
    - "grotesque noisy group testing quick and efficient"
    - "improved constructions for non adaptive threshold group testing"
    - "noise resilient group testing limitations and constructions"
    - "explicit non adaptive combinatorial group testing schemes"

Connected through hyperedge HE-4 (induced by source paper "separable codes for the symmetric multiple access channel"):
  with members:
    - "probabilistic existence results for separable codes"
    - "bounds on the rate of disjunctive codes"
    - "new bounds for frameproof codes"

Connected through hyperedge HE-5 (induced by source paper "bounds on the rate of disjunctive codes"):
  with members:
    - "lectures on designing screening experiments"

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)