anchor.diff:    [] ?p ?o.
     FILTER(isLiteral(?o))
   }
  -
  +....
  ++
  +[[query_for_datatypes_on_background_graph]]
  +.Listing 12. Obtain the datatypes on the background graph
  +....
  +SELECT DISTINCT (datatype(?o) AS ?ldt)
  +WHERE{
  +  [] ?p ?o.
  +  FILTER(isLiteral(?o))
  +}
   ....
   4.  Properties
   +
   If there is GRAPH clause being applied, we retrieve a list of properties using a query described in Listing
  -<<query_for_properties_on_a_graph, 9>>.
  +<<query_for_properties_on_a_graph, 13>>.
   +
   [[query_for_properties_on_a_graph]]
  -.Listing 9. Obtain the properties on a graph g
  +.Listing 13. Obtain the properties on a graph g
   ....
   SELECT DISTINCT ?p
           FROM <g>
   WHERE{
           ?s ?p ?o.
   }
  -
  +....
  ++
  +[[query_for_properties_on_background_graph]]
  +.Listing 14. Obtain the properties on the background graph
  +....
  +SELECT DISTINCT ?p
  +WHERE{
  +        ?s ?p ?o.
  +}
   ....
   +
   We evaluate Metadata score as follows:
  
positive.code: }
  LIMIT 1
  OFFSET 100
  
  ....
  . Include links to other URIs. so that they can discover more things
  +
  
negative.code: +
  We assume all subjects of statements are things. If there is GRAPH clause being applied, we search invalid
  statement using a query described in Listing
  <<non_http_uri_subject_on_a_graph, 15>>, and if nothing is found the endpoint
  satisfied this rule.
  +
  Note that we ignore Virtuoso specific graphs since Virtuoso contains a
  graph which contains invalid statements.
  +
  [[non_http_uri_subject_on_a_graph]]
  .Listing 15. A Query for searching non-HTTP-URI subjects on a graph g
  ....
  SELECT
    *
  