{"entities":{"Q7186958":{"pageid":22189250,"ns":120,"title":"Item:Q7186958","lastrevid":107426981,"modified":"2026-10-27T09:45:44Z","type":"item","id":"Q7186958","labels":{"en":{"language":"en","value":"Communication-Efficient Algorithms for Distributed Nonconvex Minimax Optimization Problems"}},"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":"Q7186958$01F7D1DE-BF6F-4B9C-85BF-74B8B0330238","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":"Q7186958$7A3E388A-E91C-47AD-875F-263ECE26E8E8","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"c694678d517a696fbd762c492a6f271995f7760b","datavalue":{"value":"2507.21901","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7186958$37C952B7-B93E-4E31-8320-16D63D225B50","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d0c5d683faf38ca6db28a8d3538c07f085037bd4","datavalue":{"value":{"entity-type":"item","numeric-id":5103519,"id":"Q5103519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7186958$0FE469A8-B10B-4BDE-BC56-A287052C1E58","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"837853917033fa4bb7b4e1ab27e5a85b65106702","datavalue":{"value":{"entity-type":"item","numeric-id":2184549,"id":"Q2184549"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7186958$A7AC5336-0278-4173-AE19-8AC1FDDAE620","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f262a6bf0b5e03611b3c82188b3fc981c3e12f13","datavalue":{"value":{"entity-type":"item","numeric-id":233749,"id":"Q233749"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7186958$46FACEE8-CA0A-47E0-BF2F-EDFBC01AAB04","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":"Q7186958$9E1D288C-0A59-445F-988C-A72C85B4ADC0","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":"Q7186958$97475F5A-B6E0-4550-804F-0BBF547F88CA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Communication-Efficient Algorithms for Distributed Nonconvex Minimax Optimization Problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Communication-Efficient_Algorithms_for_Distributed_Nonconvex_Minimax_Optimization_Problems"}}}}}