{"entities":{"Q6842472":{"pageid":20551546,"ns":120,"title":"Item:Q6842472","lastrevid":84284165,"modified":"2026-05-14T15:39:35Z","type":"item","id":"Q6842472","labels":{"en":{"language":"en","value":"Lower bounds for dynamic distributed task allocation"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8174003"}},"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":"Q6842472$F60699EE-95A2-44EA-BD8E-434FF75DB0F0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cf7d4d467af206bf0cd9fd59634a5ac5dd545639","datavalue":{"value":{"text":"Lower bounds for dynamic distributed task allocation","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6842472$86FD3784-4654-41E5-B33F-F5DBEC66A80D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3e627147b0f18909e999996583c7c3083b4cff01","datavalue":{"value":"10.4230/LIPICS.ICALP.2020.99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842472$9D9C09BE-4A90-4C76-AB2E-B833E4EC29AE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7dba927a4b66a9f99fe51d0c83ee3309ebecdc48","datavalue":{"value":{"entity-type":"item","numeric-id":848943,"id":"Q848943"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842472$FB86695B-292B-4B34-84C8-A599252ECA87","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bddf992d61ee7668901eb12759900f7f93a29af9","datavalue":{"value":{"entity-type":"item","numeric-id":4987443,"id":"Q4987443"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842472$F99B9E08-89E5-48DB-A3DB-A467C45C647B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"08788b2cbf350ad4bc12c8b64351e1e6eefe3b67","datavalue":{"value":{"time":"+2026-03-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6842472$572C90F5-8D90-40CE-BD0A-31AEE43598DB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1a86519cb3571ebce07f2774b2a00a0f17e12c3e","datavalue":{"value":"68Nxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842472$F504D6A2-4D2B-4CF8-89E5-55F8AF38908D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842472$B1DE91E5-8AAA-45E5-941C-20655ADA2C49","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b7efe5aab73b1119f3732813a5a551632acd9e00","datavalue":{"value":"8174003","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842472$66CD6619-A145-4AE6-8048-9F465E1BC3D6","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"daf5f856a5d861312ad309ab567540337a5f61d6","datavalue":{"value":{"entity-type":"item","numeric-id":57050,"id":"Q57050"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842472$4D2E1A3E-1FCC-4A7E-BDDB-F9105724F85C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6501a1f0f4ce5dc2dbe623525c6a843f407c6e4f","datavalue":{"value":"distributed task allocation","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842472$BDB4FF80-1873-4BE8-A79B-7D797FB9B485","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"459ffded74521c7177e183238b11e0b004784b7c","datavalue":{"value":"combinatorics","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842472$FCEF1E2E-3B50-46C8-9575-101EF304ECFB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0e0192fb524376f45dfdd3eb1a809bf3cd5a9489","datavalue":{"value":"lower bounds","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842472$8120A657-DF9B-4C31-B812-428807F5FFB1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"65c3b98487eb404131cfd6dc457f97f412fed996","datavalue":{"value":"multi-agent systems","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842472$3549D309-9476-4B2D-993E-20EC31459883","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"373ec0b2c9989db4f2d6a1e53aff0b5ca2c6044e","datavalue":{"value":"low-distortion embedding","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842472$43E68BA7-F2D6-47CC-A1E4-149BEF3FFB7F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c0675485f2da257cf341401e3ffee26238a9e391","datavalue":{"value":"dynamic algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842472$402B80CF-AA66-48B8-AE6D-7B9D13EB2A2F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a515115c1beab73f36fb27361b505eefbcde40ec","datavalue":{"value":"biological distributed algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6842472$EA88C695-A090-4E7F-B872-33781D001485","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":"Q6842472$AC5B81BF-8D10-45AC-A22B-5B4741A16BFE","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"6652b03a84d8edebf956e4ee7fbb3014b386ef5f","datavalue":{"value":{"entity-type":"item","numeric-id":5045439,"id":"Q5045439"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842472$E4C0D526-81B9-432A-B485-5CDEA9F40197","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Lower bounds for dynamic distributed task allocation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Lower_bounds_for_dynamic_distributed_task_allocation"}}}}}