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: "lists that are smaller than their parts a coding approach to tunable secrecy"
  Abstract: We present a new information-theoretic definition and associated results, based on list decoding in a source coding setting. We begin by presenting list-source codes, which naturally map a key length (entropy) to list size. We then show that such codes can be analyzed in the context of a novel information-theoretic metric, \epsilon-symbol secrecy, that encompasses both the one-time pad and traditional rate-based asymptotic metrics, but, like most cryptographic constructs, can be applied in non-asymptotic settings. We derive fundamental bounds for \epsilon-symbol secrecy and demonstrate how these bounds can be achieved with MDS codes when the source is uniformly distributed. We discuss applications and implementation issues of our codes.

Connected through hyperedge HE-1 (induced by source paper "principal inertia components and applications"):
  with members:
    - "brascamp lieb inequality and its reverse an information theoretic view"
    - "the most informative boolean function conjecture holds for high noise"
    - "bounds between contraction coefficients"
    - "on the duality of additivity and tensorization"
    - "managing your private and public data bringing down inference attacks against your privacy"
    - "remarks on the most informative function conjecture at fixed mean"
    - "euclidean information theory of networks"
    - "notes on information theoretic privacy"

Connected through hyperedge HE-2 (induced by source paper "multi user guesswork and brute force security"):
  with members:
    - "encoding tasks and renyi entropy"
    - "guesswork large deviations and shannon entropy"
    - "brute force searching the typical set and guesswork"
    - "guessing a password over a wireless channel on the effect of noise non uniformity"
    - "investigating the distribution of password choices"
    - "the shannon cipher system with a guessing wiretapper general sources"
    - "guessing revisited a large deviations approach"
    - "guessing based on length functions"

Connected through hyperedge HE-3 (induced by source paper "hiding symbols and functions new metrics and constructions for information theoretic security"):
  with members:
    - "an exploration of the role of principal inertia components in information theory"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "rate distortion theory for secrecy systems"
    - "universal secure network coding via rank metric codes"
    - "source coding with side information using list decoding"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-4 (induced by source paper "quantifying the computational security of multi user systems"):
  with members:
    - "encoding tasks and renyi entropy"
    - "guesswork large deviations and shannon entropy"
    - "brute force searching the typical set and guesswork"
    - "guessing a password over a wireless channel on the effect of noise non uniformity"
    - "investigating the distribution of password choices"
    - "the shannon cipher system with a guessing wiretapper general sources"
    - "guessing revisited a large deviations approach"
    - "guessing based on length functions"

Connected through hyperedge HE-5 (induced by source paper "maximal correlation secrecy"):
  with members:
    - "hiding symbols and functions new metrics and constructions for information theoretic security"
    - "on maximal correlation mutual information and data privacy"
    - "analysis of boolean functions"
    - "an exploration of the role of principal inertia components in information theory"
    - "bounds on inference"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-6 (induced by source paper "guesswork large deviations and shannon entropy"):
  with members:
    - "investigating the distribution of password choices"
    - "guessing revisited a large deviations approach"
    - "guessing based on length functions"

Connected through hyperedge HE-7 (induced by source paper "brute force searching the typical set and guesswork"):
  with members:
    - "guesswork large deviations and shannon entropy"
    - "guessing revisited a large deviations approach"
    - "guessing based on length functions"

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)