Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Compressing Sets and Multisets of Sequences   This article describes lossless compression algorithms for multisets of
sequences, taking advantage of the multiset's unordered structure. Multisets
are a generalisation of sets where members are allowed to occur multiple times.
A multiset can be encoded na\"ively by simply storing its elements in some
sequential order, but then information is wasted on the ordering. We propose a
technique that transforms the multiset into an order-invariant tree
representation, and derive an arithmetic code that optimally compresses the
tree. Our method achieves compression even if the sequences in the multiset are
individually incompressible (such as cryptographic hash sums). The algorithm is
demonstrated practically by compressing collections of SHA-1 hash sums, and
multisets of arbitrary, individually encodable objects.

12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th
18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con
13
The categories of this paper are: quant-ph
23
The categories of this paper are: solv-int