{"entities":{"Q7150645":{"pageid":22067364,"ns":120,"title":"Item:Q7150645","lastrevid":107126759,"modified":"2026-10-23T11:18:17Z","type":"item","id":"Q7150645","labels":{"en":{"language":"en","value":"Optimal Computing Budget Allocation for Data-driven Ranking and Selection"}},"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":"Q7150645$8754533C-86DC-416D-A860-B98028E0C5F7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4b013628beb27f964875b8ed46ce26478c65352f","datavalue":{"value":{"time":"+2022-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":"Q7150645$4E541C02-B317-419E-968B-24BB4C14F62D","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"26b3badd0b5566fd0bc3ac65b8f9b9a96d6c2370","datavalue":{"value":"2209.11809","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7150645$9F7B9FF0-47DE-4F63-AD7B-D7E5D027DC74","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e881c9ffbe6d2e3aa01c9efeb71d43343585fc05","datavalue":{"value":{"entity-type":"item","numeric-id":6888403,"id":"Q6888403"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7150645$957B192E-5D36-46F0-A61A-B9D57E533955","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b47d7acc0b710a7c51fc193aa23c76b8fb6eded3","datavalue":{"value":{"entity-type":"item","numeric-id":496595,"id":"Q496595"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7150645$EF4B2745-A0A6-46EB-80BA-AB9478DC0007","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":"Q7150645$7F2F70B7-E173-4D87-A85E-256DFE5678BD","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":"Q7150645$B458E138-50AE-4F67-8B09-1FF6C0375E7C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal Computing Budget Allocation for Data-driven Ranking and Selection","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_Computing_Budget_Allocation_for_Data-driven_Ranking_and_Selection"}}}}}