{"entities":{"Q6944002":{"pageid":21167598,"ns":120,"title":"Item:Q6944002","lastrevid":75947928,"modified":"2026-04-21T15:52:18Z","type":"item","id":"Q6944002","labels":{"en":{"language":"en","value":"Robust and sample optimal algorithms for PSD low rank approximation"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078986"}},"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":"Q6944002$20B05073-F235-43D5-9A3C-A00272B9E98A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f6cdbd6a9efda233778f7751f5989cfba229a05a","datavalue":{"value":{"text":"Robust and sample optimal algorithms for PSD low rank approximation","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944002$BD106B98-67BB-4071-91DD-5F45DCDD810C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"2d587848574186987aa2119b7d91788658aefe74","datavalue":{"value":"10.1109/FOCS46700.2020.00054","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944002$D9EEE7F9-3C64-407C-95C9-FC83E7F58D28","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1eb06e520030bd4c596685d599b5f68cac8c76a2","datavalue":{"value":{"entity-type":"item","numeric-id":343862,"id":"Q343862"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944002$5CB215DD-C84E-4095-A201-724616F4B61B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3cb869401658c6c0c2a80614f6b4b22b7ca0e51b","datavalue":{"value":{"entity-type":"item","numeric-id":5091166,"id":"Q5091166"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944002$CDEAFAAA-1079-4B00-847D-D5024FCE02EC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c7b2e28fd769f22de31d96315ba75ddb2c43a327","datavalue":{"value":{"entity-type":"item","numeric-id":6058196,"id":"Q6058196"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944002$6C594407-BAA3-4A39-BF85-000E6F533AC3","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c757b9b7db25e8670dea572b24907796ea9667b","datavalue":{"value":{"time":"+2025-08-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":"Q6944002$E68F5A9D-B7C3-4BB5-9547-0CA5CBBCE7A2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944002$05DABB19-FDF0-4C04-BEC2-24BCEC10DF8A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"462a5636420ee2297386ce066030ba7c3aaae175","datavalue":{"value":"8078986","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944002$2D0D96C9-D70B-4D55-8B1D-471F5E599A47","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":"Q6944002$8C37E36E-9CAE-4C4B-9514-EB9561914E0A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Robust and sample optimal algorithms for PSD low rank approximation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Robust_and_sample_optimal_algorithms_for_PSD_low_rank_approximation"}}}}}