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: "handling constraints in combinatorial interaction testing in the presence of multi objective particle swarm and multithreading"
  Abstract: ContextCombinatorial testing strategies have lately received a lot of attention as a result of their diverse applications. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set based on their interaction (or combination). In practice, the input configurations of software systems are subjected to constraints, especially in case of highly configurable systems. To implement this feature within a strategy, many difficulties arise for construction. While there are many combinatorial interaction testing strategies nowadays, few of them support constraints. ObjectiveThis paper presents a new strategy, to construct combinatorial interaction test suites in the presence of constraints. MethodThe design and algorithms are provided in detail. To overcome the multi-judgement criteria for an optimal solution, the multi-objective particle swarm optimisation and multithreading are used. The strategy and its associated algorithms are evaluated extensively using different benchmarks and comparisons. ResultsOur results are promising as the evaluation results showed the efficiency and performance of each algorithm in the strategy. The benchmarking results also showed that the strategy can generate constrained test suites efficiently as compared to state-of-the-art strategies. ConclusionThe proposed strategy can form a new way for constructing of constrained combinatorial interaction test suites. The strategy can form a new and effective base for future implementations.

Connected through hyperedge HE-1 (induced by source paper "using simulated annealing for locating array construction"):
  with members:
    - "constrained locating arrays for combinatorial interaction testing"
    - "achievement of minimized combinatorial test suite for configuration aware software functional testing using the cuckoo search algorithm"
    - "a constructive proof of the general lovasz local lemma"

Connected through hyperedge HE-2 (induced by source paper "generation and application of constrained interaction test suites using base forbidden tuples with mixed neighborhood tabu search"):
  with members:
    - "achievement of minimized combinatorial test suite for configuration aware software functional testing using the cuckoo search algorithm"

Connected through hyperedge HE-3 (induced by source paper "combinatorial testing for deep learning systems"):
  with members:
    - "deepgauge multi granularity testing criteria for deep learning systems"
    - "testing deep neural networks"
    - "robust physical world attacks on deep learning models"
    - "chexnet radiologist level pneumonia detection on chest x rays with deep learning"
    - "towards proving the adversarial robustness of deep neural networks"
    - "deepxplore automated whitebox testing of deep learning systems"
    - "feature guided black box safety testing of deep neural networks"
    - "deepsafe a data driven approach for checking adversarial robustness in neural networks"

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.SE(Software Engineering)