{"entities":{"Q7182919":{"pageid":22174973,"ns":120,"title":"Item:Q7182919","lastrevid":107397197,"modified":"2026-10-27T09:32:45Z","type":"item","id":"Q7182919","labels":{"en":{"language":"en","value":"On Universality of Non-Separable Approximate Message Passing Algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"2425efcc9b3f19f1145afc4b21ab66cac71c91ae","datavalue":{"value":"math.ST","type":"string"},"datatype":"string"},"type":"statement","id":"Q7182919$7D984E14-CB4A-4318-9255-FE7CA3EA6DCD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7182919$F035D506-21ED-4AB8-A5F2-3C67CE79CA13","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"22d00426118cf7fa316a68c81fec0f7124ef1dc0","datavalue":{"value":"2506.23010","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7182919$FAAE7A51-1242-422D-AABC-8BBE643142B0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a4aecf8b0db6ccb4e06087d8dad9fa4d186c2ccf","datavalue":{"value":{"entity-type":"item","numeric-id":7182918,"id":"Q7182918"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7182919$3C7FFB85-72B2-4C06-B0D0-1EEAD7EFDFC2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2899304000c5f2ea28a4bff64a89490f399461ac","datavalue":{"value":{"entity-type":"item","numeric-id":2154226,"id":"Q2154226"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7182919$C5AD6905-58A9-4051-AF56-10B406E2E1D9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"956a5a9eceb242389f41a8f3e6e16a0627105a88","datavalue":{"value":{"entity-type":"item","numeric-id":820809,"id":"Q820809"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7182919$24EA7EB6-53EE-4809-8B3E-327737D5688B","rank":"normal"}],"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":"Q7182919$AFEFC762-B03A-4338-8831-9B2AB7DA73AD","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":"Q7182919$7D5D8E58-5CB8-453A-ABC7-3E307021EE9F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On Universality of Non-Separable Approximate Message Passing Algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_Universality_of_Non-Separable_Approximate_Message_Passing_Algorithms"}}}}}