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: "privacy preserving data oblivious geometric algorithms for geographic data"
  Abstract: We give efficient data-oblivious algorithms for several fundamental geometric problems that are relevant to geographic information systems, including planar convex hulls and all-nearest neighbors. Our methods are "data-oblivious" in that they don't perform any data-dependent operations, with the exception of operations performed inside low-level blackbox circuits having a constant number of inputs and outputs. Thus, an adversary who observes the control flow of one of our algorithms, but who cannot see the inputs and outputs to the blackbox circuits, cannot learn anything about the input or output. This behavior makes our methods applicable to secure multiparty computation (SMC) protocols for geographic data used in location-based services. In SMC protocols, multiple parties wish to perform a computation on their combined data without revealing individual data to the other parties. For instance, our methods can be used to solve a problem posed by Du and Atallah, where Alice has a set, A, of m private points in the plane, Bob has another set, B, of n private points in the plane, and Alice and Bob want to jointly compute the convex hull of A u B without disclosing any more information than what can be derived from the answer. In particular, neither Alice nor Bob want to reveal any of their respective points that are in the interior of the convex hull of A u B.

Connected through hyperedge HE-1 (induced by source paper "exploring differential obliviousness"):
  with members:
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"
    - "data oblivious graph algorithms in outsourced external memory"
    - "data oblivious graph drawing model and algorithms"
    - "optimal aggregation algorithms for middleware"

Connected through hyperedge HE-2 (induced by source paper "a language for probabilistically oblivious computation"):
  with members:
    - "trace abstraction modulo probability"
    - "proving uniformity and independence by self composition and coupling"
    - "coupling proofs are probabilistic product programs"
    - "lightdp towards automating differential privacy proofs"
    - "probabilistic couplings for probabilistic reasoning"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"

Connected through hyperedge HE-3 (induced by source paper "mpc meets sna a privacy preserving analysis of distributed sensitive social networks"):
  with members:
    - "towards practical oblivious ram"
    - "de anonymizing social networks"

Connected through hyperedge HE-4 (induced by source paper "oblivious sorting and queues"):
  with members:
    - "a general multi party protocol for minimal communication and local computation"
    - "oblivious secure deletion with bounded history independence"
    - "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"

Connected through hyperedge HE-5 (induced by source paper "zig zag sort a simple deterministic data oblivious sorting algorithm running in o n log n time"):
  with members:
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "privacy preserving access of outsourced data via oblivious ram simulation"
    - "spin the bottle sort and annealing sort oblivious sorting via round robin random comparisons"

Connected through hyperedge HE-6 (induced by source paper "data oblivious graph drawing model and algorithms"):
  with members:
    - "oblivious ram simulation with efficient worst case access overhead"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "privacy preserving access of outsourced data via oblivious ram simulation"
    - "randomized shellsort a simple oblivious sorting algorithm"

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.CG(Computational Geometry)