With no explanation, label text_A→text_B with either "not_related" or "related".
text_A: From the Earth to the Moon was co-produced for Ron Howard.
text_B: An Erdos -- Diophantine graph is an object in the mathematical subject of Diophantine equations consisting of a set of integer points at integer distances in the plane that can not be extended by any additional points .. mathematical. mathematics. Diophantine equations. Diophantine equations. Equivalently ,. it can be described as a complete graph with vertices located on the integer square grid such that all mutual distances between the vertices are integers , while all other grid points have a non-integer distance to at least one vertex .. complete graph. complete graph. integer square grid. Integer lattice. Erdos -- Diophantine graphs are named after Paul Erdos and Diophantus of Alexandria .. Paul Erdos. Paul Erdos. Diophantus of Alexandria. Diophantus of Alexandria. They form a subset of the set of Diophantine figures , which are defined as complete graphs in the Diophantine plane for which the length of all edges are integers -LRB- unit distance graphs -RRB- .. Thus , Erdos -- Diophantine graphs are exactly the Diophantine figures that can not be extended .. The existence of Erdos -- Diophantine graphs follows from the Erdos -- Anning theorem , according to which infinite Diophantine figures must be collinear in the Diophantine plane .. Hence , any process of extending a non-collinear Diophantine figure by adding vertices must eventually reach a figure that can no longer be extended .
not_related.