{"entities":{"Q5211601":{"pageid":7241172,"ns":120,"title":"Item:Q5211601","lastrevid":94537715,"modified":"2026-06-05T07:04:22Z","type":"item","id":"Q5211601","labels":{"en":{"language":"en","value":"On the Optimal Recovery Threshold of Coded Matrix Multiplication"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7158917"}},"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":"Q5211601$EA277A9C-2179-4710-8D9E-660396C38AD0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"32c2702fa417ee78660989c7f8707e00fa44947f","datavalue":{"value":{"text":"On the Optimal Recovery Threshold of Coded Matrix Multiplication","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5211601$99C05303-7FCB-49CF-8134-AB3C016FDA84","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d32560cc0c77a12a5a7cdfc4d4d79787f9c5e64f","datavalue":{"value":"1433.68056","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211601$DC63604F-58DB-4664-B435-79A26F005D66","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5e1dac80b49d62fb33732a35218255a5fdc7fce6","datavalue":{"value":"10.1109/TIT.2019.2929328","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211601$B415FB5B-840E-4272-A619-4033EBE5CBF9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b3180286292627f031bc3d50f70395fbd4f9c14b","datavalue":{"value":{"entity-type":"item","numeric-id":5032527,"id":"Q5032527"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211601$01EED964-6ADC-44BC-B79B-81D81A850643","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5a8f70e9c87b2bea23c5e97a2e489d8cf1d7875","datavalue":{"value":{"entity-type":"item","numeric-id":5001578,"id":"Q5001578"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211601$BC79C92D-37A7-4BD0-9DDB-E2EEEC969992","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"533e350857c78e2c52958e26bb3f3330d47c9186","datavalue":{"value":{"entity-type":"item","numeric-id":2102412,"id":"Q2102412"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211601$1091E92A-0305-4D03-B56A-952B4AAD91D9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6c7ecc4802e23d4aba0923a4b513ac27078322f2","datavalue":{"value":{"entity-type":"item","numeric-id":5211600,"id":"Q5211600"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211601$272B7AE9-D697-41E6-9209-296B01BEF78E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"18f96a5ce1362d42e01bd4ea92f296f102bccb5d","datavalue":{"value":{"entity-type":"item","numeric-id":518679,"id":"Q518679"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211601$0A5EDF06-7BC8-4C2B-B59D-06680A2C0F8B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e48b041d8f68180d343e6e0d0e03e76cced20a7e","datavalue":{"value":{"entity-type":"item","numeric-id":2978660,"id":"Q2978660"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211601$BF8A1EEB-B6F0-4789-BDA2-CDBD7D94F298","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"90c5240c9cd9e181a1b77d3501d191b6631d1861","datavalue":{"value":{"entity-type":"item","numeric-id":97723,"id":"Q97723"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211601$71291246-F652-4FA8-ACC6-EB9E25F69CE0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c3667234f64e059790aacf6846d4478bb70e09b7","datavalue":{"value":{"time":"+2020-01-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5211601$9B0305D5-7F5B-4D73-AD9E-26CEC617DF40","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"19170704167192ec3241c28e13b6b9c20d114722","datavalue":{"value":"https://arxiv.org/abs/1801.10292","type":"string"},"datatype":"url"},"type":"statement","id":"Q5211601$D6AE88C8-9D70-4369-A681-170B8EA63FB5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62ff42057022552eaa82447a5a1563ef3bf93acd","datavalue":{"value":"68M14","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211601$A0BEE045-5707-4088-B2F6-AAF2ECE2510C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4264b8bf260e532ba12469970b36fcaf09f85467","datavalue":{"value":"68P30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211601$EF65C40E-1AB6-428F-AFB1-3F9E10F0E9CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b65efe51b183d0f4a672427b8171cd1e14211cba","datavalue":{"value":"68W15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211601$988D3A6C-7CF8-49F4-AFBB-1E24FC8A8850","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7e2dee4edb913de1df270bc53710654e50bc5f5e","datavalue":{"value":"7158917","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211601$4D15017D-20BB-4A38-BB9E-B910865D30D0","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7ba6d9ac42f0c0595cadec24ebb05c9c3872349a","datavalue":{"value":"novel coded computation strategies for distributed matrix-matrix products","type":"string"},"datatype":"string"},"type":"statement","id":"Q5211601$15971EB9-6FB6-4DDB-B200-EDB85220CB4F","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":"Q5211601$A3B32624-126C-4D3B-B3EC-35BF9EA68FD8","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"35a62a44f9bcbb1065ed01cd453c4083455cb978","datavalue":{"value":"Q127474455","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211601$EA9D8117-A6E4-4BE7-9C1F-11188B78E7FF","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"57d7eea5cbe493ce8fb4951a5f5ca8106bb7a038","datavalue":{"value":"W2963117124","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211601$C9FE4C41-3B3E-4536-B3AC-179287913230","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the Optimal Recovery Threshold of Coded Matrix Multiplication","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_Optimal_Recovery_Threshold_of_Coded_Matrix_Multiplication"}}}}}