{"entities":{"Q6365136":{"pageid":13499276,"ns":120,"title":"Item:Q6365136","lastrevid":103133348,"modified":"2026-06-06T06:22:32Z","type":"item","id":"Q6365136","labels":{"en":{"language":"en","value":"Simpler is better: A comparative study of randomized algorithms for computing the CUR decomposition"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900511211"}},"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":"Q6365136$D75A9559-2ECD-491A-9B28-82D46CCBAE29","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"34963f44076aaadc465bd68c9c3f8b96ebd4e895","datavalue":{"value":{"time":"+2021-04-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6365136$A193BF32-A20D-4DF7-8F57-AD7459F696BA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"145185654bbe89f019f1a8620312c824609f3ac3","datavalue":{"value":{"entity-type":"item","numeric-id":6052451,"id":"Q6052451"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6365136$4DAF76E8-2BBC-44DC-8E94-02F33F8E4058","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"328096366503e0dc10951a0082e3123d680b6d04","datavalue":{"value":{"entity-type":"item","numeric-id":693188,"id":"Q693188"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6365136$AB428BF4-68EC-42F6-974C-2EF4A7A78B9B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a731e38da1821efd0efb42932486c14ddba44ed6","datavalue":{"value":"900511211","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6365136$24EBFAE7-4AD8-452C-818F-E9999B76DE54","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":"Q6365136$CD3ACEC3-F9E4-4EC8-B46A-D4E8322B8B7F","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"5ed0fc4f83661b338bb78f305e8e2ef210fc0be6","datavalue":{"value":"https://github.com/eepperly/iterative-sketching-is-stable","type":"string"},"datatype":"url"},"type":"statement","id":"Q6365136$C3337BF0-0362-4E8E-A31A-23045FCF1394","rank":"normal","references":[{"hash":"22dd581222a390b37756935040ee2a7a662a3654","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"335189910d29abff0f641031bb7901289a1f4880","datavalue":{"value":"https://paperswithcode.com/paper/simpler-is-better-a-comparative-study-of","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"f846dfc57207c7640d2726d8f72d9e8a317f0bcf","datavalue":{"value":"repository README","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Simpler is better: A comparative study of randomized algorithms for computing the CUR decomposition","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Simpler_is_better:_A_comparative_study_of_randomized_algorithms_for_computing_the_CUR_decomposition"}}}}}