{"entities":{"Q6909506":{"pageid":20958901,"ns":120,"title":"Item:Q6909506","lastrevid":75610234,"modified":"2026-04-20T08:57:04Z","type":"item","id":"Q6909506","labels":{"en":{"language":"en","value":"Faster algorithms for string matching problems: matching the convolution bound"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8112169"}},"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":"Q6909506$5D56ED62-D939-4961-B460-F234DFC06F90","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"03264ebdf75b26598bf5295a49167c12149236f6","datavalue":{"value":{"text":"Faster algorithms for string matching problems: matching the convolution bound","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6909506$4DF77FD2-EBB6-42A8-9FA3-DAA0DC59A37F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cc3ef609c041ca7f3bc82aa447a211b9ada9f823","datavalue":{"value":"10.1109/SFCS.1998.743440","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909506$8B3C38EA-2C3D-4383-B153-9958F23EDCDB","rank":"normal"}],"P16":[{"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":"Q6909506$664E9F7D-E0BC-4682-8FE0-C53349E15F4F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b77d6a4382bc7a32fc14d82772e7dcb343e03ac6","datavalue":{"value":{"time":"+2025-10-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6909506$40FF2380-DE49-4C69-A3CD-17EEFCC5A074","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909506$ADE0AD15-84C2-4603-846C-172DAAD7E701","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9e1ec9d24d3a222a535d502c00b08c2d800868f7","datavalue":{"value":"8112169","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909506$F337929E-68E7-4D8B-A595-456D67EE16BD","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":"Q6909506$CE39E1AB-C1D6-4F16-93AB-AB971FCDA4F5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Faster algorithms for string matching problems: matching the convolution bound","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Faster_algorithms_for_string_matching_problems:_matching_the_convolution_bound"}}}}}