{"entities":{"Q6731314":{"pageid":14450092,"ns":120,"title":"Item:Q6731314","lastrevid":105841730,"modified":"2026-10-21T12:24:23Z","type":"item","id":"Q6731314","labels":{"en":{"language":"en","value":"Gradient-free algorithm for saddle point problems under overparametrization"}},"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":"Q6731314$3C4745DD-2884-402D-86E8-3CEAD4F4F15D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fecb2f2a7c1f813db3a025a7dd8b5d82439618b9","datavalue":{"value":{"time":"+2024-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":"Q6731314$56B384E6-3147-45C9-86BC-30DF70A9FEBF","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"4a81d082ba1b759c298fb6c7b8802e0e29ee5176","datavalue":{"value":"2406.02308","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6731314$FC5CC187-9719-4831-8406-FB33E3017EC9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e22735d7046fca5b0a8928fbc36e987ce621c318","datavalue":{"value":{"entity-type":"item","numeric-id":6731312,"id":"Q6731312"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6731314$F96EBD6B-F894-4A75-910B-8FDE3B51E87B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"59959ad5686d9ca185c117dfb359fb7f56eb33ee","datavalue":{"value":{"entity-type":"item","numeric-id":6731313,"id":"Q6731313"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6731314$28FEA59B-3BE0-4D87-A17F-EFFCC8AB2EEF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"801259f92dbe8f4ecafe82a37de9f57e17246932","datavalue":{"value":{"entity-type":"item","numeric-id":2042417,"id":"Q2042417"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6731314$BD43AFD4-A8EA-4320-A30A-D0C341C831AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"edeca0f114bed2cb858bc2f9454bf5e2c9277f8c","datavalue":{"value":{"entity-type":"item","numeric-id":6520250,"id":"Q6520250"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6731314$91C81C57-F98F-4D3B-8948-616A71B79487","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c9202d9b6b0a3572683bc0d80eb9f54e6557a636","datavalue":{"value":{"entity-type":"item","numeric-id":6060560,"id":"Q6060560"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6731314$250D7BBA-1F64-4746-AA46-BF9A3AD863DD","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":"Q6731314$13BECEB7-7E3A-414F-820A-83E58CBF52E8","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":"Q6731314$A845010C-5F66-4CF8-A8B1-3AAB67E9D199","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Gradient-free algorithm for saddle point problems under overparametrization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Gradient-free_algorithm_for_saddle_point_problems_under_overparametrization"}}}}}