human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "optimal sequential fingerprinting wald vs tardos"):
  Abstract: We study sequential collusion-resistant fingerprinting, where the fingerprinting code is generated in advance but accusations may be made between rounds, and show that in this setting both the dynamic Tardos scheme and schemes building upon Wald's sequential probability ratio test (SPRT) are asymptotically optimal. We further compare these two approaches to sequential fingerprinting, highlighting differences between the two schemes. Based on these differences, we argue that Wald's scheme should in general be preferred over the dynamic Tardos scheme, even though both schemes have their merits. As a side result, we derive an optimal sequential group testing method for the classical model, which can easily be generalized to different group testing models.

Includes members:
  Member "asymptotics of fingerprinting and group testing tight bounds from channel capacities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "group testing an information theory perspective")
  Member "optimal symmetric tardos traitor tracing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes")
  Member "capacities and capacity achieving decoders for various fingerprinting games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes")
  Member "interactive fingerprinting codes and the hardness of preventing false discovery":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reasoning about generalization via conditional mutual information")
  Member "enhanced blind decoding of tardos codes with new map based functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes")
  Member "dynamic traitor tracing schemes revisited":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asymptotics of fingerprinting and group testing capacity achieving log likelihood decoders")
  Member "discrete distributions in the tardos scheme revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes")
  Member "fingerprinting codes and the price of approximate differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "privately learning markov random fields")

Question: Please tell me which class the source paper 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.CR(Cryptography and Security)