{"entities":{"Q6829660":{"pageid":15117889,"ns":120,"title":"Item:Q6829660","lastrevid":56020078,"modified":"2026-02-24T14:58:02Z","type":"item","id":"Q6829660","labels":{"en":{"language":"en","value":"A time- and message-optimal distributed algorithm for minimum spanning trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6761852"}},"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":"Q6829660$C6106997-CCA3-47FF-80D6-31C5BC8D7602","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"00da476b968e95c007214cee09cd3bab44ea483f","datavalue":{"value":{"text":"A time- and message-optimal distributed algorithm for minimum spanning trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6829660$F8DA9EFC-A286-4B4E-9CF1-5BA98315E961","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9684407e804c4adacda17fdf3c93629150d8f3b5","datavalue":{"value":"1370.68319","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829660$393166B3-F5B0-4F68-B8D2-4B65F8ACD37A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"45dc8749e349f0a82b30da588f33fe9060485362","datavalue":{"value":"10.1145/3055399.3055449","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829660$F09D3396-A7A0-4118-8F4C-C18F463EF4D3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"56c59a0885325ce39069b0eb869e7d29e9f0f9f5","datavalue":{"value":{"entity-type":"item","numeric-id":477096,"id":"Q477096"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829660$ABE152F7-0300-46D3-826E-D594A37F8085","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"69540964196765e57314f652024b732eb13fa320","datavalue":{"value":{"entity-type":"item","numeric-id":477101,"id":"Q477101"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829660$28A98C2A-53A6-462F-845F-6B034B39BA95","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2448ac20aef5f8c6c01ba7f712c5b1e256702c39","datavalue":{"value":{"entity-type":"item","numeric-id":2121066,"id":"Q2121066"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829660$72C91DAC-0173-4551-BC36-DD0EF18A0705","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"27b75ef92f15541f4f5e004a158790ce9f108376","datavalue":{"value":{"entity-type":"item","numeric-id":6827508,"id":"Q6827508"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829660$781F0D90-2D76-4D4D-859C-DA5D23AE9C99","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"df0e235d1b1d733bcc53fdadfc8ec0d6b69c89be","datavalue":{"value":{"time":"+2017-08-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6829660$14DFE467-F90E-4CD6-BE7E-7B06821DE0F9","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"76fa55d2318e9a40482492463cd38d287a5cf639","datavalue":{"value":"http://hdl.handle.net/11577/3317205","type":"string"},"datatype":"url"},"type":"statement","id":"Q6829660$49A346C0-08BA-471E-9D34-18AAE8548B8D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b65efe51b183d0f4a672427b8171cd1e14211cba","datavalue":{"value":"68W15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829660$03003998-8C4F-4A02-A09D-DA384BBB5BAC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8195a9e26c453276e1d31339bf2413392412013d","datavalue":{"value":"68Q17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829660$A82A35B9-8A86-4B61-A965-2498487C0960","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829660$F11D1005-E594-417A-B059-46FF0EE038D0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e01671c873d801b913451010c0981a684c101d40","datavalue":{"value":"68W20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829660$730BF8CC-F603-4326-8326-6121A322C7A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a7ddaa80bf0a693a36c1113ff6b7ad576f729940","datavalue":{"value":"68W40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829660$F6112C8B-79B8-4357-83E7-470C1077F5F4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ccdaa064c69b06a2034f327b4b9bd03581f3fcc4","datavalue":{"value":"6761852","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829660$38FAE2C0-B94A-49C4-B0E2-FD1168374349","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"387e204c6977d7b097ac93bf9a6ecf723e21df10","datavalue":{"value":"distributed algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829660$08772999-AA4C-44E0-9974-70E0586A874C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"930816699e323987bf987f4de63664e42a9aab61","datavalue":{"value":"minimum spanning trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829660$A9138E8B-E52B-4432-9185-334BB06FE493","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":"Q6829660$31244724-44FF-41F6-A744-AAE3BA369275","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A time- and message-optimal distributed algorithm for minimum spanning trees","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_time-_and_message-optimal_distributed_algorithm_for_minimum_spanning_trees"}}}}}