{"entities":{"Q6602922":{"pageid":14214079,"ns":120,"title":"Item:Q6602922","lastrevid":103608566,"modified":"2026-06-06T07:43:55Z","type":"item","id":"Q6602922","labels":{"en":{"language":"en","value":"Mc2g: an efficient algorithm for matrix completion with social and item similarity graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7911429"}},"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":"Q6602922$8058D11F-DA95-41C1-8DA3-6BC791C2BA3B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6921f3e3415e80dc15b90db8a2d5c64c35e4f40e","datavalue":{"value":{"text":"Mc2g: an efficient algorithm for matrix completion with social and item similarity graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6602922$B4BEDC55-D429-49E1-94EB-CB86C10F2308","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a918c10ecc7bc13b983377ee899a8e029a89c6b3","datavalue":{"value":"1548.0531","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602922$0064D3EC-9DD0-401E-9449-117C18953889","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6b29ae380fc548a6fecab069e20633410dc73a3e","datavalue":{"value":{"entity-type":"item","numeric-id":2137303,"id":"Q2137303"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602922$47DFEBEF-754D-4FA1-A597-8460DEEDAA6F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7f7ac38750b9ebe82b3a410f525c0147335dbb52","datavalue":{"value":{"entity-type":"item","numeric-id":2413971,"id":"Q2413971"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602922$8002821F-ECC0-4357-A101-F4BB6FF2FEED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a96fd00853f22a0720e7b9be7694ee070bc60bab","datavalue":{"value":{"entity-type":"item","numeric-id":669974,"id":"Q669974"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602922$BD60EB8F-8C6C-4D56-ACB0-F40E73E7971F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"28f12800adabcc6c514f01059c8c1b6942c998cf","datavalue":{"value":{"entity-type":"item","numeric-id":693726,"id":"Q693726"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602922$61873674-73B0-4A7E-859E-A4B12EBC62FA","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":"Q6602922$CB1DC2B2-92A3-492B-96BC-BC31A0AA4888","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2c5063b0ac2f275e827bc77fc80dd2ef50027016","datavalue":{"value":{"time":"+2024-09-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":"Q6602922$BF3586E9-A062-4C9B-BF94-570F64CFDC2B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602922$7CA30796-2482-47CD-BB7F-8D10B58C57EE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8a5ceab9923c1d7e534d90622e68b4284eb3d9f3","datavalue":{"value":"7911429","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602922$73DAD60D-D53C-4525-BD40-11966544EFB5","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":"Q6602922$90DDD4FC-A84B-4A16-89CC-A7A2951C1F41","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9ca80257db2a98816efcf75f1cd66a0c4da8147f","datavalue":{"value":"10.1109/TSP.2022.3174423","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602922$286A7D6F-43DD-43A3-BCBF-79561362F5A4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Mc2g: an efficient algorithm for matrix completion with social and item similarity graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Mc2g:_an_efficient_algorithm_for_matrix_completion_with_social_and_item_similarity_graphs"}}}}}