FORRT-Claim (explore)

FORRT-Claim

https://w3id.org/sciencelive/o/terms/FORRT-Claim

Assigned to 1 class:

http://www.w3.org/2002/07/owl#Class Class ( )

Described in 1 nanopublication:

https://w3id.org/np/RA4MprIemm... FORRT Claim ( )

Has 5 instances:

https://w3id.org/np/RARXnKVStR.../aida_dggs_interoperability Effect of DGGS Indexing on Associating Vector and Raster Geospatial Data ( )
http://purl.org/aida/DGGS-base...rary%20coordinate%20precision. AIDA sentence: DGGS-based land-use mapping avoids sliver polygon artifacts that arise from overlaying vector datase... ( )
https://w3id.org/np/RAsLG-Kjy1... RAsLG-Kjy1 ( )
http://purl.org/aida/Quantum%2...%20in%20biological%20networks. AIDA sentence: Quantum approximate optimization algorithms outperform classical methods for disjoint network motif ... ( )
http://purl.org/aida/This+is+another+test. AIDA sentence: This is another test. ( )

Related Templates

Declaring an original claim according to FORRT - by Tobias Kuhn, 2026-02-27
Declaring an original claim according to FORRT (deprecated) - by Tobias Kuhn, 2026-02-26

(none)

References

Nanopublication	Part	Subject	Predicate	Object	Published By	Published On
https://w3id.org/np/RARXnKVStR... RARXnKVStR	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	https://w3id.org/np/RARXnKVStR.../aida_dggs_interoperability aida_dggs_interoperability	http://www.w3.org/1999/02/22-rdf-syntax-ns#type type	FORRT-Claim	Anne Fouilloux	2026-02-28T13:52:38.400Z
https://w3id.org/np/RAVdxfm3fg... RAVdxfm3fg	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	FORRT-Claim	http://www.w3.org/2000/01/rdf-schema#label label	FORRT claim	Tobias Kuhn	2026-02-27T08:23:36.496Z
https://w3id.org/np/RAVdxfm3fg... RAVdxfm3fg	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	https://w3id.org/np/RAVdxfm3fg.../st00 st00	http://www.w3.org/1999/02/22-rdf-syntax-ns#object object	FORRT-Claim	Tobias Kuhn	2026-02-27T08:23:36.496Z
https://w3id.org/np/RAHsZvw0Xh... RAHsZvw0Xh	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	FORRT-Claim	http://www.w3.org/2000/01/rdf-schema#label label	FORRT claim	Tobias Kuhn	2026-02-26T07:47:33.685Z
https://w3id.org/np/RAHsZvw0Xh... RAHsZvw0Xh	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	https://w3id.org/np/RAHsZvw0Xh.../st01 st01	http://www.w3.org/1999/02/22-rdf-syntax-ns#object object	FORRT-Claim	Tobias Kuhn	2026-02-26T07:47:33.685Z
https://w3id.org/np/RACbKOI-Wh... RACbKOI-Wh	links a nanopublication to its pubinfo http://www.nanopub.org/nschema#hasPublicationInfo pubinfo	FORRT-Claim	https://w3id.org/np/o/ntemplate/hasLabelFromApi hasLabelFromApi	FORRT Claim - A claim according to the FORRT framework.	Tobias Kuhn	2026-02-26T07:37:46.967Z
https://w3id.org/np/RACbKOI-Wh... RACbKOI-Wh	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	https://w3id.org/sciencelive/o/terms/asAidaStatement asAidaStatement	http://www.w3.org/2000/01/rdf-schema#domain domain	FORRT-Claim	Tobias Kuhn	2026-02-26T07:37:46.967Z
https://w3id.org/np/RAMEH9yQlB... RAMEH9yQlB	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	http://purl.org/aida/DGGS-base...rary%20coordinate%20precision. DGGS-based land-use mapping avoids sliver polygon artifacts that arise from overlaying vector datasets with arbitrary coordinate precision.	http://www.w3.org/1999/02/22-rdf-syntax-ns#type type	FORRT-Claim	Anne Fouilloux	2026-02-18T21:29:46.129Z
https://w3id.org/np/RA7bPmoGr5... RA7bPmoGr5	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	https://w3id.org/np/RAsLG-Kjy1... RAsLG-Kjy1	http://www.w3.org/1999/02/22-rdf-syntax-ns#type type	FORRT-Claim	Anne Fouilloux	2026-02-18T21:26:32.781Z
https://w3id.org/np/RANm9cS8je... RANm9cS8je	links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion	http://purl.org/aida/Quantum%2...%20in%20biological%20networks. Quantum approximate optimization algorithms outperform classical methods for disjoint network motif identification in biological networks.	http://www.w3.org/1999/02/22-rdf-syntax-ns#type type	FORRT-Claim	Anne Fouilloux	2026-02-18T21:24:58.546Z
Showing 1 to 10 of 18 << < 1 2 > >>