{"entities":{"Q57415":{"pageid":58409,"ns":120,"title":"Item:Q57415","lastrevid":56608404,"modified":"2026-03-13T12:07:36Z","type":"item","id":"Q57415","labels":{"en":{"language":"en","value":"graphclust"}},"descriptions":{"en":{"language":"en","value":"Hierarchical Graph Clustering for a Collection of Networks"}},"aliases":{},"claims":{"P132":[{"mainsnak":{"snaktype":"value","property":"P132","hash":"d1e9e19fd2edbaf0373bb9c5fbe393acc65a69ee","datavalue":{"value":"1.0.2","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"a79ac2b5716ff76e5c0abe0d4cfca7131c73d5fa","datavalue":{"value":{"time":"+2023-03-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q57415$19633B93-EA36-4EB8-9A2B-968CAA1DCF85","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P132","hash":"13fc6b6c359d9b413813f437afa63cada39dbe29","datavalue":{"value":"1.0.1","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"5a6ae76665af230d040301805a506260888aa06b","datavalue":{"value":{"time":"+2023-01-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q57415$09E0DBE8-871A-451D-B37C-6215C077547E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P132","hash":"9225c6fe829656e2eb00ac854fa62c1b2ae4d637","datavalue":{"value":"1.3","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"663ec16ecbc56706b2dc00e5da23114c24123651","datavalue":{"value":{"time":"+2023-06-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q57415$E04AD6B9-C1FC-4D1E-AF39-B05E7DEC5065","rank":"normal"}],"P229":[{"mainsnak":{"snaktype":"value","property":"P229","hash":"528a78c27669012353d81e454b2c3412f34a47b6","datavalue":{"value":"graphclust","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q57415$AD17D307-CBCD-4567-B00C-A9CCF26B6B1F","rank":"normal"}],"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"438d0eef0223375d3a92def8ffc6a10a8bf1ca95","datavalue":{"value":{"entity-type":"item","numeric-id":57080,"id":"Q57080"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$4900368A-17D9-4D30-885C-B62530D7E7A6","rank":"normal"}],"P114":[{"mainsnak":{"snaktype":"value","property":"P114","hash":"251fd109c2cd8c1ee39b48cd109c9f4b1c9fcf5c","datavalue":{"value":{"entity-type":"item","numeric-id":13519,"id":"Q13519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$942F796C-650E-4118-8D08-2E614F3018AE","rank":"normal"}],"P19":[{"mainsnak":{"snaktype":"value","property":"P19","hash":"81a4587471a01043bd317b7782c27493c933ac53","datavalue":{"value":{"entity-type":"item","numeric-id":57410,"id":"Q57410"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$9839384B-2A18-42FA-8F25-3126F17B25A4","rank":"normal"}],"P170":[{"mainsnak":{"snaktype":"value","property":"P170","hash":"993df37b38c4b7c4b70cb69a450ca8764295382c","datavalue":{"value":{"time":"+2023-06-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q57415$8404C6B1-D617-43CE-802A-6DEB12E1B0B0","rank":"normal"}],"P1459":[{"mainsnak":{"snaktype":"value","property":"P1459","hash":"c6b05ada617277b6e4415e1891474fe8753808ae","datavalue":{"value":"Graph clustering using an agglomerative algorithm to maximize the  integrated classification likelihood criterion and a mixture of stochastic  block models. The method is described in the article \"Model-based clustering   of multiple networks with a hierarchical algorithm\" by   T. Rebafka (2022) <arXiv:2211.02314>.","type":"string"},"datatype":"string"},"type":"statement","id":"Q57415$68DDADA9-46B7-489C-9640-DA47ED4DD01D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4f21f0366b981f0edb3ed5cad725cb7a7bb93683","datavalue":{"value":{"entity-type":"item","numeric-id":57410,"id":"Q57410"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$7DF45DE7-CFF0-4DB9-9322-5C72BE534411","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"caec58e2e2e3256bca461f95da85075ecd3567cd","datavalue":{"value":{"entity-type":"item","numeric-id":56623,"id":"Q56623"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$EAD6326B-3F21-440C-91AD-B49FCBE32C9A","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"d0f16da5c5bef3c0de99499c4bdf5ba7401e1bde","datavalue":{"value":{"entity-type":"item","numeric-id":40975,"id":"Q40975"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$13CD8F91-9F96-4F7C-B28C-5C90322A6292","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"cf0bb4b7afc6201510aff05bb1162df882cedbf3","datavalue":{"value":{"entity-type":"item","numeric-id":57301,"id":"Q57301"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$797B30FD-3CD6-40ED-969D-4C751A333476","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"181574dfe61d92a30914c897a5022337ec55662b","datavalue":{"value":{"entity-type":"item","numeric-id":57412,"id":"Q57412"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$0AB7811C-A2AA-4A77-8F67-4A23D7B2ACA5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"c3b31130450fc38b1fa3e990594d42bd7e76a310","datavalue":{"value":{"entity-type":"item","numeric-id":57413,"id":"Q57413"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$13FB35F3-D4E9-404A-8A29-2B8C727330D0","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"94d2a4c50320541ee9db3a4b941e245972232949","datavalue":{"value":{"entity-type":"item","numeric-id":57414,"id":"Q57414"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$DE80ABDD-854D-4CAE-A2FB-8BDA596A51FE","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q57415$8997AC22-337B-4C6A-8018-DBD5356D3DA6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Graphclust","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Graphclust"}}}}}