{"entities":{"Q6942828":{"pageid":21160575,"ns":120,"title":"Item:Q6942828","lastrevid":75937323,"modified":"2026-04-21T14:49:25Z","type":"item","id":"Q6942828","labels":{"en":{"language":"en","value":"Faster algorithms for text-to-pattern Hamming distances"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8080152"}},"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":"Q6942828$11806457-67D4-42EA-A0FB-5D5E0F13CC73","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e379499fcf13bd0d23a75c7764b7c565fdbdbb8c","datavalue":{"value":{"text":"Faster algorithms for text-to-pattern Hamming distances","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6942828$464D2A91-89CD-4F32-89F0-F7FF17AE22F0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"47321cf94bc1a559b3e4267c2e8d0008c50cc8ac","datavalue":{"value":"10.1109/FOCS57990.2023.00136","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942828$E0561C20-307C-4ECF-BE51-8326F3AB4D36","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5fcbc0bdc408571607f1e2241e62aaed8bf9b44f","datavalue":{"value":{"entity-type":"item","numeric-id":2304934,"id":"Q2304934"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942828$9DBC8546-E489-4D06-A330-35C41A6B5AC5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1ac80ef7383636c444645d5d6e34ee78765d27ea","datavalue":{"value":{"entity-type":"item","numeric-id":5091197,"id":"Q5091197"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942828$BC3E62E8-E2BD-4D29-B39B-0259A64B47D4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b9fb847abaa05802a96fff78658636b95d087e1a","datavalue":{"value":{"entity-type":"item","numeric-id":5090423,"id":"Q5090423"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942828$7345510B-6633-4720-A6F8-7896EC813112","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c5b33999e63e0c455e3cddee2e7fd2f8ff6de899","datavalue":{"value":{"entity-type":"item","numeric-id":293384,"id":"Q293384"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942828$559FFDE7-29A0-4306-92DA-5C0CBF9894E1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c353c511b4dc13ecee102b336a2664d881fe8b6f","datavalue":{"value":{"time":"+2025-08-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6942828$C33356BE-C425-49DB-A4A3-A48856BB240A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942828$75E56052-3B83-42CE-AF02-7870CFD39700","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f8bf690cebac601e690fbf99c3b22428dd63194b","datavalue":{"value":"8080152","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942828$D3E2253A-26F4-469F-97D2-56A2AB5F3C55","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":"Q6942828$AD898CFD-2DFF-4FB0-8FC5-78CAF8FA2B9F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Faster algorithms for text-to-pattern Hamming distances","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Faster_algorithms_for_text-to-pattern_Hamming_distances"}}}}}