{"entities":{"Q99739":{"pageid":101055,"ns":120,"title":"Item:Q99739","lastrevid":59724021,"modified":"2026-04-10T13:42:53Z","type":"item","id":"Q99739","labels":{"en":{"language":"en","value":"ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R"}},"descriptions":{"en":{"language":"en","value":"scientific article"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q99739$E0AA54EF-0163-4D3F-8DD5-76F711B1A419","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"dfaaa214e04b4c5ee024b0bf9ac2cadeef8064b1","datavalue":{"value":{"entity-type":"item","numeric-id":57539,"id":"Q57539"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q99739$706FC32E-D9C2-4ED5-80E4-8863F162070F","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"8ae30a50800baa461240d9dd9a4becfdbe14d4a3","datavalue":{"value":"77","type":"string"},"datatype":"string"},"type":"statement","id":"Q99739$396ED990-C49B-4E48-9C30-94992031B771","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"68b47585e633a4a2b067e511536f1dd047cbde8f","datavalue":{"value":"1","type":"string"},"datatype":"string"},"type":"statement","id":"Q99739$EE904B8A-3CFE-4F2F-ADE4-6F6DEC5AE484","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b7faee5a668f34283a86c67ea3a2dbec14373e78","datavalue":{"value":{"time":"+2017-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q99739$A179133A-4DA5-4665-8F1C-C966DD01CA9C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7f9a74aa0ee4ff8e727ad90433b9351971a19572","datavalue":{"value":{"entity-type":"item","numeric-id":99734,"id":"Q99734"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q99739$39FE56FB-55F2-4E75-A204-D37854E8D337","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"79ae8f0fe66ef7440291d566d9efa5896768f621","datavalue":{"value":{"entity-type":"item","numeric-id":99738,"id":"Q99738"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q99739$A2293F87-80FA-438A-9A22-AC4C5A43630E","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"487bd3be5cb7ea545021aba97e4aa63620fe7e83","datavalue":{"value":"Q114869298","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q99739$5F0B97FF-D8C8-487B-8A13-AA65F4D3AB9B","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q99739$E4B11CFE-C477-4A6A-884D-D7B2D6049E42","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6493afc7a86827e2f13e53ca64414499a83274e6","datavalue":{"value":"10.18637/JSS.V077.I01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q99739$1C76CA79-FE00-4A23-A86F-A0DA0F362FE8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R (scientific article)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Ranger:_A_Fast_Implementation_of_Random_Forests_for_High_Dimensional_Data_in_C%2B%2B_and_R_(scientific_article)"}}}}}