{"entities":{"Q7368347":{"pageid":31556027,"ns":120,"title":"Item:Q7368347","lastrevid":105442361,"modified":"2026-10-09T14:22:17Z","type":"item","id":"Q7368347","labels":{"en":{"language":"en","value":"eTURF: A competitive TURF algorithm for large datasets"}},"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":"Q7368347$589E4C02-A805-47FD-9AD6-0C23DEEE5652","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e0fc1907319765365d06881627820c275af34ed9","datavalue":{"value":"10.1016/J.FOODQUAL.2011.06.004","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7368347$29077FAF-E8D9-4372-90E4-46009EA6718E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"d3df050e603349b54e4f36bb22eeaa3cbcbcea1e","datavalue":{"value":{"entity-type":"item","numeric-id":72172,"id":"Q72172"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7368347$70118404-02C0-4A17-8845-AAB268034D80","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"44dc7c2dfe563f865c069079f99e746133e1f927","datavalue":{"value":"23","type":"string"},"datatype":"string"},"type":"statement","id":"Q7368347$A7A3974E-FC75-4CF7-977E-7E845B4A8689","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"68b47585e633a4a2b067e511536f1dd047cbde8f","datavalue":{"value":"1","type":"string"},"datatype":"string"},"type":"statement","id":"Q7368347$B14057F1-3128-45CA-B9B7-2BB6D481E9A2","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"3e0adf9c0aab5ac24f73f29488688e0334e13627","datavalue":{"value":"44-48","type":"string"},"datatype":"string"},"type":"statement","id":"Q7368347$67E0A452-BA94-4AEB-A8AC-D534C3CBA559","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5193a6d0f01e6732158533d4a5a65ad89cbcac68","datavalue":{"value":{"time":"+2012-01-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":10,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7368347$FF8E183E-6CA0-4969-9855-EB306648BEDD","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"86987eaf7f11bd8add6eb56a2e8d5360f8879742","datavalue":{"value":"John M. Ennis","type":"string"},"datatype":"string"},"type":"statement","id":"Q7368347$ED90555A-98F5-4F61-8315-8CA4D61351AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"c435c3585529749a0982127094661458e33e563f","datavalue":{"value":"Charles M. Fayle","type":"string"},"datatype":"string"},"type":"statement","id":"Q7368347$6193C232-3503-46AE-9CD4-C25CB5DF4DC5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"908c20c8d785832b25837814ba35ec321869ab40","datavalue":{"value":"Daniel M. Ennis","type":"string"},"datatype":"string"},"type":"statement","id":"Q7368347$18CA4FBF-A33A-4A5A-B52B-2A9FDC0C7404","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":"Q7368347$E29F1AF6-2998-40D4-A16B-49F3BAC16FB5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"ETURF: A competitive TURF algorithm for large datasets","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/ETURF:_A_competitive_TURF_algorithm_for_large_datasets"}}}}}