{"entities":{"Q2550665":{"pageid":2561408,"ns":120,"title":"Item:Q2550665","lastrevid":73791363,"modified":"2026-04-14T17:16:24Z","type":"item","id":"Q2550665","labels":{"en":{"language":"en","value":"Method of synthesis of a class of random search algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3366692"}},"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":"Q2550665$95E9FE1C-CA68-48F8-ABF1-C88C886DBD54","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"86b9f60839552c36bf97771739f92886cf3a18ca","datavalue":{"value":{"text":"Method of synthesis of a class of random search algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2550665$7DF6F001-5743-466E-A544-20AF28ECC401","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e9196574618561d3c5a1aadaa0a62b06d5deb4f4","datavalue":{"value":"0231.90025","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2550665$46232275-09FB-4AF5-8643-757ACCDF5ADF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7db4f4b8714c5f3427a9323a4ad703429640b074","datavalue":{"value":{"entity-type":"item","numeric-id":2550664,"id":"Q2550664"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2550665$E499DDE1-499D-42D5-AC2A-EBB1BD0B9A55","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f5797ad2e4bb8f33d9dcf95498080e692d61b3ad","datavalue":{"value":{"entity-type":"item","numeric-id":236215,"id":"Q236215"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2550665$579004EE-2B39-4461-B03F-755644C7F863","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2550665$9D349950-18F2-400E-BDA7-097E99B93DF7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"652ad65ffdd573691be68fbfe67aa0cdf6812549","datavalue":{"value":{"time":"+1971-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2550665$04C6FAE9-B44A-4E30-A08F-77F017DE08DD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"30d6d0de101c6ff200d712a6d7e331bcba20c783","datavalue":{"value":"90B40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2550665$F8066E09-FF60-4623-83BC-C1FD2220F1E0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2b11b1cb84691fdcd1c1ce008fee7c5389808633","datavalue":{"value":"3366692","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2550665$0D4B007D-A12A-472B-91C4-E964040BF6F3","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":"Q2550665$253D1036-9A1E-43C8-981D-9C4A8FA44579","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Method of synthesis of a class of random search algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Method_of_synthesis_of_a_class_of_random_search_algorithms"}}}}}