{"entities":{"Q4620927":{"pageid":6650510,"ns":120,"title":"Item:Q4620927","lastrevid":82129904,"modified":"2026-05-06T20:10:25Z","type":"item","id":"Q4620927","labels":{"en":{"language":"en","value":"Efficient Algorithms on Robust Low-Rank Matrix Completion Against Outliers"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7019976"}},"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":"Q4620927$4EC6FB41-01FC-4141-B719-6BC7CB989DE9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d77b8ec2f7b576dbd3084ccb0237fe6e8b6240cb","datavalue":{"value":{"text":"Efficient Algorithms on Robust Low-Rank Matrix Completion Against Outliers","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4620927$4D1E47FC-490E-4D1A-914B-C14F513B52D5","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"04a116bf0598538f615b1bc1a2f3c050014d8211","datavalue":{"value":"1414.94744","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4620927$3FF6FF61-FF1D-49A6-B219-D544662FA2D4","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ceece3874631c2e01c96fd451460d1447c7f8d06","datavalue":{"value":"10.1109/TSP.2016.2572049","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4620927$38A555BA-2AF0-4177-B905-3E2E6CC2C668","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1ca71f93614e57bc70532f2453257eaa949c2bae","datavalue":{"value":{"entity-type":"item","numeric-id":4620548,"id":"Q4620548"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4620927$DB9E54A1-3AFE-4C12-9375-63AF1485238A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"29a8c81f369c9e04ea0e9ab4219a5ea87af6ea14","datavalue":{"value":{"entity-type":"item","numeric-id":2244436,"id":"Q2244436"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4620927$FFB3638E-AD18-4D1A-B033-3C6CA7E1B78F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fcf730b826b09d3813beec2c5aa2d6f425d52a34","datavalue":{"value":{"entity-type":"item","numeric-id":129598,"id":"Q129598"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4620927$EEE06125-D202-4AA4-8D66-1D4DD9F3059B","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"39346dfbe0bcea35dbae204dc5864c494831351b","datavalue":{"value":{"entity-type":"item","numeric-id":63219,"id":"Q63219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4620927$7417E905-35FE-4D54-972F-51493D9493C7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"32a6dc046c0aa99508538df457dbadf7aa620337","datavalue":{"value":{"time":"+2019-02-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4620927$BC99CD9C-D588-4F9C-9677-2E7AABEEEFE6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4db3fc3244f368e49336c7e23443d11b7d69297d","datavalue":{"value":"94A12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4620927$6CEEB319-21DA-42CD-AD70-D2CAB0E6CA49","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a59854f7423b54f32c0e0afdff69df764e2e9fe7","datavalue":{"value":"15A83","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4620927$02C3EB66-12B8-4D3F-B83A-D9F8F334568D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b8297ed79644714524cd35cdbe6e653fb5e9722c","datavalue":{"value":"7019976","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4620927$4534FCCB-FFE3-4C8E-8864-88D8A3012614","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":"Q4620927$97032DB6-6D0F-4684-AEEF-00CB0ADA0978","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"b96460ee11b6a04ce917f51fd4ec86ba57f90b7c","datavalue":{"value":"https://doi.org/10.1109/tsp.2016.2572049","type":"string"},"datatype":"url"},"type":"statement","id":"Q4620927$34CC80A6-AC62-4014-B771-180C1D3F31F2","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"12ea39c6b88741e390a8b4fd4d275c89ba34b412","datavalue":{"value":"W2400319222","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4620927$FA8E1F7B-593B-479B-8682-6762165F87CB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient Algorithms on Robust Low-Rank Matrix Completion Against Outliers","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_Algorithms_on_Robust_Low-Rank_Matrix_Completion_Against_Outliers"}}}}}