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: "the set of solutions of random xorsat formulae"
  Abstract: The XOR-satisfiability (XORSAT) problem requires finding an assignment of $n$ Boolean variables that satisfy $m$ exclusive OR (XOR) clauses, whereby each clause constrains a subset of the variables. We consider random XORSAT instances, drawn uniformly at random from the ensemble of formulae containing $n$ variables and $m$ clauses of size $k$. This model presents several structural similarities to other ensembles of constraint satisfaction problems, such as $k$-satisfiability ($k$-SAT), hypergraph bicoloring and graph coloring. For many of these ensembles, as the number of constraints per variable grows, the set of solutions shatters into an exponential number of well-separated components. This phenomenon appears to be related to the difficulty of solving random instances of such problems. We prove a complete characterization of this clustering phase transition for random $k$-XORSAT. In particular, we prove that the clustering threshold is sharp and determine its exact location. We prove that the set of solutions has large conductance below this threshold and that each of the clusters has large conductance above the same threshold. Our proof constructs a very sparse basis for the set of solutions (or the subset within a cluster). This construction is intimately tied to the construction of specific subgraphs of the hypergraph associated with an instance of $k$-XORSAT. In order to study such subgraphs, we establish novel local weak convergence results for them.

Connected through hyperedge HE-1 (induced by source paper "interactive particle systems on hypergraphs drift analysis and the walksat algorithm"):
  with members:
    - "coalescing random walks and voting on connected graphs"
    - "the solution space geometry of random linear equations"
    - "relationship between clustering and algorithmic phase transitions in the random k xorsat model and its np complete extensions"
    - "on the dynamics of social balance on general networks with an application to xor sat"
    - "spines of random constraint satisfaction problems definition and connection with computational complexity"

Connected through hyperedge HE-2 (induced by source paper "parity queries for binary classification"):
  with members:
    - "unequal error protection querying policies for the noisy 20 questions problem"
    - "community recovery in hypergraphs"
    - "predicting positive and negative links with noisy queries theory practice"
    - "fundamental limits on data acquisition trade offs between sample complexity and query difficulty"
    - "information recovery from pairwise measurements"
    - "decoding binary node labels from censored edge measurements phase transition and efficient recovery"
    - "boolean compressed sensing and noisy group testing"
    - "group testing with probabilistic tests theory design and application"

Connected through hyperedge HE-3 (induced by source paper "inside the clustering window for random linear equations"):
  with members:
    - "on independent sets in random graphs"
    - "chasing the k colorability threshold"
    - "catching the k naesat threshold"
    - "frozen variables in random boolean constraint satisfaction problems"
    - "the solution space geometry of random linear equations"
    - "reconstruction and clustering in random constraint satisfaction problems"
    - "tight thresholds for cuckoo hashing via xorsat"
    - "survey propagation an algorithm for satisfiability"

Connected through hyperedge HE-4 (induced by source paper "linear programming relaxations for goldreich s generators over non binary alphabets"):
  with members:
    - "spectral redemption in clustering sparse networks"
    - "the power of linear programming for valued csps"
    - "tight thresholds for cuckoo hashing via xorsat"

Connected through hyperedge HE-5 (induced by source paper "frozen variables in random boolean constraint satisfaction problems"):
  with members:
    - "on independent sets in random graphs"
    - "catching the k naesat threshold"
    - "the solution space geometry of random linear equations"
    - "on the concentration of the number of solutions of random satisfiability formulas"
    - "reconstruction and clustering in random constraint satisfaction problems"
    - "tight thresholds for cuckoo hashing via xorsat"
    - "decay of correlations for sparse graph error correcting codes"
    - "on the solution space geometry of random constraint satisfaction problems"

Connected through hyperedge HE-6 (induced by source paper "the solution space geometry of random linear equations"):
  with members:
    - "on independent sets in random graphs"
    - "the satisfiability threshold for a seemingly intractable random constraint satisfaction problem"
    - "reconstruction and clustering in random constraint satisfaction problems"
    - "tight thresholds for cuckoo hashing via xorsat"

Connected through hyperedge HE-7 (induced by source paper "satisfiability thresholds beyond k xorsat"):
  with members:
    - "sharp load thresholds for cuckoo hashing"
    - "tight thresholds for cuckoo hashing via xorsat"
    - "survey propagation an algorithm for satisfiability"

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.DM(Discrete Mathematics)