{"entities":{"Q6512684":{"pageid":14091643,"ns":120,"title":"Item:Q6512684","lastrevid":40683653,"modified":"2025-03-28T13:11:19Z","type":"item","id":"Q6512684","labels":{"en":{"language":"en","value":"Partition-Insensitive Parallel ADMM Algorithm for High-dimensional Linear Models"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q6512684$1CC98B28-F9CB-4A7A-AF20-4A568CF793D2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"88f0cb6a2679854452edc985979ce7d6adc58dd3","datavalue":{"value":{"text":"Partition-Insensitive Parallel ADMM Algorithm for High-dimensional Linear Models","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6512684$415E4481-4F75-4371-AF1F-9D4C4AF13AC5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0acb84851bf2ece32038dbed187159c536fb1fa1","datavalue":{"value":{"entity-type":"item","numeric-id":312823,"id":"Q312823"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6512684$49E42DBB-A3BD-406E-9C04-676F503812BB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d126fbbeb1618d7623470b161da7b31437d6741a","datavalue":{"value":{"entity-type":"item","numeric-id":449986,"id":"Q449986"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6512684$482DF648-AE67-456E-B145-2B414DB97AF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"32b0b48265529b816a5cd0956fc786ba877239b3","datavalue":{"value":{"entity-type":"item","numeric-id":292340,"id":"Q292340"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6512684$A599698D-C445-4F93-8E07-3E5B491BDB26","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":"Q6512684$7E165B14-2052-49CF-AD0E-75AB333A3C50","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"39b78190b5a9533dc4265d83b87e7b2678608fd1","datavalue":{"value":"2308.14557","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6512684$DD7BDFBA-5932-44DD-9B59-733BBCE3249F","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"0d840a589370d17661464ead7ad9cb35a221b01d","datavalue":{"value":"https://github.com/xfwu1016/pipadmm","type":"string"},"datatype":"url"},"type":"statement","id":"Q6512684$355CA48C-B3DA-4BEF-A610-8906FAB9951B","rank":"normal","references":[{"hash":"b054cab3b880dd3bc799beeada7f432c1d80a50e","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"830d7337303f7d2698be33160846f6d94cec106f","datavalue":{"value":"https://paperswithcode.com/paper/a-parallel-linearized-admm-algorithm-for","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6512684","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6512684"}}}}}