{"entities":{"Q7126927":{"pageid":21995451,"ns":120,"title":"Item:Q7126927","lastrevid":106906004,"modified":"2026-10-23T08:58:16Z","type":"item","id":"Q7126927","labels":{"en":{"language":"en","value":"Convexification of box-constrained polynomial optimization problems via monomial patterns"}},"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":"Q7126927$30D18F27-819B-4CB6-BD78-726EFD60881B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"68f8a51ee03d75aa5b0c3a59079e8df6cac50318","datavalue":{"value":{"time":"+2019-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":"Q7126927$8D9E2E49-DBB3-4ED4-9138-0DAAA01AD58D","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"3d07c95e5273ead8b4ae5b8032aae71231593c8a","datavalue":{"value":"1901.05675","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7126927$96244BFA-3C9A-4D4C-A7D6-DF37F9CC4509","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"008c1a265b185237649d993a61248a3994990943","datavalue":{"value":{"entity-type":"item","numeric-id":306513,"id":"Q306513"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7126927$25B1227B-EADB-468F-B39E-A9137F7E69E2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"264bbe866b5e50af9efb7b595cb11d1383198ac9","datavalue":{"value":{"entity-type":"item","numeric-id":6312593,"id":"Q6312593"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7126927$B1421C9F-2966-48E5-987E-D0FC19961617","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f3fd5e3ae9aad0be5f6270d742422cd13ef083e9","datavalue":{"value":{"entity-type":"item","numeric-id":354638,"id":"Q354638"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7126927$9902CC66-1CCC-45CD-8FB4-73EED228AA67","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":"Q7126927$180A9104-42A7-463A-83D0-152C319544DF","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":"Q7126927$12E97142-DA43-4EF8-B3B6-0A836B97048C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Convexification of box-constrained polynomial optimization problems via monomial patterns (scientific article from arXiv)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Convexification_of_box-constrained_polynomial_optimization_problems_via_monomial_patterns_(scientific_article_from_arXiv)"}}}}}