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: "a simple deterministic reduction for the gap minimum distance of code problem"
  Abstract: We present a simple deterministic gap-preserving reduction from SAT to the Minimum Distance of Code Problem over $\F_2$. We also show how to extend the reduction to work over any finite field. Previously a randomized reduction was known due to Dumer, Micciancio, and Sudan, which was recently derandomized by Cheng and Wan. These reductions rely on highly non-trivial coding theoretic constructions whereas our reduction is elementary. #R##N#As an additional feature, our reduction gives a constant factor hardness even for asymptotically good codes, i.e., having constant rate and relative distance. Previously it was not known how to achieve deterministic reductions for such codes.

Connected through hyperedge HE-1 (induced by source paper "minimum bounded chains and minimum homologous chains in embedded simplicial complexes"):
  with members:
    - "computing minimal persistent cycles polynomial and hard cases"
    - "on the hardness of learning sparse parities"
    - "annotating simplices with a homology basis and its applications"
    - "the least spanning area of a knot and the optimal bounding chain problem"
    - "almost 2 sat is fixed parameter tractable"

Connected through hyperedge HE-2 (induced by source paper "tight running time lower bounds for strong inapproximability of maximum k coverage unique set cover and related problems via t wise agreement testing theorem"):
  with members:
    - "a simple gap producing reduction for the parameterized set cover problem"
    - "parameterized intractability of even set and shortest vector problem"
    - "parameterized inapproximability of exact cover and nearest codeword"
    - "tight fpt approximations for k median and k means"
    - "agreement testing theorems on layered set systems"
    - "towards a general direct product testing theorem"
    - "gap s eth hardness of svp"
    - "eth hardness of approximating 2 csps and directed steiner network"

Connected through hyperedge HE-3 (induced by source paper "parameterized intractability of even set and shortest vector problem"):
  with members:
    - "gap s eth hardness of svp"
    - "parameterized complexity of csp for infinite constraint languages"
    - "on the quantitative hardness of cvp"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "on the hardness of learning sparse parities"
    - "tensor based hardness of the shortest vector problem to within almost polynomial factors"
    - "new lattice based cryptographic constructions"

Connected through hyperedge HE-4 (induced by source paper "on the hardness of learning sparse parities"):
  with members:
    - "on learning k parities with and without noise"
    - "losing weight by gaining edges"
    - "complexity of decoding positive rate reed solomon codes"
    - "noise tolerant learning the parity problem and the statistical query model"

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.CC(Computational Complexity)