{"entities":{"Q6575140":{"pageid":14186295,"ns":120,"title":"Item:Q6575140","lastrevid":99881723,"modified":"2026-06-05T20:55:16Z","type":"item","id":"Q6575140","labels":{"en":{"language":"en","value":"Massively parallel and dynamic algorithms for minimum size clustering"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7883647"}},"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":"Q6575140$EA610AAD-94F0-4AC9-91E9-45FBE252C293","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c6d52c439f939e5a0f66c55a2d93cf159cdc2c16","datavalue":{"value":{"text":"Massively parallel and dynamic algorithms for minimum size clustering","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6575140$FB853B13-C67D-4D98-B1FC-010AB0173F8D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1166335dbcc70bed19e8e738c5172c1367292314","datavalue":{"value":"10.1137/1.9781611977073.66","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575140$C85238FE-8DC8-4606-A960-2C4098B78D95","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e5c9612754a27b41d5c9d4a6e3eeacfc914d45a9","datavalue":{"value":{"entity-type":"item","numeric-id":2331610,"id":"Q2331610"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575140$71877D3C-B269-47B8-BED2-71C5FC377B22","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d6d89b25ad098ba2c607cbf5b6ef4d28053ba40e","datavalue":{"value":{"entity-type":"item","numeric-id":322365,"id":"Q322365"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575140$B8DD82D7-C1DA-4D54-8373-3AD95358046F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d0a10103d2ba783e47a71bc1d8056c5b62a2098c","datavalue":{"value":{"entity-type":"item","numeric-id":547288,"id":"Q547288"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575140$57370FC8-D2C1-4A47-8D22-686AD4EA2CD9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"065e41c968f87a282805a42ab10aa0e73adb89ea","datavalue":{"value":{"entity-type":"item","numeric-id":4978014,"id":"Q4978014"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575140$491F0B33-2981-4FA9-A632-86C4CE23D800","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"20bb98d83d204109387fd4af6383bb63aeda87a0","datavalue":{"value":{"time":"+2024-07-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6575140$BB03BB9D-2399-4A58-A2CC-74C6048C842A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575140$38D4935A-0470-4561-91E0-D2747638AC9A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f0f0c07414dbefa1e538dee952518fd1af66edae","datavalue":{"value":"7883647","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575140$A34922C8-F190-4BB7-8E87-5FE170F60764","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":"Q6575140$197B0C5A-5366-4C83-89DD-E60086C905BA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Massively parallel and dynamic algorithms for minimum size clustering","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Massively_parallel_and_dynamic_algorithms_for_minimum_size_clustering"}}}}}