{"entities":{"Q6947196":{"pageid":21186753,"ns":120,"title":"Item:Q6947196","lastrevid":75976743,"modified":"2026-04-22T09:20:22Z","type":"item","id":"Q6947196","labels":{"en":{"language":"en","value":"Understanding alternating minimization for matrix completion"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8075832"}},"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":"Q6947196$E353C002-49C6-4544-A105-D4BDD9393E8C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"654c43d290f0bb3455260346be7a73c81e401470","datavalue":{"value":{"text":"Understanding alternating minimization for matrix completion","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6947196$92B0AA1A-0FEF-4F14-98DE-CE81A2EF008C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4c59f668d95202a7f285705188e6fa295fed86fe","datavalue":{"value":"10.1109/FOCS.2014.75","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947196$C6130439-1639-48FB-B57C-B2D307A876A2","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1c9f0ca3134b0df80e496c10955242e974a25f36","datavalue":{"value":{"entity-type":"item","numeric-id":976068,"id":"Q976068"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6947196$714333B1-26F0-4C0B-8A6E-5250AA8EBC35","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"edc92756de24fbad63d3f53ad7f8ea4e3721e7de","datavalue":{"value":{"time":"+2025-08-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6947196$E9033B4E-9A0B-4788-AA2F-C60541190379","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947196$52D222A9-EDC2-433A-BA35-C1313FF82A6F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"57f167c32409cd84dad7e725a6344d78daf6bdb3","datavalue":{"value":"05-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947196$143C7080-F267-40D0-A859-1A02D7BB2801","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"53aeb1fcbd2f0d31715f68f8c0d9430ea394bc21","datavalue":{"value":"94-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947196$1F5C9FBD-C765-4433-A6A6-FE11D3E0C0DC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e6e5cb425e485279b90f2e5140dd4ac672a096b5","datavalue":{"value":"8075832","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6947196$4D73E2C8-ABFD-4328-8675-50E3D7A11C6B","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":"Q6947196$05C6BA21-0B21-4709-B934-27EF47B28C44","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Understanding alternating minimization for matrix completion","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Understanding_alternating_minimization_for_matrix_completion"}}}}}