{"entities":{"Q6287713":{"pageid":13424216,"ns":120,"title":"Item:Q6287713","lastrevid":94857020,"modified":"2026-06-05T07:49:59Z","type":"item","id":"Q6287713","labels":{"en":{"language":"en","value":"Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900317991"}},"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":"Q6287713$5CE24850-B572-4FE8-84C5-3FB1AB4CC863","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fb0dda9dd940406a6200ad0d75902424198d1990","datavalue":{"value":{"time":"+2017-06-10T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6287713$E2703BF6-5853-4DEE-B687-83F2A3F77181","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3115a47a979f9fb656d9b0969c2a599b6524cc61","datavalue":{"value":{"entity-type":"item","numeric-id":2085820,"id":"Q2085820"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6287713$708A3266-A80B-4CF7-BAA2-8103CBAB2C0F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"46607f19196ba19c2eedc0d7d9b1e4b9c628c476","datavalue":{"value":{"entity-type":"item","numeric-id":6247558,"id":"Q6247558"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6287713$19B43B2F-D2EE-4D40-8495-7FEC2191C8DA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"601b26c3acc4eee52b3638cee61e5ebd63f62d79","datavalue":{"value":"900317991","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6287713$2C0C52FF-2A20-4A4A-8B6E-CEB1819C2DDE","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":"Q6287713$E2F08BF0-41A4-400D-8F3E-BCD0F5A42F4A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Chance-Constrained_AC_Optimal_Power_Flow:_Reformulations_and_Efficient_Algorithms"}}}}}