{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/438776115"
      "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" : [ "Bitwise AND has the advantage of short-circuiting the evaluation if it runs into a 0, but I wonder if there is a bound where a really large number with all the bits on (like 1048575 which is 20 1s in binary) is actually less efficient than a small integer division (5 % 2)?" ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "codingforums.com" ] } },

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