{"entities":{"Q7340298":{"pageid":31423441,"ns":120,"title":"Item:Q7340298","lastrevid":107930249,"modified":"2026-10-27T13:43:29Z","type":"item","id":"Q7340298","labels":{"en":{"language":"en","value":"A single loop method for quadratic minmax optimization"}},"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":"Q7340298$624A9F4A-4ECC-4911-8840-FA1409664221","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-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":"Q7340298$8663BE70-841C-4895-8C25-EB005DAC00E7","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"18f00b2ae620addd656221a8febbc3861dad960d","datavalue":{"value":"2608.17830","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7340298$DA67D6BC-6429-4122-9F0F-C948FD2395B8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a40cf14c3265942ec2f927089fc4dcf81a4577a0","datavalue":{"value":{"entity-type":"item","numeric-id":1675493,"id":"Q1675493"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7340298$B209BC14-83C3-4C09-904B-3BD08FDD98E2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0e851756434383fd6c47f38063a295604c308cbc","datavalue":{"value":{"entity-type":"item","numeric-id":213319,"id":"Q213319"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7340298$5679B9F3-5071-4DFC-9898-6F23E7A75EEC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"20a3b628e9248dfbb5e633972d5b98bd8c0506c9","datavalue":{"value":{"entity-type":"item","numeric-id":330321,"id":"Q330321"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7340298$8F3D08AE-98D1-408F-A104-678E73B823E0","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":"Q7340298$1DEE0FD3-29F9-4919-BECB-614B12E4BCAF","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":"Q7340298$97400BF2-1298-45F3-99C7-FEF2AB27D03C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A single loop method for quadratic minmax optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_single_loop_method_for_quadratic_minmax_optimization"}}}}}