{"entities":{"Q6460397":{"pageid":13593398,"ns":120,"title":"Item:Q6460397","lastrevid":59194266,"modified":"2026-04-07T19:19:50Z","type":"item","id":"Q6460397","labels":{"en":{"language":"en","value":"New efficient ADMM algorithm for the Unit Commitment Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 902369964"}},"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":"Q6460397$9B11A01A-D51A-46BF-A0DC-E2485D36E8CA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"02bc874fd535f84f9489a938d9fc8efb85a5d650","datavalue":{"value":{"time":"+2023-11-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6460397$799AB8EE-9683-493B-A6DF-DF1451DBA96B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6ecd75a3aa18887141d287e1528c956ba19dab7f","datavalue":{"value":{"entity-type":"item","numeric-id":6460395,"id":"Q6460395"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6460397$C203AF02-FE0B-4082-8755-DB9ADB0810F7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c5cf8fa0e04ad51cd66fc6be9dcab0ae1e1a95df","datavalue":{"value":{"entity-type":"item","numeric-id":835574,"id":"Q835574"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6460397$FFF5CDF6-0D87-4283-854E-6E33911AED18","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"000ac4cf0af690e030e5aeb572d0196a2493ebab","datavalue":{"value":{"entity-type":"item","numeric-id":6460396,"id":"Q6460396"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6460397$8F05CCC8-EAB4-4062-BCE9-B5637BEA8DC3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0b64ed2f19b463bfaed5a26e032d75d312d0d6b0","datavalue":{"value":"902369964","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6460397$B02C292C-7A2B-4797-8C8A-D6B321BFEA63","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":"Q6460397$1EADDF97-1183-4A18-9D5F-5CB58F1C7EDE","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"4458581a23867aa94691a093797e4128a66db315","datavalue":{"value":"https://github.com/rogierhans/ucbenchmark","type":"string"},"datatype":"url"},"type":"statement","id":"Q6460397$4AB0E987-B318-4B8A-9AD8-F657A8B3E188","rank":"normal","references":[{"hash":"aa18b54504c78b60fe054e51cc376164681f763b","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"028ef6229af5172424cafb89e0ce4704bd966431","datavalue":{"value":"https://paperswithcode.com/paper/new-efficient-admm-algorithm-for-the-unit","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6460397","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6460397"}}}}}