{"entities":{"Q6942829":{"pageid":21160581,"ns":120,"title":"Item:Q6942829","lastrevid":75937332,"modified":"2026-04-21T14:49:27Z","type":"item","id":"Q6942829","labels":{"en":{"language":"en","value":"Optimal algorithms for bounded weighted edit distance"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8080151"}},"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":"Q6942829$044C58DD-EA53-4549-BE82-080DE7414A16","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f6c5cc7121ad0f08b19461c6e2c1cba7b0e803f2","datavalue":{"value":{"text":"Optimal algorithms for bounded weighted edit distance","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6942829$787D354E-7672-44F4-BEE0-D324A5BC512E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f257c238d1a6f687dff1043f003f3280ee50d196","datavalue":{"value":"10.1109/FOCS57990.2023.00135","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942829$7700A093-4A99-485A-B8CD-65E9FB6B7166","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c448ff3558a45dcc46acf448888760935d09bdb8","datavalue":{"value":{"entity-type":"item","numeric-id":832519,"id":"Q832519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942829$0350B600-473E-48EF-949F-68A6FCB4CB35","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c60069e24c8cf293333153fb06965553e82c21ee","datavalue":{"value":{"entity-type":"item","numeric-id":6083562,"id":"Q6083562"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942829$84618E22-DAA5-4C3A-89F2-FFF832964E3C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d2f0d46d96166900d38ce02a3e241a6b0f47884c","datavalue":{"value":{"entity-type":"item","numeric-id":255283,"id":"Q255283"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942829$0CCEAB11-A41D-4F41-ABED-9B09C2E8F7E7","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":"Q6942829$E96C0C68-E279-40FE-97C6-A0197E284C3D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942829$99FB1440-912D-4BE9-AB76-F5B86AC56500","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ef20d9a47b9d6263c99ec8dbbbcdd42940340d9f","datavalue":{"value":"8080151","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942829$B484CB06-0E94-4C34-8441-E5ACF37BC249","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":"Q6942829$45F49FFE-4B6B-4C60-9E27-8D75CC7AE2C3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal algorithms for bounded weighted edit distance","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_algorithms_for_bounded_weighted_edit_distance"}}}}}