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: "balanced allocations a simple proof for the heavily loaded case"
  Abstract: We provide a relatively simple proof that the expected gap between the maximum load and the average load in the two choice process is bounded by $(1+o(1))\log \log n$, irrespective of the number of balls thrown. The theorem was first proven by Berenbrink et al. Their proof uses heavy machinery from Markov-Chain theory and some of the calculations are done using computers. In this manuscript we provide a significantly simpler proof that is not aided by computers and is self contained. The simplification comes at a cost of weaker bounds on the low order terms and a weaker tail bound for the probability of deviating from the expectation.

Connected through hyperedge HE-1 (induced by source paper "a loosely self stabilizing protocol for randomized congestion control with logarithmic memory"):
  with members:
    - "skeap leap scalable distributed priority queues for constant and arbitrary priorities"
    - "skueue a scalable and sequentially consistent distributed queue"
    - "cone dht a distributed self stabilizing algorithm for a heterogeneous storage system"
    - "weak vs self vs probabilistic stabilization"

Connected through hyperedge HE-2 (induced by source paper "parallel balanced allocations the heavily loaded case"):
  with members:
    - "the 1 2 3 toolkit for building your own balls into bins algorithm"
    - "tight bounds for randomized load balancing on arbitrary network topologies"
    - "tight bounds for parallel randomized load balancing"

Connected through hyperedge HE-3 (induced by source paper "succinct oblivious ram"):
  with members:
    - "privacy preserving access of outsourced data via oblivious ram simulation"

Connected through hyperedge HE-4 (induced by source paper "consistent hashing with bounded loads"):
  with members:
    - "on the insertion time of random walk cuckoo hashing"
    - "on the insertion time of cuckoo hashing"

Connected through hyperedge HE-5 (induced by source paper "more analysis of double hashing for balanced allocations"):
  with members:
    - "on the k independence required by linear probing and minwise independence"
    - "balanced allocations and double hashing"
    - "fast pseudo random fingerprints"

Connected through hyperedge HE-6 (induced by source paper "a generalization of multiple choice balls into bins tight bounds"):
  with members:
    - "balanced allocation on graphs"

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)