{"entities":{"Q2894081":{"pageid":2904806,"ns":120,"title":"Item:Q2894081","lastrevid":42460596,"modified":"2025-06-28T04:51:45Z","type":"item","id":"Q2894081","labels":{"en":{"language":"en","value":"Computing optimal randomized resource allocations for massive security games"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6050868"}},"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":"Q2894081$6FE94363-2905-48C6-A034-4FDB44916968","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4718a4df3aba443aa65a46889c61064031b98034","datavalue":{"value":"1241.91033","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2894081$2468A078-148B-45C0-A29F-BEE56C389110","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"69936be9ce611b0405b5a74fe7d2672f7a02e257","datavalue":{"value":{"time":"+2012-06-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2894081$16795C70-D75F-47CE-9334-37C934CCCBAD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5c83f057600e5614b7fec59c8e4ac61cb41ba8d","datavalue":{"value":"91A80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2894081$B77D5599-2DEA-48F1-82D0-E26D2717D22B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"bc7eb0f462deb89a5bf6af1abf9a96ba13c81d67","datavalue":{"value":"91A40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2894081$A343BD56-7999-4CDB-8D9D-0C587B02D183","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3783afd39b9a4c0ecdd0e6ac842f765284c23884","datavalue":{"value":"91B32","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2894081$AA40C5A1-75B5-4109-8056-CABC5F640D63","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"63f3286d9c6f686faceffc073ecb2228a5ff1cd1","datavalue":{"value":"6050868","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2894081$2ED77979-DCE2-4AC5-B6E9-0E7CE7706CE1","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":"Q2894081$57ADF33F-D048-4C53-910C-6F585D963DC6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"473529870b8bcf69c20b1c781779b4317b71b019","datavalue":{"value":{"entity-type":"item","numeric-id":360138,"id":"Q360138"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2894081$4AE2DF1B-7CEC-4174-8E2A-566A1DF85D8F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e2fda4a592231c7a343c1d27dde9b9061b03e568","datavalue":{"value":{"entity-type":"item","numeric-id":388073,"id":"Q388073"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2894081$17507955-989B-4E3B-B358-7F04B9F098CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1daac4b092d4e4a26dbd649badc1b976ecbe33eb","datavalue":{"value":{"entity-type":"item","numeric-id":200193,"id":"Q200193"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2894081$9984A337-3E5C-4437-8455-26A934DE0FF9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f7f3e9c35d07ce5517c89df380a1c8fcdf890db1","datavalue":{"value":{"entity-type":"item","numeric-id":622106,"id":"Q622106"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2894081$EE02D6BD-6957-4F0E-8422-B2D6B337CF35","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e4f5cfe4fdb67088304b19b5a776cc2efae97390","datavalue":{"value":{"entity-type":"item","numeric-id":360139,"id":"Q360139"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2894081$96C1F547-D7AA-4430-B29A-22DA16EBDB58","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"97ad97fe35fea68b50b857ae500e7117e0cc8275","datavalue":{"value":{"entity-type":"item","numeric-id":329048,"id":"Q329048"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2894081$56FED1F3-36F3-4C79-95C3-A15C545F68F8","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a2d1e93e289663df8a9e6c8773b824296d797c05","datavalue":{"value":{"text":"Computing optimal randomized resource allocations for massive security games","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2894081$85BC80C8-92A2-47E0-81F8-1E869C2CDBA8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2894081","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2894081"}}}}}