{"entities":{"Q4427372":{"pageid":6456971,"ns":120,"title":"Item:Q4427372","lastrevid":97123307,"modified":"2026-06-05T13:22:12Z","type":"item","id":"Q4427372","labels":{"en":{"language":"en","value":"An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1983397"}},"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":"Q4427372$C5A48430-DFC1-4203-9CE2-5C00D973CBBA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0225a56b54493df3563099c96adcd9f232f43fcf","datavalue":{"value":{"text":"An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4427372$55DEC817-65E2-4694-87F3-C006CB0CC1AE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"da322099653854ca5892c9b51f82517cb4ec43b2","datavalue":{"value":"1092.90506","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4427372$7E4C2A68-05A2-4219-A625-30A3507967DE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f8da75ed8378ab8989ef128712f7e53d2d633f97","datavalue":{"value":{"entity-type":"item","numeric-id":1066817,"id":"Q1066817"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4427372$FC86EF31-0C20-44DD-BF09-75B1FC1B1174","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9b917c0c1e43157832951acf07b87056a3bac9f1","datavalue":{"value":{"entity-type":"item","numeric-id":4427371,"id":"Q4427371"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4427372$62174F8F-D80B-4D6C-AB8E-0FE2EBDA8BC5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f030fff290cba9104f71fb1447bb02747b898e5f","datavalue":{"value":{"entity-type":"item","numeric-id":74741,"id":"Q74741"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4427372$FC2E1D9E-3893-405B-B747-EE80861C2CA7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a15526a466ac56a4cd2e715a1209b7ff01addaf6","datavalue":{"value":{"time":"+2003-12-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4427372$209E7181-F284-4629-8D2E-D8249237238F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e3ec0ebb66ad9a53653ec1e19a7608e786acef46","datavalue":{"value":"90B18","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4427372$032220CA-5F68-4351-B450-E9312307F620","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4427372$52C57EEE-75EF-4555-9680-411A65985820","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5a651c06a23966891448343186f07bda3eaf4ff3","datavalue":{"value":"1983397","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4427372$C0EA1651-A176-4AA8-BE8C-4F1FB2499FF2","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":"Q4427372$98D3D621-0A9B-45E0-B05D-3B12C2370CFA","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"d890b3bc2b89a6e34802cc8a9521c9cc1888a91b","datavalue":{"value":"https://doi.org/10.1287/ijoc.11.2.149","type":"string"},"datatype":"url"},"type":"statement","id":"Q4427372$D4F60CF9-11BA-4256-8CA9-BA3CB86ABD84","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"cb61f45b2257d30fbf2ba08ce097e34cad156314","datavalue":{"value":"W2143156893","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4427372$FD772ABA-2EC0-46C2-A826-5C60D6D32D96","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"25852d77e1932b3b80b5a6b5b872ad1e4ee80dc4","datavalue":{"value":"10.1287/IJOC.11.2.149","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4427372$6C53BF01-88AD-4F9E-B01A-D68DC9083D75","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network","badges":[]}}}}}