<http://webisa.webdatacommons.org/118274953>	<http://www.w3.org/ns/prov#wasQuotedFrom>	<google.com> .
<http://webisa.webdatacommons.org/118274953>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://www.w3.org/ns/prov#Entity> .
<http://webisa.webdatacommons.org/prov/516227481>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://webisa.webdatacommons.org/118274953> .
<http://webisa.webdatacommons.org/118274953>	<http://www.w3.org/ns/prov#value>	"A hypergraph G is defined to be the pair (V, E), where V is a non-empty set of nodes and E is the set of hyperedges, such that E is a mapping on non-empty subsets of V (i.e., E:2v ???2v)." .