{"entities":{"Q6380263":{"pageid":13513958,"ns":120,"title":"Item:Q6380263","lastrevid":40689173,"modified":"2025-03-28T14:33:14Z","type":"item","id":"Q6380263","labels":{"en":{"language":"en","value":"Mixed-integer linear programming approaches for tree partitioning of power networks"}},"descriptions":{"en":{"language":"en","value":"preprint article from arXiv"}},"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":"Q6380263$C7A676A6-5E1C-43E1-9D63-804D8EA00B3B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d0ad12ea52078f86cef4711f34a0d14b2b906d8c","datavalue":{"value":{"time":"+2021-10-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6380263$AF9BD408-A644-44B8-A893-DF41CA806B1A","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"3091d8062f888dd74c74bcab25cab9b6555c4dd0","datavalue":{"value":"2110.07000","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6380263$779DF2BE-B203-45F4-A64A-E69071436986","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6380263$6B473FFE-776F-4A0B-B8D9-3E4E44B79072","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"820e5d54dee9b60da5c5354757f831a3ef561839","datavalue":{"value":"cs.SY","type":"string"},"datatype":"string"},"type":"statement","id":"Q6380263$6AAD5D7C-F2FD-4069-A79F-E3B9E881BB12","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"c70fb5678a22faafd8f2db0f7c185ebadfa761a8","datavalue":{"value":"eess.SY","type":"string"},"datatype":"string"},"type":"statement","id":"Q6380263$3971C406-F045-433E-9DC8-47524B96EFCA","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"00c75303f5f1234de2f7fc0f67dd05adff912ed8","datavalue":{"value":"Leon Lan","type":"string"},"datatype":"string"},"type":"statement","id":"Q6380263$B0428C2F-8FD0-437E-8ABC-0EAD5CBB76A0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"50aae9bb4dfc7f9ca7f8b5172a32a80732e2b2ad","datavalue":{"value":"Alessandro Zocca","type":"string"},"datatype":"string"},"type":"statement","id":"Q6380263$A05391CC-F8A1-4459-8537-584DB406EDD8","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":"Q6380263$815CEB86-CBFB-4B9D-934F-DD8C044CE8DC","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"fa4ca48459be3e835caee9aae31e30350939fe67","datavalue":{"value":"https://github.com/leonlan/tree-partitioning","type":"string"},"datatype":"url"},"type":"statement","id":"Q6380263$7E271CB8-8C47-46F9-A0CE-4421AE022B49","rank":"normal","references":[{"hash":"b639e6a0100985eef67c20dd4b7571e221cdfddb","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"ee1ac0d43a45fa8af91fccfd42033a235e8892fb","datavalue":{"value":"https://paperswithcode.com/paper/an-milp-based-approach-to-tree-partitioning","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:6380263","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6380263"}}}}}