{"entities":{"Q7019710":{"pageid":21621177,"ns":120,"title":"Item:Q7019710","lastrevid":76691958,"modified":"2026-04-24T19:04:12Z","type":"item","id":"Q7019710","labels":{"en":{"language":"en","value":"Two provably consistent divide-and-conquer clustering algorithms for large networks"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7993150"}},"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":"Q7019710$658B0211-96F9-4639-B602-289B9DFE5FE6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c6a1b1840984a6086b340bc0ac821b19d4864942","datavalue":{"value":{"text":"Two provably consistent divide-and-conquer clustering algorithms for large networks","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7019710$E9CC73B9-11D0-4BB7-B604-581E38A60EA8","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c6986b4c6ce427ddcdd10b8dd1c5379c8956e87d","datavalue":{"value":"1556.05164","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7019710$FEC1B988-0E1F-4875-9AFD-61E38D658A63","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9be9f1ad1ad53950c24705052b86a2cb801ba2ac","datavalue":{"value":"10.1073/PNAS.2100482118","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7019710$26F2B347-78C0-4327-9FEF-7F886EBBD9AC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f281db3e22c42c10a6629fa53c56d4562ac00a01","datavalue":{"value":{"entity-type":"item","numeric-id":3191250,"id":"Q3191250"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7019710$662FBF05-31E7-4E03-A768-7A1FF0822ECE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d8f6127f14b0c728fc63d5da5355ffcfefa4270a","datavalue":{"value":{"entity-type":"item","numeric-id":470491,"id":"Q470491"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7019710$784E7591-A453-44F3-9AB5-0DBE149B073C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a65589ef8a64769fe85f05cccbae36691fb831f0","datavalue":{"value":{"entity-type":"item","numeric-id":127482,"id":"Q127482"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7019710$891F0983-3E80-4438-B608-6CB263B73BD5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"8b8a0e96521309ee7cc1f61f941b3cdd0f96df8d","datavalue":{"value":{"entity-type":"item","numeric-id":558913,"id":"Q558913"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7019710$A88B82F3-F504-401F-951B-11AC97FCE190","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"006236e4fe142ebeec21319b601dd6dc3ace2709","datavalue":{"value":{"time":"+2025-03-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7019710$F6D0B1C4-B040-4665-891B-BE9B8E44DDAB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7019710$A898A431-7F56-40F9-822D-2BAA51602DA1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a7ddaa80bf0a693a36c1113ff6b7ad576f729940","datavalue":{"value":"68W40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7019710$AE44CE56-4CD2-4318-8058-A4C5F64B99BE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0556c939d5f80905b689a8f78ecccbf9dd8e2697","datavalue":{"value":"05C82","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7019710$EE013C69-D79F-4C18-B984-63FEB9A59605","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"48a59f52dcfcc38cd6697e0ef07319031311895b","datavalue":{"value":"62H30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7019710$DD2A929A-4185-415E-810E-070BC73FD9B4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"39f491bcc36e8b779d161622dc01d0319b6e4578","datavalue":{"value":"7993150","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7019710$616EEDF4-E753-4D9E-BBB1-6188569B51C5","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":"Q7019710$48A8D274-E9D2-4735-B2B2-A8F432F1288B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Two provably consistent divide-and-conquer clustering algorithms for large networks","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Two_provably_consistent_divide-and-conquer_clustering_algorithms_for_large_networks"}}}}}