{"entities":{"Q7350171":{"pageid":31469749,"ns":120,"title":"Item:Q7350171","lastrevid":107972774,"modified":"2026-10-27T14:02:47Z","type":"item","id":"Q7350171","labels":{"en":{"language":"en","value":"On the Convergence Analysis of Asynchronous Distributed Quadratic Programming via Dual Decomposition"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7350171$7A6534C9-5ED1-4D68-B594-F13AA73751ED","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"25fea70fe877d25ce735e98399144442e3b8d936","datavalue":{"value":{"time":"+2015-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":"Q7350171$67CC2B6A-5FFE-4322-AB51-9A2E5E7BF631","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"90867fcf19526b3daa134953ef45873c98e64893","datavalue":{"value":"1506.05485","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7350171$27B20E46-4472-41DF-91A2-15DF88031B84","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"441ab27b4630af9eb4695dd9f7f30fb7138e31b8","datavalue":{"value":{"entity-type":"item","numeric-id":888814,"id":"Q888814"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7350171$AB0EB70C-E2EA-47C7-A2D5-4AC2D0683653","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1261a29cfaf308663104e7363304719cf6e8698f","datavalue":{"value":{"entity-type":"item","numeric-id":466274,"id":"Q466274"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7350171$D491D7E7-97AF-429B-8742-30BDA035C7A0","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":"Q7350171$2CC85F24-17EE-4AD1-ABEB-3FF6D21B2DF9","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":"Q7350171$BE0A920C-6CBE-4D19-890A-5905B4EDD5DA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the Convergence Analysis of Asynchronous Distributed Quadratic Programming via Dual Decomposition","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_Convergence_Analysis_of_Asynchronous_Distributed_Quadratic_Programming_via_Dual_Decomposition"}}}}}