{"entities":{"Q3581521":{"pageid":5611425,"ns":120,"title":"Item:Q3581521","lastrevid":80893235,"modified":"2026-05-06T17:14:30Z","type":"item","id":"Q3581521","labels":{"en":{"language":"en","value":"Efficient algorithms for substring near neighbor problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5771535"}},"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":"Q3581521$C3298519-A074-4F92-AF74-4DB63E5C118D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7936794a7c32f3d27b5b18b84687c567767ca94f","datavalue":{"value":{"text":"Efficient algorithms for substring near neighbor problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3581521$CB1E7877-6B49-439B-8EA0-9DC77BC24527","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e8ec0ff7e7ee1e2dbae7c654a693da8979cb87d2","datavalue":{"value":"1192.68814","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3581521$C3375E38-5E32-40C2-98BE-22099859E849","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ae4d99c81f18fd5070c61c292deddd608af6a04f","datavalue":{"value":"10.1145/1109557.1109690","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3581521$6D021E6A-1003-474F-AE49-B2FE31886386","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"eae9a31d6f758a27f2fb0dd99a7d1baabffdd3ef","datavalue":{"value":{"entity-type":"item","numeric-id":713204,"id":"Q713204"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3581521$62144DA2-497E-417C-A806-8D0C877487AB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b7931955f1f617c7544e605edee3db1fe0846e3b","datavalue":{"value":{"entity-type":"item","numeric-id":732030,"id":"Q732030"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3581521$AEBA3238-2F11-46C0-9244-80E5E8BE8F9E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"5689ea3415b577dacf6f3396e99073cb92e17a88","datavalue":{"value":{"entity-type":"item","numeric-id":3581484,"id":"Q3581484"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3581521$6ADB0DBF-6830-40BA-93E5-5C4799A21576","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4ab1a23b33b6c3db0ddd484ed90ac34e13f69d9a","datavalue":{"value":{"time":"+2010-08-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":"Q3581521$167D5067-114F-4525-9309-0ADB24412996","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"79b3bc872b6637176b35f9e46ac855febbf884f5","datavalue":{"value":"68W05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3581521$7A4ED672-5610-4547-9C2D-8098F84141C9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a7ddaa80bf0a693a36c1113ff6b7ad576f729940","datavalue":{"value":"68W40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3581521$021F89FB-58AB-4FB9-8E3E-DDBF992B7BAB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"505a49771a29a1df80db47f27f0ca3c9ddd29e48","datavalue":{"value":"92D20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3581521$0369DBB4-2710-4751-905D-D171C2F0B024","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"18d6aaae6ae27286c4a932a589f7f8410b541d97","datavalue":{"value":"5771535","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3581521$CA1911C4-1753-4F9F-8897-5DABE9F5ED0B","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":"Q3581521$71C5DD84-EE1D-4EF1-8B2A-13372E475CA1","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"4287f271a4c4859302970e1154264571a5d20105","datavalue":{"value":"https://doi.org/10.1145/1109557.1109690","type":"string"},"datatype":"url"},"type":"statement","id":"Q3581521$6192D7CF-F8E2-4E0C-B6BE-1F5464E714AC","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"05df5d66bb78da56a1aa658b1c45d0f0dbfd611e","datavalue":{"value":"W4243924383","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3581521$C50CB1D5-6289-4378-A14A-04F71E36AF79","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient algorithms for substring near neighbor problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_algorithms_for_substring_near_neighbor_problem"}}}}}