{"entities":{"Q7202431":{"pageid":22244267,"ns":120,"title":"Item:Q7202431","lastrevid":107540432,"modified":"2026-10-27T10:35:07Z","type":"item","id":"Q7202431","labels":{"en":{"language":"en","value":"A Dual Method for Minimax Quadratic Programming"}},"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":"Q7202431$0F4916DE-3B5C-4AE7-8679-46B5A0AA707B","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":"Q7202431$0934A4E5-1928-4109-90CD-F4F953F8A804","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"768f94fbfd311b0203f26e4210cb878456e11cf0","datavalue":{"value":"2511.06180","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7202431$6FB324A2-CB52-443A-9F3E-5BC0DCE0B3EC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"dcaec999e2f73905f90b8d334d0ec7619ceeb500","datavalue":{"value":{"entity-type":"item","numeric-id":6074951,"id":"Q6074951"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7202431$C522963F-26A0-4F53-8316-286B154F6728","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"be2ef39e0e20e06b5952775446fb1f1750cdd650","datavalue":{"value":{"entity-type":"item","numeric-id":484866,"id":"Q484866"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7202431$1B90A697-3D40-4834-B363-1CDBCE5922D6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7202431$F7251527-CD42-4029-A60F-03B1AF46A048","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e564314c10fa5b362951b280af9f9f70fb290f3e","datavalue":{"value":"90C47","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7202431$E40502E4-48EA-460C-AB1D-C793F6B1A158","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7202431$E37CF4D8-E35A-411D-B466-F9D8F36D9209","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":"Q7202431$AC5C207B-4A95-4292-839F-8EC88F4457FB","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":"Q7202431$DD819450-3D4F-4588-894E-079F8C67B4EF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Dual Method for Minimax Quadratic Programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Dual_Method_for_Minimax_Quadratic_Programming"}}}}}