{"entities":{"Q6311173":{"pageid":13447133,"ns":120,"title":"Item:Q6311173","lastrevid":94916843,"modified":"2026-06-05T07:57:41Z","type":"item","id":"Q6311173","labels":{"en":{"language":"en","value":"The PowerURV algorithm for computing rank-revealing full factorizations"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900366938"}},"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":"Q6311173$D1765ACE-E74B-4158-BFD2-B36BD0CD4C5B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e110fd3e7f29e932366537fd7d0e0572a171dee3","datavalue":{"value":{"time":"+2018-12-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6311173$D480F268-5293-4223-8CCC-9FE19A43F2E9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"430936baf4136074c03d248d2e3e2ab657242d85","datavalue":{"value":{"entity-type":"item","numeric-id":1740637,"id":"Q1740637"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311173$308FEFFA-D1C9-41D5-B0E1-9F38A3E19478","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":"Q6311173$2671DEB5-3836-4954-BA4C-4C32B0021540","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"101afce6b7977c192b3541bd8272632427cfd361","datavalue":{"value":"900366938","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6311173$16FDE401-6B0E-4AEE-B1C2-72C873D34804","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":"Q6311173$03FABC51-D084-4815-BA90-880899712CFC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The PowerURV algorithm for computing rank-revealing full factorizations","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_PowerURV_algorithm_for_computing_rank-revealing_full_factorizations"}}}}}