{"entities":{"Q6314437":{"pageid":13450303,"ns":120,"title":"Item:Q6314437","lastrevid":40689742,"modified":"2025-03-28T14:41:05Z","type":"item","id":"Q6314437","labels":{"en":{"language":"en","value":"Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods"}},"descriptions":{"en":{"language":"en","value":"preprint 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":"Q6314437$60A92FB9-0A62-4BDA-8FD2-35ECE79D0596","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c9332c1f846d5049945df8d203c7d1a4a521fd3","datavalue":{"value":{"time":"+2019-02-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6314437$2A25E9F6-6D0F-45BA-9BD1-743C76AEE722","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"ab03bedb78049ccaf776b03872f25f1f393ad02d","datavalue":{"value":"1902.08297","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6314437$DDE9671D-7C5D-4D2C-BE8D-740044722725","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6314437$8779C457-2354-4CA8-A7FC-A1543CA68074","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a9a9eaa7fd7e010f3960691b4ec6b49e1992fea","datavalue":{"value":"cs.LG","type":"string"},"datatype":"string"},"type":"statement","id":"Q6314437$96D5B9FD-5F14-4020-941D-8E0F625A7626","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"2f2e57240622252e683460d1060f02c9996da311","datavalue":{"value":"stat.ML","type":"string"},"datatype":"string"},"type":"statement","id":"Q6314437$D9C54C58-CA21-46FB-B873-0866BDE65A53","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"d4205e8070ebf07fa55762a9b2f426fe966af0c6","datavalue":{"value":"Maher Nouiehed","type":"string"},"datatype":"string"},"type":"statement","id":"Q6314437$A1F7AF31-CB5C-433E-9DB1-B7944B9B0856","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"eb6c50b76dc85b17c96861a6b8820f193199387b","datavalue":{"value":"Maziar Sanjabi","type":"string"},"datatype":"string"},"type":"statement","id":"Q6314437$C71897BE-7CF9-4CC0-9C01-2D7288A057EF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"24e4d921388c0634eb0c84977c4f63cb679c28e4","datavalue":{"value":"Tianjian Huang","type":"string"},"datatype":"string"},"type":"statement","id":"Q6314437$E426F1AE-4833-4F62-8DC6-0FAD8154BEAF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"57cf37391a051b1c513422beafd8a2f5899e61a5","datavalue":{"value":"Jason D. Lee","type":"string"},"datatype":"string"},"type":"statement","id":"Q6314437$2ED7CD88-E650-4187-8814-D1D72F22BF47","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"73fac8da06cc5ee0678bcc062ef3bdc38b8bcdf1","datavalue":{"value":"Meisam Razaviyayn","type":"string"},"datatype":"string"},"type":"statement","id":"Q6314437$7D84DC22-5854-4F6C-90F7-F9043041A6D7","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":"Q6314437$904D1A75-844B-4A0C-A23C-4AFBB7539AFB","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"233027521595efc566c55173684289e74c1dc8a1","datavalue":{"value":"https://github.com/optimization-for-data-driven-science/FairFashionMNIST","type":"string"},"datatype":"url"},"type":"statement","id":"Q6314437$79BAA2EB-CC34-44EC-ADF9-0CA8039A11ED","rank":"normal","references":[{"hash":"fcb517a631a6966a17e07dc36a77452954c9a980","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"045dc415be5754c5fc8f030cb0a27b236ba6c133","datavalue":{"value":"https://paperswithcode.com/paper/solving-a-class-of-non-convex-min-max-games","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:6314437","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6314437"}}}}}