{"entities":{"Q6602423":{"pageid":14213580,"ns":120,"title":"Item:Q6602423","lastrevid":99891542,"modified":"2026-06-05T20:56:38Z","type":"item","id":"Q6602423","labels":{"en":{"language":"en","value":"Approximating the minimum logarithmic arrangement problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7911073"}},"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":"Q6602423$8AAD4F28-53F4-4E06-9064-68E7B34712C3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"536269bb5ef5d3db8ad48a5f534fb0380a80bfe0","datavalue":{"value":{"text":"Approximating the minimum logarithmic arrangement problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6602423$F52F7117-4F27-44FA-868C-B97652838875","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e5464aa0f4d1292331afd53e47bb1a1eb63363d9","datavalue":{"value":{"entity-type":"item","numeric-id":261355,"id":"Q261355"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602423$F386441A-7ACE-40B8-9F6D-72F5ED06BD87","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3b9eb58bf76826af7e1d0529c65516ff71c8a5d8","datavalue":{"value":{"entity-type":"item","numeric-id":283870,"id":"Q283870"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602423$EC8D8968-4106-49DB-892D-663B078764EE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"984357184e36bd48b60e905848ca8fb15ede5c75","datavalue":{"value":{"time":"+2024-09-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6602423$02922478-8A9C-40EA-9FD0-89972AAFBC9E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602423$A6E033DC-A974-49E9-A7D4-3D1D2EA66249","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f1fddb66eda0e11344d5365a2d7591f65087ccbd","datavalue":{"value":"7911073","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602423$90875377-58E4-4948-BADA-722123DD9A45","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cc4837877785b4675d8ac1c6d4c911bcaf794e13","datavalue":{"value":"approximation algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6602423$EE139E04-3BEE-4DFB-8B7A-F1C111638A25","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3b46f0dc3ab7cbe54877f69c7f04f2562bd0c477","datavalue":{"value":"graph compression","type":"string"},"datatype":"string"},"type":"statement","id":"Q6602423$D3E53B90-EF25-4F09-9C1D-FD30AA6742F8","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":"Q6602423$ED836F21-2324-4D4A-AA34-3B6E06293184","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"63e7c2bb308415a4bd1d3f46f0e4fb17a3a68a5f","datavalue":{"value":"10.4230/LIPICS.ISAAC.2022.7","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602423$10E7A264-5062-472E-B86A-D3F7085262E3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximating the minimum logarithmic arrangement problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximating_the_minimum_logarithmic_arrangement_problem"}}}}}