{"entities":{"Q5146965":{"pageid":7176536,"ns":120,"title":"Item:Q5146965","lastrevid":91648580,"modified":"2026-06-04T23:42:41Z","type":"item","id":"Q5146965","labels":{"en":{"language":"en","value":"Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7304193"}},"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":"Q5146965$32391A47-41D3-47BE-BAAD-0286528EBBED","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"740f56821ade19f393d3a5b689dca0664562e719","datavalue":{"value":{"text":"Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5146965$9213C4FC-D675-4061-9B54-F94617E253BA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8d6c56a5655915fd322d993bc8abfd24de9a5916","datavalue":{"value":"10.1137/1.9781611975994.169","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5146965$B791A153-BAE9-4FB9-A1E2-E15217915701","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"35d1b57fb360c3c36b6409724dcb2df7d5293a38","datavalue":{"value":{"entity-type":"item","numeric-id":2210508,"id":"Q2210508"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5146965$1B5671DB-6747-484F-AF37-1D5881043E4F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c7995cb68cf0d1cc7c1fa01508b0ed49ea12604c","datavalue":{"value":{"entity-type":"item","numeric-id":1718127,"id":"Q1718127"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5146965$FC3C2C76-6249-401A-8EF4-7D2D46FBE3B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5714179f87b242964ff088122b066c28601e6ae2","datavalue":{"value":{"entity-type":"item","numeric-id":1801009,"id":"Q1801009"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5146965$79F2762B-144D-4A74-8144-72F32B720922","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bdf0187d6ba6fea0184d37a2b1a2027efcc7c276","datavalue":{"value":{"entity-type":"item","numeric-id":1790958,"id":"Q1790958"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5146965$55188275-C6A7-4FDF-A1F9-457B95B22385","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"0036a2fb7953c7dd9f59c1eaa79b5b0b369d14ef","datavalue":{"value":{"entity-type":"item","numeric-id":5146760,"id":"Q5146760"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5146965$7A305197-8462-4C26-9A54-68DBBA7786C6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"de7d6a80765516b521ff8175534b49851be83f47","datavalue":{"value":{"time":"+2021-02-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5146965$AE49E0F5-FB6E-4FF8-9F40-7BE4C7511047","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"d2ded49e1683c82da06b583af07a8d4a3668386c","datavalue":{"value":"https://arxiv.org/abs/2004.13891","type":"string"},"datatype":"url"},"type":"statement","id":"Q5146965$C6456438-377E-4B4E-B72A-85DB7E5562EA","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5146965$8E948E2B-B9BD-46BF-B829-E323F153BA11","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4cceb7f2c680e82a91cd7501d89723bae53ba92d","datavalue":{"value":"7304193","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5146965$AE3840FD-B6AF-4812-A7E0-F920EA625AC5","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":"Q5146965$C3FC2B55-8F10-48C7-AF26-9AA81596F668","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"54656ec442b9e8a5df62d99b413ae9c5d3eb0774","datavalue":{"value":"W2998282597","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5146965$A80349AA-106D-4EF5-A1FC-229D804733B7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Hierarchy-Based_Algorithms_for_Minimizing_Makespan_under_Precedence_and_Communication_Constraints"}}}}}