{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/33119880"
      "properties" : {
        "http://www.w3.org/1999/02/22-rdf-syntax-ns#type" : [ "http://www.w3.org/ns/prov#Entity" ] ,
        "http://www.w3.org/ns/prov#value" : [ "Path v 0 , v 1 , v 2 , ???, v k is the shortest path from i = 0 v 0 to v k if there is no other path from v 0 to v k with lower weight." ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "slideshare.net" ] } },

    { "id" : "http://webisa.webdatacommons.org/prov/215306669"
      "properties" : {
        "http://www.w3.org/ns/prov#wasDerivedFrom" : [ "http://webisa.webdatacommons.org/33119880"] } } }
