{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/303425282"
      "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" : [ "Theorem 2 also known as the theorem of Fermi-Euler and fully sounds so:Any prime number the form 4k+1, where k is a natural number, can be presented as a sum of two squares of natural numbers, besides by only one possible way.Let's focus now on a problem, how to get decomposition of any prime 4k+1 to a sum of two squares.As I read in the internet, effective methods now allegedly do not exist.Most" ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "rechenkraft.net" ] } },

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