Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Validation of Matching   We introduce a technique to compute probably approximately correct (PAC)
bounds on precision and recall for matching algorithms. The bounds require some
verified matches, but those matches may be used to develop the algorithms. The
bounds can be applied to network reconciliation or entity resolution
algorithms, which identify nodes in different networks or values in a data set
that correspond to the same entity. For network reconciliation, the bounds do
not require knowledge of the network generation process.

5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga
20
The categories of this paper are: acc-phys
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
4
The categories of this paper are: cond-mat
17
The categories of this paper are: q-fin
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org