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: "an information theoretic framework for active de anonymization in social networks based on group memberships"
  Abstract: In this paper, a new mathematical formulation for the problem of de-anonymizing social network users by actively querying their membership in social network groups is introduced. In this formulation, the attacker has access to a noisy observation of the group membership of each user in the social network. When an unidentified victim visits a malicious website, the attacker uses browser history sniffing to make queries regarding the victim's social media activity. Particularly, it can make polar queries regarding the victim's group memberships and the victim's identity. The attacker receives noisy responses to her queries. The goal is to de-anonymize the victim with the minimum number of queries. Starting with a rigorous mathematical model for this active de-anonymization problem, an upper bound on the attacker's expected query cost is derived, and new attack algorithms are proposed which achieve this bound. These algorithms vary in computational cost and performance. The results suggest that prior heuristic approaches to this problem provide sub-optimal solutions.

Connected through hyperedge HE-1 (induced by source paper "a concentration of measure approach to database de anonymization"):
  with members:
    - "fundamental limits of database alignment"
    - "typicality matching for pairs of correlated graphs"
    - "matching anonymized and obfuscated time series to users profiles"
    - "seeded graph matching efficient algorithms and theoretical guarantees"
    - "where you are is who you are user identification by matching statistics"

Connected through hyperedge HE-2 (induced by source paper "analysis of a canonical labeling algorithm for the alignment of correlated erd h o s r enyi graphs"):
  with members:
    - "nearly efficient algorithms for the graph matching problem on correlated random graphs"
    - "seeded graph matching via large neighborhood statistics"
    - "reconciling graphs and sets of sets"
    - "exact alignment recovery for correlated erdos renyi graphs"
    - "spectral alignment of graphs"
    - "optimal de anonymization in random graphs with community structure"
    - "an efficient reconciliation algorithm for social networks"

Connected through hyperedge HE-3 (induced by source paper "optimal active social network de anonymization using information thresholds"):
  with members:
    - "a simple converse of burnashev s reliability function"

Connected through hyperedge HE-4 (induced by source paper "seeded graph matching efficient algorithms and theoretical guarantees"):
  with members:
    - "de anonymization of social networks with communities when quantifications meet algorithms"
    - "optimal de anonymization in random graphs with community structure"

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.IT(Information Theory)