{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/18865903"
      "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" : [ "gt; ...&gt; contribute is a path too in the Binary Tree that contains all finite&gt; paths.In the COMPLETE INFINITE BINARY TREE, ther are no finite paths.A FISON (finite initial sequence of nodes) in such a tree is never a MISON (maximal initial sequence of nodes) and only a MISON can be a path in a COMPLETE INFINITE BINARY TREE.&gt; &gt; &gt; &gt; There is no infinite path in the Binary Tree of" ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "mathforum.org" ] } },

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