{"entities":{"Q7188046":{"pageid":22193066,"ns":120,"title":"Item:Q7188046","lastrevid":107435219,"modified":"2026-10-27T09:49:22Z","type":"item","id":"Q7188046","labels":{"en":{"language":"en","value":"Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7188046$05250355-C4B5-4B64-81F3-2CF4F749537F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-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":"Q7188046$BA85F08F-76B9-487E-A0AA-84700BD85E11","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"4af6f3e63e7a8c28fc98df10d1b8012cae09e312","datavalue":{"value":"2508.04654","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7188046$2AD0A87F-8E32-4289-B685-BF3C5D1EE327","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"87983101ce45750d556e9f12481461209863139d","datavalue":{"value":{"entity-type":"item","numeric-id":1430643,"id":"Q1430643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7188046$32DD1B14-F3DD-4CDC-9E2B-ABBF7EFF9896","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8a3bc0994836b1891a76595c02522dd4950f9292","datavalue":{"value":{"entity-type":"item","numeric-id":6873493,"id":"Q6873493"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7188046$A4697723-FAB5-41EE-B7D1-A8EFD5FD2E1A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5dc2b9ea48f7303fc6e4124c3faeb5cbe22f70d2","datavalue":{"value":{"entity-type":"item","numeric-id":888302,"id":"Q888302"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7188046$0256BC32-312D-472E-970A-7D19F6BAE02A","rank":"normal"}],"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":"Q7188046$E321609A-195B-4A08-B23F-499D7C2FE49B","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":"Q7188046$7F7B7EC9-5A6B-4839-A203-418CA66F0280","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Non-Stationary_Bandit_Convex_Optimization:_An_Optimal_Algorithm_with_Two-Point_Feedback"}}}}}