{"entities":{"Q6955056":{"pageid":21233871,"ns":120,"title":"Item:Q6955056","lastrevid":76047561,"modified":"2026-04-22T15:51:40Z","type":"item","id":"Q6955056","labels":{"en":{"language":"en","value":"Task scheduling in multi-layer CLOS topology networks based on shortest path"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8067841"}},"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":"Q6955056$DB2287AC-2D30-4564-878C-2893F5AC395A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"502e872539ce8cff9d9f7c4cf9df4e1acebb0263","datavalue":{"value":{"text":"Task scheduling in multi-layer CLOS topology networks based on shortest path","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6955056$05003392-6739-43F1-B805-C54125420CB6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5f27770bd49b90d0bdd892b2a73e072a166630bf","datavalue":{"value":"10.1007/978-981-96-1195-9_9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6955056$FF723D47-473E-4A79-9ABD-C6B838326357","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4540e7dc953ba79d1b7866677f91eb0cc3abc056","datavalue":{"value":{"entity-type":"item","numeric-id":3387768,"id":"Q3387768"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6955056$27D43D44-6DDE-4B73-8990-4EBC4F83ED5C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"96a9fd536b5c0bdf0c1658dc61104904171eec78","datavalue":{"value":{"entity-type":"item","numeric-id":2725398,"id":"Q2725398"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6955056$5ACBEB30-FBA9-4CA0-97A5-EABBDF894CCC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e5adc32b9329e82fe72e9ee29042b89b55608cca","datavalue":{"value":{"entity-type":"item","numeric-id":6865945,"id":"Q6865945"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6955056$1692AF34-99F5-4143-8C1A-A39CFB5F74D3","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9c084dd4f0799f65853be99482a86203aed665b7","datavalue":{"value":{"time":"+2025-07-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6955056$A4404E03-4F38-42D8-9CC8-68E6E7B5CF0A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6955056$CC274A2C-BCD9-4011-BE79-B1EFD4A1ACFE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c83dbf7ab9d0ef9d8e2b37e4a8614cd0bbb1bece","datavalue":{"value":"8067841","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6955056$029FFF53-63C4-4E75-983A-90B6747D5794","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"beede8b2ba5239644ab2f01263419c115d3d97aa","datavalue":{"value":"CLOS network","type":"string"},"datatype":"string"},"type":"statement","id":"Q6955056$E637C4DA-416E-42F1-A484-76A5587EC08B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"880eee02eead4bf06e2015e62dc2cf3317f05a7a","datavalue":{"value":"AI large model","type":"string"},"datatype":"string"},"type":"statement","id":"Q6955056$51D6A86A-BEA4-44A7-BF17-2155298CBAC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"392b0efe79e3c2958911c2dc25cf51490681e557","datavalue":{"value":"Kruskal","type":"string"},"datatype":"string"},"type":"statement","id":"Q6955056$10B13F8D-FDCA-4EA9-9A3A-2D9AADA70A44","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f85e9f2721221f48af2e899508349c71e3faa29f","datavalue":{"value":"shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q6955056$D3D2EC88-6197-460C-8DFA-2BD6665E8526","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":"Q6955056$84752F59-846E-4A76-B35B-127E40032F6F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Task scheduling in multi-layer CLOS topology networks based on shortest path","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Task_scheduling_in_multi-layer_CLOS_topology_networks_based_on_shortest_path"}}}}}