{"entities":{"Q6622004":{"pageid":14233161,"ns":120,"title":"Item:Q6622004","lastrevid":103962587,"modified":"2026-06-06T08:33:06Z","type":"item","id":"Q6622004","labels":{"en":{"language":"en","value":"Approximation algorithms for the longest run subsequence problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7929265"}},"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":"Q6622004$D73087C0-CF76-4C4C-A065-225EEF852B3C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b12729d8b854d14679da3e81a5e3d1ef37c8e471","datavalue":{"value":{"text":"Approximation algorithms for the longest run subsequence problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6622004$09EC196D-48B5-4C7C-A219-323C872BDDC7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8d38e0dbbc26051be72bba7c3639fc0c96e5b4d2","datavalue":{"value":{"entity-type":"item","numeric-id":260256,"id":"Q260256"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622004$84FB4E1A-D06E-4B69-AE3F-237A432540D8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1ae8ebbf8f92fb78bbd42178dea965ec15240fc1","datavalue":{"value":{"entity-type":"item","numeric-id":401301,"id":"Q401301"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622004$8F636FB1-55A1-4849-B3DD-63AB2E1F3CEF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d2a07eadc0ace350087b8be8577eaf076f0ea410","datavalue":{"value":{"entity-type":"item","numeric-id":2168773,"id":"Q2168773"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622004$65605BA0-4698-4800-995E-5E2F56168FCF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c2698a6dbb34bba1e27f1175b74c60c6505e07bb","datavalue":{"value":{"entity-type":"item","numeric-id":260257,"id":"Q260257"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622004$ADF5F3EE-0295-4245-BD7E-5E5715A22B1B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d8444ef2e9dd4226196ce672b5a484f78760db07","datavalue":{"value":{"entity-type":"item","numeric-id":166205,"id":"Q166205"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622004$440D41D3-6699-4FD8-A57C-6DC5144D5B8D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"af43faa902926c77908e47b2c6b566ceec480768","datavalue":{"value":{"entity-type":"item","numeric-id":260258,"id":"Q260258"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622004$DB76DECF-3CA4-4B19-BC4A-9D5FF7F965AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4f48d500f330b68405946109ef761b4cb91d6f99","datavalue":{"value":{"entity-type":"item","numeric-id":6546416,"id":"Q6546416"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622004$FC570DFE-2553-4FF9-B8E6-98CC61F826B3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"022037f3e9300aa37ed9ac9f0e45b2ae23494abf","datavalue":{"value":{"entity-type":"item","numeric-id":1222800,"id":"Q1222800"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622004$0B2AA4B1-3931-42B4-ACB2-C4B9028BC0D5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ac889730097a55c61339de7e6de152e6be5788f0","datavalue":{"value":{"time":"+2024-10-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6622004$D73CED4B-CC9B-4C2F-BC0C-6A39261AAC49","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"824c9242ee6f86c15bf4eecb8cafeab39e222c2d","datavalue":{"value":"68W32","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6622004$741BD53F-2D03-46E8-864F-C3B458CCE832","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3cb4765e3fac71e6df41c0a642ec7ae46d54711a","datavalue":{"value":"7929265","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6622004$71FD2DF8-2743-481B-BE2A-A184A381B4F2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"077b571b956596d80830211bde67ca0eaa6a4497","datavalue":{"value":"longest run subsequence problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q6622004$F88BE914-4405-4737-AB04-BA31A3E1640A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"399244dd7dad9f15ff2079f2c1c36784db0e3a93","datavalue":{"value":"bounded occurrence","type":"string"},"datatype":"string"},"type":"statement","id":"Q6622004$1C4E45C6-6179-4CB5-A984-76C5A47FEF9B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0de600cf8191fa1f423fd01c9a02b172072a7391","datavalue":{"value":"approximation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6622004$596D88AA-A536-4C4E-A1E4-FB1E04439F0F","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":"Q6622004$53B46205-0F1E-451C-8853-5A614B3A320B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"12a4a3b24ca8ce883c4f03d5e8ca00b838f66fbc","datavalue":{"value":"10.4230/LIPICS.CPM.2023.2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6622004$387BC704-6B5D-4E58-BAE8-D6E8E0A97443","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximation algorithms for the longest run subsequence problem","badges":[]}}}}}