Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Mapping and Matching Algorithms: Data Mining by Adaptive Graphs   Assume we have two bijective functions $U(x)$ and $M(x)$ with $M(x)\neq U(x)$
for all $x$ and $M,N: \N \rightarrow \N$ . Every day and in different
locations, we see the different results of $U$ and $M$ without seeing $x$. We
are not assured about the time stamp nor the order within the day but at least
the location is fully defined. We want to find the matching between $U(x)$ and
$M(x)$ (i.e., we will not know $x$). We formulate this problem as an adaptive
graph mining: we develop the theory, the solution, and the implementation. This
work stems from a practical problem thus our definitions. The solution is
simple, clear, and the implementation parallel and efficient. In our
experience, the problem and the solution are novel and we want to share our
finding.

32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol
37
The categories of this paper are: supr-con
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess