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 "subspace fuzzy vault"):
  Abstract: Fuzzy vault is a scheme providing secure authentication based on fuzzy matching of sets. A major application is the use of biometric features for authentication, whereby unencrypted storage of these features is not an option because of security concerns. While there is still ongoing research around the practical implementation of such schemes, we propose and analyze here an alternative construction based on subspace codes. This offers some advantages in terms of security, as an eventual discovery of the key does not provide an obvious access to the features. Crucial for an efficient implementation are the computational complexity and the choice of good code parameters. The parameters depend on the particular application, e.g. the biometric feature to be stored and the rate one wants to allow for false acceptance. The developed theory is closely linked to constructions of subspace codes studied in the area of random network coding.

Includes members:
  Member "on burst error correction and storage security of noisy data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fuzzy authentication using rank distance")
  Member "an algebraic approach for decoding spread codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "geometric decoding of subspace codes with explicit schubert calculus applied to spread codes")
  Member "on fuzzy syndrome hashing with ldpc coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fuzzy authentication using rank distance")
  Member "spread decoding in extension fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "geometric decoding of subspace codes with explicit schubert calculus applied to spread codes")
  Member "spread codes and spread decoding in network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "symbol erasure correction capability of spread codes")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "coding solutions for the secure biometric storage problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fuzzy authentication using rank distance")

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