{"entities":{"Q5238985":{"pageid":7268553,"ns":120,"title":"Item:Q5238985","lastrevid":91776083,"modified":"2026-06-05T00:02:26Z","type":"item","id":"Q5238985","labels":{"en":{"language":"en","value":"Minimax Optimal Algorithms for Adversarial Bandit Problem With Multiple Plays"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7123368"}},"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":"Q5238985$CFE5C2B5-B3C1-4840-B32F-EDFE2810E53C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1f29650716a91cae6f8875f79efc0490231da91f","datavalue":{"value":{"text":"Minimax Optimal Algorithms for Adversarial Bandit Problem With Multiple Plays","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5238985$C59597FB-A199-487B-A465-562D84BC1FDE","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5053948a171f4fc24082d8f119ecd8ebe30ae9cf","datavalue":{"value":"10.1109/TSP.2019.2928952","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5238985$DCC23FBA-9BCC-49ED-94B5-2207EFFC6860","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e7b1465375d6fc9036fb352513b244d4db75eb1f","datavalue":{"value":{"entity-type":"item","numeric-id":5103531,"id":"Q5103531"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5238985$8D7F3A4B-2615-4DCA-8B64-1EC9187489C2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3a60f539fe3d477171d60b442fc6312069aac0c7","datavalue":{"value":{"entity-type":"item","numeric-id":4628254,"id":"Q4628254"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5238985$48668A8B-D318-4443-94DD-54CD46DF8CE0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6bb07293fa4e6a2999ba566632a9109214178d5a","datavalue":{"value":{"entity-type":"item","numeric-id":4621083,"id":"Q4621083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5238985$E2C0F15E-647D-4130-B2F3-BFE0DC82115E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1f50575b8b6a57020c703c63e6a53d1ae6ffa982","datavalue":{"value":{"entity-type":"item","numeric-id":551624,"id":"Q551624"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5238985$8627E8BA-EEAB-424B-8AE7-D06455A84B68","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"39346dfbe0bcea35dbae204dc5864c494831351b","datavalue":{"value":{"entity-type":"item","numeric-id":63219,"id":"Q63219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5238985$919B4D09-4275-4171-9B9B-A400FD501D3D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ba0d2c77158ea110fa8d59ac2177021b3111f193","datavalue":{"value":{"time":"+2019-10-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5238985$84123AA4-27C0-47C2-82BC-5A6BDABFBE6B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6c6a6ab8a830c622237cbd0e370690ef4bbb1094","datavalue":{"value":"https://arxiv.org/abs/1911.11122","type":"string"},"datatype":"url"},"type":"statement","id":"Q5238985$F710089C-98F7-42F6-9FC8-170EBBCD9AD5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4db3fc3244f368e49336c7e23443d11b7d69297d","datavalue":{"value":"94A12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5238985$7637D4EC-2662-4A74-9570-7A957566067E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f02e1ef71247c01b878724b8b074ff1ea37c9e16","datavalue":{"value":"7123368","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5238985$9BC334E9-B61B-49FB-9482-0C73743FF43F","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":"Q5238985$A602BE62-A80B-45B8-9D72-1463AD571CDF","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"77a80d2b51fe9e3587a9bd14d59177b7381922f8","datavalue":{"value":"W2965905787","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5238985$F4C76111-DF48-4EA7-A303-DC38D0F346C2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Minimax Optimal Algorithms for Adversarial Bandit Problem With Multiple Plays","badges":[]}}}}}